Submission #1678368


Source Code Expand

#include <cstdio>
#include <cstring>
#include <algorithm>
#define MAXN 110
#define LL long long
using namespace std;

const LL P=1000000007;

int n,n2;
int a[MAXN],d1[MAXN],d2[MAXN];
LL f[MAXN][MAXN][MAXN];

inline void update(LL &x,LL y){ x=(x+y)%P; }

int main(){
#ifdef DEBUG
	freopen("F.in","r",stdin);
#endif
	scanf("%d",&n);
	n2=n*2-1;
	for(int i=1;i<=n2;i++) scanf("%d",a+i);
	sort(a+1,a+n2+1);
	for(int i=2;i<=n2;i++)
		if(a[i]!=a[i-1]){
			if(i<=n) d1[n-i+2]++;
			if(i>n) d2[i-n+1]++;
		}
	f[1][1+d1[2]+d2[2]][1+d1[2]]=1;
	for(int i=2;i<=n;i++){
		for(int j=1;j<=n2;j++)
			for(int k=1;k<=j;k++){
				if(!f[i-1][j][k]) continue;
				for(int l=1;l<=j;l++){
					int delta=max(abs(l-k)-1,0);
					int k2=l+d1[i+1]-(l>k?delta:0);
					update(f[i][j+d1[i+1]+d2[i+1]-delta][k2],f[i-1][j][k]);
				}
			}
	}
	LL ans=0;
	for(int i=1;i<=n2;i++)
		for(int j=1;j<=i;j++)
			update(ans,f[n][i][j]);
	printf("%lld\n",ans);
	return 0;
}

Submission Info

Submission Time
Task F - Prefix Median
User ez_zjt
Language C++14 (GCC 5.4.1)
Score 2000
Code Size 983 Byte
Status AC
Exec Time 22 ms
Memory 4736 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:20:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:22:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n2;i++) 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 384 KB
01.txt AC 22 ms 4736 KB
02.txt AC 16 ms 4608 KB
03.txt AC 4 ms 2560 KB
04.txt AC 2 ms 2688 KB
05.txt AC 1 ms 512 KB
06.txt AC 8 ms 2560 KB
07.txt AC 21 ms 4608 KB
08.txt AC 1 ms 512 KB
09.txt AC 21 ms 4608 KB
10.txt AC 1 ms 256 KB
11.txt AC 1 ms 256 KB
12.txt AC 1 ms 384 KB
13.txt AC 6 ms 2688 KB
14.txt AC 10 ms 2688 KB
15.txt AC 1 ms 256 KB
16.txt AC 7 ms 4608 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 2 ms 2560 KB
24.txt AC 1 ms 384 KB
25.txt AC 2 ms 2560 KB
26.txt AC 2 ms 2560 KB
27.txt AC 1 ms 384 KB
28.txt AC 7 ms 4608 KB
29.txt AC 2 ms 2432 KB
30.txt AC 2 ms 2560 KB
31.txt AC 1 ms 256 KB
32.txt AC 2 ms 2560 KB
33.txt AC 1 ms 128 KB
34.txt AC 2 ms 2560 KB
35.txt AC 4 ms 4480 KB
36.txt AC 1 ms 128 KB
37.txt AC 6 ms 4608 KB
38.txt AC 2 ms 2560 KB
39.txt AC 2 ms 2560 KB
40.txt AC 1 ms 384 KB
41.txt AC 3 ms 2560 KB
42.txt AC 8 ms 4608 KB
43.txt AC 1 ms 384 KB
44.txt AC 9 ms 4608 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 2560 KB
49.txt AC 4 ms 2560 KB
50.txt AC 1 ms 256 KB
51.txt AC 2 ms 4352 KB