pat-a1022. Digital Library (30)

宝典基础篇终于A完了，后面就是提高篇了。。真鸡冻。基础够了。以后还是希望每天A一个不水的题

这个题就关键字那里开始没认真读坑了一点

#include<iostream>#include<map>#include<string>#include<sstream>#include<cstdio>using namespace std;struct node{string info[5];string ke[5];};node k[10010];int main(){int n;cin>>n;string temp;map<string,int>si;for(int i=0;i<n;++i){cin>>temp;getchar();for(int j=0;j<5;++j) getline(cin,k[i].info[j]);stringstream ss(k[i].info[2]);int j=0;while(ss>>k[i].ke[j]) j++;si[temp]=i;}cin>>n;getchar();while(n--){int ok=0;getline(cin,temp);cout<<temp<<endl;int t=temp[0]-'0';temp.erase(temp.begin(),temp.begin()+3);map<string,int>::iterator it=si.begin();for(;it!=si.end();it++){if(t!=3){if(k[it->second].info[t-1]==temp){cout<<it->first<<endl;ok=1;}}else{for(int i=0;i<5;++i) if(k[it->second].ke[i]==temp){ cout<<it->first<<endl; ok=1; }}}if(!ok) cout<<"Not Found"<<endl;}return 0;} 

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