1022 Digital Library 数字图书馆

最新推荐文章于 2023-02-27 21:50:10 发布

Jack.Chanel

最新推荐文章于 2023-02-27 21:50:10 发布

阅读量140

点赞数

分类专栏： PAT甲级算法文章标签： c++ 算法

本文链接：https://blog.csdn.net/hd_tmg/article/details/128683123

版权

PAT甲级算法专栏收录该内容

24 篇文章 0 订阅

订阅专栏

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 (≤104) 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:

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: 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

代码

#include <iostream>
#include <set>
#include <sstream>
#include <vector>
#include <algorithm>
using namespace std;

struct Book{
    string id;
    string title;
    string author;
    set<string> keywords;
    string publisher;
    string year;
};
vector<Book> books;

int main(){
    int n;
    cin >> n;
    getchar();
    while(n--){
        string id, title, author, row_keyword, publisher, year;
        set<string> keywords;
        getline(cin, id);
        getline(cin, title);
        getline(cin, author);
        getline(cin, row_keyword);
        getline(cin, publisher);
        getline(cin, year);
        stringstream  ssin(row_keyword);
        string keyword;
        while(ssin >> keyword) keywords.insert(keyword);
        books.push_back({id, title, author, keywords, publisher, year});
    }
    
    int m;
    cin >> m;
    getchar();
    while(m--){
        string order;
        getline(cin, order);
        cout << order << endl;
        string order_key = order.substr(3);
        int order_index =order[0] - '0';
        vector<string> ids;
        switch(order_index){
            case 1:{
                for(auto &item : books)
                    if(item.title == order_key) ids.push_back(item.id);
                break;
            }
            case 2:{
                for(auto &item : books)
                    if(item.author == order_key) ids.push_back(item.id);
                break;
            }
            case 3:{
                for(auto &item : books)
                    if(item.keywords.count(order_key)) ids.push_back(item.id);
                break;
            }
            case 4:{
                for(auto &item : books)
                    if(item.publisher == order_key) ids.push_back(item.id);
                break;
            }
            case 5:{
                for(auto &item : books)
                    if(item.year == order_key) ids.push_back(item.id);
                break;
            }
            default:{
                break;
            }
        }
        if(!ids.size()) puts("Not Found");
        else{
            sort(ids.begin(), ids.end());
            for(auto id : ids){
                cout << id << endl;
            }
        }
    }
    return 0;
}