Submission #1205146
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 preflen,int suffoptused,int curidx) {
int &ret=mem[preflen][suffoptused][curidx];
if(ret==-1) {
if(preflen==nb) return ret=1;
ret=0;
int nsuffopt=a[na-preflen]-a[preflen-1]+1;
bool rembotopt=a[preflen-1]!=a[preflen];
bool remtopopt=a[na-preflen]!=a[na-preflen-1];
REPE(usedrembot,rembotopt?1:0) REPE(usedremtop,remtopopt?1:0) FORE(delta,-2,+2) {
int nsuffoptused=suffoptused-usedrembot-usedremtop+(abs(delta)==1?1:0),nxtidx=curidx-usedrembot-(delta==-2?1:0)+(delta>=+1?1:0);
if(nxtidx<0||nxtidx>=nsuffoptused||nsuffoptused+(rembotopt?1:0)+(remtopopt?1:0)>nsuffopt) continue;
ret=(ret+go(preflen+1,nsuffoptused,nxtidx))%MOD;
//printf("\t(%d,%d,%d)->(%d,%d,%d) [%d,%d,%d]\n",preflen,suffoptused,curidx,preflen+1,nsuffoptused,nxtidx,usedrembot,usedremtop,delta);
}
//printf("%d %d %d = %d [%d,%d,%d]\n",preflen,suffoptused,curidx,ret,nsuffopt,rembotopt?1:0,remtopopt?1:0);
}
return ret;
}
void run() {
scanf("%d",&nb); na=2*nb-1;
REP(i,na) scanf("%d",&a[i]); sort(a,a+na); for(int at=0,to=at;at<na;at=to) { while(to<na&&a[to]==a[at]) ++to; FOR(i,at,to) a[i]=at==0?0:a[at-1]+1; }
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 |
2204 Byte |
Status |
AC |
Exec Time |
4 ms |
Memory |
2304 KB |
Compile Error
./Main.cpp: In function ‘void run()’:
./Main.cpp:62: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:63: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); for(int at=0,to=at;at<na;at=to) { while(to<na&&a[to]==a[at]) ++to; FOR(i,at,to) a[i]=at==0?0:a[at-1]+1; }
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
2000 / 2000 |
Status |
|
|
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 |
4 ms |
2176 KB |
02.txt |
AC |
3 ms |
2304 KB |
03.txt |
AC |
2 ms |
2176 KB |
04.txt |
AC |
2 ms |
2176 KB |
05.txt |
AC |
2 ms |
2176 KB |
06.txt |
AC |
3 ms |
2176 KB |
07.txt |
AC |
4 ms |
2176 KB |
08.txt |
AC |
2 ms |
2176 KB |
09.txt |
AC |
4 ms |
2304 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 |
3 ms |
2176 KB |
14.txt |
AC |
3 ms |
2304 KB |
15.txt |
AC |
2 ms |
2176 KB |
16.txt |
AC |
3 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 |
2 ms |
2176 KB |
24.txt |
AC |
2 ms |
2176 KB |
25.txt |
AC |
2 ms |
2176 KB |
26.txt |
AC |
2 ms |
2176 KB |
27.txt |
AC |
2 ms |
2176 KB |
28.txt |
AC |
3 ms |
2176 KB |
29.txt |
AC |
2 ms |
2176 KB |
30.txt |
AC |
2 ms |
2176 KB |
31.txt |
AC |
2 ms |
2176 KB |
32.txt |
AC |
2 ms |
2176 KB |
33.txt |
AC |
2 ms |
2176 KB |
34.txt |
AC |
2 ms |
2176 KB |
35.txt |
AC |
2 ms |
2176 KB |
36.txt |
AC |
2 ms |
2176 KB |
37.txt |
AC |
3 ms |
2304 KB |
38.txt |
AC |
2 ms |
2176 KB |
39.txt |
AC |
2 ms |
2176 KB |
40.txt |
AC |
2 ms |
2176 KB |
41.txt |
AC |
2 ms |
2176 KB |
42.txt |
AC |
3 ms |
2304 KB |
43.txt |
AC |
2 ms |
2176 KB |
44.txt |
AC |
3 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 |
2 ms |
2176 KB |
49.txt |
AC |
3 ms |
2304 KB |
50.txt |
AC |
2 ms |
2176 KB |
51.txt |
AC |
2 ms |
2176 KB |