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
思路:输入后,排序,不会超时.注释部分,year用int表示,有个case错误;换成了char数组,就正确了……奇怪!
/*
#include <iostream>
#include"stdio.h"
#include"stdlib.h"
#include"algorithm"
#include"string.h"
using namespace std; struct book{
char id[8];
char title[81];
char author[81];
char key[61];
char publisher[81];
int year;
};
bool sortById(struct book b1,struct book b2){
if(strcmp(b1.id,b2.id)<0)
return true;
return false;
}
int main()
{
int N,M;
scanf("%d",&N);
struct book b[10000]; for(int i=0;i<N;i++){
scanf("%s",b[i].id);
getchar();//读取末尾的换行符 gets(b[i].title); gets(b[i].author); gets(b[i].key); gets(b[i].publisher); scanf("%d",&b[i].year); }
sort(b,b+N,sortById);//按照书的ID递增排序 scanf("%d",&M);
char choice[3];
int year;
for(int i=0;i<M;i++){
scanf("%s",choice);
getchar();//读取空格
char str[81]; bool flag = false; if(strcmp(choice,"1:")==0){
gets(str);
printf("%s %s\n",choice,str);
for(int j=0;j<N;j++){
if(strcmp(b[j].title,str)==0){
printf("%s\n",b[j].id);
flag =true;
}
}
}
else if (strcmp(choice,"2:")==0){
gets(str);
printf("%s %s\n",choice,str); for(int j=0;j<N;j++){
if(strcmp(b[j].author,str)==0){
printf("%s\n",b[j].id);
flag =true;
}
}
}
else if (strcmp(choice,"3:")==0){
gets(str);
printf("%s %s\n",choice,str); for(int j=0;j<N;j++){
string s = b[j].key;
int pos = s.find(str);
int len = strlen(str);
if(pos!=s.npos&&(s[pos+len]==' '||s[pos+len]=='\0')&&(pos==0||s[pos-1]==' '))//避免str只是某个关键字的子串
{
printf("%s\n",b[j].id);
flag =true;
}
}
}
else if (strcmp(choice,"4:")==0){
gets(str);
printf("%s %s\n",choice,str); for(int j=0;j<N;j++){
if(strcmp(b[j].publisher,str)==0){
printf("%s\n",b[j].id);
flag =true;
}
}
}
else if (strcmp(choice,"5:")==0){
scanf("%d",&year);
printf("%s %d\n",choice,year); for(int j=0;j<N;j++){
if(b[j].year==year){
printf("%s\n",b[j].id);
flag =true;
}
}
}
if(false == flag){
printf("Not Found\n");
}
}
return 0;
}
*/
#include <iostream>
#include"stdio.h"
#include"stdlib.h"
#include"algorithm"
#include"string.h"
using namespace std; struct book{
char id[8];
char title[81];
char author[81];
char key[61];
char publisher[81];
char year[5];
};
bool sortById(struct book b1,struct book b2){
if(strcmp(b1.id,b2.id)<0)
return true;
return false;
}
int main()
{
int N,M;
scanf("%d",&N);
struct book b[10000]; for(int i=0;i<N;i++){
scanf("%s",b[i].id);
getchar();//读取末尾的换行符 gets(b[i].title); gets(b[i].author); gets(b[i].key); gets(b[i].publisher); gets(b[i].year); }
sort(b,b+N,sortById);//按照书的ID递增排序 scanf("%d",&M);
char choice[3];
for(int i=0;i<M;i++){
scanf("%s",choice);
getchar();//读取空格
char str[81]; bool flag = false;
gets(str);
if(strcmp(choice,"1:")==0){ printf("%s %s\n",choice,str);
for(int j=0;j<N;j++){
if(strcmp(b[j].title,str)==0){
printf("%s\n",b[j].id);
flag =true;
}
}
}
else if (strcmp(choice,"2:")==0){
printf("%s %s\n",choice,str); for(int j=0;j<N;j++){
if(strcmp(b[j].author,str)==0){
printf("%s\n",b[j].id);
flag =true;
}
}
}
else if (strcmp(choice,"3:")==0){
printf("%s %s\n",choice,str); for(int j=0;j<N;j++){
string s = b[j].key;
int pos = s.find(str);
int len = strlen(str);
if(pos!=s.npos&&(s[pos+len]==' '||s[pos+len]=='\0')&&(pos==0||s[pos-1]==' '))//避免str只是某个关键字的子串
{
printf("%s\n",b[j].id);
flag =true;
}
}
}
else if (strcmp(choice,"4:")==0){
printf("%s %s\n",choice,str); for(int j=0;j<N;j++){
if(strcmp(b[j].publisher,str)==0){
printf("%s\n",b[j].id);
flag =true;
}
}
}
else if (strcmp(choice,"5:")==0){
printf("%s %s\n",choice,str); for(int j=0;j<N;j++){
if(strcmp(b[j].year,str)==0){
printf("%s\n",b[j].id);
flag =true;
}
}
}
if(false == flag){
printf("Not Found\n");
}
}
return 0;
}

												

1022. Digital Library (30)的更多相关文章

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

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

  2. PAT 甲级 1022 Digital Library (30 分)(字符串读入getline,istringstream,测试点2时间坑点)

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

  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. 1022 Digital Library (30)(30 point(s))

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

  6. 1022 Digital Library (30)(30 分)

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

  7. PAT Advanced 1022 Digital Library (30 分)

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

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

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

  9. PAT (Advanced Level) 1022. Digital Library (30)

    简单模拟题. 写的时候注意一些小优化,小心TLE. #include<iostream> #include<cstring> #include<cmath> #in ...

随机推荐

  1. 6个值得推荐的Android开源框架简介(转)

    虽然我们在做app的时候并不一定用到框架,但是一些好框架的思想是非常有学习价值的 1.volley 项目地址 https://github.com/smanikandan14/Volley-demo  ...

  2. MySQL5.5出面ERROR 1045 (28000): Access denied for user 'root'@'localhost' (using password: YES)问题的解决办法

    问题描述 安装完MySQL5.5数据库,使用Navicat Premium以及命令窗口连接数据库都报以下错误: ERROR 1045 (28000): Access denied for user ' ...

  3. 在Salesforce中可以对某一个Object的Standard Button或Link进行重写

    在Salesforce中可以对某一个Object的Standard Button或Link进行重写,来实现我们特定的逻辑过程,比如:在删除某个Object之前要判断该Object的某个Field的状态 ...

  4. VPS -Digital Ocean -搭建一个最简单的web服务器

    简单的也是美的 在一个目录放自己的几个showcase网页方便和别人分享,最简单的方式是什么 创建文件夹,放入自己的网页文件 在目录下执行 $ nohup python -m SimpleHTTPSe ...

  5. linux下SVN忽略文件/文件夹的方法

    linux下SVN忽略文件/文件夹的方法 假设想忽略文件temp 1. cd到temp所在的目录下: 2. svn propedit svn:ignore . 注意:请别漏掉最后的点(.表示当前目录) ...

  6. jfreeChart柱状图各属性详细设置

    一. 下载与环境配置 此最新版本为 1.0.13 解压jfreechart-1.0.13.zip 将lib目录下的jfreechart-1.0.13.jar .jcommon-1.0.16.jar 复 ...

  7. 廖雪峰js教程笔记3

    JavaScript的函数在查找变量时从自身函数定义开始,从"内"向"外"查找.如果内部函数定义了与外部函数重名的变量,则内部函数的变量将"屏蔽&qu ...

  8. DSP using MATLAB 示例 Example3.12

    用到的性质 代码: n = -5:10; x = sin(pi*n/2); k = -100:100; w = (pi/100)*k; % freqency between -pi and +pi , ...

  9. js不间断平滑地自动向上滚动

    <html> <head> <title>scroll up auto smooth</title> <style> *{ margin: ...

  10. Python基础8- 序列

    序列是一组有顺序的元素的集合序列的成员是有序排列的且可以通过下标偏移量来访问它的一个或几个成员序列可以包含一个或多个元素,也可以没有任何元素序列有两种类型:列表(list)和元组(tuple),两者的 ...