1022. Digital Library (30)

时间限制

1000 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

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 (<=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

#include <stdio.h>#include <stdlib.h>#include <string.h>struct RECORD{int ID;char title[81];char author[81];char KeyWord[5][11];char publisher[81];int year;int KeyCount;};RECORD a[10001];int cmp(const void *a, const void *b){return ((RECORD*)a)->ID - ((RECORD*)b)->ID;}int main(){int N, i, j, k, p;int flag;int M;char c;char q[81];//freopen("d:\\input.txt", "r", stdin);scanf("%d", &N);for (i = 0; i < N; i++){scanf("%d", &a[i].ID);getchar();//gets_s(a[i].title);k = 0;while ((c = getchar()) != '\n'){a[i].title[k++] = c;}a[i].title[k] = 0;//gets_s(a[i].author);k = 0;while ((c = getchar()) != '\n'){a[i].author[k++] = c;}a[i].author[k] = 0;j = 0;while ((c = getchar()) != '\n'){if (c == ' '){a[i].KeyWord[a[i].KeyCount++][j] = 0;j = 0;continue;}else{a[i].KeyWord[a[i].KeyCount][j++] = c;}}//gets_s(a[i].publisher);k = 0;while ((c = getchar()) != '\n'){a[i].publisher[k++] = c;}a[i].publisher[k] = 0;scanf("%d", &a[i].year);}qsort(a, N, sizeof(a[0]), cmp);scanf("%d", &M);for (i = 0; i < M; i++){scanf("%d", &j);getchar();getchar();k = 0;while ((c = getchar()) != '\n'){q[k++] = c;}q[k] = 0;printf("%d: %s\n", j, q);flag = 0;if (j == 1){for (k = 0; k < N; k++){if (strcmp(a[k].title, q) == 0){printf("%07d\n", a[k].ID);flag = 1;}}}if (j == 2){for (k = 0; k < N; k++){if (strcmp(a[k].author, q) == 0){printf("%07d\n", a[k].ID);flag = 1;}}}if (j == 3){for (k = 0; k < N; k++){for (p = 0; p <= a[k].KeyCount; p++){if (strcmp(a[k].KeyWord[p], q) == 0){printf("%07d\n", a[k].ID);flag = 1;break;}}}}if (j == 4){for (k = 0; k < N; k++){if (strcmp(a[k].publisher, q) == 0){printf("%07d\n", a[k].ID);flag = 1;}}}if (j == 5){for (k = 0; k < N; k++){if (a[k].year == atoi(q)){printf("%07d\n", a[k].ID);flag = 1;}}}if (!flag){puts("Not Found");}}return 0;}