problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03160 | s966265018 | Wrong Answer | N = int(input())
H = list(map(int, input().split()))
dp = []
for i, h in enumerate(H) :
if (i==0) :
dp.append(0)
continue
if (i==1) :
dp.append(abs(H[0]-H[1]))
continue
one = abs(H[i]-H[i-1])
two = abs(H[i]-H[i-2])
if (one < two):
dp.append(dp[i-1] + one)
else :
dp.append(dp[i-2] + two)
print(dp) |
p03160 | s137381788 | Wrong Answer | N = eval(input())
H = list(map(int, input().split()))
dp = [0, H[1] - H[0]]
if N > 2:
for i in range(2, N):
dp.append(min(abs(H[i] - H[i-2])+dp[-2], abs(H[i] - H[i-1])+dp[-1]))
else:
print(dp[-1])
exit()
print(dp[-1]) |
p03160 | s139216505 | Wrong Answer |
size = int(input())
array = list(map(int, input().split()))
dp = [0]* size
dp[1]= dp[0] + abs(array[1] - array[0])
for i in range(2,size):
dp[i] = min(
dp[i-1] + abs(array[i] - array[i-1]),
dp[i-2] ,abs( array[i] - array[i-2] )
)
print(dp[-1])
|
p03160 | s156574700 | Wrong Answer | n = int(input())
h = list(map(int, input().split()))
dp = [0] * n
for i in range(n):
if i == 0:
continue
elif i == 1:
dp[1] = abs(h[1] - h[0])
continue
else:
dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]), dp[i-2]+abs(h[i]-h[i-2]))
print(dp) |
p03160 | s190754776 | Wrong Answer | N = int(input())
costlist = list(map(int,input().split()))
DP = [0 for i in range(N)]
DP[1]=abs(costlist[1]-costlist[0])
for i in range(N-2):
probmin1 = abs(costlist[i+2]-costlist[i+1]) + costlist[i+1]
probmin2 = abs(costlist[i+2]-costlist[i]) + costlist[i]
plusmin = min(probmin1,probmin2)
DP[i+2]=plusmin
print(DP[-1]) |
p03160 | s764373491 | Wrong Answer | N = int(input())
H = list(map(int, input().split()))
dp = [10**5] * N
dp[0] = 0
for i in range(0, N-1):
dp[i+1] = min(dp[i+1], dp[i] + abs(H[i]-H[i+1]))
if i < N - 2:
dp[i+2] = min(dp[i+2], dp[i] + abs(H[i]-H[i+2]))
print(dp)
print(dp[N-1])
|
p03160 | s628193160 | Wrong Answer | n = int(input())
h = list(map(int, input().split()))
INF = 1 << 40
dp = [INF] * n
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(2, n):
pos = h[i]
if abs(h[i-2] - pos) < abs(h[i-1] - pos):
diff = abs(h[i-2] - pos)
dp[i] = dp[i-2] + diff
else:
diff = abs(h[i-1] - pos)
dp[i] = dp[i-1] + diff
print(dp[-1]) |
p03160 | s616969995 | Wrong Answer | n = int(input())
H = [0]
here = 1
ans = 0
H += list(map(int, input().split()))
while not here == n:
if here == n - 1:
one_step = abs(H[here + 1] - H[here])
ans += one_step
break
else:
one_step = abs(H[here + 2] - H[here])
two_step = abs(H[here + 1] - H[here]) + abs(H[here + 2] - H[here + 1])
if one_step >= two_step:
ans += two_step
here += 1
else:
ans += one_step
here += 2
print(ans) |
p03160 | s909905449 | Wrong Answer | # -*- coding: utf-8 -*-
"""
Created on Wed May 13 12:16:43 2020
@author: PREET MODH
"""
input()
a=list(map(int,input().split()))
i=0
sum=0
while(i+2<len(a)):
if i >=len(a):
break
b=a[i]
store=min(a[i+1],a[i+2])
diff=abs(b-store)
sum=sum + diff
if a[i+1]<a[i+2]:
i=i+1
else:
i=i+2
print(sum) |
p03160 | s422336234 | Wrong Answer | n = int(input())
hlis = list(map(int, input().split()))
dp = [0] + [float('inf')]*(n-1)
for i in range(n-2):
one = abs(hlis[i]-hlis[i+1])
two = abs(hlis[i]-hlis[i+2])
dp[i+1] = min(dp[i]+one, dp[i+1])
dp[i+2] = min(dp[i]+two, dp[i+2])
print(dp[n-1]) |
p03160 | s777791136 | Wrong Answer | n = int(input())
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-2] + abs(h[i] - h[i-1]), dp[i-1] + abs(h[i] - h[i-1]))
print(dp[-1]) |
p03160 | s924506207 | Wrong Answer | # -*- coding: utf-8 -*-
N = int(input())
A = list(map(int, input().split()))
dp = [100000] * N
dp[0] = 0
for i, h in enumerate(A):
for j in (range(1,3)):
if i+j < len(A):
dp[i + j] = min(dp[i + j], dp[i] + abs(A[i] - A[i+j]))
#print(dp)
print(dp[-1])
|
p03160 | s879659713 | Wrong Answer | N = int(input())
*h, = map(int, input().split())
dp = [0] * N
dp[1] = h[1] - h[0]
for i in range(2, N):
c1, c2 = abs(h[i] - h[i - 1]), abs(h[i] - h[i - 2])
if c1 < c2:
dp[i] = dp[i - 1] + c1
else:
dp[i] = dp[i - 2] + c2
print(dp[N - 1])
|
p03160 | s526821911 | Wrong Answer | N=int(input())
h=[0]+list(map(int,input().split()))
dp=[0]*(N+1)
dp[0]=0
dp[1]=0
for i in range(2,N+1):
dp[i]= min( dp[i-2]+abs(h[i]-h[i-2]), dp[i-1]+abs(h[i]-h[i-1]))
print(dp[-1]) |
p03160 | s254152505 | Wrong Answer | INF = 10 ** 4 + 10
def chmin(a, b):
if a > b:
return b
return a
n = int(input())
H = list(map(int, input().split()))
DP = [INF] * n
DP[0] = 0
DP[1] = abs(H[1] - H[0])
for i in range(2, n):
DP[i] = chmin(DP[i], DP[i-1] + abs(H[i] - H[i-1]))
DP[i] = chmin(DP[i], DP[i-2] + abs(H[i] - H[i-2]))
print(DP[-1]) |
p03160 | s860230946 | Wrong Answer | def hoge():
dp =[0] * (n + 1)
dp[0] = 0
dp[1] = abs(h_list[1] - h_list[0])
for i in range(2, n):
dp[i] = min(dp[i-1] + abs(h_list[i] - h_list[i - 1]), dp[i-2] + abs(h_list[i] - h_list[i - 2]))
return dp[n]
def solve():
global n, h_list
n = int(input())
h_list = list(map(int, input().split()))
ans = hoge()
print(ans)
return 0
if __name__ == "__main__":
solve() |
p03160 | s049985334 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
dp=[0 for i in range(n)]
dp[0]=a[0]
dp[1]=abs(a[0]-a[1])
for i in range(n-2):
dp[i+2]=abs(dp[i]-dp[i+2])
dp[i+1]=abs(min(dp[i+1],dp[i]+abs(a[i+1]-a[i])))
if(n>2):
dp[-1]=min(dp[-2]+abs(a[-1]-a[-2]),dp[-3]+abs(a[-3]-a[-2]))
else:
dp[1]=dp[0]+abs(a[0]-a[1])
print(dp[-1])
|
p03160 | s648100865 | Wrong Answer | n = int(input())
h = list(map(int,input().split()))
dp = [10 ** 5 for i in range(n)]
dp[0] = 0
for i in range(n):
if i <= n - 2:
val1 = dp[i] + abs(h[i+1] - h[i])
if val1 < dp[i+1]:
dp[i+1] = val1
if i <= n - 3:
val2 = dp[i] + abs(h[i+2] - h[i])
if val2 < dp[i+2]:
dp[i+2] = val2
print(dp[-1]) |
p03160 | s188090086 | Wrong Answer | import sys
N = int(input())
H = list(map(int,input().split()))
def frog1(n,h):
s = [0]*n
s[0] = 0
s[1] = min(h[1],s[0]+abs(h[1]-h[0]))
for i in range(2,n):
s[i]=min(s[i-2]+abs(h[i]-h[i-2]),s[i-1]+abs(h[i]-h[i-1]))
return s[n-1]
print(frog1(N,H)) |
p03160 | s945086172 | Wrong Answer | n = int(input())
h = list(map(int, input().split()))
INF = 10000
dp = [INF] * n
dp[0] = 0
for i in range(1, n):
tmp = dp[i - 1] + abs(h[i] - h[i - 1])
if dp[i] > tmp:
dp[i] = tmp
if i > 1:
tmp = dp[i - 2] + abs(h[i] - h[i - 2])
if dp[i] > tmp:
dp[i] = tmp
print(dp[-1]) |
p03160 | s000937769 | Wrong Answer | n = int(input())
h = list(map(int, input().split()))
dp = [h[0], abs(h[1]-h[0])]
if n >2:
dp.append(abs(h[2]-h[0]))
for i in range(3,n):
if abs(dp[-1]-h[i]) > abs(dp[-2]-h[i]):
dp.append(abs(h[i]-h[i-2])+dp[-2])
else:
dp.append(abs(h[i]-h[i-1])+dp[-1])
else:
print(dp[-1])
exit()
print(dp[-1]) |
p03160 | s460236232 | Wrong Answer | n = int(input())
h = list(map(int,input().split()))
inf = 100
dp = [inf for i in range(n)]
dp[0] = 0
for i in range(1,n):
dp[i] = min(dp[i],dp[i-1] + abs(h[i]-h[i-1]))
if i>1:
dp[i] = min(dp[i],dp[i-2]+abs(h[i]-h[i-2]))
print(dp[-1]) |
p03160 | s501988313 | Wrong Answer | n = int(input())
h = list(map(int, input().split()))
dp = [float('inf')] * n
dp[0] = 0
for i in range(0, n - 1):
print(i)
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i] - h[i + 1]))
if i + 2 >= n:
continue
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i] - h[i + 2]))
print(dp[n - 1])
|
p03160 | s404721216 | Wrong Answer | n = int(input())
h = list(map(int, input().split()))
dp = [0] * n
dp[0] = 0
dp[1] = abs(h[0] - h[1])
for i in range(2, n - 1):
dp[i] = min((dp[i - 2] + abs(h[i - 2] - h[i])), (dp[i - 1] + abs(h[i - 1] - h[i])))
print(dp[n - 1]) |
p03160 | s450457263 | Wrong Answer | N = int(input())
h = list(map(int,input().split()))
H = [0]*N
for i in range(1,N):
if i == 1:
H[i] = abs(h[1]-h[0])
else:
H[i] = max(H[i-1]+abs(h[i]-h[i-1]),H[i-2]+abs(h[i]-h[i-2]))
print(H[N-1]) |
p03160 | s993675046 | Wrong Answer | N = int(input())
h = list(map(int, input().split()))
dp = [1e7]*N
dp[0] = h[0]
dp[1] = abs(h[1]-h[0])
for i in range(2, N):
dp[i] = min(dp[i-1]+abs(h[i-1]-h[i]), dp[i-2]+abs(dp[i-1]-h[i]))
print(dp[-1])
|
p03160 | s846279310 | Wrong Answer | n=int(input())
dp=[10000000]*n
h=list(map(int,input().split()))
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(n):
for j in range(i+1,i+3):
if j<n:
dp[j]=min(dp[j],abs(h[i]-h[j])+dp[i])
print(dp[n-1]) |
p03160 | s980772431 | Wrong Answer |
n = int(input())
h = [int(v) for v in input().split()]
inf = 10 * 10
dp = [inf] * (n)
dp[0] = 0
for i in range(n - 1):
for j in (i + 1, i + 2):
if j >= n:
continue
dp[j] = min(dp[j], dp[i] + abs(h[j] - h[i]))
print(dp[n-1])
|
p03160 | s680529994 | Wrong Answer | N=int(input())
height_list=list(map(int,input().split()))
score_list=[ 0, abs(height_list[0]-height_list[1]) ]
for i in range(2,N):
tmp=min(
abs(height_list[i]-height_list[i-1])+score_list[i-1],
abs(height_list[i]-height_list[i-2])+score_list[i-2]
)
score_list.append(tmp)
print(score_list)
|
p03160 | s269389116 | Wrong Answer | n=int(input())
f=[0]*n
a=list(map(int,input().split()))
f[0]=0
f[1]=abs(a[0]-a[1])
for i in range(2,n):
a1=abs(a[i]-a[i-2])
b=abs(a[i]-a[i-1])
f[i]=min((f[i-2]+a1),(f[i-1]+b))
print(f)
print(f[n-1]) |
p03160 | s833922837 | Wrong Answer | def chmin(a, b):
if a > b:
return b
else:
return a
def main():
dp = [1e4+10]*100010
hs = [0]*100010
N = int(input())
hs[:N] = map(int, input().split())
dp[0] = 0
for i in range(N):
dp[i+1] = chmin(dp[i+1], dp[i]+abs(hs[i+1]-hs[i]))
dp[i+2] = chmin(dp[i+2], dp[i]+abs(hs[i+2]-hs[i]))
print(dp[N-1])
return
if __name__ == '__main__':
main() |
p03160 | s123273660 | Wrong Answer | # DP practice
# https://atcoder.jp/contests/dp/tasks/dp_a
# 入力方法としてはこれが手軽
N = int(input())
h = list(map(int, input().split()))
dp = list()
# N = 0, 1 の時の処理も必要。だが省く
dp.append(h[0])
dp.append(dp[0] + h[1] - h[0])
for i in range(2, N):
dp.append(min(dp[i-2] + abs(h[i] - h[i-2]), dp[i-1] + abs(h[i] - h[i-1])))
print(dp[N-1]) |
p03160 | s481217979 | Wrong Answer | n = int(input())
h = list(map(int,input().split()))
dp = [99999999]*n
dp[0] = 0
dp[1] = abs(h[0] - h[1])
for i in range(2,n):
dp[i] = min(dp[i],dp[i-1]+abs(h[i] - h[i-1]))
dp[i] = min(dp[i],dp[i-2]+abs(h[i] - h[i-2]))
print(dp[-1])
|
p03160 | s466156851 | Wrong Answer |
def solution(h):
n = len(h)
if n == 1:
return 0
elif n == 2:
return abs(h[1]-h[0])
dp = [0]*(n)
dp[1] = abs(h[1]-h[0])
for i in range(2,n):
dp[i] = min( dp[i-1]+abs(h[i]-h[i-1]) , dp[i-2]+abs(h[i]-h[i-2]) )
print(*dp)
return dp[n-1]
N = int(input())
h = list(map(int,input().split()))
res = solution(h)
print(res,end="\n")
|
p03160 | s173766216 | Wrong Answer | def cost(n, nums):
dp = [0 for _ in range(n)]
dp[0] = 0
dp[1] = abs(nums[1] - nums[0])
for i in range(2, n):
dp[i] = min(
dp[i-1] + abs(nums[i]-nums[i-1]),
dp[i-2] + abs(nums[i]-nums[i-2]))
print(dp)
return dp[-1]
n = int(input())
nums = [int(i) for i in input().split()]
print(cost(n, nums)) |
p03160 | s558807781 | Wrong Answer | N = int(input())
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-1] + abs(h[i]-h[i-1]), dp[i-2] + abs(h[i]-h[i-2])) |
p03160 | s346391039 | Wrong Answer | n = int(input())
h = [i for i in map(int, input().split())]
DP = [0]*n
DP[0] = 0
DP[1] = abs(h[1]-h[0])
for i in range(n-2):
if abs(h[i+2] - h[i]) < abs(h[i+2] - h[i+1]):
DP[i+2] = DP[i] + abs(h[i+2] - h[i])
else:
DP[i+2] = DP[i+1] + abs(h[i+2] - h[i+1])
print(DP[-1]) |
p03160 | s987260218 | Wrong Answer | n=int(input())
lis=list(map(int,input().split()))
num=0
for i in range(0,len(lis)-1):
m=0
k=0
m=abs(lis[i]-lis[i+1])
if(i<len(lis)-2):
k=abs(lis[i]-lis[i+2])
if(m<k):
num=num+m
else:
num=num+k
i=i+1
print(num)
|
p03160 | s296572294 | Wrong Answer | import sys
input = sys.stdin.readline
import numpy as np
N = int(input())
hight_list = np.array([int(item) for item in input().split()])
dp = np.full(N, hight_list.sum(), dtype='int64')
for i in range(2, N):
cost1 = abs(hight_list[i-1] - hight_list[i])
cost2 = abs(hight_list[i-2] - hight_list[i])
dp[i] = min(dp[i-1] + cost1, dp[i-2] + cost2)
print(dp[N-1]) |
p03160 | s242580794 | Wrong Answer | n=int(input())
h=list(map(int, input().split()))
dp=[10**5 for i in range(n)]
dp[0]=0
for i in range(n):
if i+1<n:dp[i+1] = min(dp[i+1], dp[i] + abs(h[i+1]-h[i]))
if i+2<n:dp[i+2] = min(dp[i+2], dp[i] + abs(h[i+2]-h[i]))
print(dp[n-1]) |
p03160 | s130693940 | Wrong Answer | N = int(input())
h = list(map(int,input().split()))
cost = [1000000]*N
cost[0] = 0
cost[1] = abs(h[1]-h[0])
for i in range(2, N):
cost[i] = min((abs(h[i-1] - h[i]) + cost[i-1]),cost[i])
cost[i] = min((abs(h[i-2] - h[i]) + cost[i-2]), cost[i])
print(cost[-1]) |
p03160 | s622437641 | Wrong Answer | N = int(input())
h = list(map(int, input().split()))
dp = [0]*N
# dp[0], dp[1] = 0, abs(h[1] - h[0])
dp[0] = 0
for i in range(2,N):
dp[i] = dp[i-1] + abs(h[i]-h[i-1])
if i > 1:
dp[i] = min(dp[i-2] + abs(h[i]-h[i-2]),dp[i-1] + abs(h[i]-h[i-1]))
print(dp[N-1]) |
p03160 | s313579003 | Wrong Answer | INF = float('inf')
N = int(input())
h = list(map(int,input().split()))
dp = [INF] * N
dp[0] = 0
if N ==1:
print(dp[0])
elif N == 2:
dp[1] = h[1]-h[0]
print(dp[1])
else:
dp[1] = h[1]-h[0]
for i in range(2, N):
dp[i] = min(dp[i-2]+abs(h[i]-h[i-2]), dp[i-1]+abs(h[i]-h[i-1]))
print(dp[N-1]) |
p03160 | s152627718 | Wrong Answer | # DP practice
# https://atcoder.jp/contests/dp/tasks/dp_a
# 入力方法としてはこれが手軽
N = int(input())
h = list(map(int, input().split()))
dp = list()
# N = 0, 1 の時の処理も必要。だが省く
dp.append(0)
dp.append(dp[0] + h[1] - h[0])
for i in range(2, N):
dp.append(min(dp[i-2] + h[i] - h[i-2], dp[i-1] + h[i] - h[i-2]))
print(dp[N-1]) |
p03160 | s072340070 | Wrong Answer | import sys
sample = sys.stdin.read().splitlines()
n, stones = int(sample[0]), list(map(int, sample[1].split()))
#print(n, stones)
def frog_jump(n:int, stones)->int:
dp = [float('inf')] * n
jumps = (1, 2)
dp[0] = 0
for idx in range(len(dp)):
for jump in jumps:
if idx+jump < len(dp):
dp[idx+jump] = min(dp[idx]+abs(stones[idx+jump]-stones[idx]), dp[idx+jump])
return dp[-1]
frog_jump(n, stones) |
p03160 | s856879396 | Wrong Answer | n = int(input())
h = [int(i) for i in input().split()]
cost = [float("inf") for i in range(n)]
cost[:2] = 0, h[0]
for i in range(2, n):
cost[i] = min(cost[i-1] + abs(h[i]-h[i-1]), cost[i-2] + abs(h[i]-h[i-2]))
print(cost[-1]) |
p03160 | s979392107 | Wrong Answer | n = int(input())
h = list(map(int,input().split()))
dp = [int(1e+10) for _ in range(n)]
dp[0],dp[1] = 0,h[1]-h[0]
for i in range(2,n):
dp[i] = min(dp[i-1] + abs(h[i] - h[i-1]),dp[i-2] + abs(h[i] - h[i-2]))
print(dp[-1]) |
p03160 | s011768152 | Wrong Answer | N = int(input())
H = list(map(int, input().split()))
H = [0] + H
dp = [0] * (N+1)
for i in range(2,N+1):
dp[i] = min(dp[i-1]+abs(H[i]-H[i-1]), dp[i-2]+abs(H[i]-H[i-2]))
res = dp[N]
print(res) |
p03160 | s601880118 | Wrong Answer | N = int(input())
a = [int(x) for x in input().split()]
def dp(N,a):
F = [0]*(len(a)+1)
F[0]=0
F[1]=a[0]
F[2]=abs(a[1]-a[0])
if N == 1: return F[1]
elif N == 2: return F[2]
#F[3] = min(F[1]+abs(a[2]))
for n in range(3,N+1):
F[n] = min(F[n-1] + abs(a[n-1]-a[n-2]),F[n-2]+abs(a[n-1]-a[n-3]))
print(F)
return F[-1]
print(dp(N,a)) |
p03160 | s960149088 | Wrong Answer | N = int(input())
Array=list(map(int, input().split(' ')[:N]))
cp = 0
ts = 0
while(cp != N-1):
try:
if( Array[cp+1]<Array[cp+2]):
ts += abs(Array[cp]- Array[cp+1])
cp = cp+1
else:
ts += abs(Array[cp]- Array[cp+2])
cp = cp+2
except :
ts += abs(Array[cp]- Array[cp+1])
cp = cp+1
print(ts)
|
p03160 | s004329681 | Wrong Answer | N = int(input())
h = list(map(int,input().split()))
A = [float('inf')] * (N)
A[0] = 0
if N > 2:
for i in range(N-2):
p = A[i] + abs(h[i+1] - h[i])
q = A[i] + abs(h[i+2] - h[i])
if p < A[i+1]:
A[i+1] = p
if q < A[i+2]:
A[i+2] = q
print(A[N-1])
else:
print(abs(h[1]-h[0])) |
p03160 | s946256091 | Wrong Answer | a=int(input())
b=list(map(int,input().split()))
c=[0,abs(b[0]-b[1])]
for i in range(2,a):
d=min(c[i-2]+abs(b[i-2]-b[i]),c[i-1]+abs(b[i-1]-b[i]))
c.append(d)
print(c) |
p03160 | s709485712 | Wrong Answer | def chmin(dp, i, target):
if (dp[i] > target):
dp[i] = target
n = int(input())
h = [i for i in input().split(" ")]
dp =[10**4] * n
dp[0] = 0
for i in range(1, n):
chmin(dp, i, dp[i - 1] + abs(int(h[i - 1]) - int(h[i])))
if i > 1:
chmin(dp, i, dp[i - 2] + abs(int(h[i - 2]) - int(h[i])))
print(dp[n - 1]) |
p03160 | s016268569 | Wrong Answer | def ch_min(a, b):
if (a > b):
a = b
return a
if __name__ == "__main__":
N = int(input())
h = list(map(int, input().split()))
INF = 10 ** 10
dp = [INF] * 100010
dp[0] = 0
for i in range(N):
dp[i + 1] = ch_min(dp[i + 1], dp[i] + abs(h[i] - h[i - 1]))
if (i > 1):
dp[i + 2] = ch_min(dp[i + 2], dp[i] + abs(h[i] - h[i - 2]))
print(dp[N - 1])
|
p03160 | s550652797 | Wrong Answer | a = int(input())
hs = [int(x) for x in input().split()]
dp = [1000000000]* len(hs)
if a == 1:
print(hs[0])
exit()
dp[0] = 0
dp[1] = abs(hs[1] - hs[0])
if a == 2:
print(dp[1])
exit()
limit_a = max(0, a-2)
for i in range(min(limit_a, len(hs)-2)):
if i + 1 < len(hs):
dp[i+1] = min(abs(hs[i+1]- hs[i]), dp[i+1])
if(i+2 < len(hs)):
dp[i+2] = min(abs(hs[i+2]- hs[i]), dp[i+2])
print(dp[-1]) |
p03160 | s924656696 | Wrong Answer | n = int(input())
h = list(map(int, input().split()))
dp = [0] * (n)
dp[0] = h[0]
dp[1] = abs(h[0]-h[1])
for i in range(2,n):
dp[i] = min(abs(h[i-1]-h[i])+dp[i-1], abs(h[i-2]-h[i])+dp[i-2])
print(dp[-1]) |
p03160 | s889762572 | Wrong Answer | INF = 10 ** 4 + 10
def chmin(a, b):
if a > b:
a = b
return a
n = int(input())
H = list(map(int, input().split()))
DP = [INF] * n
DP[0] = 0
DP[1] = abs(H[1] - H[0])
for i in range(2, n):
DP[i] = chmin(DP[i], DP[i-1] + abs(H[i] - H[i-1]))
DP[i] = chmin(DP[i], DP[i-2] + abs(H[i] - H[i-2]))
print(DP[n-1]) |
p03160 | s477469102 | Wrong Answer | def chmin(a, b):
if a > b:
return b
else:
return a
def main():
dp = [1e4]*100010
hs = [0]*100010
N = int(input())
hs[:N] = map(int, input().split())
dp[0] = 0
for i in range(N):
dp[i+1] = chmin(dp[i+1], dp[i]+abs(hs[i+1]-hs[i]))
dp[i+2] = chmin(dp[i+2], dp[i]+abs(hs[i+2]-hs[i]))
print(dp[N-1])
return
if __name__ == '__main__':
main() |
p03160 | s366729994 | Wrong Answer | N = int(input())
h = [int(x) for x in input().split()]
dp = [1000000 for _ in range(N)]
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(2, N):
dp[i] = min(dp[i], dp[i] + abs(h[i] - h[i-1]))
dp[i] = min(dp[i], dp[i] + abs(h[i] - h[i-2]))
print(dp[-1]) |
p03160 | s303198520 | Wrong Answer | s=str(input())
t=str(input())
n,m=len(s),len(t)
ans=''
dp=[[0]*(m+1) for _ in range(n+1)]
for i in range(n):
for j in range(m):
if s[i]==t[j]:
dp[i+1][j+1]=max(dp[i][j]+1,dp[i+1][j+1])
else:
dp[i+1][j+1]=max(dp[i+1][j],dp[i][j+1])
while m>0 and n>0:
if s[n-1]==t[m-1]:ans=s[n-1]+ans;n-=1;m-=1
elif dp[n][m]==dp[n-1][m]:n-=1
else:m-=1
print(ans) |
p03160 | s148436410 | Wrong Answer | n=int(input())
dp=[10000000]*n
h=list(map(int,input().split()))
dp[0]=0
for i in range(n):
for j in range(i+1,i+3):
if j<n:
dp[j]=min(dp[j],abs(h[i]-h[j])+dp[i])
print(dp[n-1]) |
p03160 | s861607511 | Wrong Answer | print(0) |
p03160 | s082414010 | Wrong Answer | # DP practice
# https://atcoder.jp/contests/dp/tasks/dp_a
# 入力方法としてはこれが手軽
N = int(input())
h = list(map(int, input().split()))
dp = list()
# N = 0, 1 の時の処理も必要。だが省く
dp.append(h[0])
dp.append(dp[0] + h[1] - h[0])
for i in range(2, N):
dp.append(min(dp[i-2] + h[i] - h[i-2], dp[i-1] + h[i] - h[i-1]))
print(dp[N-1]) |
p03160 | s186346547 | Wrong Answer | n = int(input())
h = list(map(int, input().split()))
dp=[0]*(n+1)
dp[1]=0
dp[2]=abs(h[0]-h[1])
for i in range(3,n+1):
dp[i]=min(dp[i-2]+abs(h[i-3]-h[i-1]),dp[i-1]+abs(h[i-2]-h[i-1]))
print(dp)
print(dp[-1]) |
p03160 | s249589481 | Wrong Answer | def solve():
N = int(input())
heights = map(int, input().split(" "))
dp1 = 0
dp2 = abs(heights[1] - heights[0])
for i in range(2, N):
tmp = dp2
dp2 = min(
dp2 + abs(heights[i] - heights[i-1]),
dp1 + abs(heights[i] - heights[i-2])
)
dp1 = tmp
print(dp2) |
p03160 | s358043242 | Wrong Answer | def chmin(a,b):
return a if a<=b else b
n,*h=map(int,open(0).read().split())
dp=[10000]*n
dp[0]=0
for i in range(1,n):
dp[i]=chmin(dp[i],dp[i-1]+abs(h[i]-h[i-1]))
if i-2>=0:
dp[i]=chmin(dp[i],dp[i-2]+abs(h[i]-h[i-2]))
print(dp[n-1])
|
p03160 | s317754538 | Wrong Answer | def cost_1(n, heights):
if n == 1:
return 0
min_costs = [0] * n
# Base case - First stone
min_costs[0] = 0
# Baze case - Second stone
min_costs[1] = abs(heights[1] - heights[0])
for i in range(2, n):
min_costs[i] = min(
abs(heights[i] - heights[i-2]) + min_costs[i-2],
abs(heights[i] - heights[i-1]) + min_costs[i-1]
)
print(min_costs[-1])
|
p03160 | s213258712 | Wrong Answer | n = int(input())
h = [int(x) for x in input().split()]
inf = float('inf')
dp = [inf] * n # initialize dp
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(1, n):
if abs(h[i] - h[i-1]) < abs(h[i] - h[i-2]):
dp[i] = dp[i-1] + abs(h[i] - h[i-1])
else:
dp[i] = dp[i-2] + abs(h[i] - h[i-2])
print(dp[-1]) |
p03160 | s845827217 | Wrong Answer | n = int(input())
his = list(map(int, input().split()))
dp = []
for j in range(n):
dp.append(0)
for i in range(0, n):
if i >= 2:
dpm1 = abs(his[i] - his[i-1])
dpm2 = abs(his[i] - his[i-2])
if dpm1 <= dpm2:
dp[i] = dp[i-1] + dpm1
else:
dp[i] = dp[i-2] + dpm2
elif i == 0:
pass
else:
dp[i] = abs(his[i] - his[i-1])
print(dp[n-1]) |
p03160 | s728693549 | Wrong Answer | N = int(input())
h = [0] + list(map(int, input().split())) #0-index
inf = float('inf')
dp = [inf]*(N+1)
dp[0] = 0
dp[1] = 0
for i in range(2,N+1):
dp[i] = min(dp[i-1] + abs(h[i] - h[i-1]), dp[i-2] + abs(h[i] - h[i-2]))
print(dp[N]) |
p03160 | s536829378 | Wrong Answer | def chmin(target, index, value):
if (target[index] > value):
target[index] = value
n = int(input())
h = [i for i in input().split(" ")]
dp =[10000] * n
dp[0] = 0
for i in range(1, n):
chmin(dp, i, dp[i - 1] + (abs(int(h[i]) - int(h[i - 1]))))
if i > 1:
chmin(dp, i, dp[i - 2] + (abs(int(h[i]) - int(h[i - 2]))))
print(dp[n - 1])
|
p03160 | s278404419 | Wrong Answer | n=int(input())
arr=list(map(int,input().split()))
if n < 2:
print(0)
prev2 = 0
prev1 = abs(arr[0]-arr[1])
if n == 2:
print(prev1)
for i in range(2, n):
step_1 = abs(arr[i]-arr[i-1]) + prev1
step_2 = abs(arr[i-1]-arr[i-2]) + prev2
x = min(step_1, step_2)
prev2 = prev1
prev1 = x
print(prev1) |
p03160 | s586232308 | Wrong Answer | # DP practice
# https://atcoder.jp/contests/dp/tasks/dp_a
# 入力方法としてはこれが手軽
N = int(input())
h = list(map(int, input().split()))
dp = list()
# N = 0, 1 の時の処理も必要。だが省く
dp.append(0)
dp.append(dp[0] + h[1] - h[0])
for i in range(2, N):
dp.append(min(dp[i-2] + abs(h[i] - h[i-2]), dp[i-1] + abs(h[i] - h[i-1])))
print(dp) |
p03160 | s098788221 | Wrong Answer | n=int(input())
cost=list(map(int,input().split()))
for i in range(2,n):
cost[i]+=min(
abs(cost[i]-cost[i-1]),
abs(cost[i]-cost[i-2])
)
print(cost[-1]) |
p03160 | s719561656 | Wrong Answer | n=int(input())
l=list(map(int,input().split()))
dp=[0 for i in range(n)]
dp[1]=l[1]-l[0]
for i in range(2,n):
dp[i]=min(dp[i-1]+l[i]-l[i-1],dp[i-2]+l[i]-l[i-2])
print(dp[n-1])
|
p03160 | s063888990 | Wrong Answer | import numpy as np
N=int(input())
h=list(map(int,input().split()))
#N=4
#h=[10,30,40,20]
dp=np.zeros(N)
print(dp)
dp[1]=abs(h[1]-h[0])
print(dp)
for i in range(N-2):
dp[i+2]=min(abs(h[i+2]-h[i])+dp[i],abs(h[i+2]-h[i+1])+dp[i+1])
print(dp)
#dp[2]=min(h[2]-h[0],h[1]-h[0])
#total
print(dp[-1])
|
p03160 | s521136218 | Wrong Answer | n = int(input())
h = list(map(int,input().split()))
dp = [0, abs(h[0]-h[1])]
for i in range(n-2):
dp.append(min(dp[-2] + abs(h[i]-h[i+2]), dp[-1] + abs(h[i]-h[i+1])))
print(dp[-1]) |
p03160 | s775116576 | Wrong Answer | N = int(input())
a = [int(x) for x in input().split()]
def dp(N,a):
F = [0]*(len(a))
F[0]=0
F[1]=abs(a[1]-a[0])
if N == 1: return F[0]
elif N == 2: return F[1]
for n in range(2,N):
F[n] = min(F[n-1] + abs(a[n]-a[n-1]),F[n-2]+abs(a[n]-a[n-2]))
print(F)
return F[-1]
print(dp(N,a)) |
p03160 | s098937264 | Wrong Answer | n = int(input())
h = list(map(int,input().split()))
dp = [10**5]*n
def chmin(a,b,i):
if a > b:
dp[i] = b
dp[0] = 0
for i in range(1,n):
chmin(dp[i],dp[i-1] + abs(h[i] - h[i-1]),i)
chmin(dp[i],dp[i-1] + abs(h[i] - h[i-2]),i)
print(dp[n-1]) |
p03160 | s621542220 | Wrong Answer | n=int(input())
l=list(map(int,input().split()))
def frog(l,n):
dp=[0]*n
dp[0]=0
dp[1]=abs(l[1]-l[0])
for i in range(2,n):
dp[i]=min(dp[i-1]+ abs(l[i]-l[i-1]),dp[i-2]+abs(l[i]-l[i-2]))
return dp[n-1] |
p03160 | s793198082 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
dp = [0] * N
dp[1] = abs(A[1] - A[0])
for i in range(2,N):
dp[i] = min(dp[i-1] + abs(A[i] - A[i-1]),dp[i-2] + abs(A[i] - A[i-2]))
print(dp) |
p03160 | s305515088 | Wrong Answer | n = int(input())
h = list(map(int, input().split()))
dp = 0
dp2 = 0
dp1 = abs(h[0] - h[1])
for i in range(2, n):
dp = min(
dp2 + abs(h[i] - h[i - 2]),
dp1 + abs(h[i] - h[i - 1]))
dp2, dp1 = dp1, dp
print(dp)
|
p03160 | s149396097 | Wrong Answer | n = int(input())
l = [0] + [int(i) for i in input().split()]
ans = [0]*(n+2)
for i in range(2,n+1):
ans[i]=min(ans[i-1]+abs(l[i-1]-l[i]),ans[i-2]+abs(l[i-2]-l[i]))
print(ans[-2]) |
p03160 | s482672453 | Wrong Answer | N = int(input())
h = list(map(int, input().split()))
ans = [1000000] * N
ans[0] = 0
for i in range(N-1):
ans[i+1] = min(ans[i+1], ans[i] + abs(h[i] - h[i+1]))
if i + 2 > N -1:
continue
ans[i+2] = min(ans[i+2], ans[i] + abs(h[i] - h[i+2]))
print(ans[-1]) |
p03160 | s274669833 | Wrong Answer | N = int(input())
h = [int(i) for i in input().split()]
dp = [0 for i in range(N)]
dp[1]= abs(h[1]-h[0])
for i in range(2,N):
print(dp)
dp[i] = min(dp[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i]-h[i-2]))
print(dp[N-1]) |
p03160 | s134823749 | Wrong Answer | N = int(input())
H = list(map(int, input().split()))
dp = []
for i, h in enumerate(H) :
if (i==0) :
dp.append(0)
continue
if (i==1) :
dp.append(abs(H[0]-H[1]))
continue
one = abs(dp[i-2] + (H[i]-H[i-1]))
two = abs(H[i]-H[i-2])
if (one < two):
dp.append(dp[i-1] + one)
else :
dp.append(dp[i-2] + two)
print(dp) |
p03160 | s985712156 | Wrong Answer | N = int(input())
h = list(map(int,input().split()))
cost = [100000]*N
cost[0] = 0
for i in range(N-1):
num = cost[i] + abs(h[i+1]-h[i])
if cost[i+1] > num:
cost[i+1] = num
if i > 0:
num2 = cost[i-1] + abs(h[i]-h[i-2])
if cost[i+1] > num2:
cost[i+1] = num2
print(cost[N-1]) |
p03160 | s010597137 | Wrong Answer | N=int(input())
line=input().split(" ")
dp=[]
for i in range(N):
line[i]=int(line[i])
dp.append(10000000000)
dp[0]=0
dp[1]=abs(line[1]-line[0])
for j in range(2,N):
dp[j]=min(dp[j], dp[j-1]+abs(line[j]-line[j-1]))
dp[j]=min(dp[j], dp[j-2]+abs(line[j]-line[j-2]))
print(dp) |
p03160 | s954191352 | Wrong Answer | def Frog1():
N = int(input())
Hs = list(map(int,input().split()))
dp = [0 for i in range(N)]
dp[0] = 0
dp[1] = abs(Hs[1]-Hs[0])
for i in range(2,N):
dp[i] = min(abs(Hs[i-1]-Hs[i])+dp[i-1],abs(Hs[i-2]-Hs[i])+dp[i-2])
Frog1()
|
p03160 | s012423517 | Wrong Answer | def frog(arr):
n=len(arr)
if n<=1:
return 0
dp=[0]*(n+1)
dp[2]=abs(arr[0]-arr[1])
if n==2:
return dp[2]
for i in range(3,n+1):
dp[i]=min(dp[i-1]+abs(arr[i-1]-arr[i-2]),dp[i-2]+abs(arr[i-1]-arr[i-3]))
return dp[n]
n=int(input())
arr=[int(i) for i in input().split()]
frog(arr)
|
p03160 | s327002283 | Wrong Answer | n=int(input())
h=list(map(int,input().split()))
dp=[0]*(n+1)
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
dp[i]=min(dp[i-2]+abs(h[i]-h[i-2]),dp[i-1]+abs(h[i]-h[i-1]))
print(dp)
print(dp[-2])
|
p03160 | s972011362 | Wrong Answer | n=int(input())
h=[0]+list(map(int,input().split()))
dp=[0]*(n+1)
dp[2]=h[2]-h[1]
for i in range(3,n+1):
jump1=dp[i-2]+abs(h[i-2]-h[i])
jump2=dp[i-1]+abs(h[i-1]-h[i])
dp[i]=min(jump1,jump2)
print(dp[n]) |
p03160 | s099884099 | Wrong Answer | from functools import lru_cache
N = int(input())
heights = [int(h) for h in input().split()]
@lru_cache(None)
def dfs(i):
if i == len(heights) - 1:
return 0
if i >= len(heights):
return float("inf")
return min(abs(heights[i] - heights[i + 1]) + dfs(i + 1) if i + 1 < len(heights) else float("inf"),
abs(heights[i] - heights[i + 2]) + dfs(i + 2) if i + 2 < len(heights) else float("inf")) |
p03160 | s905499714 | Wrong Answer | N = int(input())
hs = list(map(int, input().split()))
i = 0
total_cost = 0
while i < N-1:
cost1 = abs(hs[i+1] - hs[i])
cost2 = abs(hs[i+2] - hs[i]) if i+2 < N else None
if cost2 is not None and cost2 <= cost1:
i += 2
total_cost += cost2
else:
i += 1
total_cost += cost1
print(total_cost) |
p03160 | s899575211 | Wrong Answer | N = int(input())
h = [0] + list(map(int, input().split())) # 便宜上、先頭に[0]
dp = [None for _ in range(N+1)] # dp[i]：足場iに移動する最小コスト
dp[0] = 0 # 便宜上
dp[1] = 0 # 初期位置のため、0
for i in range(2, N+1):
one = dp[i-1] + abs(h[i]-h[i-1]) # 1段前からの移動
two = dp[i-2] + abs(h[i]-h[i-2]) # 2段前からの移動
dp[i] = min(one, two)
print(dp[N]) |
p03160 | s729270212 | Wrong Answer | inp = int(input())
if inp>=400 and inp<=599:
ans = 8
elif inp>=600 and inp<=799:
ans = 7
elif inp>=800 and inp<=999:
ans = 6
elif inp>=1000 and inp<=1199:
ans = 5
elif inp>=1200 and inp<=1399:
ans = 4
elif inp>=1400 and inp<=1599:
ans = 3
elif inp>=1600 and inp<=1799:
ans = 2
elif inp>=1800 and inp<=1999:
ans = 1
try:
print(ans)
except:
pass |
p03160 | s522193397 | Wrong Answer | n = int(input())
h = list(map(int,input().split()))
dp = [10**5]*n
def chmin(a,b,i):
if a > b:
dp[i] = b
dp[0] = 0
for i in range(1,n):
chmin(dp[i],dp[i-1] + abs(h[i] - h[i-1]),i)
if i >=2:
chmin(dp[i],dp[i-2] + abs(h[i] - h[i-2]),i)
print(dp[n-1]) |
p03160 | s291273004 | Wrong Answer | import math
n = int(input())
h = list(map(int, input().split()))
res = [0]*n
for i in range(n):
if i == 1:
res[1] = abs(h[0] - h[1])
temp1 = abs(h[i] - h[i-2])
temp2 = abs(h[i] - h[i-1])
res[i] = min(res[i-2] + temp1, res[i-1] + temp2)
print(res[n-1]) |
p03160 | s661362909 | Wrong Answer | from sys import stdin
def solve():
n = int(input())
A = [int(i) for i in stdin.readline().split()]
if n == 2: return abs(A[0] - A[1])
curr = 0
p2, p1 = A[0], abs(A[0] - A[1])
for i in range(2, len(A)):
# print(p2, p1)
curr += min(abs(A[i] - A[i-1]), abs(A[i] - A[i-2]))
p2 = p1
p1 = curr
return curr
print(solve()) |
p03160 | s181370668 | Wrong Answer | number = int(input())
scaffolds = list(map(int, input().split()))
scaffolds.insert(0, 0)
costs = [ [0, 0] for i in range(number + 1)]
for i in range(len(costs)):
hight = scaffolds[i]
if 0 <= i - 1:
min_v = min(costs[i - 1])
hight_1 = scaffolds[i - 1]
costs[i][0] = min_v + abs(hight_1 - hight)
if 0 <= i - 2:
min_v = min(costs[i - 2])
hight_2 = scaffolds[i - 2]
costs[i][1] = min_v + abs(hight_2 - hight)
print(min(costs[number])) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.