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 (≤10​4​​ ) 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<algorithm>
#include<queue>
using namespace std;
struct Node{
	string num;
	string title;
	string author;
	string keywords[5];
	string publisher;
	string year;
}; 
bool cmp(Node x,Node y){
	return x.num<y.num;
}
int main()
{
	int n;
	cin>>n;
	getchar();
	Node node[n];
	for(int i=0;i<n;i++)
	{
		getline(cin,node[i].num);
		getline(cin,node[i].title);
		getline(cin,node[i].author);
		int k=0;
		while(cin>>node[i].keywords[k++])
		{
			if(getchar()=='\n') break;
		}
		getline(cin,node[i].publisher);
		getline(cin,node[i].year);
	}
	sort(node,node+n,cmp);
	int m;
	cin>>m;
	getchar();
	while(m--)
	{
		int flag=1;
		string tmp1,tmp2;
		cin>>tmp1;
		getchar();
		getline(cin,tmp2);
		cout<<tmp1<<" "<<tmp2<<endl;
		if(tmp1[0]=='1')
		{
			for(int i=0;i<n;i++)
			if(node[i].title==tmp2) 
			{
				cout<<node[i].num<<endl;
				flag=0;
			}
		}
		else if(tmp1[0]=='2')
		{
			for(int i=0;i<n;i++)
			if(node[i].author==tmp2) 
			{
				cout<<node[i].num<<endl;
				flag=0;
			}
		}
		else if(tmp1[0]=='3')
		{
			for(int i=0;i<n;i++)
			{
				for(int j=0;j<5;j++)
				{
					if(node[i].keywords[j]==tmp2)
					{
						cout<<node[i].num<<endl;
						flag=0;
						break;
					}
				}
			}
		}
		else if(tmp1[0]=='4')
		{
			for(int i=0;i<n;i++)
			if(node[i].publisher==tmp2) 
			{
				cout<<node[i].num<<endl;
				flag=0;
			}
		}
		else if(tmp1[0]=='5')
		{
			for(int i=0;i<n;i++)
			if(node[i].year==tmp2) 
			{
				cout<<node[i].num<<endl;
				flag=0;
			}
		}
		if(flag) cout<<"Not Found"<<endl;
	}
}

答案二（使用map）

#include<iostream>
#include<bits/stdc++.h>
using namespace std;

map<string,set<int> > title,author,key,pub,year;

void query(map<string,set<int> >& mp, string &str)
{
	if(mp.find(str)!=mp.end())
	{
		for(set<int>::iterator it=mp[str].begin();it!=mp[str].end();it++)
		printf("%07d\n",*it);
	}
	else cout<<"Not Found"<<endl;
}

int main()
{
	int n,m,id,num;
	cin>>n;
	string _title,_author,_key,_pub,_year;
	for(int i=0;i<n;i++)
	{
		cin>>id;
		getchar();
		getline(cin,_title); title[_title].insert(id);
		getline(cin,_author); author[_author].insert(id);
		while(cin>>_key)
		{
			key[_key].insert(id);
			if(getchar()=='\n') break;
		}
		getline(cin,_pub); pub[_pub].insert(id);
		getline(cin,_year); year[_year].insert(id);
	}
	cin>>m;
	while(m--)
	{
		scanf("%d: ",&num);
		string str;
		getline(cin,str);
		cout<<num<<": "<<str<<endl;
		if(num==1) query(title,str);
		else if(num==2) query(author,str);
		else if(num==3) query(key,str);
		else if(num==4) query(pub,str);
		else if(num==5) query(year,str);
	}
}

总结

第二个答案我参考了这篇文章——Digital Library (30 分)，这篇文章的思路很好，推荐大家去看一下

需要注意的就是数字和字符串、字符交叉输入时，输入数字后要记得getchar（），否则数字后的空格或回车就会被输入到下一个字符串、字符中，造成输入错误