1022. Digital Library (30)

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

没有满分。22分

这题真的好烦啊。。

实在找不到错，感觉是超时。就把先排序改成选出ID后再排序，还是不对。。。好烦

思路就是：暴力解决

#include<iostream>  #include<cstring>  #include<cstdio>  #include<queue>  #include<stack>  #include<algorithm>  #include<vector> #include<set>using namespace std;typedef struct book{int title;char name[81];char author[81];string key[100];char publish[81];char year[10];int c;}book;  bool cmp(book b1,book b2){return b1.title<b2.title;}int main(){int n;cin>>n;static book b[10001];for(int i=0;i<n;i++){cin>>b[i].title;getchar();gets(b[i].name);gets(b[i].author);char fz[1000];gets(fz);int cnt=0;string s="";for(int j=0;j<strlen(fz);j++){if(fz[j]==' '){b[i].key[cnt++]=s;   s="";}else{s+=fz[j];}}b[i].key[cnt++]=s;b[i].c=cnt;gets(b[i].publish);gets(b[i].year);//for(int k=0;k<b[i].c;k++)  cout<<b[i].key[k]<<" ";//cout<<endl;}sort(b,b+n,cmp);/*for(int i=0;i<n;i++){cout<<b[i].title<<endl;cout<<b[i].name<<endl;cout<<b[i].author<<endl;cout<<b[i].key<<endl;cout<<b[i].publish<<endl;cout<<b[i].year<<endl;}*/int m;cin>>m;for(int i=0;i<m;i++){int num;scanf("%d: ",&num);char str[88];gets(str);printf("%d: %s\n",num,str);int flag=0;if(num==1){for(int j=0;j<n;j++){if(strcmp(b[j].name,str)==0){flag=1;cout<<b[j].title<<endl;}}}if(num==2){for(int j=0;j<n;j++){if(strcmp(b[j].author,str)==0){flag=1;cout<<b[j].title<<endl;}}}if(num==3){string s=str;for(int j=0;j<n;j++){    for(int k=0;k<b[j].c;k++){    if(b[j].key[k]==s){    cout<<b[j].title<<endl;    flag=1;    break;}}}}if(num==4){for(int j=0;j<n;j++){if(strcmp(b[j].publish,str)==0){flag=1;cout<<b[j].title<<endl;}}}if(num==5){for(int j=0;j<n;j++){if(strcmp(b[j].year,str)==0){flag=1;cout<<b[j].title<<endl;}}}if(!flag) cout<<"Not Found"<<endl;}return 0;}