Submission #29820384

Source Code Expand

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

Submission Info

Submission Time
Task A - Frog 1
User Pro_ktmr
Language PyPy3 (7.3.0)
Score 100
Code Size 236 Byte
Status AC
Exec Time 91 ms
Memory 84976 KiB

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 11
Set Name Test Cases
All 0_00, 0_01, 0_02, 1_00, 1_01, 1_02, 1_03, 1_04, 1_05, 1_06, 1_07
Case Name Status Exec Time Memory
0_00 AC 65 ms 61700 KiB
0_01 AC 49 ms 61924 KiB
0_02 AC 56 ms 61664 KiB
1_00 AC 52 ms 61772 KiB
1_01 AC 50 ms 61608 KiB
1_02 AC 77 ms 84300 KiB
1_03 AC 83 ms 84340 KiB
1_04 AC 90 ms 84748 KiB
1_05 AC 89 ms 84732 KiB
1_06 AC 91 ms 84976 KiB
1_07 AC 90 ms 84928 KiB