UVa12096 The SetStack Computer

#include<set>
#include<map>
#include<iostream>
#include<vector>
#include<cstring>
#include<stack>
#include<algorithm>      //set_union,set_intersection会用到 
using namespace std;
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
typedef set<int> Set;
map<Set,int> IDcache;
vector<Set> Setcache;


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


int n,m;
int main(){
cin>>m; 
for(int j=0;j<m;j++){
stack<int>s;
cin>>n;
for(int i=0;i<n;i++){
string op;
cin>>op;
if(op[0]=='P')s.push(ID(Set()));
else if(op[0]=='D')s.push(s.top());
else{
Set x1=Setcache[s.top()];s.pop();
Set x2=Setcache[s.top()];s.pop();
Set x;
if(op[0]=='U') set_union (ALL(x1),ALL(x2),INS(x)); //x存储结果 
if(op[0]=='I') set_intersection(ALL(x1),ALL(x2),INS(x));
if(op[0]=='A') {x=x2;x.insert(ID(x1));}
s.push(ID(x));           //栈中存储的是x的ID
} 
cout<<Setcache[s.top()].size()<<endl; 
}
cout<<"***"<<endl;
}
return 0;
}