UVA 230 Borrowers

题目链接：https://vjudge.net/problem/UVA-230

题目翻译摘自《算法禁赛入门经典》

题目大意

　　你的任务是模拟一个图书管理系统。首先输入若干图书的标题和作者（标题各不相同， 以END结束），然后是若干指令：BORROW 指令表示借书，RETURN 指令表示还书，SHELVE 指令表示把所有已归还但还未上架的图书排序后依次插入书架并输出图书标题和插入位置（可能是第一本书或者某本书的后面）。

　　图书排序的方法是先按作者从小到大排，再按标题从小到大排。在处理第一条指令之 前，你应当先将所有图书按照这种方式排序。

分析

　　有序表加二分。

代码如下

#include <bits/stdc++.h>
using namespace std;
 
#define INIT() ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define Rep(i,n) for (int i = 0; i < (n); ++i)
#define For(i,s,t) for (int i = (s); i <= (t); ++i)
#define rFor(i,t,s) for (int i = (t); i >= (s); --i)
#define ForLL(i, s, t) for (LL i = LL(s); i <= LL(t); ++i)
#define rForLL(i, t, s) for (LL i = LL(t); i >= LL(s); --i)
#define foreach(i,c) for (__typeof(c.begin()) i = c.begin(); i != c.end(); ++i)
#define rforeach(i,c) for (__typeof(c.rbegin()) i = c.rbegin(); i != c.rend(); ++i)
 
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
 
#define LOWBIT(x) ((x)&(-x))
 
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define UNIQUE(x) x.erase(unique(x.begin(), x.end()), x.end())
 
#define ms0(a) memset(a,0,sizeof(a))
#define msI(a) memset(a,inf,sizeof(a))
#define msM(a) memset(a,-1,sizeof(a))

#define MP make_pair
#define PB push_back
#define ft first
#define sd second
 
template<typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
    in >> p.first >> p.second;
    return in;
}
 
template<typename T>
istream &operator>>(istream &in, vector<T> &v) {
    for (auto &x: v)
        in >> x;
    return in;
}
 
template<typename T1, typename T2>
ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
    out << "[" << p.first << ", " << p.second << "]" << "
";
    return out;
}

inline int gc(){
    static const int BUF = 1e7;
    static char buf[BUF], *bg = buf + BUF, *ed = bg;
    
    if(bg == ed) fread(bg = buf, 1, BUF, stdin);
    return *bg++;
} 

inline int ri(){
    int x = 0, f = 1, c = gc();
    for(; c<48||c>57; f = c=='-'?-1:f, c=gc());
    for(; c>47&&c<58; x = x*10 + c - 48, c=gc());
    return x*f;
}

template<class T>
inline string toString(T x) {
    ostringstream sout;
    sout << x;
    return sout.str();
}

inline int toInt(string s) {
    int v;
    istringstream sin(s);
    sin >> v;
    return v;
}

//min <= aim <= max
template<typename T>
inline bool BETWEEN(const T aim, const T min, const T max) {
    return min <= aim && aim <= max;
}
 
typedef long long LL;
typedef unsigned long long uLL;
typedef pair< double, double > PDD;
typedef pair< int, int > PII;
typedef pair< int, PII > PIPII;
typedef pair< string, int > PSI;
typedef pair< int, PSI > PIPSI;
typedef set< int > SI;
typedef set< PII > SPII;
typedef vector< int > VI;
typedef vector< double > VD;
typedef vector< VI > VVI;
typedef vector< SI > VSI;
typedef vector< PII > VPII;
typedef map< int, int > MII;
typedef map< int, string > MIS;
typedef map< int, PII > MIPII;
typedef map< PII, int > MPIII;
typedef map< string, int > MSI;
typedef map< string, string > MSS;
typedef map< PII, string > MPIIS;
typedef map< PII, PII > MPIIPII;
typedef multimap< int, int > MMII;
typedef multimap< string, int > MMSI;
//typedef unordered_map< int, int > uMII;
typedef pair< LL, LL > PLL;
typedef vector< LL > VL;
typedef vector< VL > VVL;
typedef priority_queue< int > PQIMax;
typedef priority_queue< int, VI, greater< int > > PQIMin;
const double EPS = 1e-8;
const LL inf = 0x7fffffff;
const LL infLL = 0x7fffffffffffffffLL;
const LL mod = 1e9 + 7;
const int maxN = 1e4 + 7;
const LL ONE = 1;
const LL evenBits = 0xaaaaaaaaaaaaaaaa;
const LL oddBits = 0x5555555555555555;

struct Book{
    string title, author;
    
    Book() {}
    Book(string s) {
        title = s.substr(0, s.find('"', 1) + 1);
        author = s.substr(s.find('"', 1) + 5);
    }
    
    bool operator< (const Book &x) const {
        return author < x.author || author == x.author && title < x.title;
    }
    
    bool operator> (const Book &x) const {
        return x < *this;
    }
};
vector< Book > books;

struct MyCmp{
    bool operator() (const int &x, const int &y) const {
        return books[x] < books[y];
    }
};

bool cmp(const int &x, const int &y) {
    return books[y] < books[x];
}

string tmp;
set< int, MyCmp > sb; // 记录在架子上的书id 
set< int, MyCmp > bb; // 记录已归还但未上架的书id 
MSI tid; // title->book_id

int main(){
    //freopen("MyOutput.txt","w",stdout);
    //freopen("input.txt","r",stdin);
    //INIT();
    while(getline(cin, tmp)) {
        if(tmp == "END") break;
        books.PB(Book(tmp));
        tid[books.back().title] = books.size() - 1;
        sb.insert(books.size() - 1);
    }
    
    while(getline(cin, tmp)) {
        if(tmp == "END") break;
        
        if(tmp[0] == 'B') {
            int id = tid[tmp.substr(tmp.find(' ') + 1)];
            sb.erase(id);
        }
        else if(tmp[0] == 'R'){
            int id = tid[tmp.substr(tmp.find(' ') + 1)];
            bb.insert(id);
        }
        else {
            foreach(i, bb) {
                auto it = lower_bound(sb.rbegin(), sb.rend(), *i, cmp); // 查找第一本小于等于books[*i]的书 
                if(it == sb.rend()) printf("Put %s first
", books[*i].title.c_str());
                else printf("Put %s after %s
", books[*i].title.c_str(), books[*it].title.c_str());
                sb.insert(*i);
            }
            bb.clear();
            printf("END
");
        }
    }
    return 0;
}