PAT1022

图书查询系统设计

最新推荐文章于 2024-08-16 16:02:29 发布

转载最新推荐文章于 2024-08-16 16:02:29 发布 · 119 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/komorabi/p/11566609.html

题目

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.

输入格式

Each input file contains one test case. For each case, the first line contains a positive integer

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

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

输出格式

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.

样例输入

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

样例输出

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、书名、作者、关键字、出版社、出版日期的信息，给定查询列表如书名、作者、关键字、出版社、出版日期的信息，按id从小到大的顺序输出所有符合条件的书的id。

解题思路

个人感觉在这道题中主要的收获为stl的使用以及输入的处理。使用map进行映射，通过查询列表中给定的字符串进行映射书籍id，其中id的列表使用优先级队列进行自动排序。查询时通过判断优先级队列是否为空来判断是否能查询到相应书籍。

全部代码

 1 #include <iostream>
 2 #include <string>
 3 #include <map>
 4 #include <queue>
 5 #include <cstdio>
 6 using namespace std;
 7 
 8 const int maxn = 10000;
 9 map<string, priority_queue<int, vector<int>, greater<int>>> info[5];
10 
11 int main()
12 {
13     int n, m, num;
14     string str;
15     cin >> n;
16     for (int i = 0; i < n; i++) {
17         int id;
18         cin >> id;
19         getchar();
20         for (int j = 0; j < 5; j++) {
21             if (j == 2) {
22                 while (cin >> str) {
23                     info[j][str].push(id);
24                     char ch = getchar();
25                     if (ch == '\n') break;
26                 }
27                 continue;
28             }
29             getline(cin, str);
30             info[j][str].push(id);
31         }
32     }
33     cin >> m;
34     for (int i = 0; i < m; i++) {
35         scanf("%d: ", &num);
36         getline(cin, str);
37         cout << num << ": " << str << endl;
38         if (info[num - 1][str].size() == 0) cout << "Not Found" << endl;
39         else {
40             while (info[num - 1][str].size() != 0) {
41                 printf("%07d\n", info[num - 1][str].top());
42                 info[num - 1][str].pop();
43             }
44         }
45     }
46 }

转载于:https://www.cnblogs.com/komorabi/p/11566609.html