UVA 12504 Updating a Dictionary

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

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

题目大意

　　在本题中，字典是若干键值对，其中键为小写字母组成的字符串，值为没有前导零或正号的非负整数（-4，03 和 +77 都是非法的，注意该整数可以很大）。输入一个旧字典和一个新字典，计算二者的变化。输入的两个字典中键都是唯一的，但是排列顺序任意。

　　输入包含两行，各包含不超过100个字符，即旧字典和新字典。输出格式如下：

1. 如果至少有一个新增键，打印一个“+”号，然后是所有新增键，按字典序从小到大排列。
2. 如果至少有一个删除键，打印一个“-”号，然后是所有删除键，按字典序从小到大排列。
3. 如果至少有一个修改键，打印一个“*”号，然后是所有修改键，按字典序从小到大排列。
4. 如果没有任何修改，输出No changes。

分析

　　搞两个有序表一一对比即可。

代码如下

#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 REMOVE(x, c) x.erase(remove(x.begin(), x.end(), c), x.end()); // 删去 x 中所有 c 
#define TOLOWER(x) transform(x.begin(), x.end(), x.begin(),::tolower);
#define TOUPPER(x) transform(x.begin(), x.end(), x.begin(),::toupper);
 
#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;

int T;
string tmp;
MSS A, B;
MIS mis = {MP(0, "+"), MP(1, "-"), MP(2, "*")};

void analysis(MSS &x, string s) {
    foreach(i, s) if(*i == '{' || *i == '}' || *i == ',' || *i == ':') *i = ' ';
    stringstream sin(s);
    string a, b;
    
    while(sin >> a >> b) x[a] = b;
}

int main(){
    //freopen("MyOutput.txt","w",stdout);
    //freopen("input.txt","r",stdin);
    //INIT();
    cin >> T;
    while(T--) {
        set< string > changes[3];
        A.clear();
        B.clear();
        cin >> tmp;
        analysis(A, tmp);
        cin >> tmp;
        analysis(B, tmp);
        
        auto itA = A.begin(), itB = B.begin();
        while(itA != A.end() && itB != B.end()) {
            if(itA->ft == itB->ft) {
                if(itA->sd != itB->sd) changes[2].insert(itA->ft);
                ++itA;
                ++itB;
            }
            else if(itA->ft > itB->ft) {
                changes[0].insert(itB->ft);
                ++itB;
            }
            else {
                changes[1].insert(itA->ft);
                ++itA;
            }
        }
        
        while(itA != A.end()) {
            changes[1].insert(itA->ft);
            ++itA;
        }
        
        while(itB != B.end()) {
            changes[0].insert(itB->ft);
            ++itB;
        }
        
        if(changes[0].empty() && changes[1].empty() && changes[2].empty()) printf("No changes

");
        else {
            Rep(i, 3) {
                if(!changes[i].empty()) {
                    cout << mis[i];
                    foreach(j, changes[i]) {
                        if(j != changes[i].begin()) cout << ",";
                        cout << *j;
                    }
                    cout << endl;
                }
            }
            cout << endl;
        }
    }
    return 0;
}