PAT 1022

<h1 style="margin: 0px 0px 0.5em; padding: 0px; border: 0px; font-weight: normal; font-stretch: inherit; font-size: 3em; line-height: 1em; font-family: 'Droid Sans', Verdana, 'Microsoft YaHei', Tahoma, sans-serif; vertical-align: baseline; color: rgb(17, 17, 17); background-color: rgb(250, 250, 250);">1022. Digital Library (30)</h1><div id="problemInfo" class="rfloat" style="margin: 0px; padding: 2px; border: 1px solid rgb(221, 221, 221); font-stretch: inherit; line-height: 18px; font-family: 'Droid Sans', Verdana, 'Microsoft YaHei', Tahoma, sans-serif; vertical-align: baseline; float: right; text-align: center; color: rgb(51, 51, 51); background-color: rgb(250, 250, 250);"><div class="limit" style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;"><div class="key" style="margin: 0px; padding: 0px 20px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline; background-color: rgb(221, 221, 221);">时间限制</div><div class="value" style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">1000 ms
</div></div><div class="limit" style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;"><div class="key" style="margin: 0px; padding: 0px 20px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline; background-color: rgb(221, 221, 221);">内存限制</div><div class="value" style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">65536 kB
</div></div><div class="limit" style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;"><div class="key" style="margin: 0px; padding: 0px 20px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline; background-color: rgb(221, 221, 221);">代码长度限制</div><div class="value" style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">16000 B
</div></div><div class="checker" style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;"><div class="key" style="margin: 0px; padding: 0px 20px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline; background-color: rgb(221, 221, 221);">判题程序</div><div class="value" style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;"><span title="纯文本对比" style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">Standard</span></div></div><div class="key" style="margin: 0px; padding: 0px 20px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline; background-color: rgb(221, 221, 221);">作者</div><div class="value" style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">CHEN, Yue
</div></div><div id="problemContent" style="margin: 0px; padding: 0px; border: 0px; font-stretch: inherit; line-height: 18px; font-family: 'Droid Sans', Verdana, 'Microsoft YaHei', Tahoma, sans-serif; vertical-align: baseline; color: rgb(51, 51, 51); background-color: rgb(250, 250, 250);"><p style="margin-top: 0px; margin-bottom: 1.5em; padding-top: 0px; padding-bottom: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">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.</p><p style="margin-top: 0px; margin-bottom: 1.5em; padding-top: 0px; padding-bottom: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;"><strong>Input Specification:</strong></p><p style="margin-top: 0px; margin-bottom: 1.5em; padding-top: 0px; padding-bottom: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">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:</p><ul style="margin: 0px 1.5em 1.5em 0px; padding: 0px 0px 0px 1.5em; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;"><li style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">Line #1: the 7-digit ID number;</li><li style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">Line #2: the book title -- a string of no more than 80 characters;</li><li style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">Line #3: the author -- a string of no more than 80 characters;</li><li style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">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;</li><li style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">Line #5: the publisher -- a string of no more than 80 characters;</li><li style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">Line #6: the published year -- a 4-digit number which is in the range [1000, 3000].</li></ul><p style="margin-top: 0px; margin-bottom: 1.5em; padding-top: 0px; padding-bottom: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">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.</p><p style="margin-top: 0px; margin-bottom: 1.5em; padding-top: 0px; padding-bottom: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">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:</p><ul style="margin: 0px 1.5em 1.5em 0px; padding: 0px 0px 0px 1.5em; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;"><li style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; v
aeda
ertical-align: baseline;">1: a book title</li><li style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">2: name of an author</li><li style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">3: a key word</li><li style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">4: name of a publisher</li><li style="margin: 0px; padding: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">5: a 4-digit number representing the year</li></ul><p style="margin-top: 0px; margin-bottom: 1.5em; padding-top: 0px; padding-bottom: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;"><strong>Output Specification:</strong></p><p style="margin-top: 0px; margin-bottom: 1.5em; padding-top: 0px; padding-bottom: 0px; border: 0px; font-style: inherit; font-variant: inherit; font-weight: inherit; font-stretch: inherit;font-size:undefined; line-height: inherit; font-family: inherit; vertical-align: baseline;">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.</p></div>分析：考察对字符串的操作，在使用cin<<a之后要用cin.ignore（）忽略空格和换行符 在gets（）；

