Submission #19,479

19479

2025-12-10 16:08:36

pypy3

Time limit exceeded 43/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] < m + K - 1: 
        fold -= m + K - 1 - T[i-1]
        if T[i+K-1] < m:
            m = m - 1
            fold += m - T[i+K-1]
        else:
            fold += (K - 1) * (T[i+K-1] - m + 1)
            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	43/55
		1	Accepted	0/0	43ms	19600 KiB
		2	Accepted	0/0	43ms	19676 KiB
		3	Accepted	2/2	45ms	21160 KiB
		4	Accepted	2/2	45ms	21256 KiB
		5	Accepted	2/2	46ms	21412 KiB
		6	Accepted	2/2	48ms	21320 KiB
		7	Accepted	3/3	46ms	21220 KiB
		8	Accepted	1/1	57ms	21756 KiB
		9	Accepted	1/1	59ms	21948 KiB
		10	Accepted	1/1	59ms	22384 KiB
		11	Accepted	1/1	98ms	22348 KiB
		12	Accepted	1/1	92ms	22176 KiB
		13	Accepted	1/1	137ms	22408 KiB
		14	Accepted	2/2	119ms	22372 KiB
		15	Accepted	2/2	89ms	22136 KiB
		16	Time limit exceeded	0/2	504ms	46772 KiB
		17	Accepted	2/2	97ms	46696 KiB
		18	Accepted	2/2	112ms	46700 KiB
		19	Accepted	3/3	112ms	47868 KiB
		20	Accepted	2/2	323ms	47868 KiB
		21	Time limit exceeded	0/2	504ms	46704 KiB
		22	Time limit exceeded	0/2	495ms	46628 KiB
		23	Time limit exceeded	0/2	488ms	47872 KiB
		24	Time limit exceeded	0/2	486ms	47956 KiB
		25	Accepted	2/2	365ms	47872 KiB
		26	Time limit exceeded	0/2	407ms	47872 KiB
		27	Accepted	2/2	282ms	46684 KiB
		28	Accepted	3/3	226ms	46692 KiB
		29	Accepted	3/3	365ms	46688 KiB
		30	Accepted	3/3	112ms	47872 KiB