The SetStack Computer UVA - 12096

The SetStack Computer UVA - 12096

#include<cstdio>
#include<iostream>
#include<iterator>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<stack>
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin()) 
using namespace std; 
//宏off{}=={}>>++;++<<  do{}while(0)
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 main()
{
	string str;
	int n;
	cin>>n;
	while(n--)
	{
		int u;
		cin>>u;
		stack<int> s;
		Setcache.clear();
		IDcache.clear();
		while(u--)
		{
			cin>>str;
			if(str[0]=='P')s.push(ID(Set()));
			else if(str[0]=='D')s.push(s.top());
			else
			{
				Set x1=Setcache[s.top()];s.pop();
				Set x2=Setcache[s.top()];s.pop();
				Set x;
				if(str[0]=='U')set_union(ALL(x1),ALL(x2),INS(x));
				if(str[0]=='I')set_intersection(ALL(x1),ALL(x2),INS(x));
				if(str[0]=='A'){x=x2;x.insert(ID(x1));}
				s.push(ID(x));
			}
			cout<<Setcache[s.top()].size()<<endl;
		}
		cout<<"***"<<endl;
		
	}
	return 0;
}