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.
Each input file contains one test case. For each case, the first line contains a positive integer N (≤10 4 ) 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
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.
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
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
思路：构建合适的哈希表可以节省大部分算力，同时用set储存string可以默认升序排列。 因为除了id外其他的都要查询，所以设置一个大小为6的哈希表：unordered_map<string,set > has[6];
#include<bits/stdc++.h> using namespace std; int n; int main(){ unordered_map<string,set<string> > has[6]; cin>>n; getchar(); for(int i=0;i<n;i++) { string id,title,author,kw,pub,year; getline(cin,id); getline(cin,title); has[1][title].insert(id); getline(cin,author); has[2][author].insert(id); do{ cin>>kw; //keyword为一个一个的关键字，所以不能用getline全部放到一行储存 has[3][kw].insert(id); //字符串keyword的集合set中插入对应的id }while(getchar()==' '); getline(cin,pub); has[4][pub].insert(id); getline(cin,year); has[5][year].insert(id); } int m; cin>>m; for(int i=0;i<m;i++) { int num; cin>>num; getchar(); getchar(); string words; getline(cin,words); cout<<num<<": "<<words<<endl; if(has[num][words].size()) { for(string s: has[num][words]) { cout<<s<<endl; } }else{ cout<<"Not Found"<<endl; } } return 0; }