PAT 1022. Digital Library

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:

31111111The Testing BookYue Chentest code debug sort keywordsZUCS Print20113333333Another Testing BookYue Chentest code sort keywordsZUCS Print220122222222The Testing BookCYLLkeywords debug bookZUCS Print2201161: The Testing Book2: Yue Chen3: keywords4: ZUCS Print5: 20113: blablabla

Sample Output:

1: The Testing Book111111122222222: Yue Chen111111133333333: keywords1111111222222233333334: ZUCS Print11111115: 2011111111122222223: blablablaNot Found

我的思路比较简单，就是分别用不同的TreeSet来保存,

package p1022;import java.util.*;public class Main {// 最好是用String吧static HashMap<String, TreeSet<String>> title    = new HashMap<String, TreeSet<String>>(),author   = new HashMap<String, TreeSet<String>>(),keyword  = new HashMap<String, TreeSet<String>>(),publisher= new HashMap<String, TreeSet<String>>(),year     = new HashMap<String, TreeSet<String>>();static TreeSet<String> set;public static void main(String[] args) {Scanner sc = new Scanner(System.in);int N = sc.nextInt();sc.nextLine();for(int i=0; i<N; i++) {String id = sc.nextLine();String booltitle = sc.nextLine();if(title.keySet().contains(booltitle)) {set = title.get(booltitle);set.add(id);title.put(booltitle, set);} else {set = new TreeSet<String>();set.add(id);title.put(booltitle, set);}String bookauthor = sc.nextLine();if(author.keySet().contains(bookauthor)) {set = author.get(bookauthor);set.add(id);author.put(bookauthor, set);} else {set = new TreeSet<String>();set.add(id);author.put(bookauthor, set);}String key = sc.nextLine();String[] ss = key.split(" ");for(String s : ss) {if(keyword.keySet().contains(s)) {set = keyword.get(s);set.add(id);keyword.put(s, set);} else {set = new TreeSet<String>();set.add(id);keyword.put(s, set);}}String publ = sc.nextLine();if(publisher.keySet().contains(publ)) {set = publisher.get(publ);set.add(id);publisher.put(publ, set);} else {set = new TreeSet<String>();set.add(id);publisher.put(publ, set);}String y = sc.nextLine();if(year.keySet().contains(y)) {set = year.get(y);set.add(id);year.put(y, set);} else {set = new TreeSet<String>();set.add(id);year.put(y, set);}}int M = sc.nextInt();sc.nextLine();TreeSet<String> set2 = null;while(M -- > 0) {String q = sc.nextLine();int qid = Integer.parseInt(q.substring(0, q.indexOf(":")));String qcontent = q.substring(q.indexOf(":") + 2);set2 = null;switch(qid) {case 1:set2 = title.get(qcontent);break;case 2:set2 = author.get(qcontent);break;case 3:set2 = keyword.get(qcontent);break;case 4:set2 = publisher.get(qcontent);break;case 5:set2 = year.get(qcontent);break;}System.out.println(qid + ": " + qcontent);if(set2 == null){System.out.println("Not Found");continue;}for(String s : set2)System.out.println(s);}}}

提交结果如下：

测试点
测试点结果用时(ms)内存(kB)得分/满分0答案正确1251188816/161答案正确101117243/32答案正确113128883/33答案正确125127243/34内存超限  0/5

然后我就蒙蔽了，不知道还能怎么优化？那几个Set都是采用这种方法必须要的啊，是在不知道怎么办了。。。。。

有知道的麻烦告知一下。。。难道Java运行慢，占用内存也很多吗？。。。