Submission #1812462
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define re(i,a,b) for(int i=(a);i<(b);i++)
#define repd(i,a,b) for(int i=(a);i>=(b);i--)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define Rep(i,a,b) for(int i=(a);i<(b);i++)
#define fi first
#define se second
#define clr(a) memset(a,0,sizeof(a));
#define il inline
#define sz(a) ((int)o.size())
#define run(x) for(int k=head[x];k;k=e[k].ne)
#define v e[k].t
#define all(a) o.begin(),o.end()
#define pb push_back
#define w1 first
#define w2 second
#define adm(a,b,c) {a=a+b;if(a>=c)a-=c;else if(a<0)a+=c;}
typedef double db;
typedef long long ll;typedef long double ld;typedef unsigned long long ull;
typedef pair<int,int> pa;
const int N=100+5,INF=1e9,mod=1e9+7;
const ll linf=1e18;const double eps=1e-8,pi=acos(-1);
il int gmin(int &a,int b){if(a>b)a=b;}il ll gmin(ll &a,ll b){if(a>b)a=b;}il int gmax(int &a,int b){if(a<b)a=b;}il ll gmax(ll &a,ll b){if(a<b)a=b;}
il void read(ll&x){ll f=1,t=0;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){t=t*10+ch-'0';ch=getchar();}x=t*f;}il ll read(ll&x,ll&y){read(x);read(y);}
il void read(int&x){int f=1,t=0;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){t=t*10+ch-'0';ch=getchar();}x=t*f;}il int read(int&x,int&y){read(x);read(y);}
il void read(int&a,int&b,int&c){read(a);read(b);read(c);}il void read(ll&a,ll&b,ll&c){read(a);read(b);read(c);}
il int read(){int x;read(x);return x;}
il void judge(){
freopen("dato.in","r",stdin);
freopen("dato.out","w",stdout);
}
int n,a[N],f[N][N][N];
void ad(int&x,int y){x+=y;x%=mod;}
int main(){
read(n);rep(i,1,n+n-1)read(a[i]);
sort(a+1,a+1+2*n-1);
f[n][1][1]=1;
repd(i,n,2)
rep(j,1,2*(n-i)+1)rep(k,1,2*(n-i)+1)if(f[i][j][k]){
int nj=j+(a[i]!=a[i-1])+(a[2*n-i]!=a[2*n-i+1]),nk=k+(a[i]!=a[i-1]);
ad(f[i-1][nj][nk],f[i][j][k]);
rep(o,1,nk-1)
ad(f[i-1][nj-(nk-o-1)][o],f[i][j][k]);
rep(o,nk+1,nj)
ad(f[i-1][nj-(o-nk-1)][nk+1],f[i][j][k]);
}int res=0;
rep(i,1,2*n-1)rep(j,1,2*n-1)ad(res,f[1][i][j]);
cout<<res<<endl;
}
Submission Info
Submission Time |
|
Task |
F - Prefix Median |
User |
xjt |
Language |
C++14 (GCC 5.4.1) |
Score |
2000 |
Code Size |
2158 Byte |
Status |
AC |
Exec Time |
15 ms |
Memory |
3456 KB |
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 |
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 |
15 ms |
3456 KB |
02.txt |
AC |
10 ms |
1280 KB |
03.txt |
AC |
3 ms |
640 KB |
04.txt |
AC |
2 ms |
512 KB |
05.txt |
AC |
2 ms |
384 KB |
06.txt |
AC |
6 ms |
896 KB |
07.txt |
AC |
14 ms |
3456 KB |
08.txt |
AC |
2 ms |
512 KB |
09.txt |
AC |
14 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 |
5 ms |
896 KB |
14.txt |
AC |
7 ms |
1024 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 |
5 ms |
3072 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 |
3 ms |
896 KB |
36.txt |
AC |
1 ms |
256 KB |
37.txt |
AC |
4 ms |
1024 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 |
6 ms |
3200 KB |
43.txt |
AC |
1 ms |
384 KB |
44.txt |
AC |
7 ms |
3200 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 |
4 ms |
896 KB |
50.txt |
AC |
1 ms |
256 KB |
51.txt |
AC |
2 ms |
2432 KB |