Submission #1751041


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
int n;
const int N = 200000;
int ai[N];
int check(int t)
{
    if (ai[n] >= t && (ai[n + 1] >= t || ai[n - 1] >= t)) return 1;
    if (ai[n] < t && (ai[n + 1] < t || ai[n - 1] < t)) return 0;
    int ok = 1;
    for (int i = 1; i < n * 2; i += 2) if (ai[i] < t) ok = 0;
    if (ok) return 1;
    ok = 1;
    int l = n, r = n;
    while ((ai[l] >= t) ^ (ai[l - 1] >= t)) l --;
    while ((ai[r] >= t) ^ (ai[r + 1] >= t)) r ++;
    int L = 0, R = 0;
    if (ai[l] >= t && ai[l - 1] >= t) L = 1;
    if (ai[r] >= t && ai[r + 1] >= t) R = 1;
    if (L && R) return 1;
    if (!L && !R) return 0;
    if (R) if ((l + (r - 1)) / 2 >= n) return 1;
    if (L) if (((l + 1) + r) / 2 <= n) return 1;
    return 0;
}
int main()
{
    scanf("%d", &n);
    for (int i = 1; i < n * 2; ++ i) scanf("%d", &ai[i]);
    int l = 1, r = n * 2 - 1;
    while (l < r)
    {
        int m = (l + r + 1) / 2;
        if (check(m)) l = m; else r = m - 1;
    }
    printf("%d\n", r);
}

Submission Info

Submission Time
Task D - Median Pyramid Hard
User AwD
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1044 Byte
Status WA
Exec Time 25 ms
Memory 1024 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:28:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
./Main.cpp:29:57: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     for (int i = 1; i < n * 2; ++ i) scanf("%d", &ai[i]);
                                                         ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1300
Status
AC × 2
AC × 22
WA × 35
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 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 1 ms 256 KB
1_02.txt AC 1 ms 256 KB
1_03.txt AC 20 ms 1024 KB
1_04.txt AC 20 ms 1024 KB
1_05.txt WA 23 ms 1024 KB
1_06.txt AC 24 ms 1024 KB
1_07.txt WA 23 ms 1024 KB
1_08.txt AC 24 ms 1024 KB
1_09.txt AC 20 ms 1024 KB
1_10.txt AC 20 ms 1024 KB
1_11.txt WA 23 ms 1024 KB
1_12.txt AC 24 ms 1024 KB
1_13.txt WA 23 ms 1024 KB
1_14.txt AC 24 ms 1024 KB
1_15.txt AC 21 ms 1024 KB
1_16.txt WA 21 ms 1024 KB
1_17.txt AC 21 ms 1024 KB
1_18.txt WA 22 ms 1024 KB
1_19.txt WA 21 ms 1024 KB
1_20.txt AC 21 ms 1024 KB
1_21.txt WA 22 ms 1024 KB
1_22.txt WA 21 ms 1024 KB
1_23.txt WA 24 ms 1024 KB
1_24.txt WA 24 ms 1024 KB
1_25.txt WA 23 ms 1024 KB
1_26.txt WA 23 ms 1024 KB
1_27.txt WA 22 ms 1024 KB
1_28.txt WA 24 ms 1024 KB
1_29.txt WA 23 ms 1024 KB
1_30.txt WA 22 ms 1024 KB
1_31.txt WA 23 ms 1024 KB
1_32.txt WA 23 ms 1024 KB
1_33.txt WA 22 ms 1024 KB
1_34.txt WA 23 ms 1024 KB
1_35.txt WA 23 ms 1024 KB
1_36.txt WA 22 ms 1024 KB
1_37.txt WA 23 ms 1024 KB
1_38.txt WA 23 ms 1024 KB
1_39.txt WA 25 ms 1024 KB
1_40.txt WA 22 ms 1024 KB
1_41.txt WA 24 ms 1024 KB
1_42.txt WA 23 ms 1024 KB
1_43.txt WA 24 ms 1024 KB
1_44.txt WA 23 ms 1024 KB
1_45.txt WA 22 ms 1024 KB
1_46.txt WA 23 ms 1024 KB
1_47.txt AC 21 ms 1024 KB
1_48.txt WA 21 ms 1024 KB
1_49.txt AC 21 ms 1024 KB
1_50.txt AC 22 ms 1024 KB
1_51.txt AC 20 ms 1024 KB
1_52.txt AC 21 ms 1024 KB
1_53.txt WA 22 ms 1024 KB
1_54.txt AC 21 ms 1024 KB