PAT 1022 Digital Library(set、map、44行代码)

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.

解题思路：

一言难尽，看了某些大佬的代码，还特意学了一下STL的map和set。Map的特性是，所有元素都会根据元素的键值自动排序。Map所有的元素都是pair,同时拥有实值和键值，pair的第一元素被视为键值，第二元素被视为实值，map不允许两个元素有相同的键值。我们不可以通过map的迭代器改变map的键值, 因为map的键值关系到map元素的排列规则，任意改变map键值将会严重破坏map组织。如果想要修改元素的实值，那么是可以的。Map和list拥有相同的某些性质，当对它的容器元素进行新增操作或者删除操作时，操作之前的所有迭代器，在操作完成之后依然有效，当然被删除的那个元素的迭代器必然是个例外。在本题中，将除id外的每种属性作为健值，再把id作为实质，由于set和map具有自动排序的功能，所以在本题中不用另写排序算法。

代码如下：

#include<iostream>
#include<map>
#include<set>
using namespace std;
map<string,set<string>>M[6];
int main()
{
    int N,m;
    cin>>N;
    getchar();
    for(int i=0;i<N;i++){
        string ID,name,author,keyword,publicer,year; 
        getline(cin,ID);
        getline(cin,name);
        M[1][name].insert(ID);
        getline(cin,author);
        M[2][author].insert(ID);
        do{
            cin>>keyword;
            M[3][keyword].insert(ID);
        }while(getchar()==' ');
        getline(cin,publicer);
        M[4][publicer].insert(ID);
        getline(cin,year);
        M[5][year].insert(ID);
    }
    cin>>m;
    for(int k=0;k<m;k++){
        int i;
        cin>>i;
        string search;
        getchar();
        getchar();
        getline(cin,search);
        cout<<i<<": "<<search<<endl;
        if(M[i][search].size()>0){
            for(string name:M[i][search])
                cout<<name<<endl;
        }
        else
            cout<<"Not Found"<<endl;
    }
    return 0;
}

样例结果如下：