(I2
I141
I6
(dp0
Vtable.%l
p1
(Vtable.cpp
p2
S'#include<iostream>\r\n#include<map>\r\n#include<algorithm>\r\n#include<vector>\r\nusing namespace std;\r\nint a[80],b[80],c[80]={3,4,5,6,7};\r\nbool da[80]={0,0,0,1,1};\r\nint ra, rb,rc=0;\r\nint n, otg;\r\nvector<int>v1,v2;\r\nmap<int,bool> m;\r\nbool ok()\r\n{\r\n    for(int i=0;i<n;i++)\r\n    {\r\n        if(v1[i]>v2[i])\r\n            return 0;\r\n    }\r\n    return 1;\r\n}\r\n\r\nint main(){\r\n\r\ncin>>n;\r\ncin>>ra;\r\nfor(int i=0;i<ra;i++)\r\n{\r\n    cin>>a[i];\r\n    m[a[i]]=1;\r\n}\r\ncin>>rb;\r\nfor(int i=0;i<rb;i++)\r\n{\r\n    cin>>b[i];\r\n    m[b[i]]=1;\r\n}\r\nfor(int i=1;i<=2*n;i++)\r\n{\r\n    if(!m[i]){\r\n        c[rc]=i;\r\n        rc++;\r\n    }\r\n}\r\nfor(int i=0;i<n-ra;i++)\r\n{\r\n    //cout<<rc-i-1<<endl;\r\n    da[rc-i-1]=1;\r\n}\r\ndo\r\n{\r\n    v1.clear();\r\n    v2.clear();\r\n    for(int i=0;i<ra;i++)\r\n        v1.push_back(a[i]);\r\n     for(int i=0;i<rb;i++)\r\n        v2.push_back(b[i]);\r\n /*   for(int i=0;i<rc;i++)\r\n    {\r\n        cout<<da[i]<<" ";\r\n    }\r\n    cout<<endl;*/\r\n    for(int i=0;i<rc;i++)\r\n    {\r\n        if(da[i])\r\n            v1.push_back(c[i]);\r\n            else\r\n                v2.push_back(c[i]);\r\n    }\r\n    sort(v1.begin(), v1.end());\r\n    sort(v2.begin(), v2.end());\r\n    if(ok()) otg++;\r\n\r\n}\r\nwhile(next_permutation(da,da+rc));\r\ncout<<otg<<endl;\r\nreturn 0;\r\n}\r\n'
p3
tp4
stp5
.