Submission #1205026


Source Code Expand

#include <algorithm>  
#include <iostream>  
#include <sstream>  
#include <string>  
#include <cstring>
#include <vector>  
#include <queue>  
#include <set>  
#include <map>  
#include <cstdio>  
#include <cstdlib>  
#include <cctype>  
#include <cmath>  
#include <list>  
#include <cassert>
#include <ctime>
#include <climits>
using namespace std;  

#define PB push_back  
#define MP make_pair  
#define SZ(v) ((int)(v).size())  
#define FOR(i,a,b) for(int i=(a);i<(b);++i)  
#define REP(i,n) FOR(i,0,n)  
#define FORE(i,a,b) for(int i=(a);i<=(b);++i)  
#define REPE(i,n) FORE(i,0,n)  
#define FORSZ(i,a,v) FOR(i,a,SZ(v))  
#define REPSZ(i,v) REP(i,SZ(v))  
typedef long long ll;
typedef unsigned long long ull;
ll gcd(ll a,ll b) { return b==0?a:gcd(b,a%b); }

const int MAXNB=50;
const int MAXNA=2*MAXNB-1;
const int MOD=1000000007;

int na,nb;
int a[MAXNA];

int mem[MAXNB+1][MAXNA+1][MAXNA+1];

int go(int sufflen,int prefopt,int curidx) {
	int &ret=mem[sufflen][prefopt][curidx];
	if(ret==-1) {
		int oprefopt=prefopt,ocuridx=curidx;
		if(sufflen==nb) return ret=1;
		if(a[nb-sufflen-1]!=a[nb-sufflen]) ++prefopt,++curidx;
		if(a[nb+sufflen-1]!=a[nb+sufflen-2]) ++prefopt;
		ret=0;
		REP(i,prefopt) {
			int nprefopt=prefopt; if(i<curidx) nprefopt-=abs(curidx-1-i); if(i>curidx) nprefopt-=abs(i-curidx-1);
			ret=(ret+go(sufflen+1,nprefopt,i<=curidx?i:curidx+1))%MOD;
		}
		//REP(i,sufflen-1) printf(" "); printf("go(%d,%d,%d)=%d [%d,%d]\n",sufflen,oprefopt,ocuridx,ret,prefopt,curidx);
	}
	return ret;
}


void run() {
	scanf("%d",&nb); na=2*nb-1;
	REP(i,na) scanf("%d",&a[i]); sort(a,a+na);
	memset(mem,-1,sizeof(mem));
	int ret=go(1,1,0);
	printf("%d\n",ret);
}

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

Submission Info

Submission Time
Task F - Prefix Median
User krijgertje
Language C++14 (GCC 5.4.1)
Score 2000
Code Size 1780 Byte
Status AC
Exec Time 29 ms
Memory 2176 KB

Compile Error

./Main.cpp: In function ‘void run()’:
./Main.cpp:61:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&nb); na=2*nb-1;
                 ^
./Main.cpp:62:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  REP(i,na) scanf("%d",&a[i]); sort(a,a+na);
                             ^

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 2 ms 2176 KB
00_example_02.txt AC 2 ms 2176 KB
00_example_03.txt AC 2 ms 2176 KB
01.txt AC 28 ms 2176 KB
02.txt AC 21 ms 2176 KB
03.txt AC 5 ms 2176 KB
04.txt AC 3 ms 2176 KB
05.txt AC 3 ms 2176 KB
06.txt AC 11 ms 2176 KB
07.txt AC 29 ms 2176 KB
08.txt AC 3 ms 2176 KB
09.txt AC 28 ms 2176 KB
10.txt AC 2 ms 2176 KB
11.txt AC 2 ms 2176 KB
12.txt AC 2 ms 2176 KB
13.txt AC 8 ms 2176 KB
14.txt AC 14 ms 2176 KB
15.txt AC 2 ms 2176 KB
16.txt AC 9 ms 2176 KB
17.txt AC 2 ms 2176 KB
18.txt AC 2 ms 2176 KB
19.txt AC 2 ms 2176 KB
20.txt AC 2 ms 2176 KB
21.txt AC 2 ms 2176 KB
22.txt AC 2 ms 2176 KB
23.txt AC 3 ms 2176 KB
24.txt AC 2 ms 2176 KB
25.txt AC 3 ms 2176 KB
26.txt AC 3 ms 2176 KB
27.txt AC 2 ms 2176 KB
28.txt AC 9 ms 2176 KB
29.txt AC 2 ms 2176 KB
30.txt AC 3 ms 2176 KB
31.txt AC 2 ms 2176 KB
32.txt AC 3 ms 2176 KB
33.txt AC 2 ms 2176 KB
34.txt AC 3 ms 2176 KB
35.txt AC 5 ms 2176 KB
36.txt AC 2 ms 2176 KB
37.txt AC 8 ms 2176 KB
38.txt AC 3 ms 2176 KB
39.txt AC 3 ms 2176 KB
40.txt AC 2 ms 2176 KB
41.txt AC 4 ms 2176 KB
42.txt AC 11 ms 2176 KB
43.txt AC 2 ms 2176 KB
44.txt AC 11 ms 2176 KB
45.txt AC 2 ms 2176 KB
46.txt AC 2 ms 2176 KB
47.txt AC 2 ms 2176 KB
48.txt AC 4 ms 2176 KB
49.txt AC 6 ms 2176 KB
50.txt AC 2 ms 2176 KB
51.txt AC 2 ms 2176 KB