zoukankan      html  css  js  c++  java
  • UVA

     Borrowers 

    I mean your borrowers of books - those mutilators of collections, spoilers of the symmetry of shelves, and creators of odd volumes.

    - (Charles Lamb, Essays of Elia (1823) `The Two Races of Men')

    Like Mr. Lamb, librarians have their problems with borrowers too. People don't put books back where they should. Instead, returned books are kept at the main desk until a librarian is free to replace them in the right places on the shelves. Even for librarians, putting the right book in the right place can be very time-consuming. But since many libraries are now computerized, you can write a program to help.

    When a borrower takes out or returns a book, the computer keeps a record of the title. Periodically, the librarians will ask your program for a list of books that have been returned so the books can be returned to their correct places on the shelves. Before they are returned to the shelves, the returned books are sorted by author and then title using the ASCII collating sequence. Your program should output the list of returned books in the same order as they should appear on the shelves. For each book, your program should tell the librarian which book (including those previously shelved) is already on the shelf before which the returned book should go.

    Input

    First, the stock of the library will be listed, one book per line, in no particular order. Initially, they are all on the shelves. No two books have the same title. The format of each line will be:

    ``titlebyauthor

    The end of the stock listing will be marked by a line containing only the word:

    END

    Following the stock list will be a series of records of books borrowed and returned, and requests from librarians for assistance in restocking the shelves. Each record will appear on a single line, in one of the following formats:

    BORROW ``title"

    RETURN ``title"

    SHELVE

    The list will be terminated by a line containing only the word:

    END

    Output

    Each time the SHELVE command appears, your program should output a series of instructions for the librarian, one per line, in the format:

    Put `` tex2html_wrap_inline61 " after `` tex2html_wrap_inline63 "

    or, for the special case of the book being the first in the collection:

    Put ``titlefirst

    After the set of instructions for each SHELVE, output a line containing only the word:

    END

    Assumptions & Limitations:

    1. A title is at most 80 characters long.

    2. An author is at most 80 characters long.

    3. A title will not contain the double quote (") character.

    Sample Input

    "The Canterbury Tales" by Chaucer, G.
    "Algorithms" by Sedgewick, R.
    "The C Programming Language" by Kernighan, B. and Ritchie, D.
    END
    BORROW "Algorithms"
    BORROW "The C Programming Language"
    RETURN "Algorithms"
    RETURN "The C Programming Language"
    SHELVE
    END

    Sample Output

    Put "The C Programming Language" after "The Canterbury Tales"
    Put "Algorithms" after "The C Programming Language"
    END
    
    
    
    
    #include <bits/stdc++.h>
    using namespace std;
    
    struct book
    {
        string author;
        string title;
        bool borred = false;
        bool returned = false;
    
        book() = default;
        book(string a, string t)
        {
            author = a;
            title = t;
            borred = false;
            returned = false;
        }
    
        bool operator < (const book & b) const
        {
            if(author != b.author)
                return author < b.author;
            else
                return title < b.title;
        }
    };
    vector<book> table;
    
    void borrow()
    {
        string in;
        getline(cin, in);
        in = in.substr(1, in.size()-2);
        for(int i = 0; i!=table.size(); i++)
            if(table[i].title == in)
                table[i].borred = true;
    }
    
    void ret()
    {
        string in;
        getline(cin, in);
        in = in.substr(1, in.size()-2);
        for(int i = 0; i!=table.size(); i++)
            if(table[i].title == in)
                table[i].returned = true;
    }
    
    void shelve()
    {
        for(int i = 0; i != table.size(); i++)
        {
            if(table[i].returned==true)
            {
                int j;
                cout << "Put "" << table[i].title << "" ";
                for(j = i; j>=0; j--)
                    if(table[j].borred==false)
                        break;
                if(j == -1)
                    cout << "first" << endl;
                else
                    cout << "after "" << table[j].title << """ << endl;
                table[i].borred = table[i].returned = false;
            }
        }
        cout << "END
    ";
    }
    
    int main()
    {
    #ifndef ONLINE_JUDGE
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    
        string in;
        while(getline(cin, in) && in!="END")
        {
            book x;
            x.title = in.substr(1, in.find_last_of('"')-1);
            x.author = in.substr(in.find_last_of('"')+5, in.size());
            table.push_back(x);
        }
        sort(table.begin(), table.end());
    
        string cmd;
        while(cin >> cmd && cmd!="END")
        {
            if(cmd[0]=='B')
                cin.get(), borrow();
            else if(cmd[0]=='R')
                cin.get(), ret();
            else if(cmd[0]=='S')
                cin.get(), shelve();
        }
        return 0;
    }


  • 相关阅读:
    Codeforces369E Valera and Queries
    Codeforces369C Valera and Elections
    笔记 navmesh
    笔记 fastbuild
    C++ 遍历某个文件夹下所有文件
    ACM 已结束
    2018 “百度之星”程序设计大赛
    2018 Multi-University Training Contest 1 1002 /hdu6299 贪心 1007 /hdu6304 找规律
    2018 Multi-University Training Contest 5 1008 / hdu6357 Hills And Valleys LCS,思维
    牛客网暑期ACM多校训练营(第二场)G transform 思维,二分
  • 原文地址:https://www.cnblogs.com/kunsoft/p/5312787.html
Copyright © 2011-2022 走看看