Submission #1768903


Source Code Expand

#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define dwn(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int maxn=110;
const int mod=1000000007;
int n,A[maxn],f[2][maxn][maxn];
int Add(int& x,int y) {x+=y;if(x>=mod) x-=mod;}
int main() {
	scanf("%d",&n);
	rep(i,1,2*n-1) scanf("%d",&A[i]);
	sort(A+1,A+2*n);
	f[0][1][1]=1;int cur=0;
	rep(i,1,n-1) {
		cur^=1;memset(f[cur],0,sizeof(f[cur]));
		int al=A[n-i]!=A[n-i+1],ar=A[n+i]!=A[n+i-1];
		rep(j,1,2*i-1) rep(k,1,j) {
			int& ans=f[cur^1][j][k];if(!ans) continue;
			Add(f[cur][j+al+ar][k+al],ans);
			rep(z,1,k+al-1) Add(f[cur][j+al+ar-(k+al-z-1)][z],ans);
			rep(z,k+al+1,j+al+ar) Add(f[cur][j+al+ar-(z-(k+al)-1)][k+al+1],ans);
		}
	}
	int ans=0;
	rep(j,1,2*n-1) rep(k,1,j) Add(ans,f[cur][j][k]);
	printf("%d\n",ans);
	return 0;
}

Submission Info

Submission Time
Task F - Prefix Median
User wzj52501
Language C++14 (GCC 5.4.1)
Score 2000
Code Size 890 Byte
Status AC
Exec Time 19 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:13:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:14:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  rep(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 256 KB
00_example_02.txt AC 1 ms 256 KB
00_example_03.txt AC 1 ms 256 KB
01.txt AC 19 ms 256 KB
02.txt AC 13 ms 256 KB
03.txt AC 3 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 6 ms 256 KB
07.txt AC 19 ms 256 KB
08.txt AC 1 ms 256 KB
09.txt AC 19 ms 256 KB
10.txt AC 1 ms 256 KB
11.txt AC 1 ms 256 KB
12.txt AC 1 ms 256 KB
13.txt AC 5 ms 256 KB
14.txt AC 9 ms 256 KB
15.txt AC 1 ms 256 KB
16.txt AC 6 ms 256 KB
17.txt AC 1 ms 256 KB
18.txt AC 1 ms 256 KB
19.txt AC 0 ms 128 KB
20.txt AC 1 ms 256 KB
21.txt AC 1 ms 256 KB
22.txt AC 1 ms 256 KB
23.txt AC 1 ms 256 KB
24.txt AC 1 ms 256 KB
25.txt AC 1 ms 256 KB
26.txt AC 1 ms 256 KB
27.txt AC 1 ms 256 KB
28.txt AC 6 ms 256 KB
29.txt AC 1 ms 256 KB
30.txt AC 1 ms 256 KB
31.txt AC 1 ms 256 KB
32.txt AC 1 ms 256 KB
33.txt AC 1 ms 256 KB
34.txt AC 1 ms 256 KB
35.txt AC 3 ms 256 KB
36.txt AC 0 ms 256 KB
37.txt AC 5 ms 256 KB
38.txt AC 1 ms 256 KB
39.txt AC 1 ms 256 KB
40.txt AC 1 ms 256 KB
41.txt AC 2 ms 256 KB
42.txt AC 7 ms 256 KB
43.txt AC 1 ms 256 KB
44.txt AC 7 ms 256 KB
45.txt AC 1 ms 256 KB
46.txt AC 1 ms 256 KB
47.txt AC 1 ms 256 KB
48.txt AC 2 ms 256 KB
49.txt AC 3 ms 256 KB
50.txt AC 1 ms 256 KB
51.txt AC 1 ms 256 KB