1022 Digital Library 30

1022 Digital Library 30

题目描述

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(\le 10^4)$ 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(\le 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

问题思路

本题大意：描述了一个微型的电子图书管理程序，需要我们插入图书，并针对title, author, keywords, publisher, year五个不同的属性对图书的id进行查询。

思路一：戳我看源码

建立一个图书类型struct Book储存图书属性，以id为键Book为值进行map映射。

这个思路使用一个map类型进行数据储存，插入时间复杂度为：$O(logN)$；但查询时需要挨个遍历一遍，效率很低，查询时间复杂度为$O(MN)$

思路二：戳我看源码

对于每一个属性，分别建立一个title/author...为键id为值的映射。

这个思路提高了查询的时间复杂度，为$O(MlogN)$

测试点

坑：id输出时必须是7位数字，否则测试点3, 4过不了。比如id=1要输出0000001而不是1

源码

// 思路一
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

struct Book
{
    int id;
    string title;
    string author;
    vector<string> key_words;
    string publisher;
    string year;
    Book(int k) : id(k)
    {
        getline(cin, title);
        getline(cin, author);
        string tmp;
        while(cin>>tmp)
        {
            key_words.push_back(tmp);
            if(getchar() == '\n')
                break;
        }
        getline(cin, publisher);
        getline(cin, year);
    }
};

int main()
{
    map<int, Book *> digitlib;
    int N, id;
    scanf("%d", &N);
    for (int i = 0; i < N; i++)
    {
        scanf("%d", &id);
        getchar();
        if(digitlib.find(id) == digitlib.end())
            digitlib[id] = new Book(id);
    }

    int M;
    scanf("%d", &M);
    for (int i = 0; i < M; i++)
    {
        int mode, flag = 0;
        string key;
        scanf("%d", &mode);
        getline(cin, key);
        printf("%d%s\n", mode, key.c_str());
        for(auto s =key.begin(); (*s ==' ' || *s == ':') && s != key.end();)
        {
            key.erase(s);
        }

        for (auto s = digitlib.begin(); s != digitlib.end(); s++)
        {
            switch (mode)
            {
            case 1:
                if (s->second->title == key)
                {
                    printf("%07d\n", s->second->id);
                    flag = 1;
                }
                break;
            case 2:
                if (s->second->author == key)
                {
                    printf("%07d\n", s->second->id);
                    flag = 1;
                }
                break;
            case 3:
                if (find(s->second->key_words.begin(), s->second->key_words.end(), key) != s->second->key_words.end())
                {
                    printf("%07d\n", s->second->id);
                    flag = 1;
                }
                break;
            case 4:
                if (s->second->publisher == key)
                {
                    printf("%07d\n", s->second->id);
                    flag = 1;
                }
                break;
            case 5:
                if (s->second->year == key)
                {
                    printf("%07d\n", s->second->id);
                    flag = 1;
                }
                break;
            default:
                break;
            }
        }
        if(flag == 0)
            printf("Not Found\n");
    }

    return 0;
}

// 思路二
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
using namespace std;

void insert_map(map<string, set<int>> &m, int key)
{
    string line;
    getline(cin, line);
    m[line].insert(key);
}

int main()
{
    map<string, set<int>> title, author, keys, publisher, year;

    int N, id;
    scanf("%d", &N);
    for (int i = 0; i < N; i++)
    {
        scanf("%d", &id);
        getchar();
        insert_map(title, id);
        insert_map(author, id);
        string tmp;
        while(cin >>tmp)
        {
            keys[tmp].insert(id);
            if(getchar() == '\n')
                break;
        }
        insert_map(publisher, id);
        insert_map(year, id);
    }

    int M;
    scanf("%d", &M);
    for (int i = 0; i < M; i++)
    {
        int mode, flag = 0;
        string key;
        scanf("%d", &mode);
        getline(cin, key);
        printf("%d%s\n", mode, key.c_str());
        for(auto s =key.begin(); (*s ==' ' || *s == ':') && s != key.end();)
        {
            key.erase(s);
        }

        switch (mode)
        {
        case 1:
            if (title.find(key) != title.end())
            {
                // attention ! ! ! 输出7-digit id，而不是int(测试点 3 4)
                for(auto s = title[key].begin(); s != title[key].end(); s++)
                    printf("%07d\n", *s);
                flag = 1;
            }
            break;
        case 2:
            if (author.find(key) != author.end())
            {
                for(auto s = author[key].begin(); s != author[key].end(); s++)
                    printf("%07d\n", *s);
                flag = 1;
            }
            break;
        case 3:
            if (keys.find(key) != keys.end())
            {
                for(auto s = keys[key].begin(); s != keys[key].end(); s++)
                    printf("%07d\n", *s);
                flag = 1;
            }
            break;
        case 4:
            if (publisher.find(key) != publisher.end())
            {
                for(auto s = publisher[key].begin(); s != publisher[key].end(); s++)
                    printf("%07d\n", *s);
                flag = 1;
            }
            break;
        case 5:
            if (year.find(key) != year.end())
            {
                for(auto s = year[key].begin(); s != year[key].end(); s++)
                    printf("%07d\n", *s);
                flag = 1;
            }
            break;
        default:
            break;
        }
        if(flag == 0)
            printf("Not Found\n");
    }

    return 0;
}