Submission #66723420


Source Code Expand

Copy
n, q = map(int, input().split())
ans = []
hako = [0 for _ in range(n)]
x = list(map(int, input().split()))
for i in range(q):
xi = x[i]
if xi == 0:
mn = 10000
idx = -1
for i in range(n):
if mn > hako[i]:
mn = hako[i]
idx = i + 1
else:
idx = xi
hako[idx - 1] += 1
ans.append(idx)
print(*ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
n, q = map(int, input().split())
ans = []
hako = [0 for _ in range(n)]
x = list(map(int, input().split()))
for i in range(q):
    xi = x[i]
    if xi == 0:
        mn = 10000
        idx = -1
        for i in range(n):
            if mn > hako[i]:
                mn = hako[i]
                idx = i + 1
    else:
        idx = xi
    hako[idx - 1] += 1
    ans.append(idx)
print(*ans)

Submission Info

Submission Time
Task B - Reverse Proxy
User juten
Language Python (CPython 3.11.4)
Score 200
Code Size 405 Byte
Status AC
Exec Time 11 ms
Memory 8664 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 42
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt
Case Name Status Exec Time Memory
sample_01.txt AC 10 ms 8516 KiB
sample_02.txt AC 10 ms 8520 KiB
sample_03.txt AC 10 ms 8380 KiB
test_01.txt AC 10 ms 8664 KiB
test_02.txt AC 10 ms 8552 KiB
test_03.txt AC 10 ms 8480 KiB
test_04.txt AC 10 ms 8428 KiB
test_05.txt AC 10 ms 8452 KiB
test_06.txt AC 10 ms 8480 KiB
test_07.txt AC 10 ms 8468 KiB
test_08.txt AC 10 ms 8556 KiB
test_09.txt AC 10 ms 8376 KiB
test_10.txt AC 10 ms 8448 KiB
test_11.txt AC 11 ms 8532 KiB
test_12.txt AC 10 ms 8424 KiB
test_13.txt AC 10 ms 8496 KiB
test_14.txt AC 10 ms 8496 KiB
test_15.txt AC 10 ms 8572 KiB
test_16.txt AC 10 ms 8596 KiB
test_17.txt AC 10 ms 8480 KiB
test_18.txt AC 10 ms 8388 KiB
test_19.txt AC 10 ms 8444 KiB
test_20.txt AC 10 ms 8580 KiB
test_21.txt AC 10 ms 8448 KiB
test_22.txt AC 10 ms 8492 KiB
test_23.txt AC 10 ms 8504 KiB
test_24.txt AC 10 ms 8520 KiB
test_25.txt AC 10 ms 8516 KiB
test_26.txt AC 10 ms 8568 KiB
test_27.txt AC 10 ms 8516 KiB
test_28.txt AC 10 ms 8520 KiB
test_29.txt AC 11 ms 8380 KiB
test_30.txt AC 10 ms 8444 KiB
test_31.txt AC 10 ms 8540 KiB
test_32.txt AC 10 ms 8448 KiB
test_33.txt AC 10 ms 8508 KiB
test_34.txt AC 10 ms 8560 KiB
test_35.txt AC 10 ms 8504 KiB
test_36.txt AC 10 ms 8376 KiB
test_37.txt AC 10 ms 8416 KiB
test_38.txt AC 10 ms 8496 KiB
test_39.txt AC 10 ms 8492 KiB


2025-06-14 (Sat)
22:43:18 +09:00