(I2
I116
I6
(dp0
Vtable.%l
p1
(Vtable-2^n.cpp
p2
S'#include <bits/stdc++.h>\n\nusing namespace std;\n\nint sure[70];\n\nint nums[35];\n\nint main() {\n\tint n;\n\tscanf("%i", &n);\n\n\tfor (int i = 0;i < 2;i++) {\n\t\tint curCnt;\n\t\tscanf("%i", &curCnt);\n\n\t\tfor (int j = 0;j < curCnt;j++) {\n\t\t\tint curNum;\n\t\t\tscanf("%i", &curNum);\n\t\t\tsure[curNum] = i + 1;\n\t\t}\n\t}\n\n\tfor (int i = 0;i < 2 * n;i++) {\n\t\tnums[i] = i + 1;\n\t}\n\n\tint awns = 0;\n\twhile (next_permutation(nums, nums + 2 * n)) {\n\t\tint curAwns = 1;\n\t\tfor (int i = 0;i < n;i++) {\n\t\t\tif (nums[i] > nums[i + n]) {\n\t\t\t\tcurAwns = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tif ((i > 0) && nums[i] < nums[i - 1]) {\n\t\t\t\tcurAwns = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tif (curAwns == 0) {\n\t\t\tcontinue;\n\t\t}\n\n\t\tfor (int i = 0;i < n;i++) {\n\t\t\tif (sure[nums[i]] == 2) {\n\t\t\t\tcurAwns = 0;\n\t\t\t\tbreak;\n\t\t\t} \n\t\t\tif (sure[nums[i + n]] == 1) {\n\t\t\t\tcurAwns = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\n\t\tfor (int i = 0;i < 2 * n;i++) {\n\t\t\t//printf("%i ", nums[i]);\n\t\t}\n\t\t//printf("\\n");\n\t\tawns += curAwns;\n\t}\n\tprintf("%i\\n", awns);\n}\n'
p3
tp4
stp5
.