PAT甲级1022

题目

1022 Digital Library (30 分)
  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

文章大意

  建立一个图书馆数据库,输入书的相关信息,然后进行检索,并且输出结果。

思路

  分为两部分,第一部分先存储,这部分,采用的map加set然后将map存入vector的方法进行实现的,因为考虑到查询的时候会输入查询的是作者啊,年月分类信息,所以采用的vector加map,将id作为value,然后其他信息均为key。查询的时候,使用map的find函数进行查找。

实现

#include <iostream>
#include <stdio.h>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;

int main()
{
    vector<map<string, set<int>>> sql(5);
    int n;
    cin >> n;
    int id;
    string title;
    string author;
    string keyword;
    string publisher;
    string year;
    for (int i = 0; i < n; i++) {
        cin >> id;
        getchar();
        getline(cin, title);
        sql[0][title].insert(id);
        getline(cin, author);
        sql[1][author].insert(id);
        while (cin >> keyword) {
            sql[2][keyword].insert(id);
            if (getchar() == '\n') break;
        }
        getline(cin, publisher);
        sql[3][publisher].insert(id);
        cin >> year;
        sql[4][year].insert(id);
    }
    int m;
    cin >> m;
    int num;
    string query;
    for (int i = 0; i < m; i++) {
        cin >> num;
        getchar();
        getchar();
        getline(cin,query);
        auto it = sql[num-1].find(query);
        if (it == sql[num-1].end()) {
            cout << num << ": " << query << endl << "Not Found" << endl;
        }
        else {
            cout << num << ": " << query << endl;
            for (auto it2 = it->second.begin(); it2 != it->second.end(); it2++) {
                printf("%07d\n", *it2);
            }
        }
    }
}

注意事项和总结

  一定要注意id号是七位数字,输出的时候记得要补0否则会使3和4测试点错误.
要注意getchar()吸收空格换行,end()函数是指向最后一个元素后面的位置的

收获

1.当使用cin的时候,遇到换行符并不会使其消失,需要用getchar()吸收
2.getline(cin,a)是可以读取空格的,遇到换行符停止,会使换行符消失,a必须是string类型
3.要注意看题,7位必须是7位。要补0
4.find()函数是返回对应的迭代器的值,若找不到则返回end()

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值