1022. Digital Library
2015-10-20 19:20
197 查看
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: 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<stdio.h> #include<vector> #include<string> #include<string.h> #include<algorithm> using namespace std; struct Book { char ID[8]; char title[81]; char author[81]; vector<string> v; char publisher[81]; char pubYear[5]; }; vector<Book> buf; bool cmp(Book b1, Book b2) { return strcmp(b1.ID, b2.ID) < 0; } int main() { int n, m; while(scanf("%d", &n) != EOF) { getchar();//获取n后边的回车符 for(int i = 0; i < n; i ++) { Book b1; gets(b1.ID); gets(b1.title); gets(b1.author); int j = 0; do { char tmp[10]; scanf("%s", tmp); b1.v.push_back(tmp); }while(getchar() != '\n'); gets(b1.publisher); gets(b1.pubYear); buf.push_back(b1); } //按ID进行排序 sort(buf.begin(), buf.end(), cmp); scanf("%d", &m); for(int i = 0; i < m; i ++) { int order; bool flag = false; scanf("%d: ", &order); char query[82]; gets(query); printf("%d: %s\n", order, query); for(int j = 0; j < n; j ++) { if(strcmp(query, buf[j].author) == 0) { flag = true; puts(buf[j].ID); } else if(strcmp(query, buf[j].publisher) == 0) { flag = true; puts(buf[j].ID); } else if(strcmp(query, buf[j].pubYear) == 0) { flag = true; puts(buf[j].ID); } else if(strcmp(query, buf[j].title) == 0) { flag = true; puts(buf[j].ID); } else { for(int k = 0; k < buf[j].v.size(); k ++) { if(strcmp(query, buf[j].v[k].c_str()) == 0) { flag = true; puts(buf[j].ID); break; } } } } if(!flag) puts("Not Found"); } } return 0; }
[/code]
相关文章推荐
- String类的重要方法与字段
- ETL技术
- C#中的异常捕获机制(try catch finally)
- iOS开发3-使用DOM(GData)解析XML数据
- iOS 字符串常用编码互相转换
- MATLAB GPU并行编程
- iOS开发2-使用SAX解析XML数据
- zf2环境设置
- JAVA各种引用(Reference)的汇总
- iOS 响应者链Responder Chain浅析
- WebAPI POST总是Nothing或null
- 事件冲突总结
- iOS中生成随机数
- Xml中SelectSingleNode方法中的xpath用法
- hdu1754(splay)
- 机器学习算法之:决策树 (decision trees)
- iOS开发1-使用NSJSONSerialization解析JSON数据
- android倒计时
- 第七周 负数把正数赶出队列
- 【大数据】2015 Bossie评选-20个最佳开源大数据技术