Submission #1798047
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int P =1e9+7; const int N = 410; void add(int &x,int y){ x+=y; if(x>=P) x-=P; } int f[N][N][N],a[N],b[N],n,p1[N],p2[N],sum[N][N],g[N][N*2],h[N*2]; int main(){ scanf("%d",&n); for(int i=1;i<=n;i++)scanf("%d",a+i); for(int i =1;i<=n;i++) p1[a[i]] = i; for(int i =1;i<=n;i++)scanf("%d",b+i); for(int i =1;i<=n;i++) p2[b[i]] = i; f[0][0][0] =1; for(int i = 1;i<=n;i++) sum[0][i] = i; for(int i = 1;i<=n;i++){ sum[i][0] = i; for(int k = 0;k<=n*2;k++) h[i] = 0; for(int j =1;j<=n;j++){ sum[i][j] = sum[i-1][j]+(p2[a[i]]>j); for(int k = 0;k<=n;k++) add(h[sum[i-1][j-1]+k],f[i-1][j-1][k]); for(int k = 0;k<=2*n;k++) add(g[j-1][k],h[k]); if(p2[a[i]]>j && p1[b[j]]>i) for(int k = 1;k<=n;k++){ add(f[i][j][k],1ll*k*g[j-1][sum[i][j]+k-3]%P); } } } int ans = 0; for(int i = 1;i<=n;i++) for(int j =1;j<=n;j++) for(int k = 1;k<=n;k++) if(n-k==sum[i][j]) add(ans,1ll*f[i][j][k]%P); for(int i = 3;i<=n;i+=3) ans = 1ll*ans*(i-1)*(i-2)%P; printf("%d\n",ans); return 0; } /* 3 1 2 3 2 1 3 */
Submission Info
Submission Time | |
---|---|
Task | F - Three Gluttons |
User | wtw |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1152 Byte |
Status | WA |
Exec Time | 435 ms |
Memory | 264320 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:12:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:13:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i=1;i<=n;i++)scanf("%d",a+i); ^ ./Main.cpp:15:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for(int i =1;i<=n;i++)scanf("%d",b+i); ^
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 1800 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 2 ms | 2304 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 2 ms | 4352 KB |
0_03.txt | AC | 2 ms | 4352 KB |
0_04.txt | AC | 2 ms | 2304 KB |
1_00.txt | AC | 200 ms | 2176 KB |
1_01.txt | AC | 289 ms | 90240 KB |
1_02.txt | AC | 290 ms | 90240 KB |
1_03.txt | WA | 339 ms | 133248 KB |
1_04.txt | WA | 336 ms | 135296 KB |
1_05.txt | WA | 355 ms | 178304 KB |
1_06.txt | WA | 355 ms | 178304 KB |
1_07.txt | WA | 435 ms | 264320 KB |
1_08.txt | WA | 382 ms | 262272 KB |
1_09.txt | WA | 382 ms | 262272 KB |
1_10.txt | WA | 380 ms | 260224 KB |
1_11.txt | WA | 373 ms | 260224 KB |
1_12.txt | WA | 364 ms | 254080 KB |
1_13.txt | WA | 390 ms | 262272 KB |
1_14.txt | WA | 383 ms | 262272 KB |
1_15.txt | WA | 392 ms | 264320 KB |
1_16.txt | WA | 359 ms | 264320 KB |
1_17.txt | WA | 358 ms | 264320 KB |
1_18.txt | WA | 349 ms | 262272 KB |
1_19.txt | WA | 352 ms | 262272 KB |
1_20.txt | WA | 344 ms | 260224 KB |
1_21.txt | WA | 357 ms | 264320 KB |
1_22.txt | WA | 357 ms | 264320 KB |
1_23.txt | WA | 358 ms | 264320 KB |
1_24.txt | WA | 402 ms | 262272 KB |
1_25.txt | WA | 410 ms | 264320 KB |
1_26.txt | WA | 388 ms | 258176 KB |
1_27.txt | WA | 404 ms | 262272 KB |
1_28.txt | WA | 403 ms | 262272 KB |
1_29.txt | WA | 410 ms | 264320 KB |
1_30.txt | WA | 394 ms | 260224 KB |
1_31.txt | WA | 385 ms | 258176 KB |