题目

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$ ( $\le 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$ ( $\le 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:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26

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
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17

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

思路

数据的存储与查询。

使用了最简单暴力的结构数组来存储，然后简单地按照ID排下序，遍历数组核对就行了。

这样写是很简单的，如果要使用复杂的数据结构肯定会更快。

作为参考：最后一个测试点用了660毫秒，上限为1200。

代码

Github最新代码，欢迎交流

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct book {
	int ID;
	char title[81];
	char author[81];
	char keywords[5][11];
	char publisher[81];
	int year;
} Book;

int cmpbyid(const void *a, const void *b)
{
	return (*(Book**)a)->ID - (*(Book**)b)->ID;
}

int main()
{
	int N, M, count, query_type, query_year;
	char space, query_str[81];
	Book books[10000] = {0}, *p, *booksbyid[10000];

	scanf("%d", &N);
	for (int i = 0; i < N; i++) {
		p = booksbyid[i] = books + i;
		scanf("%d%c", &p->ID, &space);
		scanf("%[^\n]%c", p->title, &space);
		scanf("%[^\n]%c", p->author, &space);
		space = '\0';
		for (int k = 0; space != '\n'; k++)
			scanf("%s%c", p->keywords[k], &space);
		scanf("%[^\n]%c", p->publisher, &space);
		scanf("%d", &p->year);
	}

	qsort(booksbyid, N, sizeof(Book*), cmpbyid);

	scanf("%d", &M);
	for (int i = 0; i < M; i ++) {
		count = 0;
		scanf("%d: %[^\n]%c", &query_type, query_str, &space);
		printf("%d: %s\n", query_type, query_str);
		for (int j = 0; j < N; j++) {
			p = booksbyid[j];
			switch(query_type) {
			case 1:
				if (strcmp(query_str, p->title) == 0) {
					printf("%07d\n", p->ID);
					count ++;
				}
				break;
			case 2:
				if (strcmp(query_str, p->author) == 0) {
					printf("%07d\n", p->ID);
					count ++;
				}
				break;
			case 3:
				for (int k = 0; k < 5; k ++)
					if (strcmp(query_str, p->keywords[k]) == 0) {
						printf("%07d\n", p->ID);
						count ++;
					}
				break;
			case 4:
				if (strcmp(query_str, p->publisher) == 0) {
					printf("%07d\n", p->ID);
					count ++;
				}
				break;
			case 5:
				sscanf(query_str, "%d", &query_year);
				if (query_year == p->year) {
					printf("%07d\n", p->ID);
					count ++;
				}
				break;
			default:
				break;
			}
		}
		if (count == 0)
			puts("Not Found");
	}

	return 0;
}