Submission #19,476

19476

2025-12-10 15:36:59

pypy3

Wrong answer 33/55

122ms

47924 KiB

N,K=map(int,input().split())
T = list(map(int,input().split()))
fold = 0
m = T[0]
for i in range(1,K):
    if T[i] > m - 1:
        fold += (T[i] - (m-1)) * i
        m = T[i]
    else:
        fold += m - 1 - T[i]
        m = m - 1
min = N * 10**9
for i in range(1,N-K+1):
    if T[i+K-1] < m:
        fold -= m + K - 1 - T[i-1]
        m = m - 1
        fold += m - T[i+K-1]
    else:
        fold = 0
        m = T[i]
        for j in range(i,i+K):
            if T[j] > m - 1:
                fold += (T[j] - (m-1)) * (j-i)
                m = T[j]
            else:
                fold += m - 1 - T[j]
                m = m - 1
    if fold < min:
        min = fold
print(min)

	Sum	Test	Verdict		Time	Memory
base	33/55
		1	Accepted	0/0	39ms	19620 KiB
		2	Wrong answer	0/0	39ms	19420 KiB
		3	Wrong answer	0/2	48ms	21200 KiB
		4	Wrong answer	0/2	48ms	21100 KiB
		5	Wrong answer	0/2	52ms	21204 KiB
		6	Wrong answer	0/2	52ms	21204 KiB
		7	Accepted	3/3	43ms	21112 KiB
		8	Accepted	1/1	67ms	22248 KiB
		9	Accepted	1/1	61ms	22372 KiB
		10	Accepted	1/1	71ms	22248 KiB
		11	Wrong answer	0/1	56ms	22288 KiB
		12	Wrong answer	0/1	61ms	22252 KiB
		13	Accepted	1/1	65ms	22248 KiB
		14	Wrong answer	0/2	57ms	22020 KiB
		15	Wrong answer	0/2	56ms	22408 KiB
		16	Wrong answer	0/2	101ms	46744 KiB
		17	Accepted	2/2	122ms	46624 KiB
		18	Accepted	2/2	119ms	46772 KiB
		19	Accepted	3/3	103ms	46784 KiB
		20	Accepted	2/2	104ms	46844 KiB
		21	Wrong answer	0/2	119ms	46784 KiB
		22	Accepted	2/2	104ms	46708 KiB
		23	Accepted	2/2	103ms	46744 KiB
		24	Wrong answer	0/2	118ms	47924 KiB
		25	Accepted	2/2	119ms	46792 KiB
		26	Accepted	2/2	105ms	46680 KiB
		27	Wrong answer	0/2	119ms	46688 KiB
		28	Accepted	3/3	104ms	46656 KiB
		29	Accepted	3/3	103ms	46692 KiB
		30	Accepted	3/3	118ms	46668 KiB