Submission #1724197
Source Code Expand
#include <stdio.h> #include <iostream> #include <algorithm> #include <memory.h> #include <queue> using namespace std; typedef long long LL; const int maxn = 55; const int mod = 1e9+7; void upd(int &x,int y) { x+=y;x>=mod?x-=mod:0; } int dp[maxn][maxn<<1][maxn<<1],a[maxn<<1],n; int main() { #ifdef Amberframe freopen("agc012f.in","r",stdin); freopen("agc012f.out","w",stdout); #endif scanf("%d",&n); for (int i=1;i<(n<<1);i++) scanf("%d",&a[i]); sort(a+1,a+(n<<1)); dp[1][0][0]=1; for (int i=2;i<=n;i++) { int sum=a[n+i-2]-a[n-i+2]; for (int j=0;j<=sum;j++) for (int k=0;k+j<=sum;k++) if (int w=dp[i-1][j][k]) { int L=j+(a[n-i+1]!=a[n-i+2]),R=k+(a[n+i-1]!=a[n+i-2]); for (int u=1;u<=L;u++) upd(dp[i][L-u][R+1],w); for (int v=1;v<=R;v++) upd(dp[i][L+1][R-v],w); upd(dp[i][L][R],w); } } int ans=0; int sum=a[(n<<1)-1]-a[1]; for (int j=0;j<=sum;j++) for (int k=0;k+j<=sum;k++) upd(ans,dp[n][j][k]); printf("%d",ans); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Prefix Median |
User | Amberframe |
Language | C++14 (GCC 5.4.1) |
Score | 2000 |
Code Size | 1018 Byte |
Status | AC |
Exec Time | 19 ms |
Memory | 1536 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:22:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:24:20: 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 |
|
|
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 | 19 ms | 1536 KB |
02.txt | AC | 14 ms | 1280 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 | 1024 KB |
07.txt | AC | 19 ms | 1536 KB |
08.txt | AC | 2 ms | 512 KB |
09.txt | AC | 19 ms | 1536 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 384 KB |
12.txt | AC | 2 ms | 384 KB |
13.txt | AC | 6 ms | 896 KB |
14.txt | AC | 9 ms | 1152 KB |
15.txt | AC | 1 ms | 256 KB |
16.txt | AC | 7 ms | 1152 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 | 7 ms | 1024 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 | 4 ms | 896 KB |
36.txt | AC | 1 ms | 256 KB |
37.txt | AC | 6 ms | 1024 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 | 768 KB |
42.txt | AC | 8 ms | 1152 KB |
43.txt | AC | 1 ms | 384 KB |
44.txt | AC | 8 ms | 1152 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 | 1 ms | 384 KB |