Submission #19339388

Source Code Expand

import copy as cp

N = int(input())
A = list(map(int, input().split()))
Player = cp.deepcopy(A)  # 最後にレートとプレイヤー番号を照合する用
R = []
if N == 1:
    print(Player.index(min(A))+1)
else:
    for i in range(N-1):
        R = [0]*(2**(N-i-1))  # 各階層でのプレイヤー
        for j in range(2**(N-i-1)):
            if A[2*j] > A[2*j+1]:
                R[j] = A[2*j]
            else:
                R[j] = A[2*j+1]
        A = cp.deepcopy(R)
    print(Player.index(min(R))+1)

Submission Info

Submission Time
Task C - ABC Tournament
User f_taka
Language Python (3.8.2)
Score 300
Code Size 537 Byte
Status AC
Exec Time 107 ms
Memory 16784 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 12
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All extreme_00.txt, handmade_00.txt, handmade_01.txt, random_00.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
extreme_00.txt AC 107 ms 16488 KiB
handmade_00.txt AC 26 ms 9044 KiB
handmade_01.txt AC 22 ms 9144 KiB
random_00.txt AC 103 ms 16464 KiB
random_01.txt AC 106 ms 16640 KiB
random_02.txt AC 101 ms 16784 KiB
random_03.txt AC 20 ms 9064 KiB
random_04.txt AC 25 ms 9308 KiB
random_05.txt AC 19 ms 9216 KiB
sample_01.txt AC 21 ms 9152 KiB
sample_02.txt AC 23 ms 9044 KiB
sample_03.txt AC 18 ms 9036 KiB