PAT_1022: Digital Library

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

备注：原以为会卡时，结果linear scan search也能轻松地AC，看来测试数据也不是很大。。。

#include<stdio.h>#include<string.h>#include<stdlib.h>typedef struct book{char id[10];char title[85];char author[85];char keywords[100];char publisher[85];char year[10];}BOOK;BOOK book_list[10005];int compare(const void *a,const void *b){BOOK a1 = *(BOOK *)a;BOOK b1 = *(BOOK *)b;return strcmp(a1.id,b1.id);}void QueryBook(int qnum, char qword[],int nBook){bool found = false;for(int i=0;i<nBook;i++){BOOK curbook = book_list[i];switch(qnum){case 1: // titleif(strcmp(qword,curbook.title)==0){printf("%s\n",curbook.id);found = true;}break;case 2: // authorif(strcmp(qword,curbook.author)==0){printf("%s\n",curbook.id);found = true;}break;case 3: // keywordif(strstr(curbook.keywords,qword)!=NULL){printf("%s\n",curbook.id);found = true;break;}break;case 4: // publisherif(strcmp(qword,curbook.publisher)==0){printf("%s\n",curbook.id);found = true;}break;case 5: // yearif(strcmp(qword,curbook.year)==0){printf("%s\n",curbook.id);found = true;}break;}}if(!found)printf("Not Found\n");}int main(){int N,M;scanf("%d",&N);for(int i=0;i<N;i++){scanf("%s",book_list[i].id);getchar();gets(book_list[i].title);gets(book_list[i].author);gets(book_list[i].keywords);gets(book_list[i].publisher);scanf("%s",book_list[i].year);}qsort(book_list,N,sizeof(BOOK),compare);scanf("%d",&M);for(int i=0;i<M;i++){int qnum;char qword[100];scanf("%d: ",&qnum);gets(qword);printf("%d: %s\n",qnum,qword);QueryBook(qnum,qword,N);}return 0;}