Submission #1778068


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

const int mo=int(1e9+7);
int n,a[100],f[55][105][105],ans;

void upd(int &x,int y){if ((x+=y)>=mo)  x-=mo;}

void work()
{
	scanf("%d",&n);
	for (int i=1; i<2*n; i++)  scanf("%d",&a[i]);
	sort(a+1,a+2*n);
	f[n][1][1]=1;
	for (int i=n; i>1; i--)
		for (int j=1; j<=2*(n-i)+1; j++)
			for (int k=1; k<=2*(n-i)+1; k++)
				if (f[i][j][k])
					{
						int nj=j+(a[i]!=a[i-1])+(a[2*n-i]!=a[2*n-i+1]);
						int nk=k+(a[i]!=a[i-1]);
						for (int l=1; l<nk; l++)  upd(f[i-1][nj-(nk-l-1)][l],f[i][j][k]);
						upd(f[i-1][nj][nk],f[i][j][k]);
						for (int l=nj; l>nk; l--)  upd(f[i-1][nj-(l-nk-1)][nk+1],f[i][j][k]);
					}
	for (int i=1; i<2*n; i++)
		for (int j=1; j<2*n; j++)
			upd(ans,f[1][i][j]);
	printf("%d",ans);
}

int main()
{
	work();
	return 0;
}

Submission Info

Submission Time
Task F - Prefix Median
User YMDragon
Language C++14 (GCC 5.4.1)
Score 2000
Code Size 840 Byte
Status AC
Exec Time 21 ms
Memory 1408 KB

Compile Error

./Main.cpp: In function ‘void work()’:
./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:46: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int i=1; i<2*n; 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 256 KB
00_example_02.txt AC 1 ms 256 KB
00_example_03.txt AC 1 ms 384 KB
01.txt AC 21 ms 1408 KB
02.txt AC 15 ms 1280 KB
03.txt AC 3 ms 640 KB
04.txt AC 2 ms 512 KB
05.txt AC 1 ms 512 KB
06.txt AC 8 ms 896 KB
07.txt AC 21 ms 1408 KB
08.txt AC 2 ms 512 KB
09.txt AC 21 ms 1408 KB
10.txt AC 1 ms 256 KB
11.txt AC 1 ms 384 KB
12.txt AC 1 ms 384 KB
13.txt AC 6 ms 896 KB
14.txt AC 10 ms 1024 KB
15.txt AC 1 ms 256 KB
16.txt AC 7 ms 1024 KB
17.txt AC 1 ms 384 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 2 ms 640 KB
27.txt AC 1 ms 384 KB
28.txt AC 7 ms 1024 KB
29.txt AC 1 ms 384 KB
30.txt AC 2 ms 640 KB
31.txt AC 1 ms 256 KB
32.txt AC 2 ms 512 KB
33.txt AC 1 ms 256 KB
34.txt AC 2 ms 512 KB
35.txt AC 4 ms 896 KB
36.txt AC 1 ms 256 KB
37.txt AC 6 ms 896 KB
38.txt AC 2 ms 512 KB
39.txt AC 2 ms 512 KB
40.txt AC 1 ms 384 KB
41.txt AC 3 ms 768 KB
42.txt AC 8 ms 1152 KB
43.txt AC 1 ms 384 KB
44.txt AC 9 ms 1152 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 1 ms 512 KB