UVA 230 - Borrowers

#include<iostream>
#include<vector>
#include<string>
#include<type_traits>
#include<sstream>
#include<tuple>
#include<bitset>
#include<regex>
#include<set>
#include<queue>
#include<map>
using namespace std;

typedef struct book{
	string name;
	string author;
	bool flag;
}book;

bool compare(book a,book b){
	if (a.author != b.author) return a.author < b.author;
	return a.name < b.name;
}

int main(){
	string s;
	vector<book> shv;
	while (getline(cin, s)){
		if (s == "END") break;
		book temp;
		int index1 = s.find_last_of("\"");
		temp.name = s.substr(0,index1+1);
		temp.author = s.substr(index1+5);
		temp.flag = true;
		shv.push_back(temp);
	}
	sort(shv.begin(),shv.end(),compare);
	map<string, int> str2int;
	for (int i = 0; i < shv.size(); i++){
		string name = shv[i].name;
		str2int[name] = i;
	}
	vector<string> result;
	vector<book> re_book;
	while (getline(cin, s)){
		if (s == "END") break;
		else if (s == "SHELVE"){
			sort(re_book.begin(),re_book.end(),compare);
			for (int i = 0; i < re_book.size(); i++){
				string name = re_book[i].name;
				int pos = str2int[name];
				shv[pos].flag = true;
				int cur_pos;
				for (cur_pos = pos - 1; cur_pos >= 0; cur_pos--){
					if (shv[cur_pos].flag) break;
				}
				string res;
				if (cur_pos >= 0){
					res = "Put " + name + " after " + shv[cur_pos].name;
				}
				else{
					res = "Put " + name + " first";
				}
				result.push_back(res);
			}
			for (int i = 0; i < result.size(); i++) cout << result[i] << endl;
			cout << "END" << endl;
			re_book.clear();
			result.clear();
		}
		else{
			int index1;
			index1 = s.find_first_of("\"");
			string op = s.substr(0,index1-1);
			string name = s.substr(index1);
			int pos = str2int[name];
			if (op == "RETURN"){
				book temp;
				temp.name = name;
				temp.author = shv[pos].author;
				re_book.push_back(temp);
			}
			else if (op=="BORROW"){
				shv[pos].flag = false;
			}
		}
	}
	//system("pause");
	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值