Submission #1201463
Source Code Expand
#include<cstdio> #include<algorithm> #include<cstdlib> using namespace std; int n, D[51][101][101], w[110], Mod = 1000000007; int s; int main(){ int i, j, k, l; scanf("%d",&n); for(i=1;i<n+n;i++){ scanf("%d",&w[i]); } sort(w+1,w+n+n); D[1][1][1] = 1; s = 1; for(i=1;i<n;i++){ int ck1 = 0, ck2 = 0; if(w[n-i]!=w[n-i+1])ck1 = 1; if(w[n+i]!=w[n+i-1])ck2 = 1; for(j=1;j<=s;j++){ for(k=1;k<=j;k++){ if(!D[i][j][k])continue; int tp = D[i][j][k]; for(l=1-ck1;l<=k;l++){ int t = j+ck1+ck2-max(0, k-l-1); D[i+1][t][l+ck1] = (D[i+1][t][l+ck1] + tp)%Mod; } for(l=k+1;l<=j+ck2;l++){ int t = j+ck1+ck2-(l-k-1); D[i+1][t][k+1+ck1] = (D[i+1][t][k+1+ck1] + tp)%Mod; } } } s += ck1+ck2; } int r = 0; for(i=1;i<=s;i++)for(j=1;j<=i;j++)r=(r+D[n][i][j])%Mod; printf("%d\n",r); }
Submission Info
Submission Time | |
---|---|
Task | F - Prefix Median |
User | ainta |
Language | C++14 (GCC 5.4.1) |
Score | 2000 |
Code Size | 1095 Byte |
Status | AC |
Exec Time | 18 ms |
Memory | 1280 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:9:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:11:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&w[i]); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 2000 / 2000 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt |
All | 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | AC | 1 ms | 128 KB |
00_example_02.txt | AC | 1 ms | 128 KB |
00_example_03.txt | AC | 1 ms | 256 KB |
01.txt | AC | 18 ms | 1280 KB |
02.txt | AC | 14 ms | 1152 KB |
03.txt | AC | 3 ms | 640 KB |
04.txt | AC | 2 ms | 384 KB |
05.txt | AC | 1 ms | 384 KB |
06.txt | AC | 7 ms | 896 KB |
07.txt | AC | 18 ms | 1280 KB |
08.txt | AC | 1 ms | 384 KB |
09.txt | AC | 18 ms | 1280 KB |
10.txt | AC | 1 ms | 128 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 384 KB |
13.txt | AC | 5 ms | 768 KB |
14.txt | AC | 9 ms | 896 KB |
15.txt | AC | 1 ms | 128 KB |
16.txt | AC | 6 ms | 1024 KB |
17.txt | AC | 1 ms | 256 KB |
18.txt | AC | 1 ms | 128 KB |
19.txt | AC | 1 ms | 128 KB |
20.txt | AC | 1 ms | 256 KB |
21.txt | AC | 1 ms | 256 KB |
22.txt | AC | 1 ms | 128 KB |
23.txt | AC | 1 ms | 384 KB |
24.txt | AC | 1 ms | 256 KB |
25.txt | AC | 1 ms | 512 KB |
26.txt | AC | 2 ms | 512 KB |
27.txt | AC | 1 ms | 256 KB |
28.txt | AC | 6 ms | 896 KB |
29.txt | AC | 1 ms | 384 KB |
30.txt | AC | 1 ms | 512 KB |
31.txt | AC | 1 ms | 128 KB |
32.txt | AC | 1 ms | 512 KB |
33.txt | AC | 1 ms | 128 KB |
34.txt | AC | 1 ms | 384 KB |
35.txt | AC | 3 ms | 768 KB |
36.txt | AC | 1 ms | 128 KB |
37.txt | AC | 5 ms | 896 KB |
38.txt | AC | 1 ms | 512 KB |
39.txt | AC | 1 ms | 384 KB |
40.txt | AC | 1 ms | 256 KB |
41.txt | AC | 2 ms | 640 KB |
42.txt | AC | 7 ms | 1024 KB |
43.txt | AC | 1 ms | 256 KB |
44.txt | AC | 7 ms | 1024 KB |
45.txt | AC | 1 ms | 128 KB |
46.txt | AC | 1 ms | 256 KB |
47.txt | AC | 1 ms | 256 KB |
48.txt | AC | 2 ms | 640 KB |
49.txt | AC | 4 ms | 768 KB |
50.txt | AC | 1 ms | 128 KB |
51.txt | AC | 1 ms | 384 KB |