Submission #3086955

Source Code Expand

import heapq
N, K = map(int, input().split())
X = list(map(int, input().split()))

hq = [(-X[i], i+1) for i in range(K)]
heapq.heapify(hq)
for i in range(K, N):
    print(hq[0][1])
    heapq.heappushpop(hq, (-X[i], i+1))
print(hq[0][1])

Submission Info

Submission Time
Task B - 特別賞
User toberustacean
Language Python (3.4.3)
Score 100
Code Size 245 Byte
Status AC
Exec Time 175 ms
Memory 21092 KB

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 40 / 40 60 / 60
Status
AC × 2
AC × 13
AC × 22
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
Subtask1 sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt
Subtask2 sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt
Case Name Status Exec Time Memory
sample_01.txt AC 18 ms 3064 KB
sample_02.txt AC 17 ms 3060 KB
subtask1_01.txt AC 18 ms 3060 KB
subtask1_02.txt AC 18 ms 3060 KB
subtask1_03.txt AC 18 ms 3060 KB
subtask1_04.txt AC 18 ms 3060 KB
subtask1_05.txt AC 19 ms 3316 KB
subtask1_06.txt AC 19 ms 3316 KB
subtask1_07.txt AC 18 ms 3188 KB
subtask1_08.txt AC 18 ms 3188 KB
subtask1_09.txt AC 19 ms 3316 KB
subtask1_10.txt AC 19 ms 3188 KB
subtask1_11.txt AC 19 ms 3316 KB
subtask2_01.txt AC 39 ms 5052 KB
subtask2_02.txt AC 20 ms 3444 KB
subtask2_03.txt AC 175 ms 14008 KB
subtask2_04.txt AC 147 ms 14132 KB
subtask2_05.txt AC 77 ms 21092 KB
subtask2_06.txt AC 109 ms 14436 KB
subtask2_07.txt AC 173 ms 13940 KB
subtask2_08.txt AC 121 ms 14008 KB
subtask2_09.txt AC 164 ms 14008 KB