(I2
I139
I6
(dp0
Vtable.%l
p1
(Vtable2.cpp
p2
S'#include <iostream>\r\n#include <algorithm>\r\nusing namespace std;\r\n    bool alr[36];\r\n    int posibilities1[71];\r\n    int posibilities2[71];\r\nint main()\r\n{\r\n    int n = 0, la = 0, lb = 0;\r\n    int a[37],b[37],c[37];\r\n    cin >> n;\r\n    cin >> la;\r\n    for(int i = 0; i < la; i ++)\r\n    {\r\n        cin >> a[i];\r\n    }\r\n    cin >> lb;\r\n    for(int i = 0; i < lb; i ++)\r\n    {\r\n        cin >> b[i];\r\n    }\r\n    sort(a,a+la);\r\n    sort(b,b+lb);\r\n    int curr = 1;\r\n    int stb = 10000;\r\n    int ans = 1;\r\n    int much[2] = {0,0};\r\n    while(curr <= 2*n && much[0] < n)\r\n    {\r\n        int found = 0;\r\n        for(int i = 0; i < la; i ++)\r\n        {\r\n            if(a[i] == curr) found = 1;\r\n        }\r\n        for(int i = 0; i < lb; i ++)\r\n        {\r\n            if(b[i] == curr) found = 2;\r\n        }\r\n        if(found == 2) stb = min(curr,stb);\r\n        if(found == 1) much[0] ++;\r\n        if(found == 0 && posibilities1[much[0]] > 0) ans ++;\r\n        if(found == 0 && posibilities1[much[0]] < 1) posibilities1[much[0]] ++;\r\n        curr ++;\r\n    }\r\n    while(stb <= 2*n && much[1] < n)\r\n    {\r\n        int found = 0;\r\n        for(int i = 0; i < la; i ++)\r\n        {\r\n            if(a[i] == stb) found = 1;\r\n        }\r\n        for(int i = 0; i < lb; i ++)\r\n        {\r\n            if(b[i] == stb) found = 2;\r\n        }\r\n        if(found == 2) much[1] ++;\r\n        if(found == 0 && posibilities2[much[1]] > 0) ans ++;\r\n        if(found == 0 && posibilities2[much[1]] < 1) posibilities1[much[1]] ++;\r\n        stb ++;\r\n    }\r\n    cout << (ans==-1?0:ans) << endl;\r\n}'
p3
tp4
stp5
.