problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03161 | s438712705 | Wrong Answer | ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n,k=nm()
h=nl()
dp = [10**10] * n
dp[0] = 0
for i in range(n):
for j in range(i+1,min(i+k+1,n-1)):
dp[j] = min(dp[j], dp[i] + abs(h[j]-h[i]))
print(dp[n-1])
|
p03161 | s294931641 | Wrong Answer | N,K=map(int,input().split())
H=list(map(int,input().split()))
INF=10**7
add_list=[INF]*K
H.extend(add_list)
dp=[INF]*(N+100) #Kの分追加
dp[0]=0
for n in range(N):
for k in range(1,K+1):
dp[n+k]=min(dp[n+k], dp[n]+abs(H[n]-H[n+k]))
print(dp[N-1]) |
p03161 | s262781503 | Wrong Answer | n,k=map(int,input().split())
h=list(map(int,input().split()))
cost=[100000]*n
cost[0]=0
for i in range(n-1):
for j in range(1,min(k+1,n-i)):
cost[i+j]=min(cost[i+j],cost[i]+abs(h[i+j]-h[i]))
print(cost[-1])
|
p03161 | s928643097 | Wrong Answer | INF = 110000
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [INF for _ 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], abs(h[i+j] - h[i]) + dp[i])
else: break
print(dp[n-1])
|
p03161 | s637897993 | Wrong Answer | n,k = map(int,input().split())
l = list(map(int,input().split()))
dp = []
dp.append(0)
for i in range(1,k+1):
if i==n:
break
dp.append(abs(l[i]-l[0]))
for i in range(k+1,n):
dp.append(10001)
for i in range(k+1,n):
for j in range(1,k+1):
dp[i] = min(dp[i-j]+abs(l[i-j]-l[i]),dp[i])
print(dp[n-1]) |
p03161 | s710407163 | Wrong Answer | #!/usr/bin/env python3
N, K = map(int, input().split())
H = list(map(int, input().split()))
dp = [float('inf') for i in range(N+K+1)]
if K > N:
print(0)
exit()
dp[0] = 0
for i in range(1, K+1):
dp[i] = abs(H[i]-H[0])
if K==N:
print(min(dp))
exit()
for i in range(0, N):
for j in range(i+1, i+K+1):
if j < N:
dp[j] = min(dp[i] + abs(H[i] - H[j]), dp[j])
print(dp[N-1])
|
p03161 | s583194275 | Wrong Answer | size, k = map(int, input().split())
arr = list(map(int, input().split()))
max = 10000000
dp = [max]*(size)
for i in range(size):
if i > k:
for x in range(1, k +1):
dp[i] = min(dp[i], dp[i-x] + abs(arr[i-x]-arr[i]))
#dp[i] = min(dp[i-1] + abs(arr[i-1]-arr[i]), dp[i-2] + abs(arr[i-2]- arr[i]))
else:
dp[i] = abs(arr[0] - arr[i])
print(dp[size-1]) |
p03161 | s251926922 | Wrong Answer | import sys
def input():
return sys.stdin.readline().strip()
n,k=map(int,input().split())
cst=list(map(int,input().split()))
arr=[0]*n
arr[1]=abs(cst[1]-cst[0])
for i in range(2, n):
arr[i]=min(abs(cst[j]-cst[i])+arr[j] for j in range(max(i-k,0),i))
print(arr[n-1])
#print(arr) |
p03161 | s978959421 | 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(0, n):
for j in range(1, k + 1):
if j >= n:
break
dp[i] = min(dp[i], dp[i-j] + abs(h[i] - h[i - j]))
print(dp[n - 1])
|
p03161 | s950084803 | Wrong Answer | n,k = map(int,input().split())
h = list(map(int,input().split()))
dp = [0]*n
dp[0] = 0
dp[1] = abs(h[1]-h[0])
for i in range(2,n):
dp[i] = dp[i-1]+abs(h[i-1]-h[i])
print("dp(i)={}".format(dp[i]))
for j in range(2,k+1):
if i-j>=0:
dp[i] = min(dp[i],dp[i-j]+abs(h[i-j]-h[i]))
print(dp)
print(dp[n-1]) |
p03161 | s351284375 | Wrong Answer | import math
n, k = map(int,input().split())
h = list(map(int, input().split()))
res = [10**6] * n
res[0] = 0
for i in range(1, n):
temp = False
for j in range(k, 0, -1):
if i - j < 0:
continue
res[i] = min(res[i-j] + abs(h[i] - h[i-j]), res[i])
print(res[n-1]) |
p03161 | s330436906 | Wrong Answer | n, k, *hs = [int(x) for x in open(0).read().split()]
dp = [0] * n
for i in range(1, n):
v = 10000
for j in range(max(0, i - k), i):
v = min(v, dp[j] + abs(hs[i] - hs[j]))
dp[i] = v
print(dp[n-1]) |
p03161 | s446099230 | Wrong Answer | N,K = map(int,input().split())
H = [0]
F = [0]*(N+1)
*h, = map(int,input().split())
for i in h:
H.append(i)
for i in range(1,N+1):
for k in range(1,min(K+1,N-i+1)):
if F[i+k] == 0:
F[i+k] = abs(H[i]-H[i+k])+F[i]
else:
F[i+k] = min(F[i+k],abs(H[i]-H[i+k])+F[i])
print(F[-1]) |
p03161 | s818915601 | Wrong Answer | #入力:[n1,n2,...nk](int:整数配列)
def input_array():
return list(map(int,input().split()))
#入力:N,M(int:整数)
def input2():
return map(int,input().split())
n,k=input2()
H=input_array()
INF=10**9
# 最小化問題
dp=[INF]*n
# 初期化
dp[0]=0
flag=True
for i in range(n):
for j in range(1,k+1):
if i+j>=n:
flag=False
break
a=dp[i]+(abs(H[i+j]-H[i]))
dp[i+j]=min(dp[i+j],a)
if flag==False:
break
print(dp[-1]) |
p03161 | s929731173 | Wrong Answer | 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(N):
for j in range(1, K+1):
if i+j < N:
m = abs(h[i+j] - h[i]) + dp[i]
if dp[i+j] > m:
dp[i+j] = m
print(dp) |
p03161 | s496232311 | Wrong Answer | import numpy as np
def main():
N, K = list(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):
dp[i:(i+K)] = np.fmin(dp[i:(i+K)], dp[i-1] + np.abs(H[i:(i+K)] - H[i-1]))
print(dp[N-1])
if __name__ == '__main__':
main() |
p03161 | s492883334 | Wrong Answer | n,k = input().strip().split()
n,k = int(n),int(k)
h = list(map(int,input().strip().split()))
dp = [0]*n
dp[0] = 0
dp[1] = abs(h[1]-h[0])
for i in range(2,n):
min_cost = 10**10
if i < k:
_k = i
else:
_k = k
for j in range(1,_k+1):
cost = dp[i-j] + abs(h[i-j] - h[i])
if min_cost > cost:
min_cost = cost
dp[i] = min_cost
print(i,dp[i])
print(dp[n-1]) |
p03161 | s735528246 | Wrong Answer | N,K = map(int,input().split())
h = list(map(int,input().split()))
dp = [0]*N
dp[0] = 0
dp[1]=abs(h[1]-h[0])
for i in range(2,N):
dp[i] += min(dp[i-k]+abs(h[i]-h[i-k]) for k in range(1,K+1))
print(dp[-1]) |
p03161 | s166120099 | Wrong Answer | n, k = map(int, input().split())
H = list(map(int, input().split()))
C = [0] * n
for i in range(1, n):
left = max(0, i - k)
min_c = 10**5
for j in range(left, i):
min_c = min(min_c, C[j] + abs(H[i] - H[j]))
#print(i, j, min_c)
C[i] = min_c
print(C[-1]) |
p03161 | s375480044 | Wrong Answer | 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:
break
dp[i+j] = min(dp[i+j], dp[i] + abs(h[j]-h[i]))
ans = dp[n-1]
print(ans)
|
p03161 | s729025604 | 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[i]-h[j]))
#print(dp)
print(dp[-1]) |
p03161 | s607987041 | Wrong Answer | N,K=map(int,input().split())
h=list(map(int,input().split()))
DP=[0]*N
DP[0]=0
DP[1]=DP[0]+abs(h[0]-h[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[N-1]) |
p03161 | s072903347 | Wrong Answer | import sys
input = sys.stdin.readline
import numpy as np
N, K = [int(item) for item in input().split()]
h =np.array([int(item) for item in input().split()])
dp = np.full(N+1, 10**10)
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(N):
start = max(0, i-K)
cost = np.abs(h[start:i] - h[i])
np.minimum(dp[start:i] + cost, dp[i+1], out=dp[start+1:i+1])
# print(start, i)
print(dp[1:].min()) |
p03161 | s024572285 | Wrong Answer | n,k = map(int,input().split())
h = list(map(int,input().split()))
dp = [100000000]*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 | s947070345 | Wrong Answer | N, K = map(int, input().split())
H = list(map(int, input().split()))
height_memo = [float('inf')] * N
height_memo[0] = 0
height_memo[1] = abs(H[1] - H[0])
for i in range(N - K + 2):
check = float('inf')
for j in range(1, K + 1):
check = min(check, height_memo[i + K - 2 - j] + abs(H[i + K - 2] - H[i + K - 2 - j]))
height_memo[i + K - 2] = min(check, height_memo[i + K - 2])
print(height_memo[N-1]) |
p03161 | s207170885 | Wrong Answer | n,k= map(int,input().split())
h = [int(i) for i in input().split()]
inf = 10**7
dp = [inf]*100005
dp[0] = 0
for i in range(1,n):
con = inf
for j in range(k,0,-1):
if j > len(h):
continue
con = min(con,dp[i-j]+abs(h[i]-h[i-j]))
dp[i] = con
print(dp[n-1]) |
p03161 | s092046977 | Wrong Answer | [n, k] = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
dp = [10 ** 5 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] - h[i+j]))
print(dp[n-1]) |
p03161 | s870809732 | Wrong Answer | #B-Frog2
N,K=map(int,input().split())
h=list(map(int,input().split()))
dp=[0 for i in range(N)]
dp[1]=abs(h[1]-h[0])
for i in range(2,N):
min_num=10000
for j in range(max(0,i-K),i):
print(dp[i-j]+abs(h[i]-h[j]),j)
if min_num>dp[j]+abs(h[i]-h[j]):
min_num=dp[j]+abs(h[i]-h[j])
dp[i]=min_num
print(dp) |
p03161 | s556678767 | Wrong Answer | n, k = map(int, input().split())
s = list(map(int, input().split()))
inf = 10 ** 8
dp = [inf] * n
dp[0] = 0
for j in range(1, n):
for i in range(max(0, j - k), j):
dp[j] = min(dp[j], dp[i]+abs(s[j]-s[i]))
print(dp[-1])
|
p03161 | s271638688 | Wrong Answer | from collections import deque
n, k = map(int, input().split())
h = deque(list(map(int, input().split())))
dp = deque([10000]*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[n-1]) |
p03161 | s459393474 | Wrong Answer | from collections import deque
import sys
input = sys.stdin.readline
n, k = map(int, input().split())
h = deque(list(map(int, input().split())))
dp = deque([10000]*100001)
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[n-1]) |
p03161 | s252053595 | Wrong Answer | import sys
input = sys.stdin.readline
import numpy as np
N, K = [int(item) for item in input().split()]
h =np.array([int(item) for item in input().split()])
dp = np.full(N+1, 10**10)
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(N):
start = max(0, i-K)
cost = np.abs(h[start:i] - h[i])
np.minimum(dp[start:i] + cost, dp[i+1], out=dp[start+1:i+1])
# print(start, i)
print(dp[1:].min())
|
p03161 | s295366147 | Wrong Answer | #B-Frog2
N,K=map(int,input().split())
h=list(map(int,input().split()))
dp=[0 for i in range(N)]
dp[1]=abs(h[1]-h[0])
print(dp)
for i in range(1,N):
max_num=0
for j in range(1,max(0,i-K)+2):
print("j",j)
if max_num<dp[j]+abs(h[i]-h[j]):
max_num=dp[j]+abs(h[i]-h[j])
dp[i]=max_num
print(dp[N-1]) |
p03161 | s811992424 | Wrong Answer | N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0]
for i in range(1, N):
m = 10 ** 4
for j in range(1, min(i, K) + 1):
m = min(m, dp[i - j] + abs(h[i] - h[i - j]))
dp.append(m)
print(dp[-1])
|
p03161 | s575528199 | 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 | s792824176 | Wrong Answer | # coding=utf-8
if __name__ == '__main__':
N, K = map(int, input().split())
h = list(map(int, input().split()))
dp = [10001] * 100010
dp[0] = 0
for i in range(N):
for j in range(K):
j += 1
if i + j <= len(h)-1:
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 | s482832349 | Wrong Answer | n,k = map(int, input().split())
h = list(map(int, input().split()))
sol = [100000000 for i in range(n)]
sol[0] = 0
for i in range(1, n):
for j in range(i-1, max(i-k-1, -1), -1):
sol[i] = min(sol[i], sol[j] + abs(h[i]-h[j]))
print(sol[n-1])
|
p03161 | s471289662 | Wrong Answer | n ,k=map(int, input().split())
H=[0]+list(map(int,input().split()))
dp=[10**10]*(n+1)
dp[1]=0
for i in range(1,n):
for k in range(1,n-k+1):
if i+k<=n:
dp[i+k]=min(dp[i+k], dp[i]+abs(H[i+k]-H[i]))
print(dp[n]) |
p03161 | s264133154 | Wrong Answer | N, K = map(int, input().split())
H = list(map(int, input().split()))
dp = [10**4]*N
for i in range(N):
if i == 0:
dp[i] = min(dp[i], 0)
else:
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 | s797428520 | Wrong Answer | import sys
sys.setrecursionlimit(10**9)
#dp=[-1]*(10**5+2)
def frog2(arr,N,K):
if N==0:
return 0
cnt=10**8
for i in range(N-1,max(N-K-1,-1),-1):
cnt=min(cnt,frog2(arr,i,K)+abs(arr[N]-arr[i]))
return cnt
if __name__ == "__main__":
N,K=map(int,input().split())
h=[int(i) for i in input().split()][:N]
print(frog2(h,N-1,K))
#print(dp[N-1]) |
p03161 | s338228459 | 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]+abs(h[i-p]-h[i]),dp[i])
p+=1
stdout.write(str(dp[n-1])+"\n") |
p03161 | s872263187 | Wrong Answer | x,k=map(int,input().split())
a=list(map(int,input().split()))
dp=[0]*x
dp[1]=abs(a[1]-a[0])
for i in range(2,x):
p=1000001
#print(i-k,i)
for j in range(max(0,i-k),i):
#print(i,j)
p=min(p,dp[j]+abs(a[i]-a[j]))
dp[i]=p
print(dp[x-1],dp) |
p03161 | s077875317 | Wrong Answer | N,K=map(int,input().split())
H=list(map(int,input().split()))
DP=[0]*(N+1)
for i in range(2,N+1):
a=10**4
for j in range(min(K,i-1)):
a=min(a,DP[i-j-1]+abs(H[i-1]-H[i-j-2]))
DP[i]=a
print(DP[N]) |
p03161 | s444490792 | Wrong Answer | N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] + [10**5] * (N - 1)
print(dp)
for i in range(1, 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[-1])
|
p03161 | s089249914 | Wrong Answer | 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**6
for j in range(st, i):
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 | s198073469 | Wrong Answer | n,k=map(int,input().split())
l=list(map(int,input().split()))
dp=[99999999]*n
dp[0]=0
for i in range(1,n):
for j in range(1,k+1):
if i-j>=0:
dp[i]=min(abs(l[i]-l[i-j])+dp[i-j], dp[i])
print(dp[n-1])
|
p03161 | s814201356 | Wrong Answer | n,k=map(int,input().split())
a=[int(x) for x in input().split()]
c=0
f=[99999999]*(n)
f[0]=0
for i in range(n):
for j in range(i+1,i+k+1):
if j<n:
f[j]=min(f[j],f[i]+abs(a[i]-a[j]))
print(f[n-1]) |
p03161 | s223903775 | Wrong Answer |
size, jumps = map(int, input().split())
array = list(map(int, input().split()))
dp = [0]* size
dp[1]= dp[0] + abs(array[1] - array[0])
for i in range(1,size):
for j in range(i ,size):
dp[i] = min(
dp[j],abs(array[i] - array[j])
)
print(dp[-1])
|
p03161 | s324431191 | Wrong Answer | N,K = map(int,input().split())
h = list(map(int,input().split()))
dp = [10**8+1 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(h[i]-h[i+j]))
print(dp) |
p03161 | s729220068 | Wrong Answer | n,k = list(map(int, input().split()))
nums = list(map(int, input().split()))
best = [999999]*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 | s810332338 | Wrong Answer | n,k = map(int, input().split())
H = [0]+list(map(int, input().split()))
dp = [float("inf")]*(n+1)
dp[0] = 0
dp[1] = 0
for i in range(n):
for k_i in range(1, k+1):
if i+k_i<=n:
dp[i+k_i] = min(dp[i+k_i], dp[i]+abs(H[i+k_i]-H[i]))
print(dp[-1]) |
p03161 | s756113613 | Wrong Answer | n, k = map(int, input().split())
h = [int(i) for i in input().split()]
dp = [1e5]*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[n-1]) |
p03161 | s967832874 | Wrong Answer | import numpy as np
import sys
n, k = map(int, input().split())
dp = np.full(n, 100005, dtype=int)
h = np.array([int(x) for x in input().split()])
dp[0] = 0
for i in range(n):
j = 1
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 | s064769274 | Wrong Answer | import numpy as np
n, k = map(int, input().split())
arr = np.concatenate(
[np.array(list(map(int, input().split()))), np.zeros(k, dtype=int)])
INF = 1 << 20
# dp初期化
dp = np.full(n + k, INF, dtype=int)
dp[0] = 0
for i in range(n):
for j in range(1, k + 1):
dp[i + j] = min(dp[i + j], dp[i] + np.abs(arr[i + j] - arr[i]))
print(dp[n - 1]) |
p03161 | s575365858 | Wrong Answer | n,k=map(int,input().split())
h=[int(x) for x in input().split()]
a=[10000]*(n+k+1)
b=[0]*(k)
h.extend(b)
a[0]=0
for i in range(n):
for j in range(1,k+1):
a[i+j]=min(a[i+j], a[i]+abs(h[i]-h[i+j]))
print(a[n-1]) |
p03161 | s016218647 | Wrong Answer | n,k = map(int,input().split())
h = list(map(int,input().split()))
h = [h[0]]*k + h
cost = [0] * (k+1) +[1010]*(n-1)
for i in range(n):
i+=k
for j in range(k):
cost[i] = min(cost[i-j-1]+abs(h[i]-h[i-j-1]),cost[i])
print(cost[-1]) |
p03161 | s382898092 | Wrong Answer | import numpy as np
N, K = map(int, input().split())
#Hs = [int(i) for i in input().split()]
*Hs, = map(int, input().split())
DP_list = [np.inf for _ in range(N)]
DP_list[0] = 0
for i in range(1, N):
for j in range( max(i-K,0), i):
if j >= 0:
this_time_score = DP_list[j] + np.abs(Hs[j] - Hs[i])
DP_list[i] = min(DP_list[i] , this_time_score)
print(DP_list) |
p03161 | s778741898 | Wrong Answer | n, k = map(int, input().split())
l = 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, k+1):
if i+j <= n-1:
temp = dp[i] + abs(l[i+j] - l[i])
if dp[i] + temp < dp[i+j]:
dp[i+j] = temp
print(dp[n-1]) |
p03161 | s151745061 | Wrong Answer | N, K = map(int, input().split())
h = list(map(int, input().split()))
dp = [0] * N
for i in range(1, N):
m = 10**8
for j in range(1, K+1):
k = i - j
if k >= 0:
m = min(m, abs(h[i] - h[k]) + dp[k])
dp[i] = m
print(dp[N-1])
|
p03161 | s503067195 | 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(1,K+1):
if i-k>=0:
cost[i]=min(abs(listH[i-k]-listH[i])+ cost[i-k],cost[i])
ans=cost[-1]
print(ans) |
p03161 | s818655535 | Wrong Answer | N,K=map(int,input().split())
h=list(map(int,input().split()))
cost=[-1 for _ in range(N)]
for i in range(N):
if i==0:
cost[i]=0
else:
siten=max(i-K,0)
min_cost=10**6
for j in range(siten,i):
m=cost[j]+abs(h[j]-h[i])
min_cost=min(min_cost,m)
cost[i]=min_cost
print(int(cost[N-1])) |
p03161 | s009385036 | Wrong Answer | N, K = map(int,input().split())
h = list(map(int,input().split()))
dp = [10000000]*(N)
dp[0]=0
for i in range(1,N):
for j in range(0,K+1):
if 0<=i-j:
dp[i]=min(dp[i],dp[i-j]+abs(h[i-j]-h[i]))
print(dp[-1]) |
p03161 | s611730258 | 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
for i in range(n-1):
for j in range(1, k+1):
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 | s289801634 | Wrong Answer | 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]-h[i+j]))
print(dp[-1])
print(dp) |
p03161 | s319395475 | Wrong Answer | n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [1000000000 for _ in range(n)]
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[j]-h[i]))
ans = dp[n-1]
print(ans)
|
p03161 | s003168925 | 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 | s197467996 | 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(min(i+1,K)):
cost[i]=min(abs(listH[i-k-1]-listH[i])+ cost[i-k-1],cost[i])
ans=cost[-1]
print(ans) |
p03161 | s136087266 | Wrong Answer | N,K=map(int,input().split())
A=list(map(int,input().split()))
A+=[0]*N
dp=[float("INF")]*(2*N)
dp[0]=0
for i in range(N-K+1):
for j in range(1,K+1):
dp[i+j]=min(abs(A[i+j]-A[i])+dp[i],dp[i+j])
print(dp[N-1]) |
p03161 | s254973543 | Wrong Answer | import numpy as np
N, K = map(int, input().split(' '))
h = np.array(list(map(int, input().split(' '))))
dp = np.zeros(len(h), dtype=int)
for i in range(1, len(h)):
start = max(0, i-K)
print(start)
print(dp[start:i] + np.abs(h[i] - h[start:i]))
dp[i] = min(dp[start:i] + np.abs(h[i] - h[start:i]))
print(dp[-1]) |
p03161 | s558767943 | Wrong Answer | def main():
n,k= map(int,input().split())
h = [int(i) for i in input().split()]
inf = 10**7
dp = [inf]*100005
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-j] - h[i]))
print(dp[n-1])
main() |
p03161 | s934894357 | Wrong Answer | n,m = map(int,input().split())
l = list(map(int,input().split()))
dp = [0]+ [100000000]*(n-1)
for i in range(1,n):
ans = dp[i]
for j in range(1,m+1):
if i-j >= 0:
ans = min(ans,dp[i-j]+abs(l[i]-l[i-j]))
dp[i] = ans
print(dp[n-1]) |
p03161 | s945854674 | Wrong Answer | ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n,k=nm()
h=nl()
dp = [10**5] * n
dp[0] = 0
for i in range(n):
for j in range(max(0,i-k),i):
dp[i] = min(dp[i], dp[j] + abs(h[j]-h[i]))
print(dp[n-1])
|
p03161 | s483029160 | Wrong Answer | n, k = list(map(int, input().split()))
nums = list(map(int, input().split()))
dp = [0 for _ in range(n)]
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 | s601299388 | Wrong Answer | import sys
reader = (s.rstrip() for s in sys.stdin)
MAX = 100000000
input = reader.__next__
# do magic here
n, k = map(int, input().split())
heights = [int(x) for x in input().split()]
dp = [0 for x in range(n)]
for x in range(1, n):
i = x-1
ans = MAX
while i >= max(0, x-k):
ans = min(ans, abs(heights[x]-heights[i]) + dp[i])
i -= 1
dp[x] = ans
print(dp[n-1])
|
p03161 | s201106608 | Wrong Answer | """
author : halo2halo
date : 4, Feb, 2020
"""
import sys
# import itertools
# import math
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
INF = 10 ** 9
N, K, *H = map(int, read().split())
dp = [0] * N
for i in range(1, N):
dp[i] = dp[i - 1] + abs(H[i] - H[i - 1])
for j in range(1,K+1):
if i >= j:
dp[i] = min(dp[i],dp[i - j] + abs(H[i] - H[i - j]))
print(dp)
print(dp[N-1])
|
p03161 | s210663618 | 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(0, n):
for j in range(1, k + 1):
if j > n:
break
dp[i] = min(dp[i], dp[i-j] + abs(h[i] - h[i - j]))
print(dp[n - 1])
|
p03161 | s548008591 | Wrong Answer | N, K = map(int,input().split())
h = list(map(int,input().split()))
dp = [0] * N
dp[1] = abs(h[0] - h[1])
for i in range(2, N):
dp[i] = min([dp[j] + abs(h[i] - h[j]) for j in range(i - K, i) if j >= 0])
print(dp) |
p03161 | s184889404 | Wrong Answer | n,k= map(int,input().split())
h1=list(map(int,input().split()))
if k>=n-1:
print(abs(h1[0]-h1[n-1]))
else:
dp=[-1]*n
dp[n-1]=0
for y in range(n-k-1,n-1):
dp[y]=abs(h1[n-1]-h1[y])
for u in range(k+1,n):
i=(n-1-u)
dp[i]=min([dp[i+h]+abs(h1[i+h]-h1[i]) for h in range(1,k+1)])
print(dp[0],dp) |
p03161 | s400460300 | 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(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 | s039235264 | Wrong Answer | x,k=map(int,input().split())
a=list(map(int,input().split()))
dp=[0]*x
dp[1]=abs(a[1]-a[0])
for i in range(2,x):
p=100000001
#print(i-k,i)
for j in range(max(0,i-k),i):
#print(i,j)
p=min(p,dp[j]+abs(a[i]-a[j]))
dp[i]=p
print(dp[x-1]) |
p03161 | s409604240 | 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][K]=min(dp[i][0:K])
print(dp[N-1][K]) |
p03161 | s592475053 | Wrong Answer | N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
INF = 10**5
DP = [INF] * ((10**5)+10)
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)
print(DP[N-1]) |
p03161 | s001104037 | 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 = abs(h[i] - h[i - 1])
for step in range(1, K + 1):
# print("i, k:", i, k)
if i - step < 0:
break
value = min(value, S[i - step] + abs(h[i] - h[i - step]))
#print("value", value)
S[i] = value
# print(S)
# print(S)
print(S[N - 1])
|
p03161 | s287095611 | Wrong Answer | ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
n,k=mi()
h=li()
INF=10*9
dp = [0]*n
for i in range(1,n):
st = max(0,i-k)
comp = INF
for j in range(st,i):
comp = min(comp,dp[j]+abs(h[i] - h[j]))
dp[i] = comp
print(dp[n-1]) |
p03161 | s048973512 | Wrong Answer | N, K = map(int, input().split())
h = [int(x) for x in input().split()]
# list dp retains information for the minimum costs
# if dp[i] = n, it means n is the minimum cost to get to i step
# if dp[i] = INF, it means the minimum cost has not been evaluated yet
INF = float('inf')
dp = [INF for _ in range(N+K+10)]
# initial state
dp[0] = 0
for i in range(N):
for j in range(1, min(K+1, len(h)-i)):
dp[i+j] = min(dp[i] + abs(h[j+i] - h[i]), dp[i+j])
dp[N-1] |
p03161 | s815690376 | Wrong Answer | N, K = map(int, input().split())
H = list(map(int, input().split()))
INF = 10**4
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 | s508899312 | Wrong Answer | size, jumps = map(int, input().split())
array = list(map(int, input().split()))
dp = [9999999] * size
dp[0]= 0
for i in range(size):
for j in range(i + 1, i+jumps+1):
if j < size:
dp[j] = min(dp[j], dp[i]+abs(array[i] - array[j]))
print(dp[size-1])
|
p03161 | s859606141 | Wrong Answer | N, K = map(int, input().split())
[*h] = map(int, input().split())
dp = [10**4 for _ in range(N)]
dp[0] = 0
for i in range(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 | s941736485 | Wrong Answer | N, K = map(int, input().split())
h = [int(i) for i in input().split()]
dp = [10**6] * N
dp[0] = 0
dp[1] = abs(h[1]-h[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-j] - h[i]))
print(dp[N-1]) |
p03161 | s141440900 | Wrong Answer | import math
def min_cost(arr):
n = len(arr)
dp = [100000000 for _ in range(n)]
dp[0] = 0
dp[1] = abs(arr[1]- arr[0])
for i in range(2,n):
for j in range(1,k+1):
if i - j >= 0:
#print(i)
dp[i] = min(dp[i],dp[i-j] + abs(arr[i]-arr[i-j]))
return dp[n-1]
n,k = map(int,input().split())
arr = list(map(int,input().split()))
print(min_cost(arr)) |
p03161 | s279052067 | Wrong Answer | ##Educational-DP B
n,k = map(int,input().split())
h = list(map(int,input().split()))
dp = [999999] * 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 | s831620738 | Wrong Answer | 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):
minimum = 10**9
for j in range(1,K+1):
if i-j<0:
break
else:
if dp[i-j]-abs(H[i]-H[i-j]) < minimum:
minimum = dp[i-j]+abs(H[i]-H[i-j])
dp[i] = minimum
print(dp[-1])
|
p03161 | s168635041 | 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+1):
if i-k>=0:
cost[i]=min(abs(listH[i-k]-listH[i])+ cost[i-k],cost[i])
ans=cost[-1]
print(ans) |
p03161 | s576162403 | Wrong Answer | [N,K]=[int(i) for i in input().split()]
h=[int(i) for i in input().split()]
DP=[140000 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 | s037973035 | Wrong Answer | N, K = map(int, input().split())
arr = list(map(int, input().split()))
dp = [10**6] * 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 | s496228118 | 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(1,N):
for j in range(max(0,i-K),i):
DP[i]=min(DP[i],abs(H[i]-H[j])+DP[j])
print(DP[-1]) |
p03161 | s745012823 | Wrong Answer | N, K = map(int, input().split())
H = list(map(int, input().split()))
INF = 10**4 + 1
L = [INF]*N
L[0] = 0
for i in range(1, N):
for k in range(1, K+1):
if i - k >= 0:
L[i] = min(L[i], L[i-k] + abs(H[i] - H[i-k]))
print(L[N-1]) |
p03161 | s519789170 | Wrong Answer | N, K = map(int, input().split())
h = list(map(int, input().split()))
t = pow(10,10)
dp_h = [t] * N
dp_h[1] = abs(h[1] - h[0])
for i in range(2,N):
tmp_min = dp_h[i]
for j in range(min(i, K)):
tmp = abs(h[i] - h[i - j - 2]) + dp_h[i-j-2]
if h[i] - h[i-j-2] == 0:
tmp_min = tmp
break
if tmp < tmp_min:
tmp_min = tmp
dp_h[i] = tmp_min
print(dp_h[N-1])
|
p03161 | s285609201 | Wrong Answer | N,K = map(int,input().split())
h = list(map(int,input().split()))
#print(h)
dp = [9999 for i in range(N)]
dp[0] = 0
#print(dp)
for i in range(N):
for j in range(K+1):
if N-1 < i+j:
break
else:
dp[i+j] = min(dp[i+j],dp[i] + abs(h[i] - h[i+j]))
print(dp[N-1]) |
p03161 | s750189433 | Wrong Answer | def function(l,n,k):
dp=[1e6]*(n+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]+abs(l[i]-l[i+j]),dp[i+j])
else:
break
print(dp[n])
n,k=[int(i) for i in input().split()]
l=[int(i) for i in input().split()]
function(l,n-1,k) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.