(I2
I164
I6
(dp0
Vtable.%l
p1
(Vtable.cpp
p2
S'#include <iostream>\r\n#include <vector>\r\n#include <algorithm>\r\n\r\nusing namespace std;\n\r\nbool sol(int k1[80], int k2[80], int n){\r\n    for(int i = 0; i < n-1; i++){\r\n        if(k1[i] < k1[i+1]){\r\n\r\n        } else {\r\n            return false;\r\n        }\r\n    }\r\n    for(int i = 0; i < n-1; i++){\r\n        if(k2[i] < k2[i+1]){\r\n\r\n        } else {\r\n            return false;\r\n        }\r\n    }\r\n    for(int i = 0; i < n; i++){\r\n        if(k1[i] < k2[i]){\r\n\r\n        } else {\r\n            return false;\r\n        }\r\n    }\r\n    return true;\r\n}\r\n\r\nint e[81];\r\n\r\nint main()\n{\r\n    int n, m, k, a1, a2 = 0, c2 = 0, k1[80], k2[80], s= 0;\r\n    vector<int> a, b ,c;\r\n\r\n    cin >> n;\r\n    cin >> m;\r\n    for(int i = 0; i < m; i++){\r\n        cin >> a1;\r\n        e[a1] = 1;\r\n        a.push_back(a1);\r\n        //if(a1 > a2) a2 = a1;\r\n    }\r\n    cin >> k;\r\n    for(int i = 0; i < k; i++){\r\n        cin >> a1;\r\n        e[a1] = 1;\r\n        b.push_back(a1);\r\n        //if(a1 > a2) a2 = a1;\r\n    }\r\n    //cout << a2 << endl;\r\n    for(int i = 1; i <= 2*n; i++){\r\n        if(e[i]){\r\n\r\n        }else{\r\n            //cout << i << endl;\r\n            c.push_back(i);\r\n        }\r\n    }\r\n    sort(c.begin(), c.end());\r\n    sort(a.begin(), a.end());\r\n    sort(b.begin(), b.end());\r\n    for(int i = 0; i < n; i++){\r\n        //if(i == n-1)\r\n        if(i < n-1)\r\n        {\r\n            k1[i] = min(a[a2], c[c2]);\r\n            if(c[c2] < a[a2])\r\n            c2++;\r\n            else\r\n            a2++;\r\n        } else {\r\n            for(int j = c2+1; j < c.size(); j++){\r\n                k1[i] = c[j];\r\n                if(a2 < m-1){\r\n                    cout << 0 << endl;\r\n                    return 0;\r\n                }\r\n                a2 = 0;\r\n                int c23 = c2+1;\r\n                for(int v = 0; v < n; v++){\r\n                    if(c23 == j)\r\n                    {\r\n                        c23++;\r\n                        k2[v] = b[a2];\r\n                        a2++;\r\n                    } else {\r\n                    k2[v] = min(b[a2], c[c23]);\r\n                    if(c[c23] < b[a2])\r\n                    c23++;\r\n                    else\r\n                    a2++;\r\n                    }\r\n                    //cout << k2[i] << endl;\r\n                }\r\n                if(a2 < k-1){\r\n                    cout << 0 << endl;\r\n                    return 0;\r\n                }\r\n                if(sol(k1, k2, n)) s++;\r\n//                for(int q = 0; q < n; q++){\r\n//                    for(int w = 0; w < n; w++){\r\n//                        if(!e[k1[q]] && (!e[k2[w]]))\r\n//                        {\r\n//                            int t = k1[q];\r\n//                            k1[q] = k2[w];\r\n//                            k2[w] = t;\r\n//                            if(sol(k1, k2, n)) s++;\r\n//                            t = k1[q];\r\n//                            k1[q] = k2[w];\r\n//                            k2[w] = t;\r\n//                        }\r\n//\r\n//                    }\r\n//                }\r\n            }\r\n        }\r\n\r\n        //cout << k1[i] << endl;\r\n    }\r\n    //int c23 = c2;\r\n\r\n\r\n\r\n\r\n    //if(c23 > (c2-c23)) cout << c23 << endl;\r\n    //else cout << (c2-c23) << endl;\r\n\r\n    cout << s+1 << endl;\n    return 0;\n}\r\n'
p3
tp4
stp5
.