• pat advanced level1022 digital library


    1022 Digital Library (30)(30 分)

    A Digital Library contains millions of books, stored according to their titles, authors, key words of their abstracts, publishers, and published years. Each book is assigned an unique 7-digit number as its ID. Given any query from a reader, you are supposed to output the resulting books, sorted in increasing order of their ID's.

    Input Specification:

    Each input file contains one test case. For each case, the first line contains a positive integer N (<=10000) which is the total number of books. Then N blocks follow, each contains the information of a book in 6 lines:

    • Line #1: the 7-digit ID number;
    • Line #2: the book title -- a string of no more than 80 characters;
    • Line #3: the author -- a string of no more than 80 characters;
    • Line #4: the key words -- each word is a string of no more than 10 characters without any white space, and the keywords are separated by exactly one space;
    • Line #5: the publisher -- a string of no more than 80 characters;
    • Line #6: the published year -- a 4-digit number which is in the range [1000, 3000].

    It is assumed that each book belongs to one author only, and contains no more than 5 key words; there are no more than 1000 distinct key words in total; and there are no more than 1000 distinct publishers.

    After the book information, there is a line containing a positive integer M (<=1000) which is the number of user's search queries. Then M lines follow, each in one of the formats shown below:

    • 1: a book title
    • 2: name of an author
    • 3: a key word
    • 4: name of a publisher
    • 5: a 4-digit number representing the year

    Output Specification:

    For each query, first print the original query in a line, then output the resulting book ID's in increasing order, each occupying a line. If no book is found, print "Not Found" instead.

    Sample Input:

    3
    1111111
    The Testing Book
    Yue Chen
    test code debug sort keywords
    ZUCS Print
    2011
    3333333
    Another Testing Book
    Yue Chen
    test code sort keywords
    ZUCS Print2
    2012
    2222222
    The Testing Book
    CYLL
    keywords debug book
    ZUCS Print2
    2011
    6
    1: The Testing Book
    2: Yue Chen
    3: keywords
    4: ZUCS Print
    5: 2011
    3: blablabla

    Sample Output:

    1: The Testing Book
    1111111
    2222222
    2: Yue Chen
    1111111
    3333333
    3: keywords
    1111111
    2222222
    3333333
    4: ZUCS Print
    1111111
    5: 2011
    1111111
    2222222
    3: blablabla
    Not Found
    /**********************
    author: yomi
    date: 18.8.14
    ps: 不难的题 可是 却 出了错 原来我的答案只是没有控制%7d啊
    最后还是改成了答案的样子。。。
    **********************/
    #include <iostream>
    #include <algorithm>
    #include <sstream>
    #include <string>
    #include <set>
    #include <map>
    #include <cstdio>
    using namespace std;
    void print(map<string, set<int> > &mmap, string &query)
    {
        map<string, set<int> >::iterator iter = mmap.find(query);
        if(iter == mmap.end()){
            cout << "Not Found" << endl;
            return;
        }
        set<int> s = iter->second;
        for(set<int>::iterator iter1=s.begin(); iter1!=s.end(); ++iter1){
            //cout << *iter1 << endl;
            printf("%07d
    ", *iter1);
        }
    }
    int main()
    {
        int n, m, id, tt;
        map<string, set<int> >title;
        map<string, set<int> >author;
        map<string, set<int> >word;
        map<string, set<int> >publisher;
        map<string, set<int> >year;
        cin >> n;
        string t, au, wo, pub, y;
        char ch;
        for(int i=0; i<n; i++){
            cin >> id;
            getchar();
            getline(cin, t);
            title[t].insert(id);
            //getchar();
            getline(cin, au);
            author[au].insert(id);
            ///test code debug sort keywords
    
            while(cin >> wo){
                char c = getchar();
    //            if(c == '
    '){
    //                break;
    //            }
    
                //cin >> ch;
                word[wo].insert(id);
                if(c == '
    '){
                    break;
                }
            }
    
            getline(cin, pub);
            publisher[pub].insert(id);
    
            getline(cin, y);
            year[y].insert(id);
        }
        cin >> m;
        char ch1;
        string query;
        int flag = 1;
        for(int i=0; i<m; i++){
            flag = 1;
            cin >> tt >> ch1;
            getchar();
            getline(cin, query);
            cout << tt << ch1 << " " << query << endl;
            if(tt == 1){
                print(title, query);
            }
            if(tt == 2){
                print(author, query);
            }
            if(tt == 3){
                print(word, query);
            }
            if(tt == 4){
                print(publisher, query);
            }
            if(tt == 5){
                print(year, query);
            }
        }
        return 0;
    }
    /**
    3
    1111111
    The Testing Book
    Yue Chen
    test code debug sort keywords
    ZUCS Print
    2011
    3333333
    Another Testing Book
    Yue Chen
    test code sort keywords
    ZUCS Print2
    2012
    2222222
    The Testing Book
    CYLL
    keywords debug book
    ZUCS Print2
    2011
    6
    1: The Testing Book
    2: Yue Chen
    3: keywords
    4: ZUCS Print
    5: 2011
    3: blablabla
    **/
  • 相关阅读:
    后缀数组简要总结
    2019CCPC网络赛
    2019 Multi-University Training Contest 6
    洛谷P4145——上帝造题的七分钟2 / 花神游历各国
    扫描线——POJ1151
    2012Noip提高组Day2 T3 疫情控制
    2012Noip提高组Day1 T3 开车旅行
    JZOJ.5335【NOIP2017模拟8.24】早苗
    三套函数实现应用层做文件监控
    LLVM一个简单的Pass
  • 原文地址:https://www.cnblogs.com/AbsolutelyPerfect/p/9477410.html
Copyright © 2020-2023  润新知