Problem 032——UVa 12096 - The SetStack Computer

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<stack>
using namespace std;
#define fuck x1.begin(),x1.end(),x2.begin(),x2.end(),inserter(x,x.begin())

typedef set<int> Set;
map<Set,int> id;
vector<Set> sid;

int ID(Set x)
{
    if(id.count(x)) return id[x];
    sid.push_back(x);
    return id[x]=sid.size()-1;
}

int main()
{
    int T;
    cin >> T;
    while(T--)
    {
        int n;
        stack<int> s;
        cin >> n;
        for(int i=0;i<n;i++)
        {
            string op;
            cin >> op;
            if(op=="PUSH") s.push(ID(Set()));
            else if(op=="DUP") s.push(s.top());
            else
            {
                Set x1=sid[s.top()];s.pop();
                Set x2=sid[s.top()];s.pop();
                Set x;
                if(op=="UNION") set_union(fuck);
                if(op=="INTERSECT") set_intersection(fuck);
                if(op=="ADD")
                {
                    x=x2;
                    x.insert(ID(x1));
                }
                s.push(ID(x));
            }
            cout << sid[s.top()].size() << endl;
        }
        printf("***\n");
    }
    return 0;
}