problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03161 | s356108039 | Wrong Answer | import numpy as np
n, k = map(int, input().split())
arr = np.array([0] + list(map(int, input().split())) + [0] * 100)
INF = 1 << 60
dp = np.full(arr.shape[0] + 100, INF)
dp[1] = 0
for i in range(1, n + 1):
dp[i: i + k + 1] = np.minimum(dp[i: i + k + 1], dp[i] + np.abs(arr[i: i + k + 1] - arr[i]))
print(dp[n]) |
p03161 | s116898055 | Wrong Answer | inf=(10**7)+1
import sys
def get_array(): return list(map(int , sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()
n,k=get_ints()
h=get_array()
li=[inf]*n
li[0]=0
for i in range(1,n):
l=max(0,i-k)
for j in range(l,i):
li[i]=min(li[i],li[j]+abs(h[i]-h[j]))
##print(li)
print(li[n-1])
|
p03161 | s368084914 | Wrong Answer | n,k=map(int,input().split())
h=list(map(int,input().split()))
dp=[10**5]*n
for i in range(n):
if i==0:
dp[i]=0
elif i==1:
dp[i]=abs(h[1]-h[0])
else:
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[-1]) |
p03161 | s296639402 | Wrong Answer | N, K = map(int, input().split())
h = list(map(int, input().split()))
dp = [1e7]*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], dp[i-j]+abs(h[i]-h[i-j]))
print(dp[-1])
|
p03161 | s791809869 | Wrong Answer | n, k = map(int, input().split())
h = list(map(int, input().split()))
INF = 10 ** 7
D = [INF] * n
D[0] = 0
for i in range(n):
for j in range(1, k + 1):
if i >= j:
D[i] = min(D[i], D[i - j] + abs(h[i] - h[i - j]))
print(D[-1])
|
p03161 | s568185020 | Wrong Answer | N, K= map(int, input().split())
h = list(map(int, input().split()))
for i in range(K):
h.append(float('inf'))
dp = [0]
for i in range(N+K):
dp.append(float('inf'))
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)
print(dp[N-1]) |
p03161 | s804552905 | Wrong Answer | n, k = map(int, input().strip().split())
arr = list(map(int, input().strip().split()))
MAX = 10**5
dp = [MAX] * (n)
dp[0] = 0
for i in range(0, n):
for j in range(i, i + k + 1):
if j < n:
dp[j] = min( dp[j], dp[i] + ( abs( arr[j] - arr[i] ) ) )
print(dp[-1]) |
p03161 | s157652728 | Wrong Answer | 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(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 | s367722394 | Wrong Answer | 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**5
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 | s297318633 | Wrong Answer | N,K=map(int,input().split())
listH=list(map(int,input().split()))
cost=[10**5]*N
cost[0]=0
for i in range(1,N):
for k in range(K):
if i-k>=0:
cost[i]=min(abs(listH[i-k]-listH[i])+ cost[i-k],cost[i])
ans=cost[-1]
print(ans) |
p03161 | s313540221 | Wrong Answer |
import sys
def get_array(): return list(map(int , sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()
n,k=get_ints()
h=get_array()
li=[99999]*n
li[0]=0
li[1]=abs(h[1]-h[0])
for i in range(2,n):
l=max(0,i-k)
for j in range(l,i):
li[i]=min(li[i],li[j]+abs(h[i]-h[j]))
##print(li)
print(li[n-1])
|
p03161 | s988026341 | Wrong Answer | import numpy as np
N,K=map(int,input().split())
listH=list(map(int,input().split()))
cost=np.array([10**5]*N)
cost[0]=0
for i in range(1,N):
for k in range(1,min(i+1,K+1)):
cost[i]=min(abs(listH[i-k]-listH[i])+ cost[i-k],cost[i])
ans=cost[-1]
print(ans) |
p03161 | s442403370 | Wrong Answer | N,K = map(int, input().split())
h = list(map(int, input().split()))
dp = [float('inf')] * 10 ** 5
dp[0] = 0
for i in range(1, N):
tmp = i
if tmp > K:
tmp = K
for j in range(1,tmp + 1):
dp[i] = dp[i - j] + abs(h[i - j] - h[i])
print(dp[N-1])
|
p03161 | s032440759 | Wrong Answer | n,k = map(int,input().split())
h = list(map(int,input().split()))
# dp[i] = 足場i(0~n-1)に到着するコストの最小値
dp = [10*18]*(n)
dp[0] = 0
for i in range(n) :
for j in range(1,k+1) :
if i+j >= n :
continue
dp[i+j] = min(dp[i+j],dp[i]+abs(h[i]-h[i+j]))
print(dp[n-1]) |
p03161 | s697830394 | Wrong Answer | n,k = map(int,input().split())
arr = [int(i) for i in input().split()]
dp = [float("inf") for j in range(n)]
dp[0] = 0
for i in range(n):
dp[i] = float("inf")
for j in range(i+1,i+k+1):
if j < n:
val = (abs(arr[i]-arr[j]) + dp[i])
dp[j] = min(dp[j],val)
print(dp[n-1])
|
p03161 | s673716497 | Wrong Answer | n,k=map(int,input().split())
h=list(map(int,input().split()))
DP=[10**9+1]*n
DP[0]=0
DP[1]=abs(h[1]-h[0])
for i in range(1,n):
for j in range(max(0,i-k),min(i+1,n-1)):
DP[i]=min(DP[i],DP[i-j]+abs(h[i]-h[i-j]))
print(DP[-1]) |
p03161 | s353319423 | Wrong Answer | def main():
N,K = map(int, input().split())
h = list(map(int, input().split()))
cost = [10*8]*N
cost[0] = 0
for j in range(1,N):
for i in range(1,min(j,K)+1):
cp = cost[j-i] + abs(h[j]-h[j-i])
if cost[j] > cp : cost[j] = cp
print(cost[-1])
return
if __name__ == "__main__":
main() |
p03161 | s502370766 | Wrong Answer | #DP B
import sys
N, K = map(int, sys.stdin.readline().split())
H = list(map(int, sys.stdin.readline().split()))
dp = [-1 for _ in range(N)]
#print(dp)
#print(H)
dp[1] = abs(H[1]-H[0])
#print(dp)
for i in range(2, N):
for k in range(1, K+1):
if i-k>=0:
tmp = abs(H[i]-H[i-k]) + dp[i-k]
if dp[i] ==-1 or tmp < dp[i]:
dp[i] = tmp
#print(dp)
print(dp[-1]) |
p03161 | s821971070 | Wrong Answer | N,K=map(int,input().strip().split())
h=list(map(int,input().strip().split()))
inf=100000000
dp=[inf for n in range(N)]
dp[0]=0
for n in range(1,N):
chmin=inf
for k in range(1,K+1):
if n-k>=0:
chmin=min(chmin,dp[n-k]+abs(h[n]-h[n-k]))
dp[n]=chmin
print(dp[N-1]) |
p03161 | s105578821 | Wrong Answer | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
'''
------------------------
author : iiou16
------------------------
'''
import numpy as np
def main():
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
H = np.array(H)
cost = np.array([100000] * N)
cost[0] = 0
for i in range(1, N):
cost[i] = min(
cost[max(i - K, 0)] + abs(H[i] - H[max(i - K, 0): i]))
# print(i, cost[i])
print(cost[N - 1])
if __name__ == '__main__':
main()
|
p03161 | s030331043 | Wrong Answer | N, K = map(int,input().split())
h = list(map(int,input().split()))
dp = [10000000]*(N)
dp[0]=0
for i in range(0,N):
for j in range(0,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 | s471131787 | Wrong Answer | [N,K]=list(map(int, input().split()))
h=list(map(int, input().split()))
K=min(N,K)
dp=[[0 for i in range(K+1)] for j in range(N)]
for i in range (1,K):
for j in range (0,i):
dp[i][j]=dp[i-j-1][K]+abs(h[i-j-1]-h[i])
dp[i][K]=min(dp[i][0:i])
print(dp)
for i in range (K,N):
for j in range (0,K):
dp[i][j]=dp[i-j-1][K]+abs(h[i-j-1]-h[i])
dp[i][K]=min(dp[i][0:K])
print(dp[N-1][K]) |
p03161 | s534473067 | Wrong Answer | import sys
n,k = list(map(int, input().split(" ")))
l = list(map(int, input().split(" ")))
l = [999999]*k + l
print(l)
dp= [0]*(n+k)
for i in range( k + 1, n+k):
dp[i] = min([ dp[i - j] + abs(l[i] - l[i - j]) for j in range(1, k + 1) ])
print(dp[n + k - 1]) |
p03161 | s066731267 | Wrong Answer | def b_frog_2(stones, k):
dp = [0] * len(stones)
dp[0] = 0
for i in range(1, len(stones)):
for j in range(max(0, i - k), i):
dp[i] = min(dp[i], dp[j] + abs(stones[i] - stones[j]))
return dp[-1]
def main2():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
print(b_frog_2(h, K)) |
p03161 | s750803370 | Wrong Answer | N, K = map(int, input().split())
H = list(map(int, input().split()))
INF = 10**6
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:
continue
dp[i] = min(dp[i], dp[i-j] + abs(H[i-j] - H[i]))
print(dp[N-1]) |
p03161 | s182546767 | Wrong Answer | n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [0]
for i in range(1,n):
c = 100000
for j in range(1,min(k+1,i+1)):
c = min(abs(h[i] - h[i - j]) + dp[i - j], c)
dp.append(c)
print(dp[-1]) |
p03161 | s292652602 | Wrong Answer | ##Educational-DP B
n,k = map(int,input().split())
h = tuple(map(int,input().split()))
dp = [10**4 + 1] * 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[j]-h[i]))
#print(dp)
print(dp[-1]) |
p03161 | s473412347 | Wrong Answer | import sys
input = sys.stdin.readline
n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [0] * n
dp_memo = 10 ** 4
for i in range(1, n):
for j in range(min(k, i)):
memo = abs(h[i] - h[i - j - 1]) + dp[i - j - 1]
if dp_memo > memo:
dp_memo = memo
dp[i] = dp_memo
dp_memo = 10 ** 4
print(dp[n - 1])
|
p03161 | s578769868 | Wrong Answer | N,K = map(int, input().split())
H = list(map(int, input().split()))
dp_list = [10**4+1]*len(H)
dp_list[0]=0
## DP
for h in range(1,len(H)): ## 各位置ごとに計算していく
loop_cnt = min(K,h) ## 前の石にどれくらい戻れるか、の計算
cost = dp_list[h]
for m in range(1,loop_cnt+1):
cost_tmp = abs(H[h]-H[h-m])+dp_list[h-m]
cost = min(cost,cost_tmp)
dp_list[h] = cost
ans = dp_list[-1]
print(ans) |
p03161 | s761751460 | Wrong Answer |
MAX = 10 ** 6
def solve(arr, n, k):
if n == 2:
return arr[1] - arr[0]
dp = [MAX] * 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(arr[i] - arr[j]))
return dp[-1]
n, k = map(int, input().split())
arr = list(map(int, input().split()))
print(solve(arr, n, k)) |
p03161 | s755655737 | Wrong Answer | [n, k] = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
dp = [10 ** 6 for _ in range(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[n-1])
|
p03161 | s221049971 | Wrong Answer | N,K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
minToatalCostList = [100000 for i in range(N)]
minToatalCostList[0] = 0
for i in range(1,N) :
for j in range(1,K+1) :
if j > i or minToatalCostList[i] == 0 :
break
else :
minToatalCostList[i] = min(minToatalCostList[i], (abs(h[i] - h[i-j]) + minToatalCostList[i-j] ))
print(minToatalCostList[N-1])
|
p03161 | s624328342 | Wrong Answer | N, K = map(int, input().split())
High = list(map(int, input().split()))
DP = [1000000]*N
DP[0] = 0
for i in range(N):
for j in range(K):
if i + j + 1 >= N:
break
DP[i + j + 1] = min(DP[i + j + 1], DP[i] + abs(High[i] - High[i + j + 1]))
print(DP[N-1]) |
p03161 | s786722758 | Wrong Answer | import numpy as np
import sys
n, k = map(int, input().split())
dp = np.full(n, 10005, dtype=int)
h = np.array([int(x) for x in input().split()])
dp[0] = 0
for i in range(n):
j = 0
while i - j >= 0 and j <= k:
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]))
j += 1
print(dp[n - 1])
|
p03161 | s454191412 | Wrong Answer | N,K = map(int,input().split())
h = list(map(int,input().split()))
cost = [0]
for i in range(2,N+1):
print(i)
cost.append( min([cost[j] + abs(h[i-1]-h[j]) for j in range(max(0,i-K-1), i-1)]) )
print(cost) |
p03161 | s248334701 | Wrong Answer | import numpy
N, K = map(int,input().split())
h = numpy.array(input().split(),numpy.int32)
dp = numpy.array([10**5]*N,numpy.int32)
dp[0] = 0
for i in range(N) :
for j in range(1,K+1) :
x = i+j
if x< N :
m = dp[i]+abs(h[i]-h[x])
if m < dp[x] :
dp[x] = m
print(dp[-1]) |
p03161 | s606534929 | Wrong Answer | N,K = list(map(int,input().split()))
h = list(map(int,input().split()))
DP = [float("inf")]*N
for i in range(1,min(K,N)):
DP[i] = abs(h[i]-h[0])
DP[1] = abs(h[1]-h[0])
for i in range(K,N):
for k in range(1,K+1):
DP[i] = min(DP[i],DP[i-k]+abs(h[i]-h[i-k]))
print(DP[N-1]) |
p03161 | s494504887 | Wrong Answer | # import sys
# sys.setrecursionlimit(10**5)
# from collections import defaultdict
geta = lambda fn: list(map(fn, input().split()))
gete = lambda fn: fn(input())
def main():
N, K = geta(int)
h = geta(int)
dp = [0]*N
dp[0], dp[1] = 0, abs(h[0] - h[1])
for i in range(2, N):
lb = max(0, i-K)
for j in range(lb, i):
dp[i] = min(dp[i], dp[j] + abs(h[i]-h[j]))
print(dp[-1])
if __name__ == "__main__":
main() |
p03161 | s720804955 | Wrong Answer | 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] = 1000000
for j in range(max(i-K,0), i):
dp[i] = min(dp[i], dp[j]+abs(h[j]-h[i]))
print(dp[N-1])
|
p03161 | s923427607 | Wrong Answer | n,k = map(int,input().split())
h = list(map(int,input().split()))
dp = [100000000 for i in range(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] + abs(h[i] - h[i + j]), dp[i + j])
print(dp[n-1]) |
p03161 | s795441800 | Wrong Answer | n , k = map(int, input().split())
H = list(map(int, input().split()))
DP = [100000 for i in range(n)]
DP[0] = 0
for i in range(1, n):
for j in range(1, k+1):
if i - j >= 0:
tmp = DP[i - j] + abs(H[i - j] - H[i])
DP[i] = min(DP[i], tmp)
else:
pass
print(DP[n - 1]) |
p03161 | s475186976 | Wrong Answer | def min_cost(h, n, k):
dp = [10**6 for i in range(n)]
dp[0] = 0
for i in range(1, n):
for k in range(1, k + 1):
if (i - k) >= 0:
dp[i] = min(abs(h[i] - h[i - k]) + dp[i - k], dp[i])
print(dp[n - 1])
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
min_cost(h, n, k)
|
p03161 | s037623393 | Wrong Answer | import sys
sys.setrecursionlimit(10**6)
n,k = map(int,input().split())
h = list(map(int, input().split()))
dp = [0] * n
if n > k:
for i in range(k):
dp[i]=abs(h[0]-h[i])
for i in range (k,n):
for j in range(1,k):
dp[i] = min(dp[i-k]+abs(h[i-k]-h[i]),dp[i-k-1]+abs(h[i-k-1]-h[i]))
print(dp[n-1])
else:
print(min([abs(h[0]-h[i]) for i in range(n)])) |
p03161 | s495641823 | Wrong Answer | n,k = list(map(int,input().split(' ')))
h = list(map(int, input().split(' ')))
dp = [0]*n
for i in range(1,n):
temp = 1000000
for j in range(1,k+1):
if i-j>=0:
temp = min(dp[i-j]+abs(h[i]-h[i-j]), temp)
dp[i] = temp
print(dp[-1]) |
p03161 | s921334181 | Wrong Answer | N, K = map(int, input().split())
h = list(map(int, input().split()))
for j in range(K):
h.append(0)
INF = float('inf')
dp = [INF] * (N+K)
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, h) |
p03161 | s316688899 | Wrong Answer | import math
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 = math.inf
for step in range(1, N):
value = min(value, S[i - step] + abs(h[i] - h[i - step]))
S[i] = value
print(S[N - 1]) |
p03161 | s889985571 | Wrong Answer | import math
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):
mindp=dp[i-1]+ abs(h[i]- h[i-1])
for j in range(max(i-k,0),i-2):
mindp= min(dp[j]+ abs(h[i]- h[j]), mindp)
dp[i]=mindp
print(dp[n-1]) |
p03161 | s641857581 | Wrong Answer | def solve(a,k,dp):
for i in range(2,n+1):
for j in range(i-1, max(0, i-k-1), -1):
# print(i,j)
dp[i] = min(dp[i], dp[j] + abs(a[i]-a[j]))
# print(dp[j], i, j)
# print(dp[i])
n,k = map(int, input().split())
a = list(map(int, input().split()))
a.insert(0,0)
dp = [99999 for i in range(n+2)]
dp[1] = 0
# dp[1] = abs(a[1]-a[0])
solve(a,k,dp)
# print(dp)
print(dp[n]) |
p03161 | s930208289 | Wrong Answer | N,K=map(int,input().split())
h=list(map(int,input().split()))
dp=[10000]*N
dp[0]=0
#配るDP作戦 dp[i]の値が分かっている場合にdp[i]を用いてdp[i+1],dp[i+2]...を更新
for i in range(N):
for k in range(1,min(K+1,N-i)):
dp[i+k]=min(dp[i+k],dp[i]+abs(h[i]-h[i+k]))
# print("i=",i," dp=",dp)
print(dp[-1])
|
p03161 | s716431781 | Wrong Answer | N,K=map(int,input().split())
H=list(map(int,input().split()))
cost =200000
DP=[0]*(N+10)
DP[0]=0
DP[1]=abs(H[1]-H[0])
for i in range(2,N):
cost=200000
for k in range(max(i-K,0),i):
cost=min(cost,(abs(H[i]-H[k])+DP[k]))
DP[i]=cost
print(DP[N-1]) |
p03161 | s408475399 | Wrong Answer | import numpy as np
import sys
n, k = map(int, input().split())
dp = np.full(n, 10005, dtype=int)
h = np.array([int(x) for x in input().split()])
if n - 1 <= k:
print(abs(h[n - 1] - h[0]))
sys.exit()
if k == 1:
s = 0
for i in range(n - 1):
s += abs(h[i + 1] - h[i])
print(s)
sys.exit()
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(2, n):
for j in range(1, min(i + 1, k + 1)):
dp[i] = min(dp[i], dp[i - j] + abs(h[i] - h[i - j]))
print(dp[n - 1])
|
p03161 | s456976359 | Wrong Answer | N, K = map(int, input().split())
h = list(map(int, input().split()))
dp = [float("inf") for _ in range(N)]
def cost(n, m):
return abs(h[n] - h[m])
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] + cost(i, i + j))
print(dp) |
p03161 | s569718865 | Wrong Answer | N, K = map(int, input().split())
H = list(map(int, input().split()))
dp = [1 << 62] * N
dp[0] = 0
for i in range(1, N):
for j in range(i, min(i + 1 + K, N)):
cost = abs(H[i - 1] - H[j])
dp[j] = min(dp[j], dp[i - 1] + cost)
print(dp[-1])
|
p03161 | s702976590 | Wrong Answer | import sys
N, K = map(int, input().split())
h = list(map(int, input().split()))
DP = [0]*N
if N < K:
print(abs(h[0]-h[N-1]))
sys.exit()
for i in range(1, K+1):
DP[i] = abs(h[0]-h[i])
if N == K:
print(DP[N-1])
sys.exit()
for i in range(K, N):
DPmin = 10000000
for j in range(i-K, i):
DPmin = min(DPmin, DP[j]+abs(h[j]-h[i]))
DP[i] = DPmin
print(DP[N-1])
|
p03161 | s679147284 | Wrong Answer | n, k = map(int, input().strip().split(" "))
h = list(map(int, input().split(" ")))
dp = [10**5] * 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], abs(h[i]-h[i+j])+dp[i])
else:
break
print(dp[n-1]) |
p03161 | s460623138 | Wrong Answer | def main():
N, K = list(map(int, input().split()))
field = list(map(int, input().split()))
dpList = [0] * N
dpList[1] = abs(field[0] - field[1])
for i in range(2, N):
minCost = 1000000
for j in range(1, min(K, i) + 1):
minCost = min([minCost, dpList[i - j] + abs(field[i] - field[i - j])])
dpList[i] = minCost
print(dpList[-1])
if __name__ == "__main__":
main() |
p03161 | s076574535 | Wrong Answer | n,k=map(int,input().split())
a=list(map(int,input().split()))
cost=[100000]*(n)
cost[0]=0
for i in range(1, n):
for j in range(max(i-k, 0), i+1):
cost[i]=min(cost[i], cost[j]+abs(a[i]-a[j]))
print(cost[-1]) |
p03161 | s941180133 | Wrong Answer | def main():
n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [float('inf') for _ in range(n)]
dp[0] = 0
dp[1] = abs(h[0]-h[1])
for i in range(1, n):
for j in range(1, min(k+1, n-i)):
num = dp[i]+abs(h[i]-h[i+j])
if num < dp[i+j]:
dp[i+j] = num
print(dp[-1])
main()
|
p03161 | s217852380 | Wrong Answer | n, k = map(int, input().split())
h = list(map(int, input().split()))
MAXINT = 10**8
dp = [MAXINT for _ in range(n)]
dp[0] = 0
def chmin(a, b):
if (a > b):
a = b
return True
return False
for i in range(n-1):
for j in range(1, k):
if i+j>=n:
break
if dp[i+j] > dp[i] + abs(h[i] - h[i+j]):
dp[i+j] = dp[i] + abs(h[i] - h[i+j])
print(dp[n-1])
|
p03161 | s914408471 | Wrong Answer | n,k = map(int,input().split())
h = list(map(int,input().split())) + [0]*k
cost = [0] + [10000]*(n+k)
for i in range(n):
for j in range(1,k+1):
cost[i+j] = min(cost[i]+abs(h[i]-h[i+j]),cost[i+j])
print(cost[n]) |
p03161 | s362660567 | Wrong Answer | N, K = map(int, input().split())
H = list(map(int, input().split()))
INF = 10**6
ans = [INF] * N
ans[0] = 0
ans[1] = abs(H[1] - H[0])
for i in range(N):
for j in range(K+1):
if i + j <= N-1:
ans[i+j] = min(ans[i+j], ans[i] + abs(H[i+j] - H[i]))
print(ans[N-1]) |
p03161 | s335106519 | Wrong Answer | def frog(arr,n,k):
if k>n:
return 0
dp=[0]*(n+1)
for i in range(2,n+1):
dp[i]=10**9
for j in range(i-1,0,-1):
if i-j<=k:
dp[i]=min(dp[j]+abs(arr[i-1]-arr[j-1]),dp[i])
return dp[n]
value=[int(i) for i in input().split()]
n,k=value[0],value[1]
arr=[int(i) for i in input().split()]
print(frog(arr,n,k)) |
p03161 | s971909335 | Wrong Answer | n, k = map(int,input().split())
h = list(map(int,input().split()))
ans = []
for i in range(n):
if i == 0:
ans.append(0)
else:
x = 10**5
for j in range(k):
if i-j-1 < 0:
break
y = ans[-j-1] + abs(h[i]-h[i-j-1])
if y < x:
x = y
ans.append(x)
print(ans[-1])
|
p03161 | s091113323 | Wrong Answer | import sys
n,k=list(int(i) for i in input().split())
A=list(int(i) for i in input().split())
# n,k=10,4
# A=[40,10,20,70,80,10,20,70,80,60]
dpmincost=[0 for i in range(n)]
dpmincost[0]=0
for i in range(1,n):
x=sys.maxsize
for j in range(1,k+1):
if i-j>=0:
x=min(dpmincost[i-j]+abs(A[i]-A[i-j]),x)
dpmincost[i]=x
print(dpmincost)
|
p03161 | s635753348 | Wrong Answer | def min_cost(h, n, k):
dp = [10**6 for i in range(n)]
dp[0] = 0
for i in range(1, n):
for k in range(1, k + 1):
if (i - k) >= 0:
dp[i] = min(abs(h[i] - h[i - k]) + dp[i - k], dp[i])
return dp[n - 1]
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
print(min_cost(h, n, k))
|
p03161 | s564430949 | Wrong Answer | import math
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 = math.inf
for step in range(1, i + 1):
value = min(value, S[i - step] + abs(h[i] - h[i - step]))
S[i] = value
print(S[N - 1]) |
p03161 | s164791334 | Wrong Answer | n,k = map(int,input().split())
h = list(map(int,input().split()))
dp = [100000 for i in range(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] + abs(h[i] - h[i + j]), dp[i + j])
print(dp[n-1]) |
p03161 | s751521462 | Wrong Answer | n,k = list(map(int, input().split()))
nums = list(map(int, input().split()))
best = [99999999]*n
best[0] = 0
for i in range(1,n):
for j in range(1,min(i+1,k+1)):
#print(i,i-j, "CHECKING", best[i-j],abs(nums[i-j]-nums[i]))
best[i] = min(best[i], best[i-j]+abs(nums[i-j]-nums[i]))
print(best[-1]) |
p03161 | s385153367 | Wrong Answer | N,K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
minToatalCostList = [10000 for i in range(N)]
minToatalCostList[0] = 0
for i in range(1,N) :
for j in range(1,K+1) :
if j > i or minToatalCostList[i] == 0 :
break
else :
minToatalCostList[i] = min(minToatalCostList[i], abs(h[i] - h[i-j]) + minToatalCostList[i-j] )
print(minToatalCostList[N-1]) |
p03161 | s061325831 | Wrong Answer | 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(1,n-1):
for j in range(1,k+1):
if i+j>n-1:
continue
else:
cost[i+j]=min(abs(h[i+j]-h[i])+cost[i] ,cost[i+j])
print(cost[n-1])
|
p03161 | s815951285 | Wrong Answer | n,k=list(map(int, input().split()))
stones=list(map(int, input().split()))
infini=(10**4)*(10**5)
dp = [infini for _ in range(n)]
dp[0]=0
for pos in range(0, n-1):
for m in range(1, k):
if pos+k < n:
dp[pos+k] = min(dp[pos+k], dp[pos] + abs(stones[pos] - stones[pos+k]))
print(dp[-1])
|
p03161 | s467139311 | Wrong Answer | n,k = map(int, input().split())
h = list(map(int, input().split()))
dp = [0]*(n-1)
for i in range(1,n-1):
temp = 10**10
for j in range(1, min(k+1, i+1) ):
temp = min(temp, abs(h[i] - h[i-j]) + dp[i-j])
dp[i] = temp
print(dp[n-2]) |
p03161 | s313234119 | Wrong Answer | n,k=map(int,input().split())
h=list(map(int,input().split()))
dp=[0 for i in range(n)]
dp[1] = dp[0] + abs(h[1]-h[0])
for i in range(2,n):
choice=100000
for j in range(max(i-k,0), i):
tmp = dp[j]+abs(h[i]-h[j])
if tmp < choice:
choice = tmp
dp[i] = choice
print(dp[n-1]) |
p03161 | s537097695 | Wrong Answer | N, K = map(int, input().split())
places = list(map(int, input().split()))
dp_table = [99999999] * (N+1)
# 初期化
dp_table[0] = 0
dp_table[1] = abs(places[1] - places[0])
for i in range(2, N):
for j in range(1, K+1):
cost = dp_table[i-j] + abs(places[i] - places[i-j])
dp_table[i] = dp_table[i] if cost > dp_table[i] else cost
print(dp_table) |
p03161 | s076171444 | Wrong Answer | [N,K]=list(map(int, input().split()))
h=list(map(int, input().split()))
K=min(N,K)
dp=[[0 for i in range(K+1)] for j in range(N)]
for i in range (1,K):
for j in range (0,i):
dp[i][j]=dp[i-j-1][K]+abs(h[i-j-1]-h[i])
dp[i][K]=min(dp[i][0:j+1])
for i in range (K,N):
for j in range (0,K):
dp[i][j]=dp[i-j-1][K]+abs(h[i-j-1]-h[i])
print(dp[N-1][K]) |
p03161 | s837749535 | Wrong Answer | import numpy as np
N, K = map(int, input().split(" "))
Hs = [int(i) for i in input().split(" ")]
dp = [10**9] * N
dp[0] = 0
for i in range(N):
for j in range(1,K+1):
i_j = i+j
if i_j < N:
dp[i_j] = min(dp[i_j], dp[i] + abs(Hs[i-j]-Hs[i]))
print(int(dp[-1]))
|
p03161 | s033100546 | Wrong Answer | n, k = map(int,input().split())
h = list(map(int,input().split()))
dp = [10**6]*n
dp[0] = 0
for i in range(0,n):
for j in range(1,k+1):
if i+j > n-1:
continue
dp[i+j] = min(dp[i+j], dp[i] + abs(h[i]-h[i+j]))
print(dp[n-1])
|
p03161 | s074174276 | Wrong Answer | import sys
input = sys.stdin.readline
def main():
N, K = map(int, input().split())
H = list(map(int, input().split()))
dp = [10**4]*N
dp[0] = 0
for i in range(N):
for j in range(1, min(K+1, N-i)):
dp[i+j] = min(dp[i+j], abs(H[i+j] - H[i]) + dp[i])
print(dp.pop())
main() |
p03161 | s776309280 | Wrong Answer | N,K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
minToatalCostList = [100000 for i in range(N)]
minToatalCostList[0] = 0
for i in range(1,N) :
for j in range(1,K+1) :
if j > i or minToatalCostList[i] == 0 :
break
else :
minToatalCostList[i] = min(minToatalCostList[i], abs(h[i] - h[i-j]) + minToatalCostList[i-j] )
print(minToatalCostList[N-1]) |
p03161 | s736594235 | Wrong Answer | N, K = map(int, input().split())
h = list(map(int, input().split()))
dp = [-1] * N
dp[0] = 0
inf = 100000
for i in range(1, N):
mindp_i = inf
for jump in range(1, min(i, K) + 1):
dpcand = dp[i - jump] + abs(h[i] - h[i - jump])
if dpcand < mindp_i:
mindp_i = dpcand
dp[i] = mindp_i
print(dp[N-1]) |
p03161 | s195564874 | Wrong Answer | n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [10 ** 5] * (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], dp[i - j] + abs(h[i] - h[i - j]))
else:
break
print(dp[n-1])
|
p03161 | s692255649 | Wrong Answer |
# dp[i] 足場iまでいくコストの最小値
n,k = map(int,input().split())
h = [0] + list(map(int,input().split()))
# dp[2]までは初期条件で確定
dp = [0 for i in range(n+1)]
dp[2] = abs(h[2]-h[1])
for i in range(3,n+1):
arr = [dp[i-j] + abs(h[i] - h[i-j]) for j in range(1,min(i,k)+1)]
dp[i] = min(arr)
ans = dp[n]
print(ans)
|
p03161 | s525764355 | Wrong Answer | from sys import stdin,stdout
INT_MAX= 100000000
n,k=map(int,stdin.readline().split())
dp = [INT_MAX]*(n)
h=[int(X) for X in stdin.readline().split()]
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
p=1
while(p<k+1 and i-p>=0):
dp[i]= min(dp[i-p+1]+abs(h[i-p+1]-h[i]),dp[i])
p+=1
stdout.write(str(dp[n-1])+"\n") |
p03161 | s071175011 | Wrong Answer | n,k=tuple(map(int,input().split()))
l=list(map(int,input().split()))
dp=[1e5 for i in range(n)]
dp[0]=0
for i in range(1,min(k+1,n)):
dp[i]=abs(l[i]-l[0])
for i in range(1,n):
for j in range(max(i-k,1),i):
dp[i]=min(dp[i],abs(l[i]-l[j])+dp[j])
print(dp[n-1])
#print(dp)
|
p03161 | s310701637 | Wrong Answer | 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)+1):
dp[i]=min(dp[i],dp[i-j]+abs(h_list[i-j]-h_list[i]))
print(dp[-1]) |
p03161 | s492810788 | Wrong Answer | N,K=map(int,input().split())
H=list(map(int,input().split()))
cost =20000
DP=[0]*(N+10)
DP[0]=0
DP[1]=abs(H[1]-H[0])
for i in range(2,N):
cost=20000
for k in range(max(i-K,0),i):
cost=min(cost,(abs(H[i]-H[k])+DP[k]))
DP[i]=cost
print(DP[N-1]) |
p03161 | s173178590 | Wrong Answer | def main():
n, k = map(int, input().split())
h = list(map(int, input().split()))
c = [0] + [abs(h[1] - h[0])]
for i in range(2, n):
min_step = 10 ** 4
num = i if i <= k else k + 1
for j in range(1, num):
step = abs(h[i] - h[i-j]) + c[i-j]
if step < min_step:
min_step = step
c.append(min_step)
print(c.pop())
if __name__ == "__main__":
main()
|
p03161 | s233622468 | Wrong Answer | N, K = map(int, input().split())
H = list(map(int, input().split()))
DP = [100000]*N
for i, h in enumerate(H):
if i == 0:
DP[0] = 0
for k in range(1,K+1):
if i - k >= 0 :
DP[i] = min(DP[i], DP[i-k]+abs(H[i]-H[i-k]))
print(DP[-1]) |
p03161 | s683003823 | Wrong Answer | n,k = map(int,input().split())
h = [int(i) for i in input().split()]
dp = [float('Inf') for i in range(n)]
dp[0]=0
for i in range(n):
for j in range(1,k+1):
if i-j<0:
break
dp[i]= min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
print(dp)
print(dp[n-1]) |
p03161 | s694403631 | Wrong Answer | n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [float("inf")]*n
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[n-1]) |
p03161 | s615787883 | Wrong Answer | import sys
INF = 1e9 + 5
def solve(n, k, ls):
dp=[10**5 for i 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(ls[i+j]-ls[i]))
return(dp[n-1])
if __name__ == "__main__":
f = sys.stdin
fo = sys.stdout
n, k = map(int, f.readline().split())
arr = list(map(int, f.readline().split()))
result = solve(n, k, arr)
print(result) |
p03161 | s404440720 | Wrong Answer | n, k = map(int, input().split())
h = list(map(int, input().split()))
cost = [-1] * n
cost[0] = 0
for i in range(1, k):
if i >= n:
break
tmp = 100000
for j in range(0, i):
tmp = min(tmp, abs(h[j] - h[i]) + cost[j])
cost[i] = tmp
for i in range(k, n):
tmp = 100000
for j in range(i-k, i):
tmp = min(tmp, abs(h[j] - h[i]) + cost[j])
cost[i] = tmp
print(cost[n-1]) |
p03161 | s244296402 | Wrong Answer | N, K = map(int, input().split())
h = list(map(int, input().split()))
h = h + [0] * (K + 1)
# DPテーブル
dp = [10 ** 10] * (N + 1 + K)
# 初期値
dp[0] = 0
dp[1] = 0
# ループ
for i in range(1, N + 1):
for j in range(1, K + 1):
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i + j] - h[i]))
# 解を出力
print(dp[N])
|
p03161 | s563922770 | Wrong Answer | # EDPC A Frog 1
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(K):
cost[i] = min(cost[i],cost[i-k]+abs(H[i]-H[i-k]))
print(cost[N-1]) |
p03161 | s728502709 | Wrong Answer | N,K = [int(x) for x in input().split()]
h = [int(x) for x in input().split()]
DP = [100000000]*N
DP[0] = 0
DP[1] = abs(h[0] - h[1])
for i in range(2,N):
for j in range(1,min(K+1,i+1)):
DP[i] = min(DP[i],DP[i-j] + abs(h[i]-h[i-j]))
print(DP[N-1]) |
p03161 | s749450270 | Wrong Answer | infinity=10**8
N,K = map(int,input().split())
h = list(map(int,input().split()))
dp=[infinity]*N
dp[0]=0
for i in range(1,N):
step=min(K,i)
for k in range(1,step+1):
dp[i] = min(dp[i],dp[i-k]+abs(h[i]-h[i-k]))
print(dp[-1]) |
p03161 | s411203683 | Wrong Answer | n,k=map(int,input().split())
h=list(map(int,input().split()))
dp=[0]*n
rage=range #lol
for i in rage(1,n):
if i==1: dp[i]=dp[i-1]+abs(h[i]-h[i-1])
else: dp[i]+=min([dp[i-j]+abs(h[i]-h[i-j]) for j in rage(1,k+1)]);
print(dp[-1])
|
p03161 | s382492502 | Wrong Answer | import math
from decimal import *
n, k = map(int, input().split())
nos = list(map(int, input().split()))
arr = [int(10e4)+1 for i in range(n)]
arr[0] = 0
if(n>1):
arr[1] = abs(nos[1]-nos[0])
for i in range(2, n):
for x in range(1, min(k, i)+1):
arr[i] = min(arr[i], abs(nos[i-x]-nos[i])+arr[i-x])
print(arr[n-1])
|
p03161 | s028336507 | Wrong Answer | import sys
read = lambda: sys.stdin.readline().rstrip()
def main():
INF = 10 ** 20
n,k = map(int,input().split())
height = tuple(map(int,read().split()))
dp = [INF]*(n+1)
dp[0] = 0
for step in range(1, k + 1):
for target in range(n-1, 0, -1):
if target-step >= 0: dp[target] = min(dp[target], dp[target - step] + abs(height[target] - height[target - step]))
print(dp[n-1])
if __name__ == "__main__":
main() |
p03161 | s401416633 | Wrong Answer | n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [10**8] * 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[n - 1]) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.