Submission #2124084


Source Code Expand

n = int(input())
A = list(map(int, input().split()))
l = 1
r = 2*n
while l < r-1:
    mid = (l+r)//2
    B = []
    C = []
    for i in range(0,2*n-1):
        B.append(A[i] >= mid)
        C.append(0)
    for i in range(1,2*n-1):
        if B[i-1] == B[i]:
            C[i] = 1
    for i in range(0,2*n-2):
        if B[i+1] == B[i]:
            C[i] = 1
    mi = 2*n
    ans = False
    for i in range(0,2*n-1):
        if C[i] == 1:
            if abs(i-n+1) < mi:
                mi = abs(i-n+1)
                ans = B[i]
    if ans == True:
        l = mid
    else:
        r = mid
print(l)
        

Submission Info

Submission Time
Task D - Median Pyramid Hard
User nigus
Language PyPy3 (2.4.0)
Score 0
Code Size 637 Byte
Status WA
Exec Time 670 ms
Memory 126908 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1300
Status
AC × 2
AC × 51
WA × 6
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 168 ms 38384 KB
0_01.txt AC 170 ms 38256 KB
1_00.txt AC 165 ms 38256 KB
1_01.txt AC 165 ms 38256 KB
1_02.txt WA 163 ms 38256 KB
1_03.txt AC 579 ms 121884 KB
1_04.txt AC 565 ms 118624 KB
1_05.txt AC 551 ms 120376 KB
1_06.txt WA 570 ms 122332 KB
1_07.txt AC 520 ms 120408 KB
1_08.txt WA 527 ms 121104 KB
1_09.txt AC 553 ms 120144 KB
1_10.txt AC 566 ms 118628 KB
1_11.txt AC 554 ms 120368 KB
1_12.txt WA 574 ms 122464 KB
1_13.txt AC 518 ms 120436 KB
1_14.txt WA 533 ms 121104 KB
1_15.txt AC 585 ms 119520 KB
1_16.txt AC 606 ms 122176 KB
1_17.txt AC 628 ms 121036 KB
1_18.txt AC 630 ms 125940 KB
1_19.txt AC 544 ms 119972 KB
1_20.txt WA 574 ms 124696 KB
1_21.txt AC 539 ms 123072 KB
1_22.txt AC 545 ms 120960 KB
1_23.txt AC 600 ms 120832 KB
1_24.txt AC 601 ms 123812 KB
1_25.txt AC 624 ms 121416 KB
1_26.txt AC 592 ms 122132 KB
1_27.txt AC 625 ms 126908 KB
1_28.txt AC 588 ms 119368 KB
1_29.txt AC 573 ms 119108 KB
1_30.txt AC 582 ms 124112 KB
1_31.txt AC 582 ms 121464 KB
1_32.txt AC 606 ms 121612 KB
1_33.txt AC 585 ms 120416 KB
1_34.txt AC 586 ms 123840 KB
1_35.txt AC 617 ms 124772 KB
1_36.txt AC 608 ms 123416 KB
1_37.txt AC 625 ms 120748 KB
1_38.txt AC 585 ms 119832 KB
1_39.txt AC 617 ms 122668 KB
1_40.txt AC 599 ms 119740 KB
1_41.txt AC 591 ms 122452 KB
1_42.txt AC 610 ms 123372 KB
1_43.txt AC 610 ms 122280 KB
1_44.txt AC 593 ms 120904 KB
1_45.txt AC 591 ms 123388 KB
1_46.txt AC 588 ms 119932 KB
1_47.txt AC 639 ms 120964 KB
1_48.txt AC 664 ms 121152 KB
1_49.txt AC 654 ms 121452 KB
1_50.txt AC 668 ms 121488 KB
1_51.txt AC 661 ms 123356 KB
1_52.txt AC 647 ms 122500 KB
1_53.txt AC 670 ms 120180 KB
1_54.txt AC 664 ms 125308 KB