zoukankan      html  css  js  c++  java
  • [PAT] 1022 Digital Library (30 分) Java

    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 (104​​) 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


     1 package pattest;
     2 
     3 import java.io.BufferedReader;
     4 import java.io.IOException;
     5 import java.io.InputStreamReader;
     6 import java.util.HashMap;
     7 import java.util.TreeSet;
     8 
     9 /**
    10  * @Auther: Xingzheng Wang
    11  * @Date: 2019/2/27 23:17
    12  * @Description: pattest
    13  * @Version: 1.0
    14  */
    15 public class PAT1022 {
    16     static BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    17 
    18     static class Library {
    19         HashMap<String, TreeSet<String>>[] allMaps = new HashMap[5];
    20 
    21         Library() throws IOException {
    22             for (int i = 0; i < 5; i++) {
    23                 HashMap<String, TreeSet<String>> map = new HashMap<>(1000, 1);
    24                 allMaps[i] = map;
    25             }
    26             int record_size = Integer.valueOf(reader.readLine());
    27             for (int i = 0; i < record_size; i++) {
    28                 String id = reader.readLine();
    29                 for (int j = 0; j < allMaps.length; j++) {
    30                     HashMap<String, TreeSet<String>> map = allMaps[j];
    31                     if (j == 2) {
    32                         String[] keys = reader.readLine().split(" ");
    33                         for (String key : keys) {
    34                             putValue(map, key, id);
    35                         }
    36                     } else {
    37                         String key = reader.readLine();
    38                         putValue(map, key, id);
    39                     }
    40                 }
    41             }
    42         }
    43 
    44         private void putValue(HashMap<String, TreeSet<String>> map, String key, String id) {
    45             TreeSet<String> integers = map.computeIfAbsent(key, k -> new TreeSet<>());
    46             integers.add(id);
    47         }
    48 
    49         TreeSet<String> query(int id, String queryString) {
    50             HashMap<String, TreeSet<String>> allMap = allMaps[id - 1];
    51             TreeSet<String> integers = allMap.get(queryString);
    52             return integers;
    53         }
    54     }
    55 
    56     public static void main(String[] args) throws IOException {
    57         Library library = new Library();
    58         int query_size = Integer.valueOf(reader.readLine());
    59         for (int i = 0; i < query_size; i++) {
    60             String line = reader.readLine();
    61             System.out.println(line);
    62             int id = line.charAt(0) - 48;
    63             String query = line.substring(3);
    64             TreeSet<String> queryResult = library.query(id, query);
    65             if (queryResult == null) {
    66                 System.out.println("Not Found");
    67             } else {
    68                 for (String book_id : queryResult) {
    69                     System.out.println(book_id);
    70                 }
    71             }
    72         }
    73     }
    74 }
  • 相关阅读:
    PHP中使用cURL实现Get和Post请求的方法
    详解回调函数——以JS为例解读异步、回调和EventLoop
    JavaScript中变量提升------Hoisting
    js 变量提升(JavaScript Scoping and Hoisting)
    js 如何判断数据是数据还是对象
    Bootstrap Modal 垂直方向加滚动条
    Bootstrap Affix(附加导航(Affix)插件的用法)
    Vue 源码解析:深入响应式原理(上)
    ceph API之PHP的S3-SDK包的泛域名解析问题
    ceph API之PHP的客户端连接
  • 原文地址:https://www.cnblogs.com/PureJava/p/10498025.html
Copyright © 2011-2022 走看看