1、问题。。。由程序还原吧
2、本题的亮点在于
#define all(x) x.begin(),x.end()
#define ins(x) inserter(x,x.begin())
可以在算法中节省很多的代码量
set_union(all(x1),all(x2),ins(x))(完整版:set_union(x1.begin(),x1.end(),x2.begin(),x2.end(),x,x.begin))
#include <iostream>
#include<stack>
#include<set>
#include<vector>
#include<map>
#include<algorithm>
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
#define all(x) x.begin(),x.end()
#define ins(x) inserter(x,x.begin())
typedef set<int> sset;
map<sset,int>idcache;//记录set的编号
vector<sset>setid;//保存非重复的set
int id(sset x){
if(idcache.count(x))return idcache[x];
else {
setid.push_back(x);
return idcache[x]=setid.size()-1;
}
}
int main(int argc, char** argv) {
stack<int>s;
int n;cin>>n;
for(int i=0;i<n;i++){
string op;
cin>>op;
if(op[0]=='P')s.push(id(sset()));//空集入栈
else if(op[0]=='D')s.push(s.top());
else {
sset x1=setid[s.top()];s.pop();
sset x2=setid[s.top()];s.pop();
sset 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<<setid[s.top()].size()<<endl;
}
return 0;
}