PAT (Advanced Level)1022. Digital Library (30) vector c_str()
2018-03-03 22:04
471 查看
题目链接
内存限制65536 kB
代码长度限制16000 B
判题程序Standard作者CHEN, Yue
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:
1022. Digital Library (30)
时间限制1000 ms内存限制65536 kB
代码长度限制16000 B
判题程序Standard作者CHEN, Yue
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: blablablaSample 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
//1022. Digital Library(30) #include <iostream> #include <stdio.h> #include <vector> #include <queue> #include <cstring> #include <algorithm> using namespace std; struct book { char ID[8]; char title[81]; char author[81]; vector<string>key; char pub[81]; char year[5]; }; vector<book>saved; bool cmp(book t1,book t2) { return(strcmp(t1.ID, t2.ID) < 0); } int main() { int n, m; cin >> n; getchar(); for (int i = 0; i < n; i++) {//输入存书 book b; cin.getline(b.ID, 8); cin.getline(b.title, 81); cin.getline(b.author, 81); do { char keys[11]; scanf("%s", keys); b.key.push_back(keys); } while (getchar() != '\n'); cin.getline(b.pub, 81); cin.getline(b.year, 81); saved.push_back(b); } sort(saved.begin(), saved.end(), cmp); cin >> m; for (int i = 0; i < m; i++) { int order; scanf("%d: ", &order); char input[85]; cin.getline(input, 85); printf("%d: %s\n", order, input); int flag = 1; for (int j = 0; j < n; j++) { if (strcmp(input, saved[j].title) == 0) { flag = 0; puts(saved[j].ID); } else if(strcmp(input, saved[j].author) == 0) { flag = 0; puts(saved[j].ID); } else if (strcmp(input, saved[j].pub) == 0) { flag = 0; puts(saved[j].ID); } else if (strcmp(input, saved[j].year) == 0) { flag = 0; puts(saved[j].ID); } for (int k = 0; k < saved[j].key.size(); k++) { if (strcmp(input, saved[j].key[k].c_str()) == 0){//string的函数c_str()是获取这个字符串的首指针 flag = 0; puts(saved[j].ID); break; } } } if (flag == 1) { puts("Not Found"); } } return 0; }
相关文章推荐
- 浙大 PAT Advanced level 1022. Digital Library (30)
- PAT (Advanced Level) Practise 1022. Digital Library (30)
- 【PAT Advanced Level】1022. Digital Library (30)
- PAT (Advanced Level) Practise 1022 Digital Library (30)
- 1022. Digital Library (30)——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1022 Digital Library (30)
- 【PAT】【Advanced Level】1022. Digital Library (30)
- PAT (Advanced Level) 1022. Digital Library (30)
- 1022. Digital Library (30) @ PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1022. Digital Library (30)
- PAT (Advanced Level) 1022. Digital Library (30) 数字图书馆 map
- PAT (Advanced) 1022. Digital Library (30)
- Pat(Advanced Level)Practice--1022(Digital Library)
- 1053. Path of Equal Weight (30)【树+搜索】——PAT (Advanced Level) Practise
- PAT (Advanced Level) Practise 1127 ZigZagging on a Tree (30)
- PAT (Advanced Level) Practise 1057 Stack (30)
- PAT (Advanced Level) Practise 1072 Gas Station (30)
- PAT (Advanced Level) Practise 1080 Graduate Admission (30)
- PAT (Advanced Level) Practise 1091 Acute Stroke (30)
- PAT-1022 Digital Library (30)