Submission #19,471

19471

2025-12-10 10:09:21

pypy3

Time limit exceeded 21/55

504ms

47956 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-1] <= T[i] and 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	21/55
		1	Accepted	0/0	43ms	19672 KiB
		2	Accepted	0/0	43ms	19628 KiB
		3	Accepted	2/2	52ms	21688 KiB
		4	Accepted	2/2	56ms	21704 KiB
		5	Accepted	2/2	61ms	21808 KiB
		6	Accepted	2/2	64ms	21832 KiB
		7	Accepted	3/3	52ms	21588 KiB
		8	Accepted	1/1	75ms	22560 KiB
		9	Accepted	1/1	83ms	22452 KiB
		10	Accepted	1/1	90ms	22492 KiB
		11	Accepted	1/1	115ms	22316 KiB
		12	Accepted	1/1	118ms	22244 KiB
		13	Accepted	1/1	210ms	22400 KiB
		14	Accepted	2/2	239ms	22408 KiB
		15	Accepted	2/2	114ms	22356 KiB
		16	Time limit exceeded	0/2	503ms	46616 KiB
		17	Time limit exceeded	0/2	493ms	46700 KiB
		18	Time limit exceeded	0/2	490ms	46704 KiB
		19	Time limit exceeded	0/3	490ms	46676 KiB
		20	Time limit exceeded	0/2	493ms	46672 KiB
		21	Time limit exceeded	0/2	488ms	46712 KiB
		22	Time limit exceeded	0/2	472ms	46680 KiB
		23	Time limit exceeded	0/2	504ms	46680 KiB
		24	Time limit exceeded	0/2	486ms	47956 KiB
		25	Time limit exceeded	0/2	486ms	46756 KiB
		26	Time limit exceeded	0/2	488ms	46672 KiB
		27	Time limit exceeded	0/2	483ms	46736 KiB
		28	Time limit exceeded	0/3	486ms	46716 KiB
		29	Time limit exceeded	0/3	488ms	46688 KiB
		30	Time limit exceeded	0/3	486ms	46676 KiB