zoukankan      html  css  js  c++  java
  • 1022 Digital Library (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 (≤) 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 (≤) 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
     
    题解:
    c++中map的使用
    #include<bits/stdc++.h>
    using namespace std;
    const int maxn=1010;
    map<string, set<int> > title,author,key,pub,year;
    void query(map<string,set<int> > &mp,string &temp){//使用引用,减少因复制需要的时间
        if(mp.find(temp)!=mp.end()){//所查取的值存在
            for(set<int>::iterator it=mp[temp].begin();it!=mp[temp].end();it++){
                printf("%07d
    ",*it);//注意格式
            }
        }
        else{
            printf("Not Found
    ");
        }
    }
    int main(){
        int n,m,id,num;
        string ttitle,tauthor,tkey,tpub,tyear;
        scanf("%d",&n);
        while(n--){
            scanf("%d
    ",&id);//
    会被getline吸收
            getline(cin,ttitle);
            title[ttitle].insert(id);
            getline(cin,tauthor);
            author[tauthor].insert(id);
            while(cin>>tkey){
                key[tkey].insert(id);
                int c=getchar();
                if(c=='
    '){
                    break;
                }
            }
            getline(cin,tpub);
            pub[tpub].insert(id);
            getline(cin,tyear);
            year[tyear].insert(id);
        }
        scanf("%d",&m);
            while(m--){
                scanf("%d: ",&num);
                string temp;
                getline(cin,temp);
                cout<<num<<": "<<temp<<endl;
                if(num==1){
                    query(title,temp);
                }
                else if(num==2){
                    query(author,temp);
                }
                else if(num==3){
                    query(key,temp);
                }
                else if(num==4){
                    query(pub,temp);
                }
                else if(num==5){
                    query(year,temp);
                }
            }
        return 0;
    }
     
  • 相关阅读:
    攻心之战,以情动之;攻城之战,以财诱之;攻坚之战,以力迫之;攻野之战,以势强之
    2005 经典java问题
    Javadoc的简捷使用 zt
    一些入门的java小程序zt
    连载:住在我隔壁储藏室的大学刚毕业的小夫妻zt
    Oracle中發郵件代碼
    程序员职业规划
    IE與Firefox中Cookie的保存方法
    request與response區別
    Html Menu下拉菜單
  • 原文地址:https://www.cnblogs.com/dreamzj/p/14407627.html
Copyright © 2011-2022 走看看