Submission #3936881

Source Code Expand

N, K = map(int, input().split())
*A, = map(int, input().split())
dp = [0]*N
for i in range(1, N):
    v = 10**18
    for k in range(min(K, i)):
        v = min(v, dp[i-k-1] + abs(A[i] - A[i-k-1]))
    dp[i] = v
print(dp[N-1])

Submission Info

Submission Time
Task B - Frog 2
User yaketake08
Language PyPy3 (2.4.0)
Score 100
Code Size 233 Byte
Status AC
Exec Time 361 ms
Memory 56032 KiB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 16
Set Name Test Cases
All 0_00, 0_01, 0_02, 0_03, 1_00, 1_01, 1_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09, 1_10, 1_11
Case Name Status Exec Time Memory
0_00 AC 161 ms 38384 KiB
0_01 AC 158 ms 38256 KiB
0_02 AC 166 ms 38384 KiB
0_03 AC 160 ms 38256 KiB
1_00 AC 162 ms 38256 KiB
1_01 AC 160 ms 38256 KiB
1_02 AC 220 ms 53624 KiB
1_03 AC 309 ms 56032 KiB
1_04 AC 208 ms 52208 KiB
1_05 AC 220 ms 52080 KiB
1_06 AC 226 ms 52208 KiB
1_07 AC 255 ms 52208 KiB
1_08 AC 242 ms 52080 KiB
1_09 AC 273 ms 52080 KiB
1_10 AC 311 ms 52080 KiB
1_11 AC 361 ms 52080 KiB