1022. Digital Library

来源:互联网 发布:建设银行mac版网银盾 编辑:程序博客网 时间:2024/05/02 02:08

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: blablabla

Not Found

#include <cstdio>#include <cstdlib>#include <iostream>#include <deque>#include <queue>#include <cstring>#include <vector>#include <string>#include <iomanip>#include <map>#include <set>#include <cmath>#include <stack>#include <cmath>#include <algorithm>using namespace std;map<string,set<int> >title,author,key,pub,year;void query(map<string,set<int> >&m,string &temp){if(m.find(temp)!=m.end()){for(set<int>::iterator it = m[temp].begin(); it != m[temp].end(); it++)            printf("%07d\n", *it);}else        cout << "Not Found\n";}int main() {    int n,num,m,id;    cin>>n;    string ttitle,tauthor,tkey,tpub,tyear;    for(int i=0;i<n;i++){cin>>id;getchar();getline(cin,ttitle);title[ttitle].insert(id);getline(cin,tauthor);author[tauthor].insert(id);while(cin>>tkey){key[tkey].insert(id);char c;c=getchar();if(c=='\n')break;}getline(cin,tpub);pub[tpub].insert(id);getline(cin,tyear);year[tyear].insert(id);}cin>>m;for(int i=0;i<m;i++){scanf("%d:", &num);string temp;                getchar();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;}

0 0
原创粉丝点击