1022. Digital Library (30)

原创 2015年11月20日 22:48:27

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

提交代

http://www.patest.cn/contests/pat-a-practise/1022

#include <cstdio>  
#include <sstream>  
#include <cstring>  
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <map>
#include <iterator>
#include <sstream>

using namespace std;

#define  N 10005

int n , m ;

map<string,vector<int>> mp[6] ;

bool cmp(int a , int b)
{
  return a < b ;
}

int main()
{
    //freopen("in.txt", "r", stdin);
  scanf("%d",&n) ;
  int i ;
  int bid ;
  string title , author , key_words , publisher , year ;
  for(i = 0 ;i < n ; i++)
  {
    scanf("%d\n" , &bid) ;
    getline(cin , title);
    getline(cin , author);
    getline(cin , key_words);
    getline(cin , publisher);
    getline(cin , year);

    mp[1][title].push_back(bid) ;
    mp[2][author].push_back(bid) ;
    mp[4][publisher].push_back(bid) ;
    mp[5][year].push_back(bid) ;

    string key;
    istringstream istr(key_words);
    while(istr >> key)
    {
      mp[3][key].push_back(bid) ;
    }
  }
  scanf("%d",&m) ;
  map<string,vector<int>>::iterator it ;
  for(i = 1 ; i <= m ; i++)
  {
    int way ;
    scanf("%d: ",&way) ;
    string search ;
    getline(cin , search);
    
    it = mp[way].find(search) ;
    cout << way << ": " << search << endl ;
    if(it != mp[way].end() )
    {
      sort(mp[way][search].begin() , mp[way][search].end() , cmp) ;
      vector<int>::iterator vt = mp[way][search].begin() ;
      while(vt != mp[way][search].end()) 
      {
        printf("%07d\n",*vt) ;
        vt ++ ;
      }
    }else{
      printf("Not Found\n");
    }
    
  }
  return 0 ;
}

第二次做的

注意如何正确输入,输出时如果book的id设为了int 输出时 用printf(“%07d”,id);

ac代码2

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <sstream>
#include <stack> 
#include <map> 
#include <set> 
#include <unordered_map> 
#include <unordered_set> 

using namespace std;

const int INF = 0x7fffffff;
const int MIN_INF = - INF -1;
typedef long long int LL;

const int N = 10005;

int n, m;

struct book
{
  int id;
  string title;
  string author;
  vector<string> keywords;
  string pulisher;
  string year;
};
  
int main()
{
 // freopen("in.txt","r",stdin);
  while(scanf("%d",&n) != EOF)
  {
    map<string,set<int>> mp[6];
  for(int i=0;i<6;i++)
  {
    mp[i].clear();
  }

    book b;
  b.keywords.clear();
    for(int i=0;i<n;i++)
    {
      scanf("%d", &b.id);
      getchar();
      getline(cin, b.title);
      getline(cin, b.author);
      
      string tmp;
      getline(cin, tmp);
      stringstream ss(tmp);
      string word;
      while(ss >> word)
      {
        b.keywords.push_back(word);
        mp[3][word].insert(b.id);
      }

      getline(cin,b.pulisher);
      getline(cin,b.year);

      mp[1][b.title].insert(b.id);
      mp[2][b.author].insert(b.id);
      mp[4][b.pulisher].insert(b.id);
      mp[5][b.year].insert(b.id);

    }

    int searchno;
    string searchs;
    scanf("%d", &m);
    for(int i=0;i<m;i++)
    {
      scanf("%d: ",&searchno);
      getline(cin,searchs);

    if(searchno < 1 || searchno > 5)
    {
    printf("Not Found\n");
    continue;
    }

      set<int> ans = mp[searchno][searchs];
      
      printf("%d: ",searchno);
      cout << searchs << endl;

      if(ans.empty())
      {
        printf("Not Found\n");
      }else{
        set<int>::iterator it = ans.begin();
        while(it != ans.end())
        {
    printf("%07d\n",*it);
          ++it;
        }
      }
    }
  }
  
  return 0;
}





版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

pat 1022. Digital Library (30)

用STL里的map很简单 要注意的几点: 1.key的分离,网上查到一种比较好的方法char *point=book[i].keyWord;//关键词分离 while(*p...

PAT A 1022. Digital Library (30)

题目

【PAT Advanced Level】1022. Digital Library (30)

这题其他没什么,就是输入输出比较麻烦,还怪自己太不熟练。 #include #include #include #include #include #include using na...

1022. Digital Library (30)

题目如下:

1022. Digital Library (30)-PAT甲级真题(map映射)

1022. Digital Library (30) A Digital Library contains millions of books, stored according to their ...

[pat]1022. Digital Library (30)

https://www.patest.cn/contests/pat-a-practise/1022 #include #include #include #include #include #in...

PAT A1022. Digital Library (30)

A Digital Library contains millions of books, stored according to their titles, authors, key words o...

PAT 1022. Digital Library (30)

A Digital Library contains millions of books, stored according to their titles, authors, key words o...

1022. Digital Library (30)

A Digital Library contains millions of books, stored according to their titles, authors, key words o...

1022. Digital Library (30)

A Digital Library contains millions of books, stored according to their titles, authors, key words o...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)