12096 - The SetStack Computer

#include <iostream>
#include <set>
#include <stack>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;

#define ALL(x) x.begin(), x.end()
#define INS(x) inserter(x, x.begin())

int t, n;
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()
{
    cin >> t;
    while(t--)
    {
        IDcache.clear(); //其实不用clear也没关系 只是取个ID而已 对结果没影响
        Setcache.clear(); //速度反而会更快
        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