zoukankan      html  css  js  c++  java
  • PAT 1022. Digital Library

    PAT 1022. Digital Library

    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:

    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

    代码如下

    #include<iostream>
    #include<sstream>
    #include<map>
    #include<set>
    using namespace std;
    void Query(map<string,set<int>> &books,string q){
    	if(books[q].size()==0) cout<<"Not Found"<<endl;
    	for(auto it=books[q].begin();it!=books[q].end();it++)
    	printf("%07d
    ", *it);
    }
    int main(){
    	map<string,set<int>> names,authors,keywords,prints,times;
    	int n,id,no;
    	string author,name,keyword,word,print,time,query;
    	cin>>n;
    	for(int i=0;i<n;i++){
    			cin>>id;
    			getchar();
    			getline(cin,name); names[name].insert(id);
    			getline(cin,author); authors[author].insert(id);
    			getline(cin,keyword);
    			istringstream is(keyword);
    			while(is>>word)
    			keywords[word].insert(id);
    			getline(cin,print); prints[print].insert(id);
    			getline(cin,time); times[time].insert(id); 
    	}
    	cin>>n;
    	for(int i=0;i<n;i++){
    		scanf("%d: ",&no);
    		getline(cin,query);
    	    cout<<no<<": "<<query<<endl;
    		switch(no){
    			case 1:Query(names,query); break;
    			case 2:Query(authors,query); break;
    			case 3:Query(keywords,query); break;
    			case 4:Query(prints,query); break;
    			case 5:Query(times,query); break;
    		}
    	}
    	return 0;
    }
    
  • 相关阅读:
    深度系统安装wine
    Android应用真正的入口在哪里?
    推荐系统算法概览
    Android面试题:Scrollview内嵌一个Button他的事件消费是怎样的?Move,Down,Up分别被哪个组件消费?
    Java面试题:多线程交替打印字符串
    EventBus使用初体验
    Andoird面试题:A活动启动B活动,他们的生命周期各是怎么样的?
    Android在开发过程中如何选择compileSdkVersion,minSdkVersion和targetSdkVersion
    华为2020暑期实习面经(已拿Offer)
    工商银行软件开发中心2020暑期实习面经(已拿Offer)
  • 原文地址:https://www.cnblogs.com/A-Little-Nut/p/8244976.html
Copyright © 2011-2022 走看看