1022. Digital Library (30) STL 中 vector,string,map的运用

1022. Digital Library (30)

时间限制

1000 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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 (<=10000) 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:

31111111The Testing BookYue Chentest code debug sort keywordsZUCS Print20113333333Another Testing BookYue Chentest code sort keywordsZUCS Print220122222222The Testing BookCYLLkeywords debug bookZUCS Print2201161: The Testing Book2: Yue Chen3: keywords4: ZUCS Print5: 20113: blablabla

Sample Output:

1: The Testing Book111111122222222: Yue Chen111111133333333: keywords1111111222222233333334: ZUCS Print11111115: 2011111111122222223: blablablaNot Found

---

提交代码

题意: 给定n本书,给出他们的id,书名,作者等等,然后给出m个查询,让你按照id从小到大的顺序输出查找到的书的id

题解:可以用STL中的map实现,将作者,关键字,书名等一一映射到id,注意,当你存储id的类型为整形的时候,记得输出7为,比如说0000001要输出0000001, 而不是1.

#include <iostream>#include <algorithm>#include <sstream>#include <string>#include <vector>#include <map>using namespace std;map<string, vector<string> >mp[5];int main() {    int n;    cin >> n;    cin.get();    while (n--) {        string id, title, author, key_words, publisher, time;        getline(cin, id);        getline(cin, title);        getline(cin, author);        getline(cin, key_words);        getline(cin, publisher);        getline(cin, time);        mp[0][title].push_back(id);        mp[1][author].push_back(id);        istringstream istr(key_words);        string words;        while (istr >> words)            mp[2][words].push_back(id);        mp[3][publisher].push_back(id);        mp[4][time].push_back(id);    }    for (int i = 0; i < 5; ++i) {        map<string, vector<string> >::iterator itor;        for (itor = mp[i].begin(); itor != mp[i].end(); itor++)             sort(itor->second.begin(), itor->second.end());    }    int m;    cin >> m;    while (m--) {        string str, query;        cin >> str;        int idx = str[0] - '1';        cin.get();        getline(cin, query);        vector<string> V = mp[idx][query];        cout << str << " " << query << endl;        if (V.empty()) {            cout << "Not Found" << endl;        }        else {            for (int i = 0; i < V.size(); ++i)                cout << V[i] << endl;        }    }    return 0;}