Submission #1779903


Source Code Expand

#include<cstdio>
#include<algorithm>
#define fo(i,a,b) for(i=a;i<=b;i++)
#define fd(i,a,b) for(i=a;i>=b;i--)
using namespace std;
typedef long long ll;
const int maxn=100+10,mo=1000000007;
int f[maxn][maxn][maxn],a[maxn];
int i,j,k,l,r,s,t,n,m,ans;
int main(){
	scanf("%d",&n);
	fo(i,1,2*n-1) scanf("%d",&a[i]);
	if (n==1){
		printf("1\n");
		return 0;
	}
	sort(a+1,a+2*n);
	t=1;
	if (a[n]!=a[n-1]) t++,l++;
	if (a[n]!=a[n+1]) t++;
	f[n-1][t][l]=1;
	fd(i,n-1,1)
		fo(j,0,2*n)
			fo(k,0,j-1)
				if (f[i][j][k]){
					t=r=0;
					if (i>1&&a[i-1]!=a[i]) t++,r++;
					if (i>1&&a[2*n-i+1]!=a[2*n-i]) t++;
					fo(l,1,k) (f[i-1][j-(k-l)+t][l-1+r]+=f[i][j][k])%=mo;
					(f[i-1][j+t][k+r]+=f[i][j][k])%=mo;
					fo(l,1,j-k-1) (f[i-1][j-(l-1)+t][k+r+1]+=f[i][j][k])%=mo;
				}
	fo(j,0,2*n)
		fo(k,0,2*n) (ans+=f[0][j][k])%=mo;
	(ans+=mo)%=mo;
	printf("%d\n",ans);
}

Submission Info

Submission Time
Task F - Prefix Median
User werkeytom
Language C++14 (GCC 5.4.1)
Score 2000
Code Size 895 Byte
Status AC
Exec Time 14 ms
Memory 3328 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:12:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  fo(i,1,2*n-1) scanf("%d",&a[i]);
                                 ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 2000 / 2000
Status
AC × 3
AC × 54
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 13 ms 3328 KB
02.txt AC 10 ms 3200 KB
03.txt AC 2 ms 640 KB
04.txt AC 1 ms 512 KB
05.txt AC 1 ms 384 KB
06.txt AC 5 ms 896 KB
07.txt AC 14 ms 3328 KB
08.txt AC 1 ms 384 KB
09.txt AC 14 ms 3328 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 4 ms 768 KB
14.txt AC 7 ms 1024 KB
15.txt AC 1 ms 128 KB
16.txt AC 5 ms 3072 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 5 ms 2944 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 2816 KB
36.txt AC 1 ms 128 KB
37.txt AC 5 ms 2944 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 6 ms 3072 KB
43.txt AC 1 ms 384 KB
44.txt AC 6 ms 3072 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 3 ms 768 KB
50.txt AC 1 ms 128 KB
51.txt AC 2 ms 2432 KB