Submission #1796642


Source Code Expand

#include <iostream>
#include <stdio.h>
#include <math.h>
#include <string.h>
#include <time.h>
#include <stdlib.h>
#include <string>
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <sstream>
#include <stack>
#include <iomanip>
using namespace std;
#define pb push_back
#define mp make_pair
typedef pair<int,int> pii;
typedef long long ll;
typedef double ld;
typedef vector<int> vi;
#define fi first
#define se second
#define fe first
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
#define Edg int M=0,fst[SZ],vb[SZ],nxt[SZ];void ad_de(int a,int b){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;}void adde(int a,int b){ad_de(a,b);ad_de(b,a);}
#define Edgc int M=0,fst[SZ],vb[SZ],nxt[SZ],vc[SZ];void ad_de(int a,int b,int c){++M;nxt[M]=fst[a];fst[a]=M;vb[M]=b;vc[M]=c;}void adde(int a,int b,int c){ad_de(a,b,c);ad_de(b,a,c);}
#define es(x,e) (int e=fst[x];e;e=nxt[e])
#define esb(x,e,b) (int e=fst[x],b=vb[e];e;e=nxt[e],b=vb[e])
int n,a[555],f[123][123][123];
const int MOD=1e9+7;
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n+n-1;++i)
		scanf("%d",a+i);
	sort(a+1,a+n+n);
	f[n][1][1]=1;
	for(int r=n;r>1;--r)
	{
		int dt=(a[r-1]!=a[r])+(a[n+n-r+1]!=a[n+n-r]);
		for(int i=1;i<=n+n;++i)
		{
			for(int j=1;j<=i;++j) if(f[r][i][j])
			{
				int ii=i+dt,jj=j+(a[r-1]!=a[r]),F=f[r][i][j];
				for(int p=1;p<=ii;++p)
				{
					if(abs(p-jj)<=1)
						(f[r-1][ii][p]+=F)%=MOD;
					else if(p<jj)
						(f[r-1][ii-(jj-p)+1][p]+=F)%=MOD;
					else
						(f[r-1][ii-(p-jj)+1][jj+1]+=F)%=MOD;
				}
			}
		}
	}
	ll ans=0;
	for(int i=1;i<=n+n;++i)
		for(int j=1;j<=i;++j)
			ans+=f[1][i][j];
	printf("%lld\n",ans%MOD);
}

Submission Info

Submission Time
Task F - Prefix Median
User fjzzq2002
Language C++14 (GCC 5.4.1)
Score 2000
Code Size 1757 Byte
Status AC
Exec Time 17 ms
Memory 3456 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:36:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:38:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   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 17 ms 3456 KB
02.txt AC 13 ms 3328 KB
03.txt AC 3 ms 768 KB
04.txt AC 2 ms 512 KB
05.txt AC 2 ms 512 KB
06.txt AC 7 ms 3072 KB
07.txt AC 17 ms 3456 KB
08.txt AC 2 ms 512 KB
09.txt AC 17 ms 3456 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 2944 KB
14.txt AC 9 ms 3200 KB
15.txt AC 1 ms 256 KB
16.txt AC 6 ms 3072 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 6 ms 3072 KB
29.txt AC 1 ms 512 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 4 ms 2944 KB
36.txt AC 1 ms 256 KB
37.txt AC 5 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 3 ms 2816 KB
42.txt AC 7 ms 3072 KB
43.txt AC 1 ms 384 KB
44.txt AC 8 ms 3200 KB
45.txt AC 1 ms 256 KB
46.txt AC 1 ms 384 KB
47.txt AC 1 ms 384 KB
48.txt AC 3 ms 2816 KB
49.txt AC 4 ms 2944 KB
50.txt AC 1 ms 256 KB
51.txt AC 2 ms 2432 KB