分数 30
全屏浏览题目
切换布局
作者 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 (≤104) 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:
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
代码长度限制
16 KB
时间限制
1200 ms
内存限制
64 MB
代码+注解如下:
#include<bits/stdc++.h> using namespace std; struct book{ string id; string t[6];//保存title,author,keywords,publisher,year string keywords[6];//保存t[3],即分组保存keywords的单词 int cur;//保存keywords的单词个数 }b[10005]; bool cmp(book a,book b){ return a.id<b.id; } int main(){ int N; cin>>N; getchar();//吸收换行符 for (int i = 1; i <= N ; ++i) { getline(cin,b[i].id);//有空格用getline输入 getline(cin,b[i].t[1]); getline(cin,b[i].t[2]); getline(cin,b[i].t[3]); getline(cin,b[i].t[4]); getline(cin,b[i].t[5]); int cur=0; for (int j = 0; j < (b[i].t[3]).size(); ++j) {//遍历每个keywords字符串 string temp;//记录单个单词 while((b[i].t[3])[j]!=' '&&j < (b[i].t[3]).size())temp+=(b[i].t[3])[j],j++;//遇到空格表示已经保存完一个单词 b[i].keywords[cur++]=temp;//将单个单词保存在keywords数组中 } b[i].cur=cur;//保存单词个数 } sort(b+1,b+1+N,cmp);//按id从小到大排序 int M; cin>>M; getchar();//吸收换行符 for (int i = 0; i < M; ++i) { string t; int pos; scanf("%d: ",&pos); getline(cin,t); cout<<pos<<": "<<t<<endl; int cnt=0; if(pos==3){//若要查找的是keywords for (int j = 1; j <= N; ++j) for (int k = 0; k < b[j].cur; ++k) if(t==b[j].keywords[k]){ printf("%s\n",b[j].id.c_str()); cnt++; break; } } else{//查找的不是keywords for (int j = 1; j <= N ; ++j) if(t==b[j].t[pos]){ printf("%s\n",b[j].id.c_str()); cnt++; } } if(cnt==0)printf("Not Found\n");//如果一个也没查到则输出Not Found } return 0; }