problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03161 | s022928651 | Accepted | n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [0]*n
for i in range(1, n):
c = 99999999999
for j in range(max(0, i-k), i):
c = min(c, dp[j]+abs(h[i]-h[j]))
dp[i] = c
print(dp[-1]) |
p03161 | s182226234 | Accepted | n, k = [int(i) for i in input().split(" ")]
h = [int(i) for i in input().split(" ")]
dp = [float("inf")] * n
dp[0] = 0
for i in range(len(h)):
for j in range(1, k+1, 1):
if (i+j) < len(h):
dp[i+j] = min(dp[i+j], dp[i]+abs(h[i+j] - h[i]))
print(dp[-1]) |
p03161 | s666088038 | Accepted | n, k = map(int, input().split())
h = list(map(int, input().split()))
ans = [0] * n
for i in range(1, n):
l = min(i, k)
hs = h[i]
ans[i] = min([abs(hs - h[i - j])+ans[i-j] for j in range(1, l+1)])
# j : 戻り幅
#print(ans)
print(ans[-1]) |
p03161 | s355253664 | Accepted | import numpy as np
N, K = map(int, input().split())
h = np.array([int(i) for i in input().split()])
dp = np.full(N, 10 ** 10)
# 初期条件
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(2, N):
ik = max(0, i - K)
dp[i] = np.min(dp[ik:i] + np.abs(h[i] - h[ik:i]))
print(int(dp[-1]))
|
p03161 | s855064377 | Accepted | N, K = map(int, input().split())
h = list(map(int, input().split()))
S = [0] * N
S[0] = 0
for i in range(1, N):
value = S[i - 1] + abs(h[i] - h[i - 1])
maxStep = min(K, i)
for step in range(1, maxStep + 1):
value = min(value, S[i - step] + abs(h[i] - h[i - step]))
S[i] = value
print(S[N - 1]) |
p03161 | s519218280 | Accepted | n,k = map(int,input().split())
h = list(map(int,input().split()))
c = []
c.append(0)
for i in range(1,n):
c.append(min([ c[max(i-j,0)] + abs(h[i] - h[max(i-j,0)]) for j in range(1,k+1) ]))
print(c[n-1]) |
p03161 | s265327089 | Accepted | N,K = map(int,input().split())
h = list(map(int,input().split()))
dp = [0] * N
dp[0] = 0
for i in range(1,N):
dp[i] = min([dp[i-j-1] + abs(h[i]-h[i-j-1]) for j in range(min(i,K))])
print(dp[-1]) |
p03161 | s078786990 | Accepted | import sys
import numpy as np
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = np.zeros(N, dtype=int)
h = np.array(h)
for i in range(1, N):
start = max(0, i-K)
dp[i] = min(dp[start:i] + np.abs(h[start:i]-h[i]))
print(dp[N-1]) |
p03161 | s674259073 | Accepted | # sys.stdin.readline()
import sys
input = sys.stdin.readline
N,K=map(int, input().split())
h=list(map(int, input().split()))
import numpy as np
f_inf = float('inf')
dp = [f_inf]*N
dp[0]=0
# hの配列を作る。
h = np.array(h)
#配るDP
for i in range(1,N):
# start は負になることはない。
start = max(0, i-K)
# 行列として足し算できるのでforを使う必要がない。
dp[i] = min(dp[start: i] + np.abs(h[i] - h[start: i]))
print(dp[-1]) |
p03161 | s732898123 | Accepted | n, k = (int(x) for x in input().split())
h = [0] + [int(x) for x in input().split()]
dp = [float('inf')] * (n + 1)
dp[1] = 0
for i in range(2, n + 1):
for j in range(1, k + 1):
if i - j >= 0:
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]))
print(dp[n]) |
p03161 | s057438882 | Accepted | N, K = map(int, input().split())
H = list(map(int, input().split()))
dp = [10 ** 10] * N
dp[0] = 0
for i in range(1, N):
for j in range(1, K + 1):
if i - j < 0:
break
dp[i] = min(dp[i], dp[i - j] + abs(H[i - j] - H[i]))
print(dp[-1]) |
p03161 | s874851024 | Accepted | import numpy as np
steps, limit = map(int, input().split())
heights = [int(height) for height in input().split()]
heights = np.array(heights, np.int)
costs = np.array([0] * steps, np.int)
def search(step, num):
costs[step] = min(costs[step-num:step] + abs(heights[step-num:step] - heights[step]))
for i in range(1,steps):
if i < limit:
search(i, i)
else:
search(i, limit)
print(costs[steps-1]) |
p03161 | s412466618 | Accepted | import numpy as np
N, K = map(int, input().split())
h = np.array(list(map(int, input().split())))
dp = np.zeros(N, dtype=int)
for i in range(1, N):
j = max(0, i-K)
dp[i] = np.min(dp[j:i]+np.abs(h[i]-h[j:i]))
print(dp[N-1]) |
p03161 | s170498215 | Accepted | n,k = map(int,input().split())
h = list(map(int,input().split()))
dp = [float("inf")]*(n)
dp[0] = 0
def chmin(a,b,index):
if a > b:
dp[index] = b
for i in range(n-1):
for j in range(1,k+1):
chmin(dp[i+j],dp[i] + abs(h[i] - h[i+j]),i+j)
if i+j >= n-1:
break
print(dp[n-1]) |
p03161 | s635552063 | Accepted | n, k = map(int, input().split())
lst = list(map(int, input().split()))
cst = [float('inf')] * n
cst[0] = 0
for _ in range(0, n):
m = min(n-(_+1),k)
for i in range(0, m+1):
cst[_+i] = min(cst[_] + abs(lst[_+i] - lst[_]),cst[_+i])
print(cst[n-1]) |
p03161 | s815092400 | Accepted | from math import inf
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
dp = [inf for _ in range(n)]
dp[0] = 0
for i in range(1, n):
for j in range(1, k + 1):
if i - j >= 0:
dp[i] = min(dp[i], abs(a[i] - a[i - j]) + dp[i - j])
else:
break
print(dp[-1])
|
p03161 | s578906690 | Accepted | N, K = map(int, input().split())
h = list(map(int, input().split()))
dp = [float("inf") for _ in range(N)]
for i in range(min(N, K+1)):
dp[i] = abs(h[i] - h[0])
for j in range(N):
for k in range(min(N, K+1)):
if dp[j] > dp[j-k] + abs(h[j] - h[j-k]):
dp[j] = dp[j-k] + abs(h[j] - h[j-k])
print(dp[N-1]) |
p03161 | s337950668 | Accepted | from sys import stdout, stdin, maxsize
n, k = map(int, stdin.readline().split())
ls = list(map(int, stdin.readline().split()))
dp = [maxsize] * (n + 1)
dp[1] = 0
if n == 1:
print(0)
else:
dp[2] = abs(ls[1] - ls[0])
for i in range(3, n + 1):
j = 1
while j <= k and i - j >= 0:
dp[i] = min(dp[i - j] + abs(ls[i - 1] - ls[i - 1 - j]), dp[i])
j += 1
print(dp[n])
|
p03161 | s526395637 | Accepted | N, K = map(int, input().split())
H = list(map(int, input().split()))
H = [H[0]] * K + H
# dp[i] := 足場iに来るのにかかる最小のコスト
INF = 10**18
dp = [INF] * (K + N)
dp[0] = 0
for i in range(K, N + K):
h = H[i]
# TLEするので内包表記にする
costs = [x + abs(y - h) for x, y in zip(dp[i - K:i], H[i - K:i])]
dp[i] = min(costs)
ans = dp[-1]
print(ans)
|
p03161 | s251568501 | Accepted | N, K = map(int, input().split())
h = list(map(int, input().split()))
#dp[i]:i番目に到達するまでにはらうコストの最小値
INF = float('inf')
dp = [INF for i in range(N)]
dp[0] = 0
for i in range(0,N):
for k in range(1, K+1):
if i+k > N-1:
break
dp[i+k] = min(dp[i+k], dp[i]+abs(h[i+k]-h[i]))
print(dp[N-1]) |
p03161 | s773188961 | Accepted | from sys import stdin
import numpy as np
def main():
#入力
readline=stdin.readline
inf=10**10
n,k=map(int,readline().split())
h=np.array(list(map(int,readline().split())),dtype=np.int64)
dp=np.full(n,inf,dtype=np.int64)
dp[0]=0
for i in range(n-1):
end=min(n,i+k+1)
sa=np.abs(h[i]-h[i+1:end])
dp[i+1:end]=np.minimum(dp[i+1:end],dp[i]+sa)
print(dp[n-1])
if __name__=="__main__":
main() |
p03161 | s635435514 | Accepted | import numpy as np
N,K = map(int, input().split())
h = np.array(list(map(int, input().split())))
dp = np.full(N,10**10)
dp[0] = 0
for i in range(1,N):
start = max(0,i-K)
dp[i] = np.min(dp[start:i]+np.abs(h[i]-h[start:i]))
print(int(dp[-1]))
|
p03161 | s559191201 | Accepted | N,K=map(int,input().split())
h_list=list(map(int,input().split()))
dp=[0]*N
for i in range(1,N):
dp[i]=float("inf")
for j in range(1,min(i,K)+1):
dp[i]=min(dp[i],dp[i-j]+abs(h_list[i-j]-h_list[i]))
print(dp[-1]) |
p03161 | s850325489 | Accepted | def main():
platform_count, jumping_power = [int(x) for x in input().split()]
platforms = [int(x) for x in input().split()]
dp = [0]
for i in range(1, platform_count):
indexes = (i - x for x in range(1, jumping_power + 1) if i - x >= 0)
dp.append(
min(abs(platforms[i] - platforms[before]) + dp[before]
for before in indexes))
print(dp[platform_count - 1])
if __name__ == '__main__':
main()
|
p03161 | s008230293 | Accepted | n, k = map(int, input().split())
h = list(map(int, input().split()))
INF = 10**12
dp = [INF] * n
dp[0] = 0
for i in range(n):
if i == 1:
dp[1] = abs(h[1] - h[0])
continue
for j in range(1, k + 1):
if i - j < 0:
continue
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]))
print(dp[-1])
|
p03161 | s592091226 | Accepted | mod=10**9+7
import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return map(int,sys.stdin.readline().split())
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
a,b=mi()
l=list(mi())
dp=[0]*a
dp[0]=0
for i in range(1,a):
dp[i]=min(abs(l[i]-l[i-j-1])+dp[i-j-1] for j in range(min(i,b)))
print(dp[-1]) |
p03161 | s264025666 | Accepted | N, K = map(int, input().split())
h = list(map(int,input().split()))
dp = [float("INF")] * N
dp[0] = 0
K = min(N-1, K)
for i in range(1, K+1):
dp[i] = abs(h[i] - h[0])
for i in range(K, N):
c = [float("INF")] * (K+1)
for j in range(1, K+1):
c[j] = dp[i-j] + abs(h[i] - h[i-j])
dp[i] = min(c)
print(dp[N-1]) |
p03161 | s013345870 | Accepted | def cal_cost(co, h, i, j):
return co + abs(h[i]-h[j])
n, k = map(int, input().split())
h = [int(i) for i in input().split(" ")]
lis = [0 for i in range(n)]
for i in range(1, n):
a = min([cal_cost(lis[i-j], h, i-j, i) for j in range(1, k+1) if j<=i])
lis[i] = a
print(lis[-1]) |
p03161 | s607265329 | Accepted | n,k = map(int,input().split())
h = list(map(int,input().split()))
dp = [10**10]*n
dp[0] = 0
for i in range(n-1):
for j in range(i+1,min(i+k,n-1)+1):
dp[j] = min(dp[j],dp[i]+abs(h[j]-h[i]))
# print(dp)
print(dp[n-1]) |
p03161 | s244952312 | Accepted | n,k=[int(x) for x in input().split()]
infy=float('inf')
arr=[int(x) for x in input().split()]
val=[infy]*(n)
val[0]=0
for i in range(0,n-1):
for j in range(1,k+1):
if i+j < n:
val[i+j]=min(val[i+j],abs(arr[i+j]-arr[i])+val[i])
print(val[n-1])
|
p03161 | s325214072 | Accepted | n, k, *h = map(int, open(0).read().split())
h += [0] * 200
dp = [0] + [float("inf")] * 100200
for i in range(1, n):
dp[i] = min(dp[i-a] + abs(h[i] - h[i-a]) for a in range(1, k + 1))
print(dp[n - 1]) |
p03161 | s729156178 | Accepted | n, k = map(int, input().split())
h = list(map(int, input().split()))
def chmin(a, b):
if a > b:
return b
else:
return a
f_inf = float('inf')
for _ in range(k+2):
h.append(f_inf)
dp = [f_inf]*(n+k)
dp[0] = 0
for i in range(1, n):
for j in range(1, k+1):
if i >= j:
dp[i] = chmin(dp[i], dp[i-j] + abs(h[i] - h[i-j]))
print(dp[n-1]) |
p03161 | s176524255 | Accepted | N, K = map(int, input().split())
ashi = list(map(int, input().split()))
if N<=K:
print(abs(ashi[-1]-ashi[0]))
exit()
arr = [0]*N
for i in range(1,K+1,1):
arr[i] = abs(ashi[i]-ashi[0])
for i in range(K+1,N,1):
x = arr[i-1]+abs(ashi[i]-ashi[i-1])
for j in range(1,K+1,1):
if arr[i-j]+abs(ashi[i]-ashi[i-j]) < x:
x=arr[i-j]+abs(ashi[i]-ashi[i-j])
arr[i] = x
print(arr[-1]) |
p03161 | s866684664 | Accepted | N,K = map(int, input().split())
h = list(map(int, input().split()))
dp = [0] + [1000000000000]*(N-1)
for i in range(1,N):
for j in range(max(i-K,0),i):
dp[i] = min(dp[i],dp[j]+abs(h[i]-h[j]))
print(dp[-1])
|
p03161 | s705866993 | Accepted | def hoge():
dp = [0] * (n + 5)
for i in range(1, n):
p = [dp[j] + abs(h_list[i] - h_list[j]) for j in range(max(0, i - k), i)]
dp[i] = min(p)
return dp[n - 1]
def solve():
global n, k, h_list
n, k = map(int, input().split())
h_list = list(map(int, input().split()))
ans = hoge()
print(ans)
return 0
if __name__ == "__main__":
solve() |
p03161 | s645259839 | Accepted | n, k = map(int, input().split())
hs = list(map(int, input().split()))
results = list()
results.append(0)
for i in range(1, n):
score = float('INF')
for j in range(1, min(k+1, i + 1)):
score = min(score, results[i-j] + abs(hs[i-j] - hs[i]))
results.append(score)
print(results[n-1])
|
p03161 | s627277085 | Accepted | n,k = map(int,input().split())
h = list(map(int,input().split()))
dp = [float("inf")]*(n+1)
dp[1] = 0
for i in range(1,n+1):
for j in range(max(1,i-k),i):
dp[i] = min(dp[i],dp[j]+abs(h[i-1]-h[j-1]))
print(dp[-1]) |
p03161 | s234566183 | Accepted | from numba import jit
import math
N, K = map(int,input().split())
h = list(map(int,input().split()))
@jit
def nya(N, K, h):
dp=[0]*N
for i in range(1,N):
value=math.inf
for j in range(1,K+1):
if i-j<0:
break
value=min(value,dp[i-j]+abs(h[i]-h[i-j]))
dp[i]=value
return(dp[N-1])
print(nya(N,K,h)) |
p03161 | s733665670 | Accepted | N, K = map(int,input().split())
H = list(map(int,input().split()))
#DP[i] i番目までの足場を見たときの足場iにたどり着く最小値
DP = [10**12 for _ in range(N + 1)]
DP[0] = 0
for i in range(N):
for k in range(1,K + 1):
if 0 <= i - k and i - k < N:
cost_min = 10**12
cost_min = min(cost_min, DP[i - k] + abs(H[i] - H[i - k]))
DP[i] = min(DP[i],cost_min)
print(DP[N - 1])
|
p03161 | s657199070 | Accepted | n, k = map(int, input().split())
h_list = list(map(int, input().split()))
dp = [0]
for i in range(1, n):
mi = min([abs(h_list[i] - h_list[j]) + dp[j] for j in range(max(0, i - k), i)])
dp.append(mi)
print(dp[-1]) |
p03161 | s332350784 | Accepted | N, K = map(int, input().split())
h = list(map(int, input().split()))
inf = float('inf')
dp = [inf] * N
dp[0] = 0
for i in range(N-1):
for j in range(1, K+1):
if i+j < N:
dp[i+j] = min(dp[i]+abs(h[i]-h[i+j]), dp[i+j])
print(dp[N-1]) |
p03161 | s514499126 | Accepted | import math
N, K = map(int, input().split())
H = list(map(int, input().split()))
dp_list = [math.inf] * N
dp_list[0] = 0
for i, h in enumerate(H[:-1]):
for j in range(1, min(K + 1, N - i)):
cost_step = abs(H[i] - H[i + j])
cost_total = dp_list[i] + cost_step
if dp_list[i + j] > cost_total:
dp_list[i + j] = cost_total
print(dp_list[-1]) |
p03161 | s355715045 | Accepted | import sys
input = sys.stdin.readline
N,K=map(int,input().split())
import numpy as np
hights=np.array(list(map(int,input().split())))
steps=np.array([10**10]*N)
steps[0]=0
for i in range(N-1):
gaps=hights[i+1:i+K+1]-hights[i]
gaps=np.abs(gaps)
gaps+=steps[i]
steps[i+1:i+K+1]=np.minimum(steps[i+1:i+K+1],gaps)
print(steps[-1]) |
p03161 | s993758652 | Accepted | n, k = map(int, input().split())
h = [int(i) for i in input().split()]
def chmin(a, b):
if a > b:
return b
else:
return a
f_inf = pow(10,9)+99
dp = [f_inf] * (n+1)
dp[0] = 0
for i in range(1, n):
for j in range(1, k+1):
if i - j >= 0:
dp[i] = chmin(dp[i], dp[i-j]+ abs(h[i] - h[i - j]))
print(dp[n-1])
|
p03161 | s272061268 | Accepted | n, k = map(int, input().split())
scaffolds = list(map(int, input().split()))
dp = [10 ** 5 * 10 ** 4] * n
dp[0] = 0
for i in range(n):
for j in range(1, k + 1):
if i + j >= n:
break
dp[i + j] = min(dp[i + j], abs(scaffolds[i] - scaffolds[i + j]) + dp[i])
print(dp[-1]) |
p03161 | s301115640 | Accepted | n, k = map(int, input().split())
h = list(map(int, input().split()))
INF = float('inf')
dp = [INF] * n
dp[0] = 0
for i in range(n - 1):
for j in range(1, k + 1):
if i + j >= n:
break
else:
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]))
print(dp[-1]) |
p03161 | s156976773 | Accepted | N,K=map(int,input().split())
H=list(map(int,input().split()))
DP=[0]*(N+1)
for i in range(2,N+1):
L=[DP[i-j-1]+abs(H[i-1]-H[i-j-2])for j in range(min(K,i-1))]
DP[i]=min(L)
print(DP[-1])
|
p03161 | s552894441 | Accepted | import numpy as np
def solve():
N, K = map(int, input().split())
h = np.array(list(map(int, input().split())))
dp = np.full(N, 10**9, dtype=np.int)
dp[0] = 0
for i in range(1, N):
dp[i:i + K] = np.fmin(
dp[i:i + K],
dp[i - 1] + np.abs(h[i:i + K] - h[i - 1])
)
return dp[-1]
if __name__ == "__main__":
print(solve()) |
p03161 | s541015994 | Accepted | n,k,*h=map(int,open(0).read().split())
INF=float("inf")
dp=[INF]*(n)
dp[0]=0
for i in range(n):
for j in range(1,k+1):
# try:
# dp[i+j]=min(dp[i+j],dp[i]+abs(h[i+j]-h[i]))
# except:
# pass
if not i-j<0:
dp[i]=min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
print(dp[-1]) |
p03161 | s127610427 | Accepted | n,k=map(int, input().split())
h=list(map(int,input().split()))
dp=[0]*(n)
if k+1<=n:
max=k+1
else:
max=n
for i in range(1,max):
dp[i]=abs(h[0]-h[i])
for i in range(k,n):
li=[abs(h[i]-h[ik])+dp[ik] for ik in range(i-1,i-k-1,-1) ]
dp[i]=min(li)
print(dp[-1]) |
p03161 | s950476152 | Accepted | n,k = [int(x) for x in input().split()]
h = [int(x) for x in input().split()]
dp = [float("inf") for _ in range(n)]
dp[0] = 0
for i in range(1,n):
for j in range(1,min(k,i)+1):
dp[i] = min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
print(dp[-1]) |
p03161 | s473559582 | Accepted | nk = list(map(int,input().split()))
h = list(map(int,input().split()))
n,k = nk[0], nk[1] #5,3
DP = [0]
for i in range(1, n):#0~3 -> 1~4
act = float("inf")
for k_ in range(1, k+1):#0~2 -> 1~3
if i-k_ < 0 : continue
act = min(DP[-k_] + abs(h[i-k_]-h[i]), act)#
DP+= [act]#[0,20,]
print(DP[-1]) |
p03161 | s503078920 | Accepted | n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [float('Inf')] * (10 ** 5 + 1)
dp[0] = 0
for i in range(n):
for j in range(1, k + 1):
if i + j < n:
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i]))
print(dp[n - 1])
|
p03161 | s152586500 | Accepted | from sys import stdin,stdout
st=lambda:list(stdin.readline().strip())
li=lambda:list(map(int,stdin.readline().split()))
mp=lambda:map(int,stdin.readline().split())
inp=lambda:int(stdin.readline())
pr=lambda n: stdout.write(str(n)+"\n")
mod=1000000007
INF=float('inf')
n,k=mp()
l=li()
dp=[INF for i in range(n)]
dp[0]=0
for i in range(n):
for j in range(i+1,min(i+k+1,n)):
dp[j]=min(abs(l[i]-l[j])+dp[i],dp[j])
print(dp[-1])
|
p03161 | s128627540 | Accepted | n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [0]*n
dp[1] = abs(h[1]-h[0])
for i in range(2, n):
dp[i] = min(dp[i-j]+abs(h[i]-h[i-j]) for j in range(1, min(i, k)+1))
print(dp[-1])
|
p03161 | s648885861 | Accepted | n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [float('Inf')] * n
dp[0] = 0
for i in range(n):
for j in range(i+1, i+k+1):
if j < n:
dp[j] = min(dp[j], dp[i]+abs(h[i]-h[j]))
print(dp[-1]) |
p03161 | s530793850 | Accepted | n ,k= map(int,input().split())
h = list(map(int,input().split()))
#print(h)
inf = float("inf")
dp = [inf]*(n+1)
dp[0] = 0
for i in range(1,n):
for j in range(1,k+1):
if i-j >=0:
dp[i] = min(dp[i],dp[i-j] + abs(h[i] - h[i-j]))
#print(dp)
print(dp[n-1]) |
p03161 | s451923812 | Accepted | n,k,*h=map(int,open(0).read().split())
a=[0]*n
for i in range(1,n):
j=max(0,i-k)
e=h[i]
a[i]=min(A+abs(e-H) for A,H in zip(a[j:i],h[j:i]))
print(a[-1])
|
p03161 | s592478371 | Accepted | def chmin(a,b):
if a > b:
return b
else:
return a
N, K = map(int, input().split())
h = list(map(int, input().split()))
INF = float('inf')
dp = [INF] * N
dp[0] = 0
for i in range(N):
for j in range(1,K+1):
if i+j < N:
dp[i+j] = chmin(dp[i+j], dp[i] + abs(h[i] - h[i+j]))
print(dp[N-1]) |
p03161 | s621184443 | Accepted | N,K=list(map(int, input().split()))
h=list(map(int, input().split()))
dp=[0]+[float("inf")]*(N-1)
for i in range(N-1):
for j in range(i,i+K):
if j+1>N-1:
break
dp[j+1]=min(abs(h[j+1]-h[i])+dp[i],dp[j+1])
print(dp[-1]) |
p03161 | s769628450 | Accepted | import sys
data = sys.stdin.readlines()
n, k = list(map(int, data[0].split()))
h = list(map(int, data[1].split()))
dp = [-1] * n
dp[0] = 0
for i in range(1, min(n, k)):
dp[i] = min([dp[j] + abs(h[i]-h[j]) for j in range(i)])
for i in range(k, n):
dp[i] = min([dp[i-j] + abs(h[i]-h[i-j]) for j in range(1, k+1)])
print(dp[n-1]) |
p03161 | s794123951 | Accepted | N,K=map(int,input().split())
H=list(map(int,input().split()))
dp=[0]*N
for i in range(N-1):
A=[]
for j in range(K):
if i-j>=0:
A.append(dp[i-j]+abs(H[i-j]-H[i+1]))
dp[i+1]=min(A)
print(dp[N-1]) |
p03161 | s214256509 | Accepted | N, K = map(int, input().rstrip().split(' '))
frog_lst = list(map(int, input().rstrip().split(' ')))
frog_jump_lst = []
def frog_jump(frog_jump_lst=[], index=0):
if not frog_jump_lst:
frog_jump_lst.append(0)
else:
now_pos = frog_lst[index]
k = min(K, len(frog_jump_lst))
pattern = [abs(now_pos - frog_lst[index-i]) + frog_jump_lst[-i] for i in range(1,k+1)]
frog_jump_lst.append(min(pattern))
for j in range(N):
frog_jump(frog_jump_lst, j)
print(frog_jump_lst[-1]) |
p03161 | s612079088 | Accepted | import sys
input = sys.stdin.readline
n,k = map(int,input().split())
h = list(map(int,input().split()))
dp = [10**10] * n
dp[0] = 0
for i in range(n):
for j in range(1,k+1):
if i + j < n:
dp[i+j] = min(dp[i+j], dp[i] + abs(h[i+j] - h[i]))
print(dp[-1])
|
p03161 | s749788374 | Accepted | n, k = map(int,input().split())
h = list(map(int,input().split()))
INF = float('inf')
dp = [INF] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(2,n):
for j in range(1, min(i, k) + 1):
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i -j]))
print(dp[n - 1])
|
p03161 | s467628949 | Accepted | n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [float('inf')] * n
dp[0] = 0
for i in range(1, n):
for j in range(1, k+1):
if(i-j < 0):
break
dp[i] = min(dp[i], dp[i-j] + abs(h[i-j] - h[i]))
print(dp[-1])
|
p03161 | s815149023 | Accepted | N,K = map(int,input().split())
h = list(map(int,input().split()))
cost = [0]
for i in range(2,N+1):
cost.append( min([cost[j] + abs(h[i-1]-h[j]) for j in range(max(0,i-K-1), i-1)]) )
print(cost[-1])
|
p03161 | s575367935 | Accepted | n, k = map(int, input().split())
h = [int(i) for i in input().split()]
dp = [0] * n
for i in range(1, n):
dp[i] = min([dp[i-j]+abs(h[i]-h[i-j]) for j in range(1, min(i, k)+1)])
print(dp[n-1]) |
p03161 | s506274670 | Accepted | N,K=map(int,input().split())
h=[int(i) for i in input().split()]
f_inf=float('inf')
dp=[f_inf]*(N+10)
dp[0]=0
for i in range(1,N):
for j in range(1,K+1):
if i-j>=0:
dp[i]=min(dp[i-j]+abs(h[i]-h[i-j]),dp[i])
print(dp[N-1]) |
p03161 | s440180384 | Accepted | N, K = map(int, input().split())
h = list(map(int, input().split()))
h.insert(0, float("inf"))
dp = [float("inf")] * (N + 1)
dp[1] = 0
for i in range(2, N + 1):
for k in range(1, K + 1):
if i - k >= 0:
dp[i] = min(dp[i], dp[i - k] + abs(h[i - k] - h[i]))
else:
break
print(dp[N]) |
p03161 | s391338459 | Accepted | import numpy as np
n, k = map(int, input().split())
h = np.array(input().split(), dtype=np.int64)
dp = np.zeros(n, dtype=np.int64)
for i in range(1, n):
l = max(0, i-k)
dp[i] = np.min(np.abs(h[i] - h[l:i]) + dp[l:i])
print(dp[-1]) |
p03161 | s457121754 | Accepted | [N,K]=[int(i) for i in input().split()]
h=[int(i) for i in input().split()]
DP=[1000000000 for i in range(N)]
DP[0]=0
for i in range(N):
for j in range(max(i-K,0),i):
DP[i]=min(DP[j]+abs(h[i]-h[j]),DP[i])
print(DP[N-1]) |
p03161 | s728580360 | Accepted | # coding: utf-8
import numpy as np
n, k = map(int, input().split())
h_list = np.array([int(x) for x in input().split()])
ans = np.zeros(n, dtype=int)
for i in range(1, n):
start = max(i-k, 0)
ans[i] = np.min(ans[start:i] + np.abs(h_list[start:i] - h_list[i]))
# print(ans)
print(ans[-1]) |
p03161 | s138879552 | Accepted | n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [0 for _ in range(n)]
for i in range(1, n):
hi = h[i]
x = 2 * 10 ** 9
for j in range(1, min(k, i) + 1):
x = min(x, dp[i - j] + abs(hi - h[i - j]))
dp[i] = x
print(dp[-1])
|
p03161 | s382503906 | Accepted | #frog1からジャンプの回数が変数kになった
n,k=map(int,input().split())
h=list(map(int,input().split()))
INF=float('INF')
dp=[INF]*n
dp[0]=0
for i in range(1,n):
for j in range(1,k+1):
if i-j<0:#out of indexを防ぐ
continue
dp[i]=min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))#dp[i]と大小を比較する
print(dp[n-1]) |
p03161 | s433881626 | Accepted | #!/usr/bin/env python3
def main():
N, K = map(int, input().split())
h = list(map(int, input().split()))
INF = 1 << 60
dp = [INF] * 100010
dp[0] = 0
for i in range(N):
for j in range(1, K + 1):
if i + j < N:
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]))
print(dp[N - 1])
if __name__ == "__main__":
main()
|
p03161 | s923097062 | Accepted | [n,k] = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
"""
初期条件
dp[0] = 0
dp[1] = h[1] - h[0]
"""
dp = [10 ** 9 + 7] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
if n > 2:
for i in range(2,n):
for j in range(1,min(i - 0,k)+1):
dp[i] =min(dp[i - j] + abs(h[i]-h[i - j]),dp[i])
print(dp[n-1])
else:
print(dp[1])
|
p03161 | s393254159 | Accepted | import sys
N, K = map(int, sys.stdin.readline().split())
h = tuple(map(int, sys.stdin.readline().split()))
cost = [None]*N
cost[0] = 0
for i in range(N):
for j in range(1, K+1):
if i + j > N-1:
break
tmp = cost[i] + abs(h[i] - h[i+j])
if cost[i+j] == None or cost[i+j] > tmp:
cost[i+j] = tmp
print(cost[N-1]) |
p03161 | s533725262 | Accepted | n,k = map(int,input().split())
h = list(map(int,input().split()))
dp = [10**9] * n
dp[0] = 0
for i in range(1,n):
for j in range(max(0,i-k),i):
dp[i] = min(dp[j] + abs(h[i] - h[j]), dp[i])
print(dp[-1]) |
p03161 | s742686935 | Accepted | n,k=map(int,input().split())
l=list(map(int,input().split()))
dp=[0]*n
for i in range(1,n):
start=max(0,i-k)
dp[i]=min(dp[j]+abs(l[i]-l[j]) for j in range(start,i))
print(dp[-1]) |
p03161 | s229326785 | Accepted | N, K = map(int, input().split())
h = list(map(int, input().split()))
dp = [float("inf")] * N
dp[0] = 0
for i in range(N):
for j in range(1, K + 1):
if i + j >= N:
break
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]))
print(dp[-1]) |
p03161 | s593366422 | Accepted | import itertools,sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,K = LI()
h = LI()
dp = [float('INF')]*N
dp[0] = 0
for i,j in itertools.product(range(1,N),range(1,K+1)):
if i-j>=0:
dp[i] = min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
print(dp[-1])
|
p03161 | s324640439 | Accepted | import sys
N, K = map(int, input().split())
steps = list(map(int, input().split()))
dp = [sys.maxsize] * N
dp[0] = 0
for i in range(1, N):
limit = K if K <= i else i
for j in range(1, limit + 1):
a = abs(steps[i] - steps[i - j]) + dp[i - j]
dp[i] = a if a < dp[i] else dp[i]
print(dp[N - 1])
|
p03161 | s989519466 | Accepted | # N = int(input())
N, K = [int(i) for i in input().split()]
h = [0] + [int(i) for i in input().split()]
INF = 10 ** 9
dp = [INF for i in range(N+1)]
dp[1] = 0
for j in range(1, N+1):
for i in range(1, K+1):
if j > i:
dp[j] = min(dp[j], dp[j-i] + abs(h[j] - h[j-i]))
print(dp[N])
|
p03161 | s695399633 | Accepted | import sys
sys.setrecursionlimit(2000000001)
def solve(n,k,ar,dp,x):
ab = abs; mn = min
if x>=n-2: return dp[x]
if not dp[x] is -1: return dp[x]
dp[x] = mn(map(lambda i:ab(ar[x]-ar[i])+solve(n,k,ar,dp,i), range(x+1,mn(n,x+k+1))))
return dp[x]
def main():
I = lambda:map(int,sys.stdin.readline().split())
pr = lambda x:sys.stdout.write(f'{x}\n')
n,k, ar = *I(), [*I()]
dp = [-1]*(n-2) + [abs(ar[-2]-ar[-1]),0]
pr(solve(n,k,ar,dp,0))
main() |
p03161 | s277528833 | Accepted | import sys
n,k=map(int,input().split())
l=list(map(int,input().split()))
dp=[sys.maxsize]*n
dp[0]=0
for i in range(n):
for j in range(i+1,i+k+1):
if j<n:
dp[j]=min(dp[j], dp[i]+ abs(l[i]-l[j]))
print(dp[-1])
|
p03161 | s604033094 | Accepted | import sys
INF = sys.maxsize
N, K = (int(x) for x in input().split())
heights = [int(x) for x in input().split()]
memo = [INF] * N
for i in range(N - 1, -1, -1):
if i == N - 1:
# ゴールからゴールの距離を0で初期化
memo[i] = 0
continue
cost = INF
for j in range(1, K + 1):
# 範囲外
if i + j >= N:
continue
cost = min(cost, memo[i + j] + abs(heights[i] - heights[i + j]))
memo[i] = cost
print(memo[0])
|
p03161 | s450328216 | Accepted | N,K=map(int,input().split())
h=list(map(int,input().split()))
cost=[0,abs(h[1]-h[0])]
for i in range(2,N):
cand=10**10
for j in range(K):
if j==i:
break
cand=min(cand,cost[i-j-1]+abs(h[i]-h[i-j-1]))
cost.append(cand)
print(cost[-1]) |
p03161 | s858263906 | Accepted | [N,K] = list(map(int,input().split()))
h = list(map(int,input().split()))
#配るdp
inf = float('inf')
dp = [inf]*N
dp[0] = 0
for i in range(0,N-1):
for j in range(i+1, min(i+K+1,N)):
dp[j] = min(dp[i]+abs(h[i]-h[j]), dp[j])
print(dp[N-1])
|
p03161 | s013717487 | Accepted | def main():
n,k = map(int,input().split())
h = [int(i) for i in input().split()]
INF = float('inf')
dp = [INF for i in range(n)]
dp[0] = 0
dp[1] = abs(h[0]-h[1])
for i in range(2,n):
dp[i] = min(dp[i-j]+abs(h[i-j]-h[i]) for j in range(1,min(i,k)+1))
print(dp[n-1])
main()
|
p03161 | s185438681 | Accepted | #-*-coding:utf-8-*-
import numpy as np
def main():
n,k = map(int,(input().split()))
ashiba=np.array((input().split()),int)
dp=np.zeros(n,dtype=int)
for i in range(1,n):
start=max(0,i-k)
dp[i]=min(dp[start:i]+abs(ashiba[i]-ashiba[start:i]))
print(dp[n-1])
if __name__ == "__main__":
main() |
p03161 | s304609396 | Accepted | import sys,queue,math,copy,itertools,bisect,collections,heapq
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N,K = LI()
h = LI()
dp = [INF for _ in range(N)]
dp[0] = 0
for i in range(N-1):
for j in range(i+1,i+K+1):
if j < N:
dp[j] = min(dp[j],dp[i]+abs(h[i]-h[j]))
print(dp[-1]) |
p03161 | s482377050 | Accepted | n, k = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [0] * n
for i in range(n):
if i == 0:
dp[i] = 0
elif i == 1:
dp[i] = abs(H[0] - H[i])
else:
cands = []
for j in range(1, k+1):
if i - j >= 0:
cost = dp[i - j] + abs(H[i - j] - H[i])
cands.append(cost)
dp[i] = min(cands)
print(dp[-1]) |
p03161 | s485625974 | Accepted | N, K = map(int, input().split())
H = tuple(map(int, input().split()))
table = [0] * N
for i in range(1, N):
table[i] = min(abs(H[i] - H[j]) + table[j] for j in range(max(0, i - K), i))
print(table[N-1])
|
p03161 | s649791217 | Accepted | import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()
def main():
N,K=map(int,input().split())
h=list(map(int,input().split()))+[INF]*K
dp=[INF]*(2*10**5)
dp[0]=0
for i in range(N):
for k in range(1,K+1):
dp[i+k]=min(dp[i+k],dp[i]+abs(h[i+k]-h[i]))
print(dp[N-1])
if __name__ == '__main__':
main()
|
p03161 | s676886039 | Accepted | n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [0]*(10**6)
dp[0] = 0
for i in range(1, n):
dp[i] = 10**9
for j in range(1, k+1):
if i-j >= 0:
dp[i] = min(dp[i], dp[i-j]+abs(h[i]-h[i-j]))
print(dp[n-1])
|
p03161 | s803251675 | Accepted | INFTY = 10**9
N, K = map(int, input().split())
H = list(map(int, input().split()))
dp = [INFTY] * N
dp[0] = 0
for i in range(1,N):
j = 1
while j <= K and i-j >= 0:
dp[i] = min(dp[i], dp[i-j]+abs(H[i-j]-H[i]))
j += 1
print(dp[N-1]) |
p03161 | s622478958 | Accepted | # coding:utf-8
N, K = (int(x) for x in input().split())
h = [int(x) for x in input().split()]
inf = 100000000000000
dp = [inf for x in range(N)]
dp[0] = 0
for i in range(0, N):
for j in range(1, K+1):
if i + j < N:
dp[i+j] = min(dp[i+j], dp[i] + abs(h[i] - h[i+j]))
print(dp[N-1]) |
p03161 | s006643368 | Accepted | from sys import maxint
N, K = map(int,raw_input().split())
stones = map(int,raw_input().split())
costs = [maxint] * N
costs[0] = 0
for n in range(N) :
for k in range(1,min(K, N-n-1)+1) :
costs[n+k] = min(costs[n+k], costs[n] + abs(stones[n]-stones[n+k]))
print costs[-1] |
p03161 | s293284499 | Accepted | n,k = map(int,input().split())
h = list(map(int,input().split()))
dp = [0,abs(h[1]-h[0])]
for i in range(2,n):
u = []
for j in range(1,min(i,k)+1):
u.append(dp[i-j]+abs(h[i]-h[i-j]))
dp.append(min(u))
print(dp[n-1]) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.