Submission #1204564


Source Code Expand

#include<cstdio>
#include<algorithm>
using namespace std;

int dp[50][100][100];
bool Lflag[50], Rflag[50];
int arr[100];

const int MOD = 1e9+7;
void add(int& target, int delta){
    target = (target + delta)%MOD;
}

int main(){
    int N; scanf("%d",&N);
    for(int i=0;i<2*N-1;i++) scanf("%d",arr+i);
    sort(arr,arr+2*N-1);

    for(int i=1;i<N;i++) if(arr[N-1-(i-1)] != arr[N-1-i])
        Lflag[i] = true;
    for(int i=1;i<N;i++) if(arr[N-1+(i-1)] != arr[N-1+i])
        Rflag[i] = true;

    dp[0][0][0] = 1;
    for(int i=0;i<N-1;i++) for(int L=0;L<=2*i+1;L++) for(int R=0;R<=2*i+1;R++){
        int nL = L + (Lflag[i+1]?1:0), nR = R + (Rflag[i+1]?1:0);
        int cur = dp[i][L][R];
        add(dp[i+1][nL][nR], cur);
        for(int j=1;j<=nL;j++)
            add(dp[i+1][nL-j][nR+1], cur);
        for(int j=1;j<=nR;j++)
            add(dp[i+1][nL+1][nR-j], cur);
    }

    int ans = 0;
    for(int i=0;i<2*N-1;i++)for(int j=0;j<2*N-1;j++)
        add(ans, dp[N-1][i][j]);
    printf("%d\n", ans);
}

Submission Info

Submission Time
Task F - Prefix Median
User pps789
Language C++14 (GCC 5.4.1)
Score 2000
Code Size 1055 Byte
Status AC
Exec Time 30 ms
Memory 1280 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:15:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     int N; scanf("%d",&N);
                          ^
./Main.cpp:16:47: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for(int i=0;i<2*N-1;i++) scanf("%d",arr+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 128 KB
00_example_02.txt AC 1 ms 128 KB
00_example_03.txt AC 1 ms 256 KB
01.txt AC 30 ms 1280 KB
02.txt AC 21 ms 1152 KB
03.txt AC 4 ms 640 KB
04.txt AC 2 ms 512 KB
05.txt AC 1 ms 384 KB
06.txt AC 11 ms 896 KB
07.txt AC 29 ms 1280 KB
08.txt AC 1 ms 384 KB
09.txt AC 29 ms 1280 KB
10.txt AC 1 ms 256 KB
11.txt AC 1 ms 256 KB
12.txt AC 1 ms 384 KB
13.txt AC 8 ms 768 KB
14.txt AC 14 ms 1024 KB
15.txt AC 1 ms 256 KB
16.txt AC 29 ms 1280 KB
17.txt AC 1 ms 256 KB
18.txt AC 1 ms 128 KB
19.txt AC 1 ms 128 KB
20.txt AC 1 ms 256 KB
21.txt AC 1 ms 256 KB
22.txt AC 1 ms 256 KB
23.txt AC 4 ms 512 KB
24.txt AC 1 ms 384 KB
25.txt AC 3 ms 512 KB
26.txt AC 4 ms 640 KB
27.txt AC 1 ms 384 KB
28.txt AC 25 ms 1280 KB
29.txt AC 2 ms 384 KB
30.txt AC 4 ms 640 KB
31.txt AC 1 ms 128 KB
32.txt AC 4 ms 640 KB
33.txt AC 1 ms 128 KB
34.txt AC 3 ms 512 KB
35.txt AC 21 ms 1152 KB
36.txt AC 1 ms 128 KB
37.txt AC 21 ms 1152 KB
38.txt AC 4 ms 640 KB
39.txt AC 2 ms 512 KB
40.txt AC 1 ms 384 KB
41.txt AC 10 ms 896 KB
42.txt AC 29 ms 1280 KB
43.txt AC 1 ms 384 KB
44.txt AC 29 ms 1280 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 8 ms 768 KB
49.txt AC 14 ms 1024 KB
50.txt AC 1 ms 256 KB
51.txt AC 29 ms 1280 KB