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:
" title " by author
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 " title1 " after " title2 "
or, for the special case of the book being the first in the collection:
Put " title " first
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"

SHELVEEND

Sample Output
Put "The C Programming Language" after "The Canterbury Tales"

Put "Algorithms" after "The C Programming Language"

END

题意

模拟图书馆借书还书(按作者字典序从小到大,再按书名从小到大),BRROW借一本书,RETURN还一本书,SHELVES把书按序一本本放回书架

题解

由于借书还书只给你书名,所以需要用map<string,string>把书名映射到作者,这样才可以用set查找

BRROW借书:就是删除erase一本书的作者和书名

RETURN还书:就是把作者和书名放进set1中

SHELVES放回书架:就是把遍历所有已经还的书it,用lower-bound找到插入后的位子hit,如果当前set为空或者hit==set.begin()就输出first,否则输出hit前面1个(hit--),最后插入*it即可,别忘了最后输出END

代码

 #include<bits/stdc++.h>
using namespace std;
struct book
{
string title,author;
book(string t,string a):title(t),author(a){}
bool operator <(const book &rhs)const
{
return author<rhs.author||(author==rhs.author&&title<rhs.title);
}
};
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
string s;
map<string,string> ma;
set<book> se,se1;
while(getline(cin,s))
{
if(s=="END")break;
int pos=s.find(" by ");
ma[s.substr(,pos)]=s.substr(pos+);
se.insert(book(s.substr(,pos),s.substr(pos+)));
}
while(getline(cin,s))
{
if(s[]=='E')break;
else if(s[]=='S')
{
set<book>::iterator it,bit;
for(it=se1.begin();it!=se1.end();it++)
{
bit=se.lower_bound(*it);
cout<<"Put "<<it->title;
if(se.empty()||bit==se.begin())
cout<<" first"<<endl;
else
cout<<" after "<<(--bit)->title<<endl;
se.insert(*it);
}
se1.clear();
cout<<"END"<<endl;
}
else if(s[]=='B')
se.erase(book(s.substr(),ma[s.substr()]));
else if(s[]=='R')
se1.insert(book(s.substr(),ma[s.substr()]));
}
return ;
}

UVa 230 Borrowers(map和set)的更多相关文章

  1. uva 230 Borrowers(摘)<vector>"结构体“ 膜拜!

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

  2. Uva - 230 - Borrowers

    AC代码: #include <iostream> #include <cstdio> #include <cstdlib> #include <cctype ...

  3. UVA 230 Borrowers (STL 行读入的处理 重载小于号)

    题意: 输入若干书籍和作者名字,然后先按作者名字升序排列,再按标题升序排列,然后会有3种指令,BORROW,RETURN, SHELVE. BORROW 和 RETURN 都会带有一个书名在后面,如: ...

  4. Borrowers UVA - 230

      I mean your borrowers of books - those mutilators of collections, spoilers of the symmetry of shel ...

  5. 【习题 5-8 UVA - 230】Borrowers

    [链接] 我是链接,点我呀:) [题意] 在这里输入题意 [题解] 用map+set写个模拟就好. 3个区域 书架.桌子.别人的手上. 其中前两个区域的书都能借出去. [代码] #include &l ...

  6. UVA 156 Ananagrams ---map

    题目链接 题意:输入一些单词,找出所有满足如下条件的单词:该单词不能通过字母重排,得到输入文本中的另外一个单词.在判断是否满足条件时,字母不分大小写,但在输出时应保留输入中的大小写,按字典序进行排列( ...

  7. uva 156 (map)

    暑假培训习题 1.用vector<string>储存string类型的输入单词: 2.将vector中的元素逐一标准化后映射进map中,并给map值加一: 3.新建一个空的vector 4 ...

  8. UVA 12035 War Map

    让我先把微笑送给出题人 这个题最基础的一个想法:先找出一个度数和为总度数和的1/2的点集,然后判断这个点集和这个点集的补集能否形成二分图.但是就算我们把判断的复杂度看成O(1),这个算法的复杂度也是 ...

  9. UVa 1592 Database (map)

    题意:给出n行m列的数据库(数据范围: n 1~10000, m 1~10), 问你能不能找出两行r1, r2,使得这两行中的c1, c2列是一样的, 即(r1,c1)==(r2,c1) && ...

随机推荐

  1. 检测2个公网IP的GRE隧道是否通的方法,使用PPTP拨号检测。

    检测2个公网IP的GRE隧道是否通的方法,使用PPTP拨号检测. 因为PPTP是建立在GRE隧道基础上的. PPTP 防火墙开放 TCP 1723防火墙开放 IP protocol 47,即GRENA ...

  2. ROS的工作模式和ESXI网卡工作模式的关系

    1.ROS网卡如果工作在桥接模式,那么ESXI网卡的工作模式必须设置为Promiscuous Mode(混杂模式)和Forged Transmits(伪传输)这两个必须都为开启状态,如下: 这种情况, ...

  3. [UE4]计算机中的数据表示

    一.位:数据的最小单位,一个位仅有两种状态 一个电路,通或断:磁盘上的小磁铁,南极或北极: 使用Bit表示位,百兆带宽,一秒钟可以传输一百兆个bit 二.字节:8个位组成一个字节,一个字节有256种状 ...

  4. vmware 共享文件夹(win10下的vmware安装了centos7)

    最近研究下了docker.我的笔记本是win10系统,就尝试使用了 win10的hyper-v虚拟化技术,总是感觉占用系统较多,于是换成了vmware,在虚拟机中安装 docker容器服务. 考虑到开 ...

  5. 清理mysql binlog日志

    1.查看binlog日志 mysql> show binary logs; +------------------+------------+| Log_name         | File_ ...

  6. UVA-550

    题意 输入进制数n,第一个乘数的最后一位m,第二个乘数k,乘法的结果为mk, mk的第一位是m,求此时mk的长度 #include<iostream> #include <stdio ...

  7. OpenCL 归约 1

    ▶ 照着书上的代码,写了几个一步归约的计算,只计算一步,将原数组归约到不超过 1024 个工作项 ● 代码 // kernel.cl __kernel void reduce01(__global u ...

  8. CUDA C Programming Guide 在线教程学习笔记 Part 7

    ▶ 可缓存只读操作(Read-Only Data Cache Load Function),定义在 sm_32_intrinsics.hpp 中.从地址 adress 读取类型为 T 的函数返回,T ...

  9. robot framework添加库注意事项

    添加库 假设你的项目结构是这样: 项目 ..myLib(库目录) ..目录1 ..测试用例套件1 此时你需要在“测试用例套件1”中用相对路径添加库myLib,你应该填:../myLib/ 特别注意后面 ...

  10. VB6 实现命令行调用时附着到原控制台

    Public Declare Function AttachConsole Lib "kernel32.dll" (ByVal ProcessID As Integer) As B ...