(I2
I153
I6
(dp0
Vtable.%l
p1
(Vmain.cpp
p2
S'#include <cstdio>\r\n\r\nusing namespace std;\r\n\r\nbool findA[100],findB[100];\r\nint n,A,B,k,i,j,a[73],b[73];\r\nlong long d[73][73][73];\r\n\r\nint main()\r\n{\r\n  //  freopen("table.in","r",stdin);\r\n //   freopen("table.out","w",stdout);\r\n\r\n    scanf("%d",&n);\r\n    scanf("%d",&A);\r\n    for(i=1;i<=A;++i) scanf("%d",&a[i]), findA[a[i]]=1;\r\n    scanf("%d",&B);\r\n    for(i=1;i<=B;++i) scanf("%d",&b[i]), findB[b[i]]=1;\r\n\r\n   // sort(a+1,a+A+1);\r\n  //  sort(b+1,b+B+1);\r\n  //  for(i=0;i<=A;++i)\r\n  //  for(j=0;j<=B;++j)\r\n   // d[i][j][0]=1;\r\n\r\n    d[0][0][0]=1LL;\r\n    for(i=0;i<=n;++i)\r\n    for(j=0;j<=n;++j)\r\n    for(k=0;k<=i+j;++k)\r\n    if(i+j==2*n) continue;\r\n    else if(findA[i+j+1]) d[i+1][j][k]+=d[i][j][k];\r\n    else if(findB[i+j+1]) d[i][j+1][k]+=d[i][j][k];\r\n    else\r\n    {\r\n        if(i<n) d[i+1][j][k+1]+=d[i][j][k];\r\n        if(i>j) d[i][j+1][k+1]+=d[i][j][k];\r\n    }\r\n    printf("%lld\\n",d[n][n][2*n-A-B]);\r\n    return 0;\r\n}\r\n'
p3
tp4
stp5
.