(I2
I143
I6
(dp0
Vtable.%l
p1
(Vtable.cpp
p2
S'#include <iostream>\r\n#include <algorithm>\r\n#include <vector>\r\nusing namespace std;\r\n\r\nint A[70], B[70], C[70], a, b, c, n;\r\n\r\nbool inA(int k)\r\n{\r\n    for(int i = 0;i < a;++ i)\r\n        if(A[i] == k)\r\n            return true;\r\n\r\n    return false;\r\n}\r\n\r\nbool inB(int k)\r\n{\r\n    for(int i = 0;i < b;++ i)\r\n        if(B[i] == k)\r\n            return true;\r\n\r\n    return false;\r\n}\r\n\r\nstruct table {\r\n    unsigned a, b;\r\n    unsigned t[2][35];\r\n};\r\n\r\nvoid tryAll(int number, table* T, int s)\r\n{\r\n    for(int i = 0;i < s;i ++)\r\n    {\r\n        if( *(table+i).a == n-1) {} else {\r\n\r\n        }\r\n        if( *(table+i).b == n-1) {}\r\n    }\r\n}\r\n\r\nint main()\r\n{\r\n    cin >> n;\r\n\r\n    cin >> a;\r\n    for(int i = 0;i < a;++ i)\r\n        cin >> A[i];\r\n\r\n    cin >> b;\r\n    for(int i = 0;i < b;++ i)\r\n        cin >> B[i];\r\n\r\n    sort(A, A+a);\r\n    sort(B, B+b);\r\n\r\n    for(int i = 1;i <= 2*n;++ i)\r\n    {\r\n        if(!inA(i) and !inB(i))\r\n            C[c ++] = i;\r\n    }\r\n\r\n    long long res = 0;\r\n    table* first = new table;\r\n    first.a = a;\r\n    first.b = b;\r\n    for(int i = 0;i < a;++ i)\r\n        first.t[0][i] = A[i];\r\n    for(int i = 0;i < b;++ i)\r\n        first.t[1][i] = B[i];\r\n\r\n    for(int i = 0;i < c;++ i)\r\n    {\r\n        tryAll(C[i], first, 0);\r\n    }\r\n\r\n    return 0;\r\n}\r\n'
p3
tp4
stp5
.