Submission #958795


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second

bool check(vector<int> &x)
{
    int m=x.size();

    bool alternate=true;
    rep(i,m-1) if(x[i]==x[i+1]) alternate=false;

    if(alternate) return x[0]==1;

    for(int i=m/2; i<m-1; ++i)
    {
        if(x[i]==x[i+1]) return x[i]==1;
        int j=m/2-(i-m/2);
        if(x[j]==x[j-1]) return x[j]==1;
    }

    return false;
}

int main()
{
    int n;
    scanf(" %d", &n);
    int m=2*n-1;
    vector<int> a(m);
    rep(i,m) scanf(" %d", &a[i]);

    int l=1, r=m+1;
    while(r-l>1)
    {
        int mid=(l+r)/2;
        vector<int> t(m,0);
        rep(i,m) if(a[i]>=mid) t[i]=1;
        if(check(t)) l=mid;
        else r=mid;
    }
    printf("%d\n", l);
    return 0;
}

Submission Info

Submission Time
Task D - Median Pyramid Hard
User imulan
Language C++14 (GCC 5.4.1)
Score 1300
Code Size 1026 Byte
Status AC
Exec Time 44 ms
Memory 1920 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:34:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf(" %d", &n);
                     ^
./Main.cpp:37:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     rep(i,m) scanf(" %d", &a[i]);
                                 ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1300 / 1300
Status
AC × 2
AC × 57
Set Name Test Cases
Sample 0_00.txt, 0_01.txt
All 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt
Case Name Status Exec Time Memory
0_00.txt AC 3 ms 256 KB
0_01.txt AC 3 ms 256 KB
1_00.txt AC 2 ms 256 KB
1_01.txt AC 3 ms 256 KB
1_02.txt AC 3 ms 256 KB
1_03.txt AC 31 ms 1792 KB
1_04.txt AC 30 ms 1792 KB
1_05.txt AC 32 ms 1792 KB
1_06.txt AC 31 ms 1792 KB
1_07.txt AC 32 ms 1792 KB
1_08.txt AC 32 ms 1792 KB
1_09.txt AC 30 ms 1792 KB
1_10.txt AC 30 ms 1792 KB
1_11.txt AC 31 ms 1792 KB
1_12.txt AC 31 ms 1792 KB
1_13.txt AC 33 ms 1792 KB
1_14.txt AC 31 ms 1792 KB
1_15.txt AC 34 ms 1792 KB
1_16.txt AC 39 ms 1792 KB
1_17.txt AC 39 ms 1792 KB
1_18.txt AC 39 ms 1792 KB
1_19.txt AC 31 ms 1792 KB
1_20.txt AC 30 ms 1792 KB
1_21.txt AC 31 ms 1792 KB
1_22.txt AC 31 ms 1792 KB
1_23.txt AC 33 ms 1792 KB
1_24.txt AC 33 ms 1792 KB
1_25.txt AC 37 ms 1792 KB
1_26.txt AC 32 ms 1800 KB
1_27.txt AC 39 ms 1792 KB
1_28.txt AC 33 ms 1792 KB
1_29.txt AC 31 ms 1792 KB
1_30.txt AC 32 ms 1792 KB
1_31.txt AC 32 ms 1796 KB
1_32.txt AC 36 ms 1792 KB
1_33.txt AC 31 ms 1792 KB
1_34.txt AC 32 ms 1796 KB
1_35.txt AC 34 ms 1792 KB
1_36.txt AC 34 ms 1792 KB
1_37.txt AC 37 ms 1792 KB
1_38.txt AC 33 ms 1792 KB
1_39.txt AC 37 ms 1792 KB
1_40.txt AC 36 ms 1792 KB
1_41.txt AC 32 ms 1792 KB
1_42.txt AC 36 ms 1792 KB
1_43.txt AC 34 ms 1920 KB
1_44.txt AC 37 ms 1792 KB
1_45.txt AC 31 ms 1792 KB
1_46.txt AC 35 ms 1792 KB
1_47.txt AC 37 ms 1792 KB
1_48.txt AC 44 ms 1792 KB
1_49.txt AC 34 ms 1792 KB
1_50.txt AC 43 ms 1792 KB
1_51.txt AC 38 ms 1804 KB
1_52.txt AC 40 ms 1792 KB
1_53.txt AC 41 ms 1792 KB
1_54.txt AC 43 ms 1792 KB