Submission #31255342

Source Code Expand

n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [0] * n
for i in range(1, n):
    dp[i] = 1000000000000000000
    for j in range(max(0, i - k), i):
        dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]))
print(dp[n - 1])

Submission Info

Submission Time
Task B - Frog 2
User Pro_ktmr
Language PyPy3 (7.3.0)
Score 100
Code Size 250 Byte
Status AC
Exec Time 273 ms
Memory 84756 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 62 ms 61668 KiB
0_01 AC 52 ms 61664 KiB
0_02 AC 51 ms 61368 KiB
0_03 AC 50 ms 61708 KiB
1_00 AC 51 ms 61660 KiB
1_01 AC 52 ms 61512 KiB
1_02 AC 77 ms 84756 KiB
1_03 AC 242 ms 84148 KiB
1_04 AC 84 ms 84580 KiB
1_05 AC 87 ms 84180 KiB
1_06 AC 91 ms 84216 KiB
1_07 AC 94 ms 83704 KiB
1_08 AC 103 ms 83932 KiB
1_09 AC 148 ms 84708 KiB
1_10 AC 182 ms 84060 KiB
1_11 AC 273 ms 83884 KiB