(I2
I127
I6
(dp0
Vtable.%l
p1
(Vtable.cpp
p2
S'#include<iostream>\r\n#include<algorithm>\nusing namespace std;\r\nint n,broi[4],A[128],B[128],C[128],im[128],brc=0,Go[128],Do[128],br=0;\r\nvoid Read()\r\n{\r\n    int i;\r\n    cin>>n;\r\n    cin>>broi[0];\r\n    for(i=0;i<broi[0];i++)\r\n    {\r\n        cin>>A[i];\r\n        Go[i]=A[i];\r\n        im[A[i]]=1;\r\n    }\r\n    cin>>broi[1];\r\n     for(i=0;i<broi[1];i++)\r\n    {\r\n        cin>>B[i];\r\n        Do[i]=B[i];\r\n        im[B[i]]=1;\r\n    }\r\n    for(i=1;i<=2*n;i++)\r\n    {\r\n        if(im[i]==0)\r\n        {\r\n            C[brc]=i;\r\n            brc++;\r\n        }\r\n    }\r\n}\r\nint Otdo(int G[128],int D[128])\r\n{\r\n    int i;\r\n    for(i=0;i<n;i++)\r\n    {\r\n        if(G[i]>D[i]) return 0;\r\n    }\r\n    return 1;\r\n}\r\nint Resh()\r\n{\r\nint i,x,y,C2[128],chis,tv,sw;\r\nx=n-broi[0];\r\ny=n-broi[1];\r\nchis=0;\r\ntv=x;\r\nsort(C,C+brc);\r\nfor(i=0;i<brc;i++)\r\n    {\r\n        C2[i]=C[i];\r\n    }\r\ndo\r\n{\r\n    for(i=broi[0];i<broi[0]+x;i++)\r\n     {\r\n         Go[i]=C2[i-broi[0]];\r\n     }\r\n     for(i=broi[1];i<broi[1]+y;i++)\r\n     {\r\n         Do[i]=C2[i-broi[1]+x];\r\n     }\r\n     sort(Go,Go+n);\r\n     sort(Do,Do+n);\r\n     if(Otdo(Go,Do)==1) br++;\r\n     for(i=0;i<broi[0];i++)\r\n    {\r\n        Go[i]=A[i];\r\n    }\r\n     for(i=0;i<broi[1];i++)\r\n    {\r\n        Do[i]=B[i];\r\n    }\r\n    for(i=0;i<brc;i++)\r\n    {\r\n        C2[i]=C[i];\r\n    }\r\n    if(tv<brc)\r\n    {\r\n        sw=C2[chis];\r\n        C2[chis]=C2[tv];\r\n        C2[tv]=sw;\r\n         tv++;\r\n    }\r\n   else\r\n   {\r\n    chis++;\r\n       tv=x;\r\n       if(chis>=brc-1) return br;\r\n    sw=C2[chis];\r\n        C2[chis]=C2[tv];\r\n        C2[tv]=sw;\r\n         tv++;\r\n   }\r\n\r\n}\r\nwhile(chis<brc);\r\n}\nint main()\n{\nRead();\r\ncout<<Resh();\nreturn 0;\n}\r\n'
p3
tp4
stp5
.