Submission #1686260
Source Code Expand
#include<iostream> #include<vector> #include<algorithm> #include<cstring> #include<cstdio> #include<cmath> #include<cstdlib> #include<ctime> #include<queue> #include<set> #include<map> #include<stack> #include<bitset> using namespace std; typedef long long LL; int gi() { int w=0;bool q=1;char c=getchar(); while ((c<'0'||c>'9') && c!='-') c=getchar(); if (c=='-') q=0,c=getchar(); while (c>='0'&&c <= '9') w=w*10+c-'0',c=getchar(); return q? w:-w; } const int N=110; int f[N][N][N],a[N]; #define mod 1000000007 inline void inc(int &x,int y) { (x+=y)>=mod?x-=mod:0; } int main() { int n=gi(),i,j,k,t,x,y; for (i=1;i<n*2;i++) a[i]=gi(); sort(a+1,a+n*2); f[n][1][1]=1; for (i=n;i;i--) { x=a[i]!=a[i-1]; y=a[n*2-i+1]!=a[n*2-i]; for (j=1;j<2*n;j++) for (k=1;k<=j;k++) if (f[i][j][k]) { for (t=1;t<k+x;t++) inc(f[i-1][j+x+y-(k+x-t-1)][t],f[i][j][k]); for (t=k+x+1;t<=j+x+y;t++) inc(f[i-1][j+x+y-(t-(k+x)-1)][k+x+1],f[i][j][k]); inc(f[i-1][j+x+y][k+x],f[i][j][k]); } } x=0; for (j=1;j<n*2;j++) for (k=1;k<=j;k++) inc(x,f[1][j][k]); printf("%d\n",x); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Prefix Median |
User | laofu |
Language | C++14 (GCC 5.4.1) |
Score | 2000 |
Code Size | 1172 Byte |
Status | AC |
Exec Time | 22 ms |
Memory | 3456 KB |
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 | 256 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
00_example_03.txt | AC | 1 ms | 384 KB |
01.txt | AC | 22 ms | 3456 KB |
02.txt | AC | 17 ms | 3328 KB |
03.txt | AC | 4 ms | 768 KB |
04.txt | AC | 2 ms | 512 KB |
05.txt | AC | 2 ms | 512 KB |
06.txt | AC | 8 ms | 1024 KB |
07.txt | AC | 22 ms | 3456 KB |
08.txt | AC | 2 ms | 512 KB |
09.txt | AC | 22 ms | 3456 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 384 KB |
12.txt | AC | 2 ms | 384 KB |
13.txt | AC | 7 ms | 896 KB |
14.txt | AC | 11 ms | 1152 KB |
15.txt | AC | 1 ms | 256 KB |
16.txt | AC | 8 ms | 3072 KB |
17.txt | AC | 1 ms | 256 KB |
18.txt | AC | 1 ms | 256 KB |
19.txt | AC | 1 ms | 256 KB |
20.txt | AC | 1 ms | 384 KB |
21.txt | AC | 1 ms | 384 KB |
22.txt | AC | 1 ms | 256 KB |
23.txt | AC | 2 ms | 512 KB |
24.txt | AC | 1 ms | 384 KB |
25.txt | AC | 2 ms | 512 KB |
26.txt | AC | 3 ms | 640 KB |
27.txt | AC | 1 ms | 384 KB |
28.txt | AC | 8 ms | 3072 KB |
29.txt | AC | 2 ms | 384 KB |
30.txt | AC | 2 ms | 640 KB |
31.txt | AC | 1 ms | 256 KB |
32.txt | AC | 2 ms | 640 KB |
33.txt | AC | 1 ms | 256 KB |
34.txt | AC | 2 ms | 512 KB |
35.txt | AC | 5 ms | 2944 KB |
36.txt | AC | 1 ms | 256 KB |
37.txt | AC | 7 ms | 3072 KB |
38.txt | AC | 2 ms | 640 KB |
39.txt | AC | 2 ms | 512 KB |
40.txt | AC | 1 ms | 384 KB |
41.txt | AC | 4 ms | 768 KB |
42.txt | AC | 9 ms | 3200 KB |
43.txt | AC | 1 ms | 384 KB |
44.txt | AC | 9 ms | 3200 KB |
45.txt | AC | 1 ms | 256 KB |
46.txt | AC | 1 ms | 256 KB |
47.txt | AC | 1 ms | 384 KB |
48.txt | AC | 3 ms | 768 KB |
49.txt | AC | 5 ms | 896 KB |
50.txt | AC | 1 ms | 256 KB |
51.txt | AC | 2 ms | 2432 KB |