code：最后两个sample 不行

<pre name="code" class="cpp">#include <stdio.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <string.h>
#include <string>
using namespace std;
struct book{
char id[8];
char title[81];
char aut[81];
vector<string> key;
char pub[81];
char year[5];
}info[10002];
int n;
void find(string str,char query[])
{
vector <int> vec;
vec.clear();
int flag;
for(int i=0;i<n;i++)
{
flag=1;
if(strcmp(query,info[i].title)==0) flag=0;
else if(strcmp(query,info[i].aut)==0) flag=0;
else if(strcmp(query,info[i].pub)==0) flag=0;
else if(strcmp(query,info[i].year)==0) flag=0;
else
for(int j=0;j<info[i].key.size();j++)
{
if(str==info[i].key[j])
flag=0;
}
if(flag==0)
{
int k=atoi(info[i].id);
vec.push_back(k);
}

}
sort(vec.begin(),vec.end());
if(vec.size()!=0)
for(int i=0;i<vec.size();i++)
{
printf("%d\n",vec[i]);
}
else printf("Not Found\n");

}
bool cmp(const book a,const book b)
{
return strcmp(a.id,b.id)<0;
}
int main()
{
memset(info,0,sizeof(info));
int m;
cin>>n;
cin.ignore();
for(int i=0;i<n;i++)
{
gets(info[i].id);
gets(info[i].title);
gets(info[i].aut);
char kk[11];
while(cin>>kk)
{
info[i].key.push_back(kk);
if(cin.get()=='\n')
break;

}
gets(info[i].pub);
gets(info[i].year);
}
sort(info,info+n,cmp)
cin>>m;
for(int i=0;i<m;i++)
{
char k[3];
char query[81];
cin>>k;
cin.ignore();
gets(query);
printf("%s %s\n",k,query);
string str;
str=query;
find(str,query);
}
return 0;
}

下面是ac code；

比较代码不同：前者是将所有的可靠id压人向量，如果向量为空那么没有找到，错误是 将字符数组换成整数会出现错误，

<span style="white-space:pre">		</span>后者是找到了 立即输出；

#include <stdio.h>
#include <vector>
#include <algorithm>
#include <iostream>
#include <string.h>
#include <string>
using namespace std;
struct book{
char id[8];
char title[81];
char aut[81];
vector<string> key;
char pub[81];
char year[5];
}info[10002];
int n;
void find(string str,char query[])
{
vector <int> vec;
vec.clear();
int flag;
bool notfound=true;
for(int i=0;i<n;i++)
{
flag=1;
if(strcmp(query,info[i].title)==0) flag=0;
else if(strcmp(query,info[i].aut)==0) flag=0;
else if(strcmp(query,info[i].pub)==0) flag=0;
else if(strcmp(query,info[i].year)==0) flag=0;
else
for(int j=0;j<info[i].key.size();j++)
{
if(str==info[i].key[j])
flag=0;
}

if(flag==0)
{
notfound=false;
cout<<info[i].id<<endl;
}
}

if(notfound)
printf("Not Found\n");

}
bool cmp(const book a,const book b)
{
return strcmp(a.id,b.id)<0;
}
int main()
{
memset(info,0,sizeof(info));
int m;
cin>>n;
cin.ignore();
for(int i=0;i<n;i++)
{
gets(info[i].id);
gets(info[i].title);
gets(info[i].aut);
char kk[11];
while(cin>>kk)
{
info[i].key.push_back(kk);
if(cin.get()=='\n')
break;

}
gets(info[i].pub);
gets(info[i].year);
}
sort(info,info+n,cmp);
cin>>m;
for(int i=0;i<m;i++)
{
char k[3];
char query[81];
cin>>k;
cin.ignore();
gets(query);
printf("%s %s\n",k,query);
string str;
str=query;
find(str,query);
}
return 0;
}