problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03161 | s029026842 | Accepted | N,K=map(int, input().split())
h=list(map(int,input().split()))
dp=[float('inf') for i in range(N)]
dp[0]=0
if(N<K):
K=N-1
for i in range(1,N):
for j in range(1,K+1):
dp[i]=min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
print(dp[N-1]) |
p03161 | s081534318 | Accepted | N,K = map(int,input().split())
A = list(map(int, input().split()))
dp = [0 for _ in range(len(A))]
dp[0] = 0
for i in range(1,N):
tmp = [float("inf")]
for j in range(1,K+1):
if i - j>=0:
tmp.append(dp[i-j] + abs(A[i] - A[i-j]))
dp[i] = min(tmp)
print(dp[len(A)-1])
|
p03161 | s519955466 | Accepted | def main():
#import sys
#input = sys.stdin.readline
N,K=map(int,input().split())
h=list(map(int,input().split()))
DP=[0]*N
DP[0]=0
for i in range(1,N):
#j=1
#while j<=K and j<=i:
# DP[i]=min(DP[i],abs(h[i]-h[i-j])+DP[i-j])
#for j in range(max(0, i-K),i):
#DP[i]=min(DP[i],abs(h[i]-h[j])+DP[j])
r=max(0, i-K)
DP[i]=min([abs(h[i]-h[j])+DP[j] for j in range(r,i)])
print(DP[-1])
if __name__ == '__main__':
main()
|
p03161 | s793355433 | Accepted | import sys
N,k=map(int,input().split())
l=[int(x) for x in input().split()]
l1=[sys.maxsize]*(N)
l1[0]=0
for i in range(N):
for j in range(i+1,i+k+1):
if j<N:
l1[j]=min(l1[j],l1[i]+abs(l[j]-l[i]))
print(l1[N-1])
|
p03161 | s209058127 | Accepted | mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
import numpy as np
n,k=mi()
h=np.array(li())
dp = np.array([0]*n)
for i in range(1,n):
st = max(0,i-k)
dp[i] = min(dp[st:i]+abs(h[i] - h[st:i]))
print(dp[n-1])
|
p03161 | s060871200 | Accepted | N, K = map(int, input().split())
h = list(map(int, input().split()))
INF = 10 ** 18
dp = [INF] * N
dp[0] = 0
for i in range(1, N):
left = max(0, i - K)
for j in range(left, i):
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]))
print(dp[N - 1])
|
p03161 | s537732706 | 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):
s = max(0,i-K)
dp[i] = np.min(dp[s:i] + np.abs(H[i]-H[s:i]))
print(dp[-1]) |
p03161 | s386331586 | Accepted | N, K = map(int,input().split())
h_list = list(map(int,input().split()))
INF = 100001010000100
dp = [INF]*N
dp[0] = 0
for i in range(1,N):
start = max(0,i-K)
dp[i] = min([dp[j]+abs(h_list[i]-h_list[j]) for j in range(start,i)])
print(dp[N-1]) |
p03161 | s432924135 | Accepted | def main():
infinity = 1e10
n, k, height = getInputs()
cost = [infinity] * n
cost[0] = 0
cost[1] = abs(height[0] - height[1])
for i in range(2, n):
for j in range(i - 1, i - k - 1, -1):
if j >= 0:
cost[i] = min(cost[i], cost[j] + abs(height[i] - height[j]))
print(cost[-1])
def getInputs():
n, k = map(lambda x: int(x), input().split())
height = tuple(map(lambda x: int(x), input().split()))
return n, k, height
main()
|
p03161 | s698789961 | Accepted | N, K = map(int, input().split())
H = list(map(int, input().split()))
INF = 10 ** 10
dp = [INF] * N
dp[0] = 0
for i in range(1, N):
for j in range(min(K, i) + 1):
dp[i] = min(dp[i], dp[i-j] + abs(H[i] - H[i-j]))
print(dp[N-1]) |
p03161 | s974234702 | Accepted | n, k = map(int, input().split())
h = list(map(int, input().split()))
x = float("inf")
dp = [x] * n
dp[0] = 0
for i in range(1, n):
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])
|
p03161 | s392828558 | Accepted | import numpy as np
N, K = map(int, input().split())
lst = np.array([int(x) for x in input().split()])
dp = np.zeros(N, dtype=int)
for i in range(1, N):
start = max(i - K, 0)
dp[i] = np.min(dp[start:i] + np.abs(lst[start:i] - lst[i]))
print(dp[-1])
|
p03161 | s559676976 | 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(1, k+1):
if i+j < n:
dp[i+j] = min(dp[i+j], dp[i]+abs(h[i]-h[i+j]))
print(dp[-1])
|
p03161 | s371406895 | Accepted | N, K = map(int, input().split())
h = list(map(int, input().split()))
dp = [0]*N
for i in range(1, N):
dp[i] = dp[i-1]+abs(h[i]-h[i-1])
L = min(K, i)
for j in range(2, L+1):
dp[i] = min(dp[i], dp[i-j]+abs(h[i]-h[i-j]))
print(dp[N-1]) |
p03161 | s579101059 | Accepted |
import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
N,K = map(int,input().split())
h = list(map(int,input().split()))
INF = 10**20
dp = [INF]*(N+10)
dp[0] = 0
def distance(x,y):
return abs(h[x]-h[y])
for i in range(1,N):
for k in range(1,K+1):
if i-k<0:break
dp[i] = min(dp[i], dp[i-k] + distance(i-k,i))
print(dp[N-1])
|
p03161 | s666908424 | Accepted | N, K = map(int, input().split())
arr = list(map(int, input().split()))
dp = [float('inf')] * N
dp[0] = 0
for i in range(0,N):
k = 1
while (i + k < N) and (k <= K):
dp[i+k] = min(abs(arr[i]-arr[i+k])+dp[i],dp[i+k])
k += 1
print(dp[N-1]) |
p03161 | s614537114 | Accepted | N, K = map(int,input().split())
H = list(map(int,input().split()))
#sub problem: min cost from 0 to i
memo = []
for i, num in enumerate(H):
if i == 0:
memo.append(0)
elif i == 1:
memo.append(abs(num - H[i-1]))
else:
m = min(abs(num - H[i-j])+ memo[i-j] for j in range(1, K+1) if i - j >= 0)
memo.append(m)
print(memo[-1]) |
p03161 | s410193932 | Accepted | def solve():
INF = 10**12
N, K = map(int, input().split())
Hs = list(map(int, input().split()))
dp = [INF] * N
dp[0] = 0
for i, H in enumerate(Hs):
dpi = dp[i]
for j in range(i+1, min(N, i+K+1)):
dp2 = dpi + abs(H-Hs[j])
if dp2 < dp[j]:
dp[j] = dp2
print(dp[N-1])
solve()
|
p03161 | s869859122 | Accepted | N,K=map(int,input().split())
h=list(map(int,input().split()))
DP=[10000000000]*N
DP[0]=0
for i in range(1,N):
temp=[]
if i<K:
for j in range(i):
temp.append(DP[j]+abs(h[j]-h[i]))
else:
for j in range(1,K+1):
temp.append(DP[i-j]+abs(h[i]-h[i-j]))
DP[i]=min(temp)
print(DP[N-1]) |
p03161 | s356354561 | Accepted | N, K = map(int, input().split())
h = list(map(int, input().split())) + [0]*101010
dp = [float("inf")]*101010
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)
print(dp[N-1]) |
p03161 | s610767117 | Accepted | import numpy as np
n, k = map(int, input().split())
h = np.array(list(map(int, input().split())), np.int64)
INF = 10 ** 18
dp = np.full(n, INF, np.int64)
dp[0] = 0
for i, e in enumerate(h[1:], 1):
lb = max(0, i - k)
dp[i] = np.min(dp[lb:i] + np.abs(h[lb:i] - e))
ans = dp[-1]
print(ans)
|
p03161 | s581833849 | Accepted | def main():
from builtins import abs
N, K = map(int, input().split())
h = list(map(int, input().split()))
dp = [0] * N
for i in range(1, N):
dp[i] = min(dp[j] + abs(h[i] - h[j]) for j in range(max(0, i - K), i))
print(dp[N - 1])
main()
|
p03161 | s778763254 | Accepted | n, k = map(int,input().split())
pedras = list(map(int,input().split()))
INF = 1e12
dp = [INF] * n
dp[0] = 0
dp[1] = abs(pedras[1] - pedras[0])
for i in range(2,n):
pulo = 0
for j in range(i-1,-1,-1):
pulo += 1
if pulo > k:
break
else:
dp[i] = min(dp[i], dp[j] + abs(pedras[i] - pedras[j]))
print(dp[n-1])
|
p03161 | s421338066 | Accepted | N, K = map(int, input().split())
h_list = list(map(int, input().split()))
dp = [float('INF') for i in range(N)]
dp[0] = 0
def update_dp(now, next):
global h_list
global dp
global N
if next > N - 1: return
if dp[next] > dp[now] + abs(h_list[next] - h_list[now]):
dp[next] = dp[now] + abs(h_list[next] - h_list[now])
return
for i in range(N):
for j in range(1, K + 1):
update_dp(i, i + j)
print(dp[N - 1]) |
p03161 | s381166471 | Accepted | # coding: utf-8
# Your code here!
N,K=map(int,input().split())
H=list(map(int,input().split()))
dp=[10**9]*(N)
dp[0]=0
for i in range(N):
for j in range(i+1,min(i+1+K,N)):
dp[j]=min(dp[i]+abs(H[j]-H[i]),dp[j])
print(dp[-1])
|
p03161 | s602340312 | 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(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 | s547021833 | Accepted | N,K=map(int,input().split())
H=list(map(int,input().split()))
dp = [float('inf')]*(N+1)
dp[0]=0
dp[1]=0
for i in range(N):
if i!=0:
for k in range(K):
if i-k>=1:
dp[i+1] = min ( dp[i+1] ,dp[i-k] + abs(H[i]-H[i-(k+1)]) )
print(int(dp[N]))
# print(dp) |
p03161 | s996233433 | Accepted | N, K = map(int, input().split())
H = list(map(int, input().split()))
dp = [0] * N
for i in range(1, N):
tmp = []
for j in range(K):
if (i - j - 1) < 0:
break
tmp.append(dp[i-j-1] + abs(H[i]-H[i-j-1]))
dp[i] = min(tmp)
# print("tmp", tmp)
# print("dp ", dp)
print(dp[-1]) |
p03161 | s106391619 | Accepted | import numpy as np
n, k = map(int, input().split())
h = np.array(list(map(int, input().split())))
dp = np.zeros(n)
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[n-1]))
|
p03161 | s636855358 | Accepted | n,k=map(int,input().split())
h=[int(i) for i in input().split()]
k=min(k,n-1)
dp=[0]
for i in range(1,k):
x=[]
for j in range(1,i+1):
x.append(dp[i-j]+abs(h[i-j]-h[i]))
dp.append(min(x))
for i in range(1,n-k+1):
m=k+i-1
x=[]
for j in range(1,k+1):
x.append(dp[m-j]+abs(h[m-j]-h[m]))
dp.append(min(x))
print(dp[-1])
|
p03161 | s902856836 | 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(1,N):
ddp=dp[i-1]+abs(h[i]-h[i-1])
for j in range(1,K+1):
if i-j<0:
continue
elif ddp>=dp[i-j]+abs(h[i]-h[i-j]):
ddp=dp[i-j]+abs(h[i]-h[i-j])
dp[i]=ddp
print(dp[-1]) |
p03161 | s823827832 | Accepted | # 配るDPで解く
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, min(i+1+K, N)):
dp[j] = min(dp[j], dp[i]+abs(H[j]-H[i]))
print(dp[N-1])
|
p03161 | s848864913 | Accepted | N,K = map(int,input().split())
import numpy as np
H = np.array(input().split(), dtype = int)
INF = 10 ** 9 + 1
dp = np.full(N,INF,dtype = int)
dp[0] = 0
for i in range(1, N):
dp[i] = min(dp[max(i - K,0):i] + np.abs(H[max(i - K,0):i] - H[i]))
print(dp[-1]) |
p03161 | s373238159 | Accepted | import numpy as np
N, K = map(int, input().split())
h = np.array(list(map(int, input().split())))
# dp = np.array([-1 for _ in range(N)])
dp = np.zeros(N, dtype=int)
dp[0] = 0
for i in range(1, N):
start = max(0, i-K)
dp[i] = min(dp[start: i] + np.abs(h[i] - h[start: i]))
print(dp[-1])
|
p03161 | s479697742 | Accepted | n,k = map(int, input().split())
h = list(map(int, input().split()))
dp = [float('inf') for i in range(n)]
dp[0] = 0
def chmin(a, b):
if a > b:
return b
else:
return a
for i in range(n-1):
if i == 0:
dp[i+1] = abs(h[i+1] - h[i])
else:
for j in range(k):
dp[i+1] = chmin(dp[i+1], dp[i-j] + abs(h[i+1] - h[i-j]))
print(dp[n-1]) |
p03161 | s742718914 | Accepted | # B - Frog2
import numpy as np
N, K = list(map(int, input().split()))
h = np.array(list(map(int, input().split()))+[0]*K)
dp = np.array([10**9]*(N+K))
dp[0] = 0
for i in range(N):
dp[i+1:i+K+1] = np.minimum(dp[i+1:i+K+1], dp[i]+abs(h[i+1:i+K+1]-h[i]))
print(dp[N-1]) |
p03161 | s338998909 | Accepted | n, K = map(int, input().split())
h = [int(x) for x in input().split()]
inf = float('inf')
dp = [inf] * n # initialize dp
dp[0] = 0
for i in range(1, n):
for k in range(1, K+1):
if i - k >= 0:
kouho = dp[i-k] + abs(h[i] - h[i-k])
dp[i] = min(kouho, dp[i])
else:
break
print(dp[-1]) |
p03161 | s271477490 | Accepted | import numpy as np
n, k = map(int, input().split())
h = [int(i) for i in input().split()]
dp = [0] * n
for i, val in enumerate(h):
if i > 0:
p = max(i-k, 0)
dp[i] = min(j + abs(l - val) for j, l in zip(dp[p:i], h[p:i]))
print(dp[-1]) |
p03161 | s467011612 | Accepted | import sys
def main():
INF=sys.maxsize
N,K=tuple(map(int,sys.stdin.readline().split()))
h=tuple(map(int,sys.stdin.readline().split()))
dp=[INF for _ in range(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+j],dp[i]+abs(h[i+j]-h[i])])
print(dp[N-1])
if __name__=='__main__':main() |
p03161 | s182587010 | Accepted | ##Educational-DP B
n,k = map(int,input().split())
h = tuple(map(int,input().split()))
dp = [float('inf')] * n
dp[0] = 0
for i in range(1,n):
for j in range(max(0,i-k),i):
dp[i] = min(dp[i],dp[j]+abs(h[i]-h[j]))
#print(dp)
print(dp[-1]) |
p03161 | s019281496 | Accepted | import numpy as np
n,k = map(int,input().split())
h = np.array(list(map(int, input().split())))
dp = np.array([np.inf] * n)
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
if i-k > 0:
dp[i] = min(dp[i-k:i]+abs(h[i]-h[i-k:i]))
else:
dp[i] = min(dp[0:i]+abs(h[i]-h[0:i]))
print(int(dp[n-1])) |
p03161 | s265353232 | Accepted | n, k = map(int, input().split())
h = [int(i) for i in input().split()]
dp = [0]
for i in range(1, n):
to = min(i, k) + 1
dp += [min([dp[-j] + abs(h[i] - h[i - j]) for j in range(1, to)])]
print(dp[-1]) |
p03161 | s346489945 | Accepted | (N,K) = map(int,input().split())
h = list(map(int,input().split()))
n = 2
cost = [0]*N
cost[1] = abs(h[1]-h[0])
for n in range(2,N):
costmin = 10**10
for i in range(max(0,n-K),n):
costmin = min(costmin,cost[i]+abs(h[n]-h[i]))
cost[n] = costmin
print(cost[N-1]) |
p03161 | s036936706 | Accepted | inf=float("inf")
n,k = map(int, input().split())
h = list(map(int, input().split()))
dp = [inf]*n
dp[0] = 0
for i in range(n-1):
for j in range(1, min(k + 1, n - i)):
dp[i+j] = min(dp[i+j],dp[i]+abs(h[i+j]-h[i]))
print(dp[n-1]) |
p03161 | s206045622 | Accepted | N,K=map(int,input().split())
H=list(map(int,input().split()))
Cost=[1e30 for i in range(N)]
Cost[0]=0
Cost[1]=abs(H[1]-H[0])
for i in range(2,N):
for k in range(1,min(i,K)+1):
Cost[i]=min(Cost[i], Cost[i-k] + abs(H[i]-H[i-k]))
print(Cost[N-1]) |
p03161 | s805397876 | Accepted | import numpy as np
N, K = list(map(int, input().split()))
h = np.array(list(map(int, input().split())))
dp = np.array([np.inf] * N)
dp[0] = 0
dp[1] = abs(h[1]-h[0])
for i in range(2,N):
if i - K >= 0:
dp[i] = min(dp[i-K:i]+abs(h[i]-h[i-K:i]))
else:
dp[i] = min(dp[0:i]+abs(h[i]-h[0:i]))
print(int(dp[N-1])) |
p03161 | s271130174 | Accepted | def main():
N, K = map(int, input().split())
h = list(map(int, input().split()))
dp = [10**9 for _ in range(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])
if __name__ == "__main__":
main()
|
p03161 | s631754044 | Accepted | N, K = map(int, input().split())
K = min(N, K)
*h, = map(int, input().split())
a = [abs(h[0] - h[k]) for k in range(K)]
for n in range(N - K):
a = a[1:] + [min([a[k] + abs(h[n + k] - h[n + K]) for k in range(K)])]
print(a[K - 1])
|
p03161 | s125506235 | Accepted | n, k = list(map(int, input().strip().split()))
mm = list(map(int, input().strip().split()))
dp = [float('inf')] * 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(mm[i+j] - mm[i]))
print(dp[n-1]) |
p03161 | s805694772 | Accepted | n,k=map(int,input().split())
h=list(map(int,input().split()))
dp=[float('inf') for i in range(n)]
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
for j in range(1,k+1):
if(i-j<0):
break
else:
dp[i]=min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
print(dp[n-1]) |
p03161 | s552437950 | Accepted | import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
# import numpy as np
def main():
n,k=map(int,input().split())
h=list(map(int,input().split()))
dp=[10**10]*(n+200)
dp[0]=0
for i in range(n):
for j in range(1,k+1):
if i+j<=n-1:
dp[i+j]=min(dp[i+j],dp[i]+abs(h[i+j]-h[i]))
print(dp[n-1])
if __name__ == "__main__":
main()
|
p03161 | s315541273 | Accepted | N, K = map(int, input().split())
h = list(map(int, input().split()))
DP = [0]
for i in range(N-1):
act = float("inf")
for k in range(K):
if i-k < 0 : continue
act = min(DP[-1-k] + abs(h[i-k]-h[i+1]) , act)
DP += [act]
print(DP[-1]) |
p03161 | s094928153 | Accepted | N,K = map(int, input().split())
H = list(map(int, input().split()))
L = [0]*N
for i in range (1,N):
L[i] = min(L[i-j] + abs(H[i] - H[i-j]) for j in range(1, min(i,K)+1))
print(L[N-1]) |
p03161 | s220754519 | Accepted | #Frog2
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.insert(0,0)
dp={1.0:0}
for val3 in range(2,n+1):
dp[val3]=float(1e9)
for val in range(2,n+1):
for val2 in range(1,min(val,k+1)):
dp[val]=min(dp[val],dp[val-val2]+abs(h[int(val)]-h[int(val-val2)]))
print(dp[n])
|
p03161 | s616483638 | Accepted | # PyPy で提出しないと通らない
import sys
input = sys.stdin.readline
n, k = map(int, input().strip().split())
hs = list(map(int, input().strip().split()))
dp = [0] * n
for i in range(1, n):
min_cost = 1e19
for j in range(1, min(k + 1, i + 1)):
cost = dp[i - j] + abs(hs[i] - hs[i - j])
min_cost = min(cost, min_cost)
dp[i] = min_cost
print(dp[n - 1])
|
p03161 | s595291861 | Accepted | #B
n,k=map(int,input().split())
h_list=list(map(int,input().split()))
h1=abs(h_list[0]-h_list[1])
cst_list=[0,h1]
for i in range(2,n):
x_list=[]
for j in range(1,min(i+1,k+1)):
x=cst_list[i-j]+abs(h_list[i]-h_list[i-j])
x_list.append(x)
cst_list.append(min(x_list))
print(cst_list[n-1]) |
p03161 | s239261123 | Accepted | N,K = [int(_n) for _n in input().split()]
h = [int(_n) for _n in input().split()]
dp = [0]*N
dp[1] = abs(h[1]-h[0])
for i in range(1,N):
dp[i] = dp[i-1]+abs(h[i]-h[i-1])
for j in range(max(i-K,0), i):
dp[i] = min(dp[i], dp[j]+abs(h[i]-h[j]))
print(dp[N-1])
|
p03161 | s130489274 | Accepted | def main():
n, k, *h = map(int, open(0).read().split())
dp = [float("inf")] * n
dp[0] = 0
for i in range(1, n):
min_j = max(0, i-k)
dp[i] = min([dp[j] + abs(h[i] - h[j]) for j in range(min_j, i)])
print(dp[n-1])
main() |
p03161 | s637405269 | Accepted | N, K = map(int, input().split())
h = list(map(int, input().split()))
# DP
inf = float("inf")
dp = [inf for _ in range(N)]
dp[0] = 0
for i in range(1, N):
for k in range(1, K+1):
if i - k < 0:
break
dp[i] = min(dp[i], dp[i-k] + abs(h[i] - h[i-k]))
print(dp[-1]) |
p03161 | s603396170 | Accepted | n,k=map(int,input().split())
h=list(map(int,input().split()))
dp=[int(10e8)]*n
dp[0]=0
for i in range(1,n):
for j in range(min(i,k)):
dp[i]=min(dp[i],dp[i-j-1]+abs(h[i]-h[i-j-1]))
print(dp[n-1])
|
p03161 | s797980345 | Accepted | # Frog2
N, K = map(int, input().split())
h = list(map(int, input().split()))
inf = float("inf")
dp = [inf for _ in range(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 | s956074840 | Accepted | import numpy as np
n,k=map(int,input().split())
h=np.array(list(map(int,input().split())))
dp=np.zeros(n,dtype="int32")
for i in range(1,n):
start=0 if k>i else i-k
dp[i]=np.min(dp[start:i]+np.abs(h[i]-h[start:i]))
print(dp[-1]) |
p03161 | s979311971 | Accepted | n, k = map(int,input().split())
h = list(int(i) for i in input().split())
dp = [0] * n
for i in range(0, n - 1):
if(i > 0):
dp[i + 1] = min(dp[i - x] + abs(h[i + 1] - h[i - x]) for x in range(k) if (i - x) >= 0)
else:
dp[i + 1] = (abs(h[i + 1] - h[i]))
print(dp[n - 1])
|
p03161 | s467259448 | Accepted | def main():
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[n-1])
if __name__ == "__main__":
main() |
p03161 | s845712863 | Accepted | #python3
INF = int(1e9)
def main():
n, k = map(int, input().split())
h = [int(i) for i in input().split()] + [0]* 110
dp = [INF] * 110000
dp[0] = 0
for i in range(n):
for j in range(1, k+1):
dp[i+j] = min(dp[i+j], dp[i] + abs(h[i] - h[i+j]))
print(dp[n-1])
main()
|
p03161 | s009774395 | 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-1):
for j in range(1,min(K+1,N-i)):
dp[i+j]=min(dp[i+j],dp[i]+abs(H[i+j]-H[i]))
print(dp[-1]) |
p03161 | s610396255 | Accepted | N,K = map(int,input().split())
h = list(map(int,input().split()))
dp = [float("inf")]*(10**5+10)
dp[0] = 0
for i in range(N-1):
Mi = min(K+1,N-i)
for j in range(1,Mi):
dp[i+j] = min(dp[i+j],dp[i]+abs(h[i+j]-h[i]))
print(dp[N-1])
|
p03161 | s961107239 | Accepted | n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [float("inf") for _ in range(n)]
dp[0] = 0
for i in range(n-1):
for j in range(1, min(k+1, n-i)):
dp[i+j] = min(dp[i+j], dp[i] + abs(h[i+j] - h[i]))
print(dp[n-1]) |
p03161 | s704333221 | Accepted | N, K = map(int, input().split())
h = list(map(int, input().split()))
cost = [0] + [float("inf")] * (N-1)
for i in range(1, N):
for back in range(1, K+1):
try:
cost[i] = min(cost[i], cost[i-back] + abs(h[i] - h[i-back]))
except IndexError:
break
print(cost[-1]) |
p03161 | s460162620 | Accepted | #2回目
n,k=map(int,input().split())
h=list(map(int,input().split()))
dp=[-1]*n
for i in range(min(k,n)):
dp[i]=abs(h[i]-h[0])
#print(dp)
for i in range(k,n):
#print(i)
mindp=10**9
for j in range(i-k,i):
#print(j)
mindp=min(mindp , abs(h[i]-h[j])+dp[j])
dp[i]=mindp
# print(dp[i])
#print(dp)
print(dp[-1])
|
p03161 | s424891492 | Accepted | N,K=map(int,input().split())
h=list(map(int,input().split()))
dp=[float('inf')]*(N+1)
dp[0]=0
for i in range(N-1):
for j in range(1,K+1):
if i+j>N-1:
break
else:
dp[i+j]=min(dp[i+j],dp[i]+abs(h[i]-h[i+j]))
print(dp[N-1]) |
p03161 | s158936937 | Accepted | N, K = map(int, input().split())
H = list(map(int, input().split()))
cost = [0] * N
for i in range(1, N):
#print('i=', i)
st = max(i - K, 0)
ci = 10**18
for j in range(st, i):
if cost[j] < ci:
cj = cost[j] + abs(H[i] - H[j])
#print('cj=', cj)
ci = min(cj, ci)
#print('ci=', ci)
cost[i] = ci
#print(cost)
ans = cost[N-1]
print(ans) |
p03161 | s867133022 | Accepted | N, K = map(int, input().split())
h = list(map(int, input().split()))
dp = [float('inf')]* N
dp[0] = 0
for j in range(1, N):
for i in range(max(0, j-K), j):
dp[j] = min(dp[i]+abs(h[j]-h[i]), dp[j])
print(dp[-1]) |
p03161 | s416915839 | Accepted | n, k = list(map(int, input().split()))
nums = list(map(int, input().split()))
dp = [float('inf') for _ in range(n)]
dp[0] = 0
for i in range(1, n):
for j in range(max(0, i-k), i):
dp[i] = min(dp[i], dp[j] + abs(nums[i]-nums[j]))
print(dp[-1])
|
p03161 | s613806839 | Accepted | n,K=map(int,input().split())
h=list(map(int,input().split()))
h.insert(0,0)
dp=[float('inf') for i in range(n+1)]
dp[1]=0
for i in range(1,n):
for k in range(1,min(K+1,n-i+1)):
dp[i+k]=min(dp[i+k],dp[i]+abs(h[i+k]-h[i]))
print(dp[n]) |
p03161 | s121053786 | Accepted | import sys
input=sys.stdin.readline
def main():
n,k=map(int,input().split())
H=list(map(int,input().split()))
dp=[10**9]*(n)
dp[0]=0
for i in range(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[-1])
main() |
p03161 | s975873263 | Accepted | N,K = list(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(min(i+1,K)):
DP[i+1] = min(DP[i+1],DP[i-j]+abs(h[i+1]-h[i-j]))
print(DP[N-1]) |
p03161 | s728049718 | Accepted | n,k=map(int,input().split())
l=list(map(int,input().split()))
dp=[float('inf') for i in range(n+1)]
dp[0]=0
for i in range(len(dp)):
for j in range(i+1,i+k+1):
if(j<len(l)):
dp[j]=min(dp[j],dp[i]+abs(l[j]-l[i]))
print(dp[n-1]) |
p03161 | s428749418 | Accepted | n,k = [int(x) for x in input().strip().split()]
H = [int(x) for x in input().strip().split()]
inf = int(10e9 + 7)
dp = [inf] * n
dp[0] = 0
for i in range(n):
for j in range(i+1,min(n,i+k+1)):
dp[j] = min (dp[j], dp[i] + abs(H[i] - H[j]))
print (dp[-1]) |
p03161 | s983165229 | Accepted | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
n, k = map(int, input().split())
dp = [INF] * n
dp[0] = 0
H = list(map(int, input().split()))
for i in range(n):
for pi in range(i - k, i):
if pi < 0:
continue
dp[i] = min(dp[i], dp[pi] + abs(H[i] - H[pi]))
print(dp[n - 1])
resolve() |
p03161 | s826557655 | Accepted | import math
N, K = map(int, input().split())
H = list(map(int, input().split()))
INF = math.inf
dp = [INF]*N
dp[0] = 0
for i in range(N-1):
for j in range(1, min(K+1, N-i)):
dp[i+j] = min(dp[i+j], dp[i] + abs(H[i+j] - H[i]))
print(dp[-1]) |
p03161 | s783463895 | 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(i - k, 0), i):
dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]))
print(dp[-1]) |
p03161 | s574209756 | Accepted | N,K = map(int,input().split())
H = list(map(int,input().split()))
DP = [0]
for i in range(1,N):
a = DP[i-1] + abs(H[i]-H[i-1])
for j in range(2,min(K,i)+1):
b = DP[i-j] + abs(H[i]-H[i-j])
a = min(a,b)
DP.append(a)
print(DP[N-1]) |
p03161 | s271180017 | Accepted | n,h=map(int,input().split())
l=list(map(int,input().split()))
c=[10**9]*n
c[0]=0
c[1]=abs(l[0]-l[1])
for i in range(2,n):
c[i]=min( c[j]+abs(l[i]-l[j]) for j in range(max(0,i-h),i) )
print(c[-1])
|
p03161 | s845487624 | 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 >= 0:
dp[i] = chmin(dp[i], dp[i-j] + abs(h[i] - h[i-j]))
print(dp[N-1]) |
p03161 | s070613373 | Accepted | N, K = map(int,input().split())
h = list(map(int,input().split()))
INF = 10e9
dp=[INF]*N
dp[0]=0
for i in range (0,N):
for j in range(i+1, min(N,i+K+1)):
dp[j] = min(abs(h[i]-h[j])+dp[i],dp[j])
print(dp[N-1])
|
p03161 | s358097964 | Accepted | def main():
n, k = map(int, input().split())
stones = tuple(map(int, input().split()))
inf = 10**9
dp = [inf]*n
dp[0] = 0
for i in range(n):
for t in range(1, k+1):
step = i+t
if step < n:
v = dp[i]+abs(stones[i]-stones[step])
if v < dp[step]:
dp[step] = v
print(dp[-1])
if __name__ == '__main__':
main()
|
p03161 | s822643523 | Accepted | def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
dp = [0] * n
for i in range(1, n):
h = a[i]
dp[i] = min([dp[j] + abs(h - a[j]) for j in range(max(0, i-k), i)])
print(dp[n-1])
main() |
p03161 | s262881371 | Accepted | n, k = map(int, input().split())
arr = list(map(int, input().split()))
dp = [float('inf')]*n
dp[0] = 0
dp[1] = abs(arr[0]-arr[1])
for i in range(2, n):
for j in range(i-1, max(-1, i-k-1), -1):
dp[i] = min(dp[i], dp[j]+abs(arr[i]-arr[j]))
print(dp[-1])
|
p03161 | s268687413 | Accepted | N,K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
minTotalCostList = [0 for i in range(N)]
minTotalCostList[0] = 0
for i in range(1,N) :
for j in range(1,K+1) :
if j == 1 :
minTotalCostList[i] = (abs(h[i] - h[i-j]) + minTotalCostList[i-j] )
elif j > i or minTotalCostList[i] == 0 :
break
else :
minTotalCostList[i] = min(minTotalCostList[i], (abs(h[i] - h[i-j]) + minTotalCostList[i-j] ))
print(minTotalCostList[N-1]) |
p03161 | s753892443 | Accepted | n,k = map(int,input().split())
h = list(map(int,input().split()))
dp = [10**9]*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]-h[i+j]))
print(dp[-1])
|
p03161 | s252990717 | Accepted |
def totalcost_dp(cost,N,k):
dp = [float('inf')]*(N+1)
dp[1] = 0
for i in range(1,N+1):
for j in range(i+1,k+i+1):
if j < N+1:
dp[j] = min(dp[j],dp[i]+abs(cost[i]-cost[j]))
return dp[N]
n ,k= map(int,input().split())
cost = list(map(int,input().split()))
cost = [0]+cost
print(totalcost_dp(cost,n,k)) |
p03161 | s306975463 | Accepted | # EDPC B Frog 2
N, K = map(int, input().split())
H = list(map(int,input().split()))
cost = [float("inf")]*N
cost[0] = 0
cost[1] = abs(H[1]-H[0])
for i in range(2,N):
for k in range(1,min(K,i)+1):
cost[i] = min(cost[i], cost[i-k]+abs(H[i]-H[i-k]))
print(cost[N-1])
|
p03161 | s185328952 | Accepted | import numpy as np
N, K = map(int, input().split())
H = np.array(list(map(int, input().split())) + [0] * (K + 2), dtype = np.int64)
INF = 10 ** 9
cost = np.array([INF] * (N + K + 2), dtype = np.int64)
cost[0] = 0
for i in range(N):
cost[i + 1: i + K + 1] = np.minimum(cost[i + 1: i + K + 1], cost[i] + np.abs(H[i + 1: i + K + 1] - H[i]))
# print (cost)
print (cost[N - 1]) |
p03161 | s317414083 | Accepted | # -*- coding: utf-8 -*-
def main():
n, k = map(int, input().split())
h_list = list(map(int, input().split()))
dp = [0] + [9999999999] * (n - 1)
for i in range(n):
for j in range(1, k + 1):
if i - j >= 0:
dp[i] = min(dp[i], dp[i - j] + abs(h_list[i] - h_list[i - j]))
print(dp[-1])
if __name__ == '__main__':
main()
|
p03161 | s662321787 | Accepted | import sys
def input():
return sys.stdin.readline().strip()
def main():
size, jumps = map(int, input().split())
array = list(map(int, input().split()))
dp = [999999999] * size
dp[0]= 0
dp[1] = abs(array[0]- array[1])
for i in range(2,size):
dp[i] = min(abs(array[i] - array[j]) + dp[j] for j in range(max(0, i - jumps), i))
print(dp[size-1])
if __name__ == "__main__":
main()
|
p03161 | s613906207 | Accepted | n, k = map(int, input().split())
H = list(map(int, input().split()))
dp = [float("inf") for _ in range(n)] # 最小化問題なのでinfで初期化
dp[0] = 0 # 初期条件
for i in range(n - 1): # 配るDP
for j in range(1, min(k+1, n-i)):
dp[i + j] = min(dp[i + j], dp[i] + abs(H[i + j] - H[i]))
print(dp[n - 1]) |
p03161 | s235677478 | Accepted | N,K=map(int,input().split())
import numpy as np
H=np.array([10**9]*(K-1)+list(map(int,input().split())))
dp=np.zeros(N+K-1)
for i in range(N-1):
dp[i+K]=np.min(dp[i:i+K]+np.abs(H[i:i+K]-H[i+K]))
print(int(dp[-1])) |
p03161 | s408350244 | Accepted | def main():
(N, K) = map(int, input().split())
H = [int(x) for x in input().split()]
dp = [0] * N
for i in range(1, N):
ret = 10 ** 18
for j in range(K):
if i - 1 - j < 0:
break
ret = min(ret, dp[i-1-j] + abs(H[i] - H[i-1-j]))
dp[i] = ret
print(dp[-1])
if __name__ == '__main__':
main()
|
p03161 | s318130496 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
d=[999999999999999]*n
d[0]=0
for i in range(1,n):
for j in range(1,k+1):
if i-j<0:
break
d[i]=min(d[i],d[i-j]+abs(a[i]-a[i-j]))
print(d[n-1]) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.