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 (≤) 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 (≤) 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
题解:
题意是一个图书馆查询系统,除了第三个查询是查找子串,其他的问题都是字符串比较,所以就用了循环。
1.keywords的读入用到了一个字符串流
istringstream tmp(str);//<sstream>以空格分开字符串
a[i].kn=;
while(tmp>>word)
{
a[i].kn++;
a[i].key[a[i].kn]=word;
}
也可以
while(cin>>string){
char c = getchar()
if(c == ‘\n’) break;
}
2.题目中所说的year在[1000, 3000]之间,但是所给的测试并不一定在这之间,否则会测试点2不能通过。
AC代码:
#include<bits/stdc++.h>
using namespace std;
struct node{
int id;
string ti;
string au;
int kn;
string key[];
string pu;
string year;//测试点2坑点,用int反而错了,year不一定全在[1000, 3000]之间 }a[];
bool cmp(node x,node y){
return x.id<y.id;
}
int main(){
int n;
cin>>n;
string str,word;
for(int i=;i<=n;i++){
cin>>a[i].id;
getchar();//吸收回车
getline(cin,a[i].ti);
getline(cin,a[i].au); getline(cin,str);
istringstream tmp(str);//<sstream>以空格分开字符串
a[i].kn=;
while(tmp>>word)
{
a[i].kn++;
a[i].key[a[i].kn]=word;
} getline(cin,a[i].pu);
getline(cin,a[i].year);
}
/*cout<<endl;
for(int i=1;i<=n;i++){
cout<<"ID "<<a[i].id<<endl;
cout<<"TI "<<a[i].ti<<endl;
cout<<"AU "<<a[i].au<<endl;
for(int j=1;j<=a[i].kn;j++){
cout<<a[i].key[j]<<"-";
}
cout<<endl;
cout<<"PU "<<a[i].pu<<endl;
cout<<"YE "<<a[i].year<<endl;
}*/
sort(a+,a++n,cmp);
int m;
cin>>m;
int k;
char kk;
string find;
for(int i=;i<=m;i++){
cin>>k;
cin>>kk;//冒号
getchar();//空格
getline(cin,find);
cout<<k<<": "<<find<<endl;
int f=;
if(k==){//ti
for(int j=;j<=n;j++){
if(a[j].ti==find){
f=;
printf("%07d\n", a[j].id);
}
}
}else if(k==){//au
for(int j=;j<=n;j++){
if(a[j].au==find){
f=;
printf("%07d\n", a[j].id);
}
}
}else if(k==){//kw
for(int j=;j<=n;j++){
for(int p=;p<=a[j].kn;p++){
if(a[j].key[p]==find){
f=;
printf("%07d\n", a[j].id);
break;
}
}
}
}else if(k==){//pu
for(int j=;j<=n;j++){
if(a[j].pu==find){
f=;
printf("%07d\n", a[j].id);
}
}
}else if(k==){//year
for(int j=;j<=n;j++){
if(a[j].year==find){
f=;
printf("%07d\n", a[j].id);
}
}
}
if(!f){
cout<<"Not Found"<<endl;
}
}
return ;
}


 

PAT 甲级 1022 Digital Library (30 分)(字符串读入getline,istringstream,测试点2时间坑点)的更多相关文章

  1. pat 甲级 1022. Digital Library (30)

    1022. Digital Library (30) 时间限制 1000 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者 CHEN, Yue A Di ...

  2. PAT Advanced 1022 Digital Library (30 分)

    A Digital Library contains millions of books, stored according to their titles, authors, key words o ...

  3. 1022 Digital Library (30 分)

    1022 Digital Library (30 分)   A Digital Library contains millions of books, stored according to thei ...

  4. 1022. Digital Library (30) -map -字符串处理

    题目如下: A Digital Library contains millions of books, stored according to their titles, authors, key w ...

  5. PAT-1022 Digital Library (30 分) 字符串处理

    A Digital Library contains millions of books, stored according to their titles, authors, key words o ...

  6. PAT 甲级 1022 Digital Library

    https://pintia.cn/problem-sets/994805342720868352/problems/994805480801550336 A Digital Library cont ...

  7. 【PAT甲级】1022 Digital Library (30 分)(模拟)

    题意: 输入一个正整数N(<=10000),接下来输入N组数据,ID,书名,作者,关键词,出版社,出版年份. 然后输入一个正整数M(<=1000),接下来输入查询的数据,递增输出ID,若没 ...

  8. PAT A 1022. Digital Library (30)【结构体排序检索】

    https://www.patest.cn/contests/pat-a-practise/1022 直接模拟, 输入,按id排序,检索 #include <iostream> #incl ...

  9. PAT甲级1022 Digital Library

    题目:https://pintia.cn/problem-sets/994805342720868352/problems/994805480801550336 题意: 每一本书有一个id, 书名,作 ...

随机推荐

  1. SpringBoot LoggerFactory is not a Logback LoggerContext but Logback is on the classpath

    SpringBoot 在启动项目的时候一起错误: SLF4J: Class path contains multiple SLF4J bindings.SLF4J: Found binding in ...

  2. 凌乱的yyy / 线段覆盖(贪心)

    https://www.luogu.org/problemnew/show/P1803  题目链接 贪心,选择结束时间为关键字排序,相同时开始时间大的在前,然后for一遍比较就好了 #include& ...

  3. TCP的半连接

    T C P提供了连接的一端在结束它的发送后还能接收来自另一端数据的能力.这就是所谓下载的半关闭.正如我们早些时候提到的只有很少的应用程序使用它.为了使用这个特性,编程接口必须为应用程序提供一种方式来说 ...

  4. Lua 学习之基础篇八<Lua 元表(Metatabble)&&继承>

    讲到元表,先看一段table的合并动作. t1 = {1,2} t2 = {3,4} t3 = t1 + t2 attempt to perform arithmetic on a table val ...

  5. Oracle自动化安装脚本-part02-亲试ok

     此为网络配置文件  network.conf [PUBLIC-IP] IP-LIST:192.168.7.198,192.168.8.221 HOSTNAME-LIST:mysql-198,RAC2 ...

  6. Java8-Atomic

    import java.util.concurrent.ExecutorService; import java.util.concurrent.Executors; import java.util ...

  7. Java8-Synchronized-No.02

    import java.util.concurrent.ExecutorService; import java.util.concurrent.Executors; import java.util ...

  8. C# 判断一个string型的时间格式是否正确

    在项目开发过程中,由于各种坑爹的需求,我们可能需要用户自己手动输入时间,不过这种功能一般都出现在自己家的后台里面,咳咳,言归正传.既然如此,那么这个时候我们就需要对用户手动输入的时间格式进行验证,方法 ...

  9. python自动华 (六)

    Python自动化 [第六篇]:Python基础-面向对象   目录: 面向过程VS面向对象 面向对象编程介绍 为什么要用面向对象进行开发 面向对象的特性:封装.继承.多态 面向过程 VS 面向对象 ...

  10. word如何选择图片粘贴

    自动导入Word图片,或者粘贴Word内容时自动上传所有的图片,并且最终保留Word样式,这应该是Web编辑器里面最基本的一个需求功能了.一般情况下我们将Word内容粘贴到Web编辑器(富文本编辑器) ...