1022. Digital Library (30)

时间限制

1000 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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:

31111111The Testing BookYue Chentest code debug sort keywordsZUCS Print20113333333Another Testing BookYue Chentest code sort keywordsZUCS Print220122222222The Testing BookCYLLkeywords debug bookZUCS Print2201161: The Testing Book2: Yue Chen3: keywords4: ZUCS Print5: 20113: blablabla

Sample Output:

1: The Testing Book111111122222222: Yue Chen111111133333333: keywords1111111222222233333334: ZUCS Print11111115: 2011111111122222223: blablablaNot Found

参照上机指南P254

map<string,set<int> >的使用

#include<stdio.h>#include<iostream>#include<string>#include<map>#include<set>using namespace std;map<string,set<int> >mtitle,mauthor,mword,mpublisher,myear;void f(map<string,set<int> >&mp,string &query){if(mp.find(query)==mp.end()){printf("Not Found\n");}else{set<int>::iterator it=mp[query].begin();for(;it!=mp[query].end();it++){printf("%07d\n",*it);}}}int main(){int n,m,id,i;string title,author,word,publisher,year;scanf("%d",&n);for(i=0;i<n;i++){cin>>id;////scanf("%d",&id);getchar();//!!!!!getline(cin,title);mtitle[title].insert(id);getline(cin,author);mauthor[author].insert(id);while(cin>>word){mword[word].insert(id);char c=getchar();if(c=='\n'){break;}}getline(cin,publisher);mpublisher[publisher].insert(id);cin>>year;//getline(cin,year);myear[year].insert(id);}scanf("%d",&m);int num;string query;for(i=0;i<m;i++){int num;scanf("%d: ",&num);getline(cin,query);cout<<num<<": "<<query<<endl;if(num==1)f(mtitle,query);else if(num==2)f(mauthor,query);else if(num==3)f(mword,query);else if(num==4)f(mpublisher,query);else if(num==5)f(myear,query);}}