Submission #66728250

---

Source Code Expand

from collections import deque, defaultdict, Counter
from math import ceil
from bisect import *
from heapq import *
import sys


def input():
    return sys.stdin.readline().strip()


def ri():
    return int(input())


def rri():
    return map(int, input().split())


inf = float("inf")
MOD = 998244353
N, M = rri()
A = list(rri())
cnt = [0] * N
h = [(0, i) for i in range(N)]
heapify(h)
box = [0] * M
for i in range(M):
    if A[i] > 0:
        x = A[i] - 1
        cnt[x] += 1
        heappush(h, (cnt[x], x))
        box[i] = x
    else:
        while h and h[0][0] != cnt[h[0][1]]:
            heappop(h)
        if h:
            x = heappop(h)[1]
            cnt[x] += 1
            heappush(h, (cnt[x], x))
            box[i] = x
print(*([x + 1 for x in box]))

Submission Info

Judge Result