problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03161 | s232798357 | Wrong Answer | import numpy as np
#入力
N,K=map(int,input().split())
H=list(map(int,input().split()))
dp = np.ones(N+1,dtype=float)*float('inf')
dp[0]=0
dp[1]=0
for i in range(N):
if i!=0:
for k in range(K):
if i-(k+1)>=0:
dp[i+1] = min ( dp[i+1] ,dp[i-k] + abs(H[i]-H[i-(k+1)]) )
print(dp[N])
# print(dp) |
p03161 | s665920007 | 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])
if m<min_cost:
min_cost=m
cost[i]=min_cost
print(int(cost[N-1])) |
p03161 | s181821830 | Wrong Answer | n,k=map(int,input().split())
h=list(map(int,input().split()))
s=[0,abs(h[1]-h[0])]
total=10**5
for i in range(2,n):
for j in range(1,k+1):
if i-j<0:
break
total=min(total,abs(h[i]-h[i-j])+s[i-j])
s.append(total)
total=10**6
print(s[-1]) |
p03161 | s816646102 | Wrong Answer | from sys import stdin,stdout
n,k=map(int,stdin.readline().split())
l=list(map(int,stdin.readline().split()))
l1=[]
for i in range(min(n,k)):
l1.append(abs(l[i]-l[0]))
for i in range(min(n,k),n):
cost=10**5
if k>i:
x=i
else:
x=k
for j in range(1,x+1):
cost=min(cost,abs(l[i]-l[i-j])+l1[-j])
l1.append(cost)
stdout.write(str(l1[-1])+'\n')
|
p03161 | s359769747 | Wrong Answer | n,k=map(int,input().split())
h=list(map(int,input().split()))
dp=[1000000000 for i in range(n)]
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(1,n+1):
for j in range(i+1,i+k+1):
if(j<n):
dp[j]=min(dp[i]+abs(h[j]-h[i]),dp[j])
print(dp[n-1])
|
p03161 | s235318114 | 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(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 | s937169835 | Wrong Answer | N, K = map(int, input().split())
lst = [int(x) for x in input().split()]
dp = [100 ** 10] * N
dp[0] = 0
dp[1] = abs(lst[0] - lst[1])
for i in range(2, N):
j = K
while j > 0:
if i - j >= 0:
tmp = dp[i - j] + abs(lst[i - j] - lst[i])
dp[i] = min(dp[i], tmp)
j -= 1
print(dp)
|
p03161 | s479532911 | Wrong Answer | import math
from decimal import *
n, k = map(int, input().split())
nos = list(map(int, input().split()))
dp = [int(10e6) for i in range(n)]
dp[0] = 0
if(n>1):
dp[1] = abs(nos[1]-nos[0])
for y in range(2, n):
for x in range(1, k+1):
if(y-x >= 0):
dp[y] = min(dp[y], abs(nos[y-x]-nos[y])+dp[y-x])
print(dp[n-1]) |
p03161 | s816190680 | Wrong Answer | N, K = map(int, input().split())
h = list(map(int, input().split()))
dp = [-1] * N
dp[0] = 0
inf = 1000000
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 | s660378288 | Wrong Answer | def compute(n, k, h):
inf = 1e9
if n == 1:
return 0
dp = [inf] * n
dp[0] = 0
for i in range(1, n):
for j in range(i + 1, i + k + 1):
if j < n:
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]))
return dp[-1]
if __name__ == '__main__':
N, K = map(int, input().split())
h = list(map(int, input().split()))
print(compute(N, K, h)) |
p03161 | s013850332 | 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[-1]) |
p03161 | s014464937 | Wrong Answer | n,k = map(int,input().split())
h = list(map(int,input().split()))
c = []
c.append(0)
for i in range(1,n):
c.append(min([c[max(i-k,0)]+abs(h[i]-h[max(i-j,0)]) for j in range(1,k+1)]))
print(c[n-1]) |
p03161 | s636055632 | Wrong Answer | import numpy as np
n,k = map(int, input().split(" "))
l = list(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] = np.minimum(dp[i], dp[j]+abs(l[j]-l[i]))
print(dp[-1])
|
p03161 | s354547560 | Wrong Answer | N, K = map(int, input().split())
H = list(map(int, input().split()))
DP = [10**9]*N
DP[0] = 0
DP[1] = abs(H[1]-H[0])
for i in range(K, N):
for k in range(2,K+1):
for l in range(1,k+1):
DP[i-K+k] = min(DP[i-K+k], DP[i-K+k-l]+abs(H[i-K+k]-H[i-K+k-l]))
print(DP[-1]) |
p03161 | s268175862 | 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-1]-listH[i])+ cost[i-k-1],cost[i])
ans=cost[-1]
print(ans) |
p03161 | s319793210 | 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 + 1, 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 | s894475703 | Wrong Answer | def main():
n, k = map(int, input().split())
stns = [int(i) for i in input().split()]
INF = 10**9
dp = (n + k) * [INF]
dp[0] = 0
k = k + 1
for i in range(n):
for j in range(1, k):
j = j + i
if j < n: dp[j] = min(dp[j], dp[i] + abs(stns[i] - stns[j]))
else: break
print(dp[-1])
if __name__ == "__main__":
main()
|
p03161 | s352116024 | Wrong Answer | n, k = map(int,input().split())
h = list(map(int,input().split()))
dp = [10000]*n
dp[0] = 0
for i in range(n):
for j in range(k+1):
if 0 <= i-j:
dp[i] = min(dp[i], dp[i-j] + abs(h[i-j]-h[i]))
print(dp[n-1]) |
p03161 | s030948572 | 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-1):
for j in range(i + 1, min(N, i + K + 1)):
DP[j] = min(DP[j], DP[i] + abs(High[i] - High[j]))
print(DP[N-1]) |
p03161 | s061644211 | 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 | s958437704 | 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):
m = []
for j in range(1, k+1):
m.append(dp[i-j] + abs(h[i]-h[i-j]))
dp[i] = min(m)
print(dp[-1])
|
p03161 | s372021013 | 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[N-1]) |
p03161 | s981247439 | Wrong Answer | N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
INF = 10**5
DP = [INF] * N
DP[0] = 0
for i in range(N):
for j in range(1, K+1):
if i + j < N:
DP[i+j] = min(DP[i+j], DP[i] + abs(H[i] - H[i+j]))
# print(DP)
# print('--')
print(DP[N-1]) |
p03161 | s741224661 | Wrong Answer | n,k = map(int,input().split())
h = list(map(int,input().split()))
dp = [0,abs(h[1]-h[0])]
for i in range(2,n):
u = []
for j in range(1,min(i-1,k)+1):
u.append(dp[i-j]+abs(h[i]-h[i-j]))
dp.append(min(u))
print(dp[n-1]) |
p03161 | s001293618 | 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):
dp[i + 1: i + k + 1] = np.minimum(dp[i + 1: i + k + 1], dp[i] + np.abs(arr[i + 1: i + k + 1] - arr[i]))
print(dp[n]) |
p03161 | s057411332 | Wrong Answer | [n,k] = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
dp = [1000000000] * n
dp[0] = 0
for i in range(1,n):
for j in range(1,min(k,i)+1):
dp[i] = min(dp[i],dp[i-j] + abs(h[i] - h[i-j]))
print(dp[n-1])
print(dp)
|
p03161 | s963631919 | 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], minToatalCostList[i-j] + abs(h[i] - h[i-j]) )
print(minToatalCostList[N-1]) |
p03161 | s662398141 | 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):
con = inf
for j in range(1,min(k,i)+1):
con = min(con,dp[i-j] + abs(h[i-j] - h[i]))
dp[i] = con
print(dp[n-1])
main() |
p03161 | s236343068 | Wrong Answer | n, k = list(map(int,input().split()))
l = list(map(int,input().split()))
dp = [10**8]*n
dp[0] = 0
dp[1] = abs(l[0] - l[1])
for i in range(2,n):
for j in range(i-1,max(0,i-k)-1,-1):
tem = dp[j] + abs(l[i] - l[j])
if tem<dp[i]:
dp[i] = tem
print(dp[n-1])
|
p03161 | s475313992 | Wrong Answer | N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
INF = 10**6
# DP = [INF] * N
DP = [INF] * ((10**5)+10)
DP[0] = 0
for i in range(1, N):
for j in range(1, K+1):
if 0 <= i - j < N:
DP[i] = min(DP[i], DP[i-j] + abs(H[i-j] - H[i]))
print(DP[N-1])
|
p03161 | s817180205 | Wrong Answer | # B Frog 2
n, k = map(int, input().split())
h_list = [int(x) for x in input().split()]
dp = [float('Inf')] * n
dp[0] = 0
for i in range(1,n,1):
for j in range(i):
dp[i] = min(dp[i], dp[j] + abs(h_list[i]-h_list[j]))
print(dp[n-1]) |
p03161 | s573110606 | Wrong Answer | N,K = [int(i) for i in input().rstrip().split()]
H = [int(i) for i in input().rstrip().split()]
H = [H[0]]*K + H
C = [0]*K
print(H)
print(C)
for i,h in enumerate(H):
if i < K: continue
c = [C[-1-j]+abs(H[i-j-1]-h) for j in range(K)]
C += [min(c)]
print(C[-1]) |
p03161 | s763105355 | Wrong Answer | N, K = map(int, input().split(' '))
heights = tuple(map(int, input().split(' ')))
dp = [10 ** 6] * N
dp[0] = 0
for i in range(N):
for j in range(i + 1, min(N, i + 1 + K)):
dp[j] = min(dp[j], dp[i] + abs(heights[i] - heights[j]))
print(dp[N - 1])
|
p03161 | s879636751 | Wrong Answer | N, K = input().split()
N = int(N)
K = int(K)
h = [int(x) for x in input().split()]
dp = [100000000]*( len(h) )
dp[0] = 0
for ii in range( 1, len(dp) ):
for kk in range( max(0, ii-K), ii ):
dp[ii] = min( dp[ii], dp[kk] + abs( h[kk] - h[ii] ) )
print(dp[-1]) |
p03161 | s981129774 | Wrong Answer | def b_frog_2(stones, k):
dp = [10e5+1] * 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))
if __name__ == '__main__':
main2() |
p03161 | s655454115 | Wrong Answer | N,K=map(int,input().split())
h=list(map(int,input().split()))
DP=[10000000000]*N
for i in range(1,N):
mi=10000
if i<K:
for j in range(i):
mi=min(mi,DP[j]+abs(h[j]-h[i]))
else:
for j in range(1,K+1):
mi=min(mi,DP[i-j]+abs(h[i]-h[i-j]))
DP[i]=mi
print(DP[N-1]) |
p03161 | s429018169 | Wrong Answer | import sys
input = sys.stdin.readline
N, K = map(int,input().split())
H = list(map(int,input().split()))
DP = [0]*N
for _ in range(1,N):
Hi = H[_]
c = 10**5
for j in range(max(0,_-K),_):
c = min(c, DP[j] + abs(Hi - H[j]))
DP[_] = c
print(DP[-1]) |
p03161 | s890137010 | Wrong Answer | # EDPC B Frog 2
N, K = map(int, input().split())
H = list(map(int,input().split()))
f_inf = float("inf")
cost = [f_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+1,N-i)):
cost[i] = min(cost[i],cost[i-k]+abs(H[i]-H[i-k]))
print(cost[N-1]) |
p03161 | s890390822 | 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 | s032508672 | 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+K+1, 10**5)
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(N):
for k in range(1,K+1):
if i+k <= N-1:
cost = np.abs(h[i+k] - h[i])
dp[i + k] = min(dp[i] + cost, dp[i + k])
# print(dp)
print(dp[N-1]) |
p03161 | s896352841 | Wrong Answer | import sys
n,k = map(int,input().split())
a = list(map(int,input().split()))
dp = [0]*(n)
dp[0] = 0
for i in range(n):
for j in range(i+1,k+i+1):
if j<n:
dp[j] = min(dp[j],dp[i]+abs(a[i]-a[j]))
print(dp[n-1])
|
p03161 | s288242183 | Wrong Answer | N, K = [int(item) for item in input().split()]
h =[0] + [int(item) for item in input().split()]
dp = [0 for _ in range(N+1)]
for i in range(N+1):
for k in range(1, K+1):
if i - k >= 1:
if dp[i] != 0:
dp[i] = min(dp[i-k] + abs(h[i] - h[i-k]), dp[i])
else:
dp[i] = dp[i-k] + abs(h[i] - h[i-k])
print(dp[N]) |
p03161 | s302470674 | Wrong Answer | from sys import stdin,stdout
n,k=map(int,stdin.readline().split())
a=list(map(int,stdin.readline().split()))
dp=[9999]*n;dp[-1]=0
for i in range(n-1,-1,-1):
for j in range(i+1,min(n,i+k+1)):
dp[i]=min(dp[i],abs(a[i]-a[j])+dp[j])
#print(dp,sep=' ')
stdout.write(str(dp[0])+'\n') |
p03161 | s961899099 | Wrong Answer | N, K = map( int, input().split() )
h = list( map( int, input().split() ))
l = [0] + [ 1000000 ] * ( N - 1 )
for i in range( N ):
for j in range( K + 1 ):
if i - j >= 0:
l[ i ] = min( l[ i ], l[ i - j ] + abs( h[ i ] - h[ i - j ]))
print( l[ N - 1 ] ) |
p03161 | s067811918 | 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) |
p03161 | s428973275 | 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(2, N):
for j in range(1, K+1):
if i - j >= 0:
ans[i] = min(ans[i], ans[i-j] + abs(H[i] - H[i-j]))
print(ans[N-1]) |
p03161 | s006153303 | Wrong Answer | N, K = map(int, input().split())
H = list(map(int, input().split()))
H = [H[0]]*K+H
DP = [0]*(K+N)
for i in range (K, K+N):
minimum = 100000000
for j in range (1, K+1):
if abs(H[i]-H[i-j])+DP[i-j] < minimum:
minimum = abs(H[i]-H[i-j])+DP[i-j]
DP[i] = minimum
print(DP[-1]) |
p03161 | s866730727 | 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 | s878606596 | Wrong Answer | n, k = map(int, input().split())
h = list(map(int, input().split()))
inf = 1001001001
dp = [inf] * (n+1)
dp[0] = 0
dp[1] = abs(h[0]-h[1])
for i in range(n):
for j in range(k):
if i + j >= n:
break
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i + j]))
print(dp[n-1])
|
p03161 | s925723348 | Wrong Answer | n, k = map(int, input().split())
arr = list(map(int, input().split()))
dp = [10001]*n
dp[0] = 0
for i in range(n):
for j in range(1, k+1):
if j > i:
break
dp[i] = min(dp[i], abs(arr[i]-arr[i-j]) + dp[i-j])
print(dp[-1])
|
p03161 | s491107289 | Wrong Answer | import sys
import numpy as np
#inputを高速化する。
input = sys.stdin.readline
n, k = map(int, input().split())
h = [int(i) for i in input().split()]
# dpの配列を作る。
dp = np.zeros(n, dtype=int)
# hの配列を作る。
h = np.array(h)
for i in range(1, n):
# start は負になることはない。
start = max(0, i-k)
print(start)
# 行列として足し算できるのでforを使う必要がない。
dp[i] = min(dp[start: i] + np.abs(h[i] - h[start: i]))
print(dp)
print(dp[n-1]) |
p03161 | s396768595 | 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-1]) |
p03161 | s647556967 | Wrong Answer | N, K = map(int, input().split())
H = list(map(int, input().split()))
H = [0] + H
dp = [0] * (N + 1)
dp[1] = 0
dp[2] = abs(H[2] - H[1])
for i in range(3, N+1):
dp[i] = dp[i - 1] + abs(H[i] - H[i - 1])
for j in range(max(1, i - K), K + 1):
dp[i] = min(dp[i], dp[i - j] + abs(H[i] - H[i - j]))
print(dp[N]) |
p03161 | s542289350 | Wrong Answer | n,k=map(int,input().split())
h=list(map(int,input().split()))
INF=float('inf')
dp=[0]*(n+1)
dp[0]=INF
dp[1]=0
s=[]
for i in range(2,n+1):
if i-3<0:
dp[i]=dp[i-1]+abs(h[i-1]-h[i-2])
else:
for j in range(1,k):
s.append(dp[i-j]+abs(h[i-1]-h[i-j-1]))
s.sort()
dp[i]=s[0]
print(dp[n]) |
p03161 | s266927818 | Wrong Answer | N, K = map(int,input().split())
h = [int(i) for i in input().split()]
dp = [10**5]*N
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 | s157181259 | Wrong Answer | import numpy as np
n, k = map(int, input().split())
h = np.array([int(i) for i in input().split()])
dp = np.zeros(n+1)
for i in range(1, n):
j = max(0, i-k)
dp[i] = np.min(dp[j:i] + abs(h[i] - h[j:i]))
print(dp[-1])
|
p03161 | s454107504 | 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 | s048865352 | Wrong Answer | n,k = map(int,input().split())
h = list(map(int,input().split()))
start = h[0]
for i in range(n):
h[i] -= start
dp = [10**4]*n
dp[0] = h[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[-1]) |
p03161 | s010500200 | Wrong Answer | n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [100] * 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 | s128890682 | Wrong Answer | import sys
read = lambda: sys.stdin.readline().rstrip()
def main():
INF = 10 ** 20
n,k = map(int,input().split())
h = tuple(map(int,read().split()))
dp = [INF]*(n+1)
dp[0] = 0
for step in range(1, k+1):
for i in range(step,n):
dp[i] = min(dp[i], dp[i-step]+abs(h[i]-h[i-step]))
print(dp[n-1])
if __name__ == "__main__":
main() |
p03161 | s939685057 | Wrong Answer | N,K = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
minToatalCostList = [0 for i in range(N)]
minToatalCostList[0] = 0
for i in range(1,N) :
minToatalCostList[i] = 10000
for j in range(1,K+1) :
if j > i or minToatalCostList[i] == 0:
break
else :
minToatalCostList[i] = min(minToatalCostList[i], minToatalCostList[i-j] + abs(h[i] - h[i-j]) )
print(minToatalCostList[N-1]) |
p03161 | s702871361 | Wrong Answer | n,k=map(int,input().split())
h=list(map(int,input().split()))
cost=[10**5+1]*n
cost[0]=0
for i in range(n):
for j in range(min(k+1,n-i)):
cost[i+j]=min(cost[i+j],cost[i]+abs(h[i]-h[i+j]))
print(cost[n-1]) |
p03161 | s680423089 | Wrong Answer | N, K = map(int, input().split())
h = [0] + list(map(int, input().split()))
dp = [0]*(N+1) # 足場iにたどり着くまでの最小コスト
for i in range(2,N+1):
for j in range(1,K+1):
dp[i] = dp[i-1] + abs(h[i]-h[i-1])
if i-j >= 0:
dp[i] = min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
print(dp[-1]) |
p03161 | s589148249 | Wrong Answer | from sys import stdin
MAX=10001
N,K=map(int,stdin.readline().split())
h=[int(i) for i in stdin.readline().split()][:N]
dp=[MAX for i in range(N)]
dp[0]=0
for i in range(N):
for j in range(i+1,i+K+1):
if j<N:
dp[j]=min(dp[j],dp[i]+abs(h[j]-h[i]))
#print(dp)
print(dp[-1]) |
p03161 | s870224495 | Wrong Answer | N, K = map(int, input().split())
H = list(map(int, input().split()))
INF = 10**8
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 | s655510821 | Wrong Answer | import numpy as np
N, K = map(int, input().split())
H = np.array(list(map(int, input().split())) + [0]*K)
table = np.full(N + K, 10 ** 10)
table[0] = 0
for i in range(1, N):
table[i:i + K] = np.minimum(table[i:i + K], np.abs(H[i:i + K] - H[i - 1]) + table[i - 1])
print(table[N - 1])
|
p03161 | s555769890 | Wrong Answer | n,k = map(int,input().strip().split(" "))
arr = list(map(int,input().strip().split(" ")))
dp = [0]*n
dp[0] = 0
for i in range(1,min(n,k)):
mn = 100000
for j in range(i-1,-1,-1):
p = abs(arr[i]-arr[j])
mn = min(mn,p+dp[j])
dp[i] = mn
for i in range(min(n,k),n):
mn = 100000
for j in range(i-k,i,1):
p = abs(arr[i]-arr[j])
mn = min(mn,p+dp[j])
dp[i] = mn
print(dp[n-1]) |
p03161 | s652310621 | 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(1,k):
if j > len(h):
break
con = min(con,dp[i-j]+abs(h[i]-h[i-j]))
if abs(h[i]-h[i-j]) == 0:
break
dp[i] = con
print(dp[n-1]) |
p03161 | s076203811 | Wrong Answer | n,k=map(int,input().split())
dp=[0]*(n+1)
h=list(map(int,input().split()))
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
mincost=100000000
for j in range(1,k+2):
if i-j<0:
break
tmp=dp[i-j]+abs(h[i]-h[i-j])
mincost=min(mincost,tmp)
dp[i]=mincost
print(dp[n-1]) |
p03161 | s999817403 | 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<1:
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 | s302726038 | Wrong Answer | N, K = map(int, input().split())
h = list(map(int, input().split()))
dp = [float('inf')] * N
dp[0] = 0
dp[1] = h[1] - h[0]
for i in range(2, N):
for j in range(1, K+1):
if j <= i:
dp[i] = min(dp[i], dp[i-j] + abs(h[i] - h[i-j]))
print(dp[-1]) |
p03161 | s016257762 | Wrong Answer | import math
n, k = map(int,input().split())
h = list(map(int, input().split()))
res = [10**5] * 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 | s209045532 | Wrong Answer | import sys
input = sys.stdin.readline
n, k = map(int, input().split())
h = list(map(int, input().split()))
dp = [100000]*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 | s168679200 | Wrong Answer | import numpy as np
inf=10000007
n,k=map(int,input().split())
h=np.array(list(map(int,input().split())))
dp = np.array([inf]*n)
dp[0]=0
for i in range(1,n):
l=max(0,i-k)
for j in range(l,i):
dp[i]=min(dp[i],dp[j]+abs(h[i]-h[j]))
##print(dp)
##print(li)
print(dp[-1]) |
p03161 | s720049705 | Wrong Answer | #Frog1
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.insert(0,0)
dp={1:0}
for val3 in range(2,n+1):
dp[val3]=int(1e7)
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[val]-h[val-val2]))
print(dp[n])
|
p03161 | s090140050 | Wrong Answer | n,k=[int(i) for i in input().split(' ')]
h=[int(i) for i in input().split(' ')]
dp=[10**10]*n
dp[0]=0
for i in range(n):
for j in range(i+1,i+1+k+1):
if j<n:
dp[j]=min(dp[j],dp[i]+abs(h[i]-h[j]))
print(dp[n-1])
|
p03161 | s330057682 | Wrong Answer | 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(1,size):
for j in range(i+1,1+i+jumps):
if j < size:
dp[j] = min(dp[j], dp[i]+abs(array[i] - array[j]))
print(dp[size-1]) |
p03161 | s247770692 | Wrong Answer | import numpy as np
inf = 10000007
n, k = map(int, input().split())
h = np.array(list(map(int, input().split())))
dp = np.zeros(n, dtype=int)
dp[0] = 0
temp=inf
for i in range(1, n):
l = max(0, i - k)
temp=inf
for j in range(l,i):
temp=min(temp,dp[j]+abs(h[i]-h[j]))
dp[i]=temp
##print(li)
print(dp[-1]) |
p03161 | s853884416 | Wrong Answer | n, k = map( int, input().split() )
h = [ int( hi ) for hi in input().split() ]
#print( n, k )
#print( h )
cost = [ 0 ] * n
for ni in range( 1, n ):
for ki in range( 1, k+1 ):
# print( ni, ki )
if ni-ki >= 0:
costx = cost[ ni-ki ] + max( h[ ni ]-h[ ni-ki ], h[ ni-ki ]-h[ ni ] )
cost[ ni ] = max( cost[ ni-ki ], costx )
print( cost[ n-1 ] )
|
p03161 | s302246991 | 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[N-1]) |
p03161 | s506506553 | Wrong Answer | n, k = map(int, input().split())
h = [int(i) for i in input().split()]
dp = [1e5]*n
dp[0] = 0
dp[1] = abs(h[1]-h[0])
for i in range(2, 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 | s879129858 | Wrong Answer | N, K = map(int,input().split())
H = list(map(int,input().split()))
#DP[i] i番目までの足場を見たときの足場iにたどり着く最小値
DP = [100000000 for _ in range(N + 1)]
DP[0] = 0
for i in range(N):
for k in range(1,K + 1):
if 0 <= i - k and i - k < N:
cost_min = 100000000
cost_min = min(cost_min, DP[i - k] + abs(H[i] - H[i - k]))
DP[i] = cost_min
print(DP[N - 1])
|
p03161 | s705557508 | Wrong Answer | n,k=map(int, input().split())
cost=list(map(int, input().split()))
dp=[999999]*n
dp[0]=0
for i in range(n):
for j in range(i,i+k+1):
if j < n:
dp[j]=min(dp[j],dp[i]+abs(cost[i]-cost[j]))
print(dp[n-1]) |
p03161 | s192327315 | Wrong Answer | N,K=list(map(int,input().split()))
dp_list=[10**7]*N
h=list(map(int,input().split()))
dp_list[0]=0
for i in range(N):
for j in range(1,K+1):
j=i+j
if j<N:
# if dp_list[j] is None:dp_list[j]=abs(h[j]-h[i])+dp_list[i]
dp_list[j]=min(dp_list[j],abs(h[j]-h[i])+dp_list[i])
print(dp_list[-1])
|
p03161 | s741553382 | 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(1,n):
mindp=dp[0]+ abs(h[i-1]- h[0])
for j in range(max(i-k,1),i-2):
mindp= min(dp [j]+ abs(h[i]- h[j]), mindp)
dp[i]=mindp
print(dp[n-1]) |
p03161 | s623774483 | Wrong Answer | N,K=map(int,input().split())
h=list(map(int,input().split()))
dp=[100000000]*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 | s577597248 | Wrong Answer | n, k = map(int, input().strip().split(" "))
h = list(map(int, input().split(" ")))
dp = [0] * n
dp[1] = abs(h[0] - h[1])
for i in range(2, n):
if i >= k:
loop = k
else:
loop = i
tmp = []
dp[i] = 10 ** 4
for j in range(1, loop+1):
dp[i] = min(dp[i], abs(h[i]-h[i-j])+dp[i-j])
print(dp[n-1]) |
p03161 | s148674625 | Wrong Answer | n,k=map(int,input().split())
h=list(map(int,input().split()))
s=[0,h[1]-h[0]]
total=10**5
for i in range(2,n):
for j in range(1,k+1):
if i-j>=0:
total1=abs(h[i]-h[i-j])+s[i-j]
if total>total1:
total=total1
s.append(total)
print(s[-1]) |
p03161 | s313760423 | Wrong Answer | n,k=map(int,input().split())
h=[int(i) for i in input().split()]
h.insert(0,0)
ans=[0]*(n+1)
ans[1]=0
ans[2]=abs(h[2]-h[1])
for i in range(3,n+1):
m=1000000000000000
for j in range(i-1,i-k-1,-1):
if i>=1:
m=min(m,ans[j]+abs(h[i]-h[j]))
else:
break
ans[i]=m
print(ans[n])
|
p03161 | s257054173 | Wrong Answer | n, k = list(map(int,input().split()))
l = list(map(int,input().split()))
dp = [10**8]*n
dp[0] = 0
dp[1] = abs(l[0] - l[1])
for i in range(2,n):
for j in range(i-1,max(0,i-k)-1,-1):
tem = dp[j] + abs(l[i] - l[j])
if tem<dp[i]:
dp[i] = tem
print(dp[n-1])
#print(dp)
|
p03161 | s183810980 | 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 = 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 | s289434752 | 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 | s813956891 | Wrong Answer | N,K=map(int,input().split())
h=list(map(int,input().split()))
DP=[0]*N
for i in range(1,N):
mi=10000
if i<K:
for j in range(i):
mi=min(mi,DP[j]+abs(h[j]-h[i]),abs(h[i]-h[0]))
else:
for j in range(1,K+1):
mi=min(mi,DP[i-j]+abs(h[i]-h[i-j]))
DP[i]=mi
print(DP[N-1]) |
p03161 | s760830383 | 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])
print(dp[N-1][K]) |
p03161 | s497854230 | Wrong Answer | import sys; input = sys.stdin.buffer.readline
import numpy as np
sys.setrecursionlimit(10**7)
from collections import defaultdict
con = 10 ** 9 + 7; INF = 2 ** 63 - 1
def getlist():
return list(map(int, input().split()))
#処理内容
def main():
N, K = getlist()
h = np.array(getlist() + [0] * K, dtype = np.int64)
DP = np.full(N + K, INF, dtype = np.int64)
DP[0] = 0
for i in range(N):
DP[i + 1:i + K] = np.minimum(DP[i + 1:i + K],
DP[i] + np.abs(h[i] - h[i + 1:i + K]))
print(DP[N - 1])
if __name__ == '__main__':
main() |
p03161 | s812815804 | 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(1,min(K,i)+1):
DP[i]=min(DP[i],DP[i-j]+abs(H[i]-H[i-j]))
print(DP[-1]) |
p03161 | s523202607 | Wrong Answer | N, K = map(int, input().split())
H = list(map(int, input().split()))
H = [0] + H
dp = [0] * (N + 1)
dp[1] = 0
dp[2] = abs(H[2] - H[1])
for i in range(3, N+1):
dp[i] = 1000000000
for j in range(max(1, i - K), K + 1):
dp[i] = min(dp[i], dp[i - j] + abs(H[i] - H[i - j]))
print(dp[N]) |
p03161 | s997827974 | Wrong Answer | N, K = map(int, input().split())
H = list(map(int, input().split()))
dp = [0 for _ in range(N)]
for i in range(1, N):
min_cost = 10**5
for j in range(1, K+1):
if i - j < 0:
continue
cost = dp[i-j] + abs(H[i-j] - H[i])
if cost < min_cost:
min_cost = cost
dp[i] = min_cost
print(dp[N-1]) |
p03161 | s158501585 | Wrong Answer | [a,k] = [int(x) for x in input().split()]
hs = [int(x) for x in input().split()]
dp = [0]* len(hs)
dp[0] = 0
dp[1] = abs(hs[1] - hs[0])
for i in range(2, a):
dp[i] = min(abs(hs[i-1]- hs[i]) + dp[i-1], abs(hs[i-2]- hs[i]) + dp[i-2] )
print(dp[-1]) |
p03161 | s163518446 | Wrong Answer | n,k = map(int,input().split())
h = list(map(int,input().split()))
dp = [10000]*n
for i in range(min(k+1,len(h))):
dp[i] = abs(h[i]-h[0])
if k>=n:
print(dp[-1])
exit()
else:
for i in range(k+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[-1]) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.