delete pics to save space

2.12096.cpp

@@ -0,0 +1,77 @@
+#include<iostream>
+#include<string>
+#include<vector>
+#include<set>
+#include<map>
+#include<stack>
+#include<algorithm>
+using namespace std;
+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;
+}
+#define ALL(x) x.begin(),x.end()
+#define INS(x) inserter(x,x.begin())
+void solve()
+{
+	stack<int> s;
+	int n;
+	cin>>n;
+	string op;
+	for(int i=0;i<n;i++)
+	{
+		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));
+			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));
+		}
+		cout<<Setcache[s.top()].size()<<endl;
+	}
+	cout<<"***"<<endl;
+}
+int main()
+{
+#ifdef local
+	freopen("pro.in","r",stdin);
+#endif
+	int T;
+	cin>>T;
+	while(T-->0)
+	{
+		IDcache.clear();
+		Setcache.clear();
+		solve();
+	}
+	return 0;
+}
+/*
+0
+0
+1
+0
+1
+1
+2
+2
+2
+***
+0
+0
+1
+0
+0
+***
+*/