Submission #25,890

2026-03-06 20:50:04

pypy3

Accepted 100/100

146ms

66784 KiB

# UUID: 959e8b51-9834-4cbb-b8ce-159a9b308adf
N, C = [int(x) for x in input().split()]
L = [int(x) for x in input().split()]

res=N
cur = set()
last = {}
first = 0
for i in range(N):
    cur.add(L[i])
    while len(cur) == C:
        res = min(res,i-first+1)
        if last[L[first]] == first:
            cur.remove(L[first])
        first += 1
    last[L[i]]=i

print(res)

	Sum	Test	Verdict	Time	Memory
subtask1	0/0
		1	Accepted	39ms	19632 KiB
		2	Accepted	43ms	19436 KiB
subtask2	15/15
		3	Accepted	101ms	37872 KiB
		4	Accepted	90ms	38012 KiB
		5	Accepted	104ms	37820 KiB
		6	Accepted	43ms	21184 KiB
		7	Accepted	43ms	21228 KiB
subtask3	10/10
		8	Accepted	43ms	19432 KiB
		9	Accepted	39ms	19432 KiB
		10	Accepted	39ms	19380 KiB
		11	Accepted	43ms	19388 KiB
		12	Accepted	39ms	19624 KiB
subtask4	20/20
		13	Accepted	43ms	19784 KiB
		14	Accepted	39ms	19684 KiB
		15	Accepted	45ms	19648 KiB
		16	Accepted	39ms	19688 KiB
		17	Accepted	39ms	19692 KiB
subtask5	25/25
		18	Accepted	54ms	21672 KiB
		19	Accepted	52ms	21744 KiB
		20	Accepted	57ms	21676 KiB
		21	Accepted	50ms	21896 KiB
		22	Accepted	59ms	21736 KiB
subtask6	30/30
		23	Accepted	146ms	66784 KiB
		24	Accepted	107ms	39356 KiB
		25	Accepted	108ms	40516 KiB
		26	Accepted	115ms	44056 KiB
		27	Accepted	146ms	54360 KiB
		28	Accepted	112ms	40392 KiB
		29	Accepted	96ms	39204 KiB
		30	Accepted	101ms	37944 KiB