(I2
I107
I6
(dp0
Vtable.%l
p1
(Vtable.cpp
p2
S'#include<iostream>\r\n#include<vector>\r\n#include<algorithm>\nusing namespace std;\nvector<int> a,b;\r\nint used[100],cnt=0,br=0;\r\n\r\nint n,m,k,i,t;\r\n\r\nvoid add(int i,int j){\r\n\r\n    int it;\r\n//    cout<<"i="<<i<<" "<<cnt<<endl;\r\n\r\n\r\n    if((a.size() == n && j==1) || (b.size() == n && j==2)){\r\n\r\n        return;\r\n    }\r\n    cnt--;\r\n\r\n\r\n    if(j==1){\r\n        used[i] = 1;\r\n        it = lower_bound(a.begin(),a.end(),i) - a.begin();\r\n        a.insert(it + a.begin(),i);\r\n\r\n    }\r\n    if(j==2){\r\n        used[i]=2;\r\n        it = lower_bound(b.begin(),b.end(),i) - b.begin();\r\n        b.insert(it + b.begin(),i);\r\n    }\r\n\r\n    if(cnt==0){\r\n        bool valid = true;\r\n        for(int o=0; o<n;o++){\r\n            if(a[o] > b[o])valid = false;\r\n        }\r\n        if(valid)br++;\r\n    }else{\r\n\r\n        for(int o=i+1; o<=2*n;o++){\r\n            if(used[o] == 0){\r\n                add(o,1);\r\n                add(o,2);\r\n                break;\r\n            }\r\n\r\n        }\r\n    }\r\n\r\n    if(j==1)a.erase(it + a.begin());\r\n    else b.erase(it + b.begin());\r\n\r\n    used[i] = 0;\r\n    cnt++;\r\n}\r\n\nint main()\n{\r\n    cin>>n;\r\n\r\n\r\n    cin>>m;\r\n\r\n    for(int i = 0; i<m;i++){\r\n        cin>>t;\r\n        a.push_back(t);\r\n        used[t]=1;\r\n        cnt++;\r\n    }\r\n    sort(a.begin(),a.end());\r\n\r\n    cin>>k;\r\n    for(int i = 0; i<k;i++){\r\n        cin>>t;\r\n        b.push_back(t);\r\n        used[t]=2;\r\n        cnt++;\r\n\r\n    }\r\n    sort(b.begin(),b.end());\r\n\r\n    cnt=2*n-cnt;\r\n    for(int i = 1; i<=2*n;i++){\r\n        //cout<<"i="<<i<<" used=" << used[i]<<endl;\r\n        if(used[i] == 0){\r\n            //cout<<i;\r\n            add(i,1);\r\n            add(i,2);\r\n            break;;\r\n        }\r\n\r\n    }\r\n\r\n    cout<<br<<endl;\n    return 0;\n}\n'
p3
tp4
stp5
.