problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03160 | s014049792 | Accepted | n = int(input())
h = [int(i) for i in input().split()]
m = [0, abs(h[0]-h[1])]
for i in range(2, n):
v = min(m[0]+abs(h[i-2]-h[i]), m[1]+abs(h[i-1]-h[i]))
m = [m[1], v]
print(m[1]) |
p03160 | s732228060 | Accepted | N = int(input())
h = list(map(int, input().split()))
INF = 10 ** 9
dp = [INF] * N
dp[0] = 0
for i in range(N - 1):
if i == N - 2:
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]))
else:
dp[i + 1] = min(dp[i + 1], dp[i] + abs(h[i + 1] - h[i]))
dp[i + 2] = min(dp[i + 2], dp[i] + abs(h[i + 2] - h[i]))
print(dp[-1]) |
p03160 | s064214845 | Accepted | N=int(input())
h=list(map(int, input().split()))
dp=[float("inf")]*N
dp[0]=0
for i in range(1, N):
if i==1:
dp[i]=min(dp[i], abs(h[i]-h[i-1]))
else:
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 | s210743146 | Accepted | 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):
tmp1 = dp[i-1] + abs(H[i]-H[i-1])
tmp2 = dp[i-2] + abs(H[i]-H[i-2])
dp[i] = min(tmp1, tmp2)
print(dp[N-1]) |
p03160 | s211209224 | Accepted | N = int(input())
h = list(map(int, input().split()))
dp = [1e7]*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]))
print(dp[-1])
|
p03160 | s475548326 | Accepted | n = int(input())
h = [None] + list(map(int, input().split()))
dp = [None for _ in range(n+1)]
for k in range(1,n+1):
if k == 1:
dp[k] = 0
elif k == 2:
dp[k] = abs(h[2] - h[1])
else:
dp[k] = min(
dp[k-1] + abs(h[k] - h[k-1]),
dp[k-2] + abs(h[k] - h[k-2])
)
print(dp[k]) |
p03160 | s598332883 | Accepted | N=int(input())
h=list(map(int,input().split()))
cost=[0,abs(h[1]-h[0])]
for i in range(2,N):
cost.append(min(cost[i-1]+abs(h[i]-h[i-1]),cost[i-2]+abs(h[i]-h[i-2])))
print(cost[-1]) |
p03160 | s412710414 | Accepted | import numpy as np
N=int(input())
H=list(map(int,input().split()))
dp=np.zeros(N+1,dtype=int)
dp[0]=0
dp[1]=0
for i in range(1,N):
if i==1:
dp[i+1] = abs(H[1]-H[0])
else:
dp[i+1] = min( dp[i] + abs( H[i] - H[i-1] ), dp[i-1] + abs( H[i] - H[i-2] ) )
# print(dp)
print(dp[N]) |
p03160 | s158890258 | Accepted | N = int(input())
h = list(map(int, input().split()))
dp = [float('inf')] * 100010
dp[0] = 0
def chmin(a, b):
if a > b:
return b
else:
return a
for i in range(1, N):
dp[i] = chmin(dp[i], dp[i-1] + abs(h[i] - h[i-1]))
if i > 1:
dp[i] = chmin(dp[i], dp[i-2] + abs(h[i] - h[i-2]))
print(dp[N-1])
|
p03160 | s825622074 | Accepted | N = int(input())
H = list(map(int, input().split()))
dp = [0] * N
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[-1]) |
p03160 | s067306251 | Accepted | import numpy as np
n = int(input())
h = np.array(list(map(int, input().split())))
dp = np.full_like(h, np.inf)
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(2, len(h)):
dp[i] = min(dp[i - 1] + abs(h[i] - h[i - 1]), dp[i - 2] + abs(h[i] - h[i - 2]))
print(dp[(len(h) - 1)]) |
p03160 | s687514087 | Accepted | input1 = input()
input2 = input()
N = int(input1)
h = list(map(int,input2.split()))
c = [0,abs(h[1]-h[0])]
for i in range(2,N):
c.append(min(c[i-1]+abs(h[i]-h[i-1]),c[i-2]+abs(h[i]-h[i-2])))
print(c.pop()) |
p03160 | s428549036 | Accepted | n=int(input())
h=list(map(int,input('').split()))
dp=[0]*n
dp[1]=abs(h[1]-h[0])
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 | s728906980 | Accepted | N=int(input())
*h,=map(int,input().split())
dp = [0]*N
for i in range(1,N):
if i == 1:
dp[i] = dp[0]+abs(h[i]-h[0])
else:
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 | s169579266 | Accepted | N = int(input())
h = list(map(int,input().split()))
dp = [100010]*N
dp[0] = 0
for i in range(1,N):
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 | s393855447 | Accepted | n = int(input())
l = list(map(int, input().split()))
dp = [0]*n
for i in range(1,n):
d1 = dp[i-1] + abs(l[i] - l[i-1])
if i > 1:
d2 = dp[i-2] + abs(l[i] - l[i-2])
if d1 > d2:
d1 = d2
dp[i] = d1
print(dp[-1])
|
p03160 | s947350926 | Accepted | #!/usr/bin/env python3
N = int(input())
H = list(map(int, input().split()))
dp = [float('inf') for i in range(N+1)]
dp[1] = 0
dp[2] = abs(H[1]-H[0])
for i in range(3, N+1):
dp[i] = min(dp[i-1]+abs(H[i-1]-H[i-2]), dp[i-2]+abs(H[i-1]-H[i-3]))
print(dp[N])
|
p03160 | s659016417 | Accepted | 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(abs(a[i]-a[i-2])+dp[i-2],abs(a[i]-a[i-1])+dp[i-1])
print(dp[n-1]) |
p03160 | s158788983 | Accepted | N = int(input())
h = list(map(int,input().split()))
n = 2
cost = [0]*N
cost[1] = abs(h[1]-h[0])
for n in range(2,N):
cost[n] = min(cost[n-1]+abs(h[n-1]-h[n]),cost[n-2]+abs(h[n-2]-h[n]))
print(cost[N-1]) |
p03160 | s255442479 | Accepted | import sys
n = int(input())
a = list(map(int,input().split()))
dp = [sys.maxsize]*(n)
dp[0] = 0
for i in range(n):
for j in range(i+1,i+2+1):
if j<n :
dp[j] = min(dp[j],dp[i]+abs(a[i]-a[j]))
print(dp[n-1]) |
p03160 | s141649783 | Accepted | n=int(input())
li = list(map(int,input().split()))
dp = n* [10**9]
#print(dp)
dp[0]=0
dp[1]=abs(li[1]-li[0])
for i in range(2, n):
dp[i]=min(dp[i-1] + abs(li[i] - li[i-1]),dp[i-2] + abs(li[i] - li[i-2]) )
#print(dp)
print(dp[-1]) |
p03160 | s578319109 | Accepted | N=int(input())
h=list(map(int,input().split()))
dp=[-1]*(N+1)
dp[1]=0
dp[2]=abs(h[2-1]-h[1-1])
for i in range(3,N+1):
dp[i]=min(abs(h[i-1]-h[i-2])+dp[i-1],abs(h[i-1]-h[i-3])+dp[i-2])
print(dp[N]) |
p03160 | s978909016 | Accepted | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
N = int(readline().rstrip())
H = list(map(int, readline().split()))
LIM = 10 ** 9
dp = [LIM] * 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] - H[i+1]))
if i+2 < N:
dp[i+2] = min(dp[i+2], dp[i] + abs(H[i] - H[i+2]))
ans = dp[-1]
print(ans) |
p03160 | s680100821 | Accepted | a=int(input())
t = list(map(int,input().split()))
res = [float('inf')]*a
res[0] = 0
for i in range(1, a):
for j in range(i-2, i):
res[i] = min([res[i], res[j]+abs(t[i]-t[j])])
print(res[-1]) |
p03160 | s307861119 | Accepted | N, = map(int, input().split())
H = list(map(int, input().split()))
DP = [0] * N
for i in range(1, N):
DP[i] = min(abs(H[i] - H[max(i - 1, 0)]) + DP[max(i - 1, 0)], abs(H[i] - H[max(i - 2, 0)]) + DP[max(i - 2, 0)])
print(DP[N - 1]) |
p03160 | s757817108 | Accepted | n = int(input())
h = list(map(int,input().split()))
cst = [0 for i in range(n+10)]
cst[0] = 0
cst[1] = abs(h[0]-h[1])
for i in range(2,n):
cst[i] = min(cst[i-2]+abs(h[i-2]-h[i]) , cst[i-1]+abs(h[i-1]-h[i]))
print(cst[n-1]) |
p03160 | s788673491 | Accepted | # Frog1
N = int(input())
h = list(map(int, input().split()))
inf = float("inf")
dp = [inf for _ in range(N)]
dp[0] = 0
for i in range(N):
for j in (1, 2):
if i + j >= N:
continue
dp[i + j] = min(dp[i + j], dp[i] + abs(h[i] - h[i+j]))
print(dp[-1]) |
p03160 | s140239535 | Accepted | n = int(input())
h = list(map(int, input().split()))
dp = [0, abs(h[0] - h[1])]
for i in range(2, n):
dp.append(min(dp[i - 2] + abs(h[i - 2] - h[i]), dp[i - 1] + abs(h[i - 1] - h[i])))
#print(dp)
print(dp[-1])
|
p03160 | s745070294 | Accepted | N = int(input())
H = list(map(int, input().split()))
for _ in range(10):
H.append(10**9)
dp = [10**9] * (N+2)
dp[0] = 0
# 配る方式
for i in range(N):
dp[i+1] = min(dp[i] + abs(H[i]-H[i+1]),dp[i+1])
dp[i+2] = min(dp[i] + abs(H[i]-H[i+2]), dp[i+2])
print(dp[N-1])
|
p03160 | s001368050 | Accepted | import numpy as np
N = int(input())
hs = np.array(list(map(int, input().split())))
i = 0
total_cost = 0
a = np.zeros(N, int)
a[0] = 0
a[1] = abs(hs[1] - hs[0])
for i in range(2, N):
a[i] = min(a[max(i-2,0)] + abs(hs[i] - hs[max(i-2,0)]),
a[max(i-1,0)] + abs(hs[i] - hs[max(i-1,0)]))
print(a[-1])
|
p03160 | s083496093 | Accepted | n = int(input())
h = list(map(int, input().split()))
dp = [0] * n
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[-1]) |
p03160 | s420211997 | Accepted | N = int(input())
h = list(map(int,input().split()))
cost = [0,abs(h[1]-h[0])]
for i in range(1,N-1):
cost.append( min(cost[i]+abs(h[i+1]-h[i]), cost[i-1]+abs(h[i+1]-h[i-1])) )
print(cost[-1])
|
p03160 | s630325169 | Accepted | n=int(input())
l=list(map(int,input().split()))
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]))
print(dp[-1])
|
p03160 | s022284318 | Accepted |
#二回目
n=int(input())
h=list(map(int,input().split()))
dp=[-1]*n
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
dp[i]=min( abs(h[i]-h[i-1])+dp[i-1] ,abs(h[i]-h[i-2])+dp[i-2] )
#print(dp)
print(dp[-1])
|
p03160 | s338964851 | Accepted | # A
# 若干解説を見た
# 2020/04/27 17:5-
n = int(input())
h = list(map(int, input().split()))
dp = [0]*n
for i in range(1, n):
if i == 1:
dp[i] = abs(h[i] - h[i-1])
else:
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 | s540351309 | Accepted | INF=int('fffFFFFffffFFFF',16)
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]=min(abs(h[i]-h[i-1])+dp[i-1],abs(h[i]-h[i-2])+dp[i-2])
print(dp[n-1]) |
p03160 | s096503842 | Accepted | n = int(input())
hs = list(map(int, input().split()))
results = list()
results.append(0)
results.append(abs(hs[0] - hs[1]))
for i in range(2, n):
results.append(min(abs(hs[i]-hs[i-2]) + results[i-2], abs(hs[i]-hs[i-1]) + results[i-1]))
print(results[n-1])
|
p03160 | s062047632 | Accepted | #最初に置いておくもの
import sys
sys.setrecursionlimit(500000)
input=sys.stdin.readline
N=int(input())
A = list(map(int, input().split()))
inf=float('inf')
dp=[inf]*N
def chmin(a,b):
return min(a,b)
def rec(n):
if n==0:
return 0
if dp[n] < inf:
return dp[n]
res=rec(n-1) + abs(A[n] - A[n-1])
if n>1:
res=chmin(res,rec(n-2) + abs(A[n] - A[n-2]))
dp[n]=res
return res
print(rec(N-1)) |
p03160 | s385254179 | Accepted | def solve(n, H):
dp = [0] * n
dp[0] = 0
dp[1] = abs(H[0] - H[1])
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])
)
return dp[n - 1]
_n = int(input())
_H = list(map(int, input().split()))
print(solve(_n, _H))
|
p03160 | s569134896 | Accepted | inf = float("inf")
n=int(input())
a=list(map(int ,input().split()))
dp=[inf]*n
k=2
dp[0]=0
for i in range(1,n):
for j in range(i-1,max(0,i-k)-1,-1):
dp[i]=min(dp[i],dp[j]+abs(a[i]-a[j]))
print(dp[n-1])
|
p03160 | s822812075 | Accepted | N=int(input())
h=list(map(int,input().split()))
ans=[0]*(N)
ans[0]=0
ans[1]=abs(h[1]-h[0])
if N>2 :
for i in range(2,N):
ans[i]=min(ans[i-2]+abs(h[i]-h[i-2]),ans[i-1]+abs(h[i]-h[i-1]))
print(ans[N-1])
|
p03160 | s514528733 | Accepted | n = int(input())
h = list(map(int, input().split()))
dp =[0, abs(h[1] - h[0])]
for i in range(2, n):
dp += [min(dp[i-2] + abs(h[i] - h[i-2]), dp[i-1] + abs(h[i] - h[i-1]))]
print(dp[-1]) |
p03160 | s768762277 | Accepted | def i():
return int(input())
def i2():
return map(int,input().split())
def s():
return str(input())
def l():
return list(input())
def intl():
return list(int(k) for k in input().split())
n = i()
h = intl()
dp = [0]*n
for i in range(1,n):
if i == 1:
dp[i] = abs(h[i] - h[0])
else:
dp[i] = min( abs(h[i]-h[i-1]) + dp[i-1], abs(h[i]-h[i-2]) + dp[i-2] )
print(dp[-1]) |
p03160 | s995950897 | Accepted | n=int(input())
l=[int(x) for x in input().split()]
d=[0]*n
if n-2>=0:
d[-2]=abs(l[-2]-l[-1])
for i in range(n-3,-1,-1):
mn=10**9
mn=min(abs(l[i+1]-l[i])+d[i+1],mn)
mn=min(abs(l[i+2]-l[i])+d[i+2],mn)
d[i]=mn
print(d[0])
|
p03160 | s557923425 | Accepted | N = int(input())
*h, = map(int, input().split())
dp = [float('inf')] * N
dp[0] = 0
for i in range(1, N):
if i == 1:
dp[i] = abs(h[i] - h[i - 1])
else:
dp[i] = min(abs(h[i] - h[i - 1]) + dp[i - 1], abs(h[i] - h[i - 2]) + dp[i - 2])
print(dp[-1]) |
p03160 | s368103916 | Accepted | 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]))
print(dp[n-1]) |
p03160 | s413852404 | Accepted | N = int(input())
h = list(map(int,input().split()))
dp = [float("inf")]*len(h)
dp[0] = 0
for i in range(1, len(h)):
if(i == 1):
dp[i] = h[i]
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 | s913986042 | Accepted | n = int(input())
h = list(map(int, input().split()))
dp = [0]*n
for i in range(1,n):
if i == 1:
dp[1] = abs(h[1]-h[0])
else:
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 | s276202320 | Accepted | import numpy as np
def main():
n = int(input())
h = np.fromstring(input(), dtype='int', sep=' ')
h = np.append(h, [0] * 2)
dp = np.full(n + 1, 10 ** 9, dtype='int')
dp[0] = 0
for i in range(n - 1):
dp[i + 1:i + 3] = np.minimum(
dp[i + 1:i + 3],
dp[i] + np.abs(h[i] - h[i + 1:i + 3])
)
print(dp[n - 1])
if __name__ == "__main__":
main()
|
p03160 | s929542073 | Accepted | n = int(input())
hlis = list(map(int, input().split()))
dp = [0] + [float('inf')]*n
dp[1] = dp[0] + abs(hlis[0])
for i in range(1, n):
one = abs(hlis[i]-hlis[i-1])
two = abs(hlis[i]-hlis[i-2])
dp[i] = min(dp[i-1]+one, dp[i-2]+two)
print(dp[n-1]) |
p03160 | s267502855 | Accepted | N = int(input())
H = list(map(int,input().split()))
INF = 10**10
dp = [INF]*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]))
print(dp[-1]) |
p03160 | s934975032 | Accepted | n = int(input())
H = list(map(int, input().split()))
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[-1])
|
p03160 | s612360716 | Accepted | n = int(input())
h = list(map(int, input().split()))
dp = [0] * n
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[-1]) |
p03160 | s523119804 | Accepted | N = int(input())
H = list(map(int, input().split()))
dp = [0]*N
for i, x in enumerate(H):
if i == 0:
continue
elif i == 1:
dp[i] = abs(H[i]-H[i-1])
else:
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 | s770850304 | Accepted | n = int(input())
h = list(map(int, input().split()))
dp = [10 ** 18 for _ in range(n)]
dp[0] = 0
for i in range(1, 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 | s630835534 | Accepted | import sys
n = int(sys.stdin.readline())
inp = list(map(lambda x: int(x), sys.stdin.readline().split(" ")))
dp = [0]*(n)
dp[1] = abs(inp[1]-inp[0])
for i in range(1,n-1):
dp[i+1] = min(abs(inp[i+1]-inp[i-1])+dp[i-1], abs(inp[i+1]-inp[i])+dp[i])
print(dp[-1]) |
p03160 | s226802521 | Accepted | import sys
n = int(input())
a = list(map(int, input().split()))
dp = [sys.maxsize]*n
dp[0] = 0
for i in range(n):
for j in range(i+1, i+2+1):
if(j<n):
dp[j] = min(dp[j], dp[i]+abs(a[i]-a[j]))
print(dp[n-1])
|
p03160 | s289144785 | Accepted | n=int(input())
l=list(map(int,input().split()))
ans=[0,abs(l[1]-l[0])]
for i in range(2,n):
ans.append(min(abs(l[i]-l[i-2])+ans[-2],abs(l[i]-l[i-1])+ans[-1]))
print(ans[-1])
|
p03160 | s101688365 | Accepted | N = int(input())
h = list(map(int, input().split()))
dp = {}
dp[0] = 0
dp[1] = abs(h[0] - h[1])
for i in range(2, N):
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 | s862505927 | Accepted | n = int(input())
hs = list(map(int, input().split()))
a, b = 0, abs(hs[1] - hs[0])
for i in range(2, n):
d1 = a + abs(hs[i] - hs[i-2])
d2 = b + abs(hs[i] - hs[i-1])
a, b = b, min(d1, d2)
print(b) |
p03160 | s323766815 | Accepted | # -*- coding: utf-8 -*-
def main():
n = int(input())
h = list(map(int, input().split()))
dp = [0, abs(h[0]-h[1])]
for i in range(2, n):
from_2 = dp[i-2] + abs(h[i-2] - h[i])
from_1 = dp[i-1] + abs(h[i-1] - h[i])
dp.append(min(from_2, from_1))
print(dp[-1])
if __name__ == "__main__":
main() |
p03160 | s418265488 | Accepted | import sys
import numpy as np
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
n=int(input())
h=list(map(int,input().split()))
dp=[0]*(n+1)
dp[1]=0
dp[2]=abs(h[1]-h[0])
for i in range(1,n-1):
dp[i+2]=min((dp[i]+abs(h[i+1]-h[i-1])),(dp[i+1]+abs(h[i+1]-h[i])))
print(dp[n]) |
p03160 | s471858675 | Accepted | n=int(input())
h=list(map(int,input().split()))
cost=[0,abs(h[1]-h[0])]
for i in range(2,n):
cost.append(min(cost[i-2]+abs(h[i]-h[i-2]),cost[i-1]+abs(h[i]-h[i-1])))
print(cost[n-1])
|
p03160 | s940350799 | Accepted | n = int(input())
arr = list(map(int,input().split()))
if n==2:
print(abs(arr[0]-arr[1]))
elif n==3:
x = abs(arr[0]-arr[2])
y = abs(arr[0]-arr[1]+arr[1]-arr[2])
print(min(x,y))
else:
x = abs(arr[0]-arr[1])
y = abs(arr[0]-arr[2])
dp = [x,y]
for i in range(3,n):
x = dp[-1]+abs(arr[i]-arr[i-1])
y = dp[-2]+abs(arr[i]-arr[i-2])
dp.append(min(x,y))
print(dp[-1]) |
p03160 | s138067175 | Accepted | 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(1,n-1):
dp[i+1] = min(dp[i-1]+abs(h[i+1]-h[i-1]),dp[i]+abs(h[i+1]-h[i]))
print(dp[-1]) |
p03160 | s999464974 | Accepted | n=int(input())
h=list(map(int,input().split()))
dp=[1000000000]*(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-1]-h[i]),dp[i-2]+abs(h[i-2]-h[i]))
print(dp[n-1]) |
p03160 | s142850560 | Accepted | import sys
input = sys.stdin.readline
n = int(input())
H = list(map(int,input().split()))
D = [float("inf") for i in range(n)]
D[0] = 0
for i in range(1, n):
for j in range(1, 3):
if i-j >= 0:
D[i] = min(D[i], D[i-j]+abs(H[i]-H[i-j]))
print(D[-1]) |
p03160 | s766369858 | Accepted | def sol(lis):
if len(lis)<=2:
return abs(lis[0]-lis[1])
costs = [0,abs(lis[0]-lis[1])]
for i in range(2,len(lis)):
x = abs(lis[i]-lis[i-1])
y = abs(lis[i]-lis[i-2])
costs.append(min(x+costs[-1],y+costs[-2]))
return costs[-1]
input()
lis = list(map(int,input().split(' ')))
print(sol(lis)) |
p03160 | s926178240 | Accepted | N = int(input())
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[i-1]+abs(h[i]-h[i-1]),dp[i-2]+abs(h[i]-h[i-2]))
print(dp[-1]) |
p03160 | s278311656 | Accepted | n=int(input())
l=list(map(int,input().split()))
sumlmin=[0]*n
sumlmin[1]=abs(l[1]-l[0])
for i in range(n-2):
sumlmin[i+2]=min((sumlmin[i]+abs(l[i+2]-l[i])),(sumlmin[i+1]+abs(l[i+2]-l[i+1])))
print(sumlmin[n-1]) |
p03160 | s698049522 | Accepted | N = int(input())
A = list(map(int, input().split()))
dp = [0 for i in range(N)]
dp[0] = 0
dp[1] = abs(A[1]-A[0])
for i in range(2,N):
dp[i] = min( abs(A[i]-A[i-2]) + dp[i-2] , abs(A[i]-A[i-1]) + dp[i-1])
print(dp[N-1]) |
p03160 | s165957712 | Accepted | import sys
sys.setrecursionlimit(200000)
N = int(input())
h = list(map(int, input().split()))
dp = [float('inf')] * N
dp[0] = 0
def rec(i):
if dp[i] < float('inf'):
return dp[i]
a = rec(i-1) + abs(h[i] - h[i-1])
if i > 1:
a = min(a, rec(i-2) + abs(h[i] - h[i-2]))
dp[i] = a
return a
print(rec(N-1))
|
p03160 | s421996798 | Accepted | import numpy as np
n = int(input())
h = list(map(int,input().split()))
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[-1]) |
p03160 | s087870987 | Accepted | N = int(input())
h = list(map(int, input().split()))
"""
dp[i]: カエルが足場 i にたどり着くまでの最小コスト
i の一つ前は、 i-1 or i-2 にいる. dp[0] = 0.
"""
dp = [0] * N
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[N - 1])
|
p03160 | s202621489 | Accepted | n = int(input())
l=list(map(int ,input().split()))
dp=[float("inf")]*n
dp[0]=0
dp[1]=abs(l[0]-l[1])
for i in range(n-2):
dp[i+2]=min(dp[i]+abs(l[i]-l[i+2]),dp[i+1]+abs(l[i+1]-l[i+2]))
print(dp[-1]) |
p03160 | s358182201 | Accepted | n = int(input())
k = list(map(int, input().split()))
dp = [0] * n
dp[1] = abs(k[1] - k[0])
for i in range(2, n):
dp[i] = min(abs(k[i]-k[i-1])+dp[i-1], abs(k[i]-k[i-2]) +dp[i-2])
print(dp[-1]) |
p03160 | s179442893 | Accepted | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n = ni()
h = na()
A = [0 for _ in range(n)]
for i in range(n):
if i == 1:
A[i] = abs(h[i]-h[i-1])
elif i>1:
A[i] = min(A[i-1]+abs(h[i]-h[i-1]),A[i-2]+abs(h[i]-h[i-2]))
else:
A[i] = A[i]
print(A[-1]) |
p03160 | s435824281 | Accepted | n = int(input())
H = list(map(int, input().split()))
dp = [-1] * 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]))
print(dp[n-1]) |
p03160 | s007269451 | Accepted | #!/usr/bin/env python3
import sys
def chmin(val: int, new: int):
if new < val:
return new
else:
return val
N = int(input())
H = list(map(int, input().split()))
dp = [sys.maxsize] * 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 | s107913564 | Accepted | n=int(input())
routes=list(map(int,input().split()))
dp=[float("inf") for i in range(n)]
dp[0]=0
for i in range(n):
for j in range(i+1,i+3):
if j<n:
dp[j]=min(dp[j],dp[i]+abs(routes[i]-routes[j]))
print(dp[-1]) |
p03160 | s559670437 | Accepted | 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):
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 | s885050755 | Accepted | N = int(input())
h = list(map(int, input().split()))
INF = 10**9
dp = [INF] * N
dp[0] = 0
for i in range(1, N):
dp[i] = min(dp[i-1] + abs(h[i] - h[i-1]), dp[i])
if i + 1 < N:
dp[i+1] = min(dp[i-1] + abs(h[i+1] - h[i-1]) , dp[i+1])
print(dp[N-1]) |
p03160 | s823876028 | Accepted | N = int(input())
h = [0] + list(map(int,input().split()))
dp = [0] * (N+1)
dp[2] = abs(h[2]-h[1])
for i in range(3,N+1):
jump1 = dp[i-1] + abs(h[i]-h[i-1])
jump2 = dp[i-2] + abs(h[i]-h[i-2])
dp[i] = min(jump1,jump2)
print(dp[N]) |
p03160 | s071540639 | Accepted | N = int(input())
h_array = list(map(int, input().split()))
dp = [10 ** 5 for i in range(N)]
for i in range(N):
if i == 0:
dp[0] = 0
elif i == 1:
dp[1] = dp[0] + abs(h_array[1] - h_array[0])
else:
dp[i] = min(dp[i - 1] + abs(h_array[i] - h_array[i - 1]), dp[i - 2] + abs(h_array[i] - h_array[i - 2]))
print(dp[N - 1])
|
p03160 | s040330422 | Accepted | N = int(input())
H = list(map(int, input().split()))
inf = float('inf')
dp = [inf] * (N + 1)
dp[1] = 0
for i in range(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 + 1] - H[i - 1]))
print(dp[N])
# print(dp)
|
p03160 | s978507794 | Accepted | n = int(input())
h = list(map(int,input().split()))
dp = [float('inf')]*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 | s673616024 | Accepted | n=int(input())
l=list(map(int,input().split()))
final=[0]*n
for i in range(1,n):
if i==1:
final[i]=abs(l[i]-l[i-1])
else:
final[i]=min(final[i-1]+abs(l[i]-l[i-1]),final[i-2]+abs(l[i]-l[i-2]))
print(final[-1]) |
p03160 | s578756256 | Accepted | import numpy as np
n = map(int, input())
h_list = [int(i) for i in input().split()]
h_list = np.array(h_list)
dp = np.zeros((len(h_list)))
dp[1] = np.abs(h_list[1]-h_list[0])
for i in range(2,len(h_list)):
temp1 = dp[i-1] + np.abs(h_list[i] - h_list[i-1])
temp2 = dp[i-2] + np.abs(h_list[i] - h_list[i-2])
dp[i] = min(temp1, temp2)
print(int(dp[-1])) |
p03160 | s672248412 | Accepted | """dpまじでわからん"""
'''
Created on 2020/08/29
@author: harurun
'''
import sys
N=int(sys.stdin.readline())
h=list(map(int,sys.stdin.readline().split()))
dp=[0]*N
for i in range(1,N):
if i>=2:
dp[i]=min(dp[i-1]+abs(h[i-1]-h[i]),dp[i-2]+abs(h[i-2]-h[i]))
else:
dp[i]=dp[i-1]+abs(h[i-1]-h[i])
print(dp[N-1])
# print(dp) |
p03160 | s361488312 | Accepted | n = int(input())
l = list(map(int, input().split()))
l1 = [0]*n
l1[1] = abs(l[0] - l[1])
for i in range(2, n):
l1[i] = min(l1[i - 2] + abs(l[i] - l[i - 2]), l1[i - 1] + abs(l[i] - l[i - 1]))
print(l1[n - 1]) |
p03160 | s028290529 | Accepted | n=int(input())
if n==1:
print(0)
exit()
h=list(map(int,input().split()))
c=[-1]*n
c[0]=0
c[1]=abs(h[1]-h[0])
for i in range(2,n):
c[i]=min(c[i-2]+abs(h[i]-h[i-2]),c[i-1]+abs(h[i]-h[i-1]))
print(c[n-1]) |
p03160 | s806733780 | Accepted | N = int(input())
h = list(map(int,input().split()))
A = [float('inf')] * (N)
A[0] = 0
A[1] = abs(h[1]-h[0])
if N > 2:
for i in range(2,N):
p = A[i-1] + abs(h[i-1] - h[i])
q = A[i-2] + abs(h[i-2] - h[i])
if p < A[i]:
A[i] = p
if q < A[i]:
A[i] = q
print(A[N-1])
else:
print(abs(h[1]-h[0])) |
p03160 | s989698315 | Accepted | n=int(input())
h=list(map(int,input().split()))
c=[0]*n
c[1]=abs(h[1]-h[0])
i=2
while i<n:
c[i]=min(c[i-2]+abs(h[i-2]-h[i]),c[i-1]+abs(h[i-1]-h[i]))
i+=1
print(c[n-1]) |
p03160 | s888716912 | Accepted | N = int(input())
h = list(map(int,input().split()))
dp = [0] * 110000
for i in range(1,N):
if i == 1:
dp[i] = dp[i-1]+abs(h[i-1]-h[i])
else:
dp[i] = min(dp[i-1]+abs(h[i-1]-h[i]),dp[i-2]+abs(h[i-2]-h[i]))
print(dp[N-1]) |
p03160 | s901074297 | Accepted | N=int(input())
h=list(map(int, input().split()))
min_cost = [0]*N
min_cost[0] = 0
min_cost[1] = abs(h[1]-h[0])
for idx in range(2, N):
min_cost[idx] = min(min_cost[idx-1]+abs(h[idx]-h[idx-1]), \
min_cost[idx-2]+abs(h[idx]-h[idx-2]))
print(min_cost[-1])
|
p03160 | s850609070 | Accepted | 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(1,n-1):
dp[i+1]=min(dp[i-1]+abs(h[i+1]-h[i-1]),dp[i]+abs(h[i+1]-h[i]))
print(dp[n-1])
|
p03160 | s480592369 | Accepted | from sys import stdin,stdout
st=lambda:list(stdin.readline().strip())
li=lambda:list(map(int,stdin.readline().split()))
mp=lambda:map(int,stdin.readline().split())
inp=lambda:int(stdin.readline())
pr=lambda n: stdout.write(str(n)+"\n")
mod=1000000007
INF=float('inf')
n=inp()
l=li()
dp=[0 for i in range(n)]
dp[1]=abs(l[1]-l[0])
for i in range(2,n):
dp[i]=min(dp[i-2]+abs(l[i]-l[i-2]),abs(l[i]-l[i-1])+dp[i-1])
print(dp[-1])
|
p03160 | s672928462 | Accepted | n = int(input())
h = list(map(int, input().split()))
dp = [0 for _ in range(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[-1]) |
p03160 | s318642802 | Accepted | N = int(input())
H = [int(i) for i in input().split()]
dp = [0] * N
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[-1]) |
p03160 | s497884337 | Accepted | n = int(input())
a = list(map(int,input().split()))
dp = [0 for i in range(n)]
dp[0] = 0
dp[1] = abs(a[1]-a[0])
for i in range(2,n):
dp[i] = min(dp[i-1]+abs(a[i-1]-a[i]),dp[i-2]+abs(a[i-2]-a[i]))
print(dp[-1])
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.