input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
dp=[float('inf')]*N
dp[0]=0
for i in range(1,N):
for k in range(1,K+1):
if i-k<0:
break
dp[i]=min(dp[i],dp[i-k]+abs(H[i]-H[i-k]))
print((dp[N-1])) | N,K=list(map(int,input().split()))
H=list(map(int,input().split()))
dp=[float('inf')]*N
dp[0]=0
dp[1]=abs(H[1]-H[0])
for n in range(2,N):
if n-K>0:
dp[n]=min([(dp[i]+abs(H[n]-H[i]))for i in range(n-K,n)])
else:
dp[n]=min([dp[i]+abs(H[n]-H[i])for i in range(0,n)])
print((dp[N-1])) | p03161 |
def resolve():
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [0 for _ in range(N+K)]
dp[0] = 0
dp[1] = abs(H[1] - H[0])
for tmp in range(1, K):
#print("tmp:", tmp)
if tmp+1 >= N:
break
candidates = [dp[tmp-k] + a... | def resolve():
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [0] * N
for i in range(1, N):
s = max(0, i-K)
dp[i] = min([c + abs(h - H[i]) for c, h in zip(dp[s:i], H[s:i])] )
print((dp[N-1]))
if __name__ == "__main__":
resolve()
| p03161 |
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
cost=[10**9]*n
cost[0]=0
for i in range(1,n):
for j in range(1,min(i+1,k+1)):
cost[i]=min(cost[i],cost[i-j]+abs(h[i]-h[i-j]))
print((cost[-1])) | n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
cost=[0]*n
for i in range(1,n):
cost[i]=min( [cost[i-j]+abs(h[i]-h[i-j]) for j in range(1,min(i+1,k+1))] )
print((cost[-1])) | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
INF = 10**4 + 1
dp = [INF] * N
dp[0] = 0
dp[1] = abs(h[0] - h[1])
for i in range(2, N):
candidate = []
for j in range(i-K, i):
if j >= 0:
candidate.append(dp[j]+abs(h[i]-h[j]))
dp[i] = min(candidate... | N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0]*N
for i in range(1, N):
h_to = h[i]
dp[i] = min(
[
dp_from + abs(h_to - h_from)
for dp_from, h_from in zip(
dp[max(0, i-K):i], h[max(0, i-K):i]
)
... | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split())) + [0]*100010
dp = [float("inf")]*100010
dp[0] = 0
for i in range(N):
for k in range(1, K+1):
dp[i+k] = min(dp[i+k], dp[i] + abs(h[i+k] - h[i]))
# print(dp)
print((dp[N-1])) | N, K = list(map(int, input().split()))
h = list(map(int, input().split())) + [0]*101010
dp = [float("inf")]*101010
dp[0] = 0
for i in range(N):
for k in range(1, K+1):
dp[i+k] = min(dp[i+k], dp[i] + abs(h[i+k] - h[i]))
# print(dp)
print((dp[N-1])) | p03161 |
n,k = list(map(int, input().split()))
a = list(map(int,input().split()))
dp = [0]*(n)
dp[1] = abs(a[1]-a[0])
for i in range(2,n):
c = float("inf")
for j in range(1,min(k,i)+1):
c = min(c,dp[i-j] + abs(a[i] -a[i-j]))
dp[i] = c
print((dp[n-1])) | n,k = list(map(int, input().split()))
a = list(map(int,input().split()))
dp = [0]*n
dp[1] = abs(a[1]-a[0])
for i in range(2,n):
c = float("inf")
for j in range(1,min(k,i)+1):
c = min(c,dp[i-j] + abs(a[i] -a[i-j]))
dp[i] = c
print((dp[n-1])) | p03161 |
def func():
N, K = [int(i) for i in input().split()]
H = [int(i) for i in input().split()]
dp = [0]*N
for i in range(1, N):
L = []
for j in range(max(0, i-K), i):
L.append(dp[j] + abs(H[i] - H[j]))
dp[i] = min(L)
print((dp[-1]))
if __name... | N, K = [int(i) for i in input().split()]
H = [int(i) for i in input().split()]
dp = [0] * N
for i in range(1, N):
L = []
for j in range(max(0, i-K), i):
L.append(dp[j] + abs(H[i] - H[j]))
dp[i] = min(L)
print((dp[-1])) | p03161 |
N,K=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[0]*N
for i in range(1,N):
dp[i]=min(
dp[j]+abs(h[j]-h[i]) for j in range(max(i-K,0),i)
)
print((dp[N-1]))
| def main():
N,K=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[0]*N
for i in range(1,N):
dp[i]=min(
dp[j]+abs(h[j]-h[i]) for j in range(max(i-K,0),i)
)
print((dp[N-1]))
main()
| p03161 |
n, k = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
d = [0] * n
if k >= n:
k = n-1
for i in range(1, k):
d[i] = min(d[j]+abs(h[i]-h[j]) for j in range(i))
for i in range(n-k):
d[i+k] = min(d[i+j]+abs(h[i+k]-h[i+j]) for j in range(k))
print((d[n-1])) | n, k = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
def frog(n, k, h):
d = [float('inf')] * n
d[0] = 0
for i in range(1, n):
d[i] = min(
d[j] + abs(h[i] - h[j]) for j in range(max(i - k, 0), i)
)
return d[n - 1]
print((frog(n, k, h... | p03161 |
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[10**9]*n
dp[0]=0
for i in range(1,n):
for j in range(1,min(k+1,i+1)):
dp[i]=min(dp[i],dp[i-j]+abs(h[i]-h[i-j]))
print((dp[n-1])) | N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [10 ** 9] * N
dp[0] = 0
for i in range(1, N):
for j in range(min(i, K) + 1):
dp[i] = min(dp[i], dp[i - j] + abs(H[i] - H[i - j]))
print((dp[-1])) | p03161 |
n,k = list(map(int,input().split()))
arr = list(map(int,input().split()))
dp = [float("inf")]*len(arr)
dp[0] = 0
cost = 0
for i in range(len(arr)):
for jump in range(i+1,i+k+1):
if(jump<len(arr)):
dp[jump] = min(dp[jump],dp[i]+abs(arr[jump]-arr[i]))
print((dp[-1])) | if __name__ == "__main__":
n,k = list(map(int,input().split()))
arr = list(map(int,input().split()))
dp = [-1]*len(arr)
curr = 1
dp[0] = 0
dp[1] = abs(arr[1]-arr[0])
cost = 0
for i in range(2,len(arr)):
m = float("inf")
x = i-1
c = 0
while(x>=... | p03161 |
from sys import stdin
n, k = [int(i) for i in stdin.readline().split(' ')]
h = [int(i) for i in stdin.readline().split(' ')]
minCosts = [0, abs(h[1]-h[0])]
for i in range(2, len(h)):
minCosts.append(min([abs(h[i]-h[i-j])+minCosts[i-j] for j in range(1, min(i, k)+1)]))
print((minCosts[-1])) | def test():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float('inf')]*N
dp[0] = 0
for i in range(1,N):
dp[i] = min(dp[j] + abs(h[i] - h[j]) for j in range(max(i-K, 0), i))
print((dp[N-1]))
if __name__ == '__main__':
test... | p03161 |
def test():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float('inf')]*N
dp[0] = 0
for i in range(1,N):
dp[i] = min(dp[j] + abs(h[i] - h[j]) for j in range(max(i-K, 0), i))
print((dp[N-1]))
if __name__ == '__main__':
test... | def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
a = [0] * n
a[0] = 0
for i in range(1, n):
a[i] = min([a[j] + abs(h[i] - h[j]) for j in range(max(0, i - k), i)])
print((a[-1]))
if __name__ == '__main__':
main() | p03161 |
import math
class Input():
def readInt(self):
return int(eval(input()))
def readIntArray(self):
return [int(x) for x in input().split(" ")]
def readString(self):
return eval(input())
def readStringArray(self):
return input().split(" ")
def readFloat(self):
return float(eval(input()))... | n,k = list(map(int,input().split()))
l = list(map(int,input().split()))
a = [0]*n
a[1] = abs(l[0]-l[1])
i = 2
while(i < len(a)):
e = i-k
ma = 10**10
j = i-1
while(j > -1 and j >= e):
r = a[j]+abs(l[i]-l[j])
ma = min(ma,r)
j = j-1
a[i] = ma
i = i+1
#prin... | p03161 |
N,K = list(map(int,input().split(" ")))
hs = list(map(int,input().split(" ")))
dp = [9999999999999] * N
dp[0] = 0
for i in range(1,N):
stepLim = min(K,i)
temp = 9999999999999999999
for j in range(1,stepLim + 1):
ind = i-j
c = dp[ind]+abs(hs[i]-hs[ind])
if temp >c:
... | N,K = list(map(int,input().split(" ")))
hs = list(map(int,input().split(" ")))
dp = [9999999999999] * N
dp[0] = 0
for i in range(1,N):
#ind → i-1 ~ i-stepLim -1 [i-stepLim -1:i]
stepLim = min(K,i)
temp = 9999999999999999999
dp[i] = min([d+abs(hs[i]-h) for d,h in zip(dp[i-stepLim:i],hs[i-stepLim:... | p03161 |
N,K=list(map(int,input().split(" ")))
cost=[0]*(N+1)
h=[0]
hh=list(map(int,input().split(" ")))
h.extend(hh)
h[0]=h[1]
cost[1]=0
for i in range(2,N+1):
j=min(i,K)
cost[i]=min(mm+abs(h[i]-nn) for mm,nn in zip(cost[i-j:i],h[i-j:i]))
print((cost[N])) | N,K=list(map(int,input().split(" ")))
cost=[0]*(N+1)
h=[0]
hh=list(map(int,input().split(" ")))
h.extend(hh)
h[0]=h[1]
cost[1]=0
for i in range(2,N+1):
z=max(0,i-K)
cost[i]=min(mm+abs(h[i]-nn) for mm,nn in zip(cost[z:i],h[z:i]))
print((cost[N])) | p03161 |
#配るDP（多分
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[float('inf')]*n
dp[0]=0
for i in range(1,n):
for j in range(k):
if i+j<n:
dp[i+j]=min(dp[i+j],dp[i-1]+abs(h[i+j]-h[i-1]))
print((dp[-1])) | #DP-B
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
dp=[float('inf')]*n
dp[0]=0
for i in range(1,n):
for j in range(k):
if i+j<n:
dp[i+j]=min(dp[i+j],dp[i-1]+abs(h[i+j]-h[i-1]))
print((dp[-1])) | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp=[0]*N
for i in range(1,N):
dp[i] = min(
dp[g] + abs(h[i] - h[g]) for g in range(max(i-K,0), i)
)
print((dp[N-1])) | def main():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp=[0]*N
for i in range(1,N):
dp[i] = min(
dp[g] + abs(h[i] - h[g]) for g in range(max(i-K,0), i)
)
print((dp[N-1]))
main() | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * N
for i in range(1, N):
dp[i] = min(
dp[g] + abs(h[i] - h[g]) for g in range(max(i - K, 0), i)
)
print((dp[N - 1])) | def main():
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp=[0]*N
for i in range(1,N):
dp[i] = min(
dp[g] + abs(h[i] - h[g]) for g in range(max(i-K,0), i)
)
print((dp[N-1]))
main() | p03161 |
def main():
n, k = list(map(int, input().split()))
h = [int(n) for n in input().split()]
dp = [0]*n
dp[1] = abs(h[1]-h[0])
for i in range(2, n):
dp[i] = min([dp[i-j]+abs(h[i]-h[i-j]) for j in range(1,min(i+1,k+1))])
print((dp[-1]))
if __name__ == "__main__":
main() | def main():
n, k = list(map(int, input().split()))
h = [int(n) for n in input().split()]
dp = [0]*n
for i in range(1, n):
dp[i] = min([dp[j]+abs(h[i]-h[j]) for j in range(max(0,i-k),i)])
print((dp[-1]))
if __name__ == "__main__":
main() | p03161 |
N, K = list(map(int, input().split()))
H = list(map(int,input().split()))
dp = [0]*N
for i in range(1,N):
dp[i] = min([dp[j]+abs(H[i]-H[j]) for j in range(max(0,i-K),i)])
print((dp[-1])) | def main():
N, K = list(map(int, input().split()))
H = list(map(int,input().split()))
dp = [0]*N
for i in range(1,N):
dp[i] = min([dp[j]+abs(H[i]-H[j]) for j in range(max(0,i-K),i)])
print((dp[-1]))
main() | p03161 |
def main():
N, K = list(map(int,input().split()))
H = list(map(int,input().split()))
dp = [1e9]*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]))
else:
break
print((dp[N-1]))
if __name__ == "__main... | def main():
N, K = list(map(int,input().split()))
H = list(map(int,input().split()))
dp = [1e10]*N
dp[0] = 0
for i, h in enumerate(H):
if i == 0:
continue
x = max(0, i-K)
dp[i] = min([d+abs(h-ht) for d, ht in zip(dp[x:i], H[x:i])])
print((dp[-1]))
if __name__ == "__main__":
... | p03161 |
def main():
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp= [0]*n
for i in range(1,n):
dp[i] =min([dp[i-j] + abs(h[i] - h[i-j]) \
for j in range(1,min(i+1,k+1))])
print((dp[-1]))
if __name__=='__main__':
main() | # TLE
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp= [0]*n
for i in range(1,n):
tmp = float('inf')
for j in range(1,min(i+1,k+1)):
d = dp[i-j] + abs(h[i] - h[i-j])
tmp = min(tmp,d)
dp[i] = tmp
print((dp[-1])) | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float("inf") for _ in range(N)]
derta = [[-1 for i in range(N)] for j in range(N)]
def cost(n, m):
if derta[n][m] == -1:
derta[n][m] = abs(h[n] - h[m])
return derta[n][m]
else:
return derta[n][m]
dp[0] = 0
... | N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [float("inf") for _ in range(N)]
def cost(n, m):
return abs(h[n] - h[m])
dp[0] = 0
for i in range(N):
for j in range(1, K + 1):
if (i + j) <= N -1:
dp[i + j] = min(dp[i + j], dp[i] + cost(i, i + j))
print((... | p03161 |
n,k = list(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):
dp[i] = min(abs(h[i] - h[j]) + dp[j] for j in range(max(0,i-k),i))
print((dp[-1]))
| def main():
n,k = list(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):
dp[i] = min(abs(h[i] - h[j]) + dp[j] for j in range(max(0,i-k),i))
print((dp[-1]))
main()
| p03161 |
#TLE
import sys
INF = float('inf')
input = sys.stdin.readline
def LIST():
return list(map(int, input().split()))
N, K = LIST()
h = LIST()
# DP配列を初期化
dp = [INF] * N
# 初期条件を入力
dp[0] = 0
# テーブルを更新 もらうDP
for i in range(1, N):
dp[i] = min([dp[i - j] + abs(h[i] - h[i - j]) for j in... | import sys
INF = float('inf')
input = sys.stdin.readline
def LIST():
return list(map(int, input().split()))
N, K = LIST()
h = LIST()
# DP配列を初期化
dp = [INF] * N
# 初期条件を入力
dp[0] = 0
# テーブルを更新 もらうDP
for i in range(1, N):
x = max(0, i - K)
dp[i] = min([dp_ + abs(h[i] - h_) for dp_... | p03161 |
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
dp=[0]*n
for i in range(1,n):
predp=dp[i-1]+abs(l[i]-l[i-1])
for j in range(2,k+1):
if i-j>=0 :
predp=min(predp,dp[i-j]+abs(l[i]-l[i-j]))
dp[i]=predp
print((dp[-1])) | n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
dp=[0]*n
for i in range(1,n):
start=max(0,i-k)
dp[i]=min(dp[j]+abs(l[i]-l[j]) for j in range(start,i))
print((dp[-1])) | p03161 |
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
H = [H[0]] * K + H
# dp[i] := 足場iに来るのにかかる最小のコスト
INF = 10**18
dp = [INF] * (K + N)
dp[0] = 0
for i in range(1, N + K):
for j in range(1, K + 1):
v = dp[i - j] + abs(H[i] - H[i - j])
dp[i] = min(dp[i], v)
# print('... | N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
H = [H[0]] * K + H
# dp[i] := 足場iに来るのにかかる最小のコスト
INF = 10**18
dp = [INF] * (K + N)
dp[0] = 0
for i in range(K, N + K):
h = H[i]
dp[i] = min(x + abs(y - h) for x, y in zip(dp[i - K:i], H[i - K:i]))
# for j in range(1, K + 1... | p03161 |
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
H = [H[0]] * K + H
# dp[i] := 足場iに来るのにかかる最小のコスト
INF = 10**18
dp = [INF] * (K + N)
dp[0] = 0
for i in range(K, N + K):
h = H[i]
dp[i] = min(x + abs(y - h) for x, y in zip(dp[i - K:i], H[i - K:i]))
# for j in range(1, K + 1... | N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
H = [H[0]] * K + H
# dp[i] := 足場iに来るのにかかる最小のコスト
INF = 10**18
dp = [INF] * (K + N)
dp[0] = 0
for i in range(K, N + K):
h = H[i]
tmp = [x + abs(y - h) for x, y in zip(dp[i - K:i], H[i - K:i])]
dp[i] = min(tmp)
# dp[i] ... | p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [None]*n
dp[0], dp[1] = 0, abs(h[0]-h[1])
for i in range(2, n):
di = 10**9
hi = h[i]
for j in range(max(0, i-k), i):
dj = dp[j] + abs(h[j]-hi)
if di > dj:
di = dj
dp[i] = di
print((dp[... | def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [None]*n
dp[0], dp[1] = 0, abs(h[0]-h[1])
for i in range(2, n):
di = 10**9
hi = h[i]
for j in range(max(0, i-k), i):
dj = dp[j] + abs(h[j]-hi)
if di >... | p03161 |
def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [None]*n
dp[0], dp[1] = 0, abs(h[0]-h[1])
for i in range(2, n):
di = 10**9
hi = h[i]
for j in range(max(0, i-k), i):
dj = dp[j] + abs(h[j]-hi)
if di >... | def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
m = [0 if i<k else i-k for i in range(2, n)]
dp = [None]*n
dp[0], dp[1] = 0, abs(h[0]-h[1])
for i, (hi, mi) in enumerate(zip(h[2:], m), 2):
di = 10**9
for dj, hj in zip(dp[mi:i], h[mi:i... | p03161 |
def test():
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [float('inf')]*N
dp[0] = 0
for i in range(1, N):
dp[i] = min(dp[j] + abs(H[i] - H[j]) for j in range(max(i-K, 0), i))
print((dp[-1]))
if __name__ == '__main__':
test() | n,k=list(map(int,input().split()))
H=list(map(int,input().split()))
dp=[float('inf') for _ in range(n)]
dp[0]=0
for i,hi in enumerate(H[1:],1):
s=max(0,i-k)
dp[i]=min([aj + abs(hi-hj) for hj,aj in zip(H[s:i],dp[s:i])])
print((dp[-1])) | p03161 |
N, K = list(map(int, input().split()))
h = list(map(int, input().split()))
INF = 1000000007
dp = [INF] * (N + K)
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]))
| def input_li():
return list(map(int, input().split()))
def input_int():
return int(eval(input()))
N, K = input_li()
h_li = input_li()
dp = [10 ** 9 + 7] * 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_li[i] ... | p03161 |
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
c=[0]*n
for i in range(1,n):
c[i]=min([c[j]+abs(h[i]-h[j]) for j in range(max(0,i-k),i)])
print((c[-1])) | n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
c=[0]*n
for i in range(1,n):
c[i]=min([cj+abs(h[i]-hj) for cj,hj in zip(c[max(0,i-k):i],h[max(0,i-k):i])])
print((c[-1])) | p03161 |
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
dp=[0]*n
dp[0]=0
for i in range(1,n):
x=l[i]
dp[i]=min([dp[j]+abs(x-l[j]) for j in range(max(0,i-k),i)])
print((dp[n-1])) | n,k=list(map(int,input().split()))
h=list(map(int, input().split()))
v=[0]*n
for i in range(1,n):
u = h[i]
v[i] = min([v[j] + abs(h[j]-u) for j in range(max(0, i-k), i)])
print((v[n-1]))
| p03161 |
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
d=[0]*n
d[0]=0
for i in range(1,n):
x=l[i]
d[i]=min([d[j]+abs(x-l[j]) for j in range(max(0,i-k),i)])
print((d[n-1])) | n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
d=[0]*n
d[0]=0
for i in range(1,n):
x=l[i]
d[i]=min([d[j]+abs(l[j]-x) for j in range(max(0,i-k),i)])
print((d[n-1])) | p03161 |
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
d=[0]*n
d[0]=0
for i in range(1,n):
x=l[i]
d[i]=min([d[j]+abs(l[j]-x) for j in range(max(0,i-k),i)])
print((d[n-1])) | n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
d=[0]*n
for i in range(1,n):
x=l[i]
d[i]=min([d[j]+abs(l[j]-x) for j in range (max (0,i-k),i)])
print((d[n-1])) | p03161 |
N, K = list(map(int, input().split()))
h = [int(x) for x in input().split()]
dp = [float('inf')] * N
dp[0] = 0
Func = min
for i in range(N-1):
for j in range(i+1, i+K+1):
if j >= N:
break
dp[j] = Func(dp[j], dp[i] + abs(h[i] - h[j]))
print((dp[N-1])) | N, K = list(map(int, input().split()))
h = [int(x) for x in input().split()]
dp = [float('inf')] * N
dp[0] = 0
Func = min
for i, hi in enumerate(h):
if i == 0:
continue
x = (0 if i-K < 0 else i-K)
dp[i] = min([dpj + abs(hi - hj) for dpj, hj in zip(dp[x:i], h[x:i])])
print((dp[-1])) | p03161 |
import sys
def input():
return sys.stdin.readline().strip()
def main():
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * n
dp[0] = 0
dp[1] = abs(h[0] - h[1])
if n == 2:
print((dp[1]))
else:
for i in range(2, n):
... | import sys
def input():
return sys.stdin.readline().strip()
def main():
n, k = list(map(int, input().split()))
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(abs(h[i] - h[j]) + dp[j] for j in r... | p03161 |
INF = 10**9
n, k = list(map(int, input().split(' ')))
hs = list(map(int, input().split(' ')))
dp = [INF] * n
dp[0] = 0
for i in range(1, n):
l = i if i < k else k
a = INF
hsi = hs[i]
for m in range(1, l + 1):
j = i - m
v = dp[j] + abs(hs[j] - hsi)
if a > v:
... | n, k = list(map(int, input().split(' ')))
hs = list(map(int, input().split(' ')))
dp = [float('inf')] * (n + k + 1)
dp[0] = 0
for i in range(n - 1):
for j in range(1, k + 1):
if i + j < n:
dp[i + j] = min([
dp[i + j],
dp[i] + abs(hs[i] - hs[i + j])
... | p03161 |
n,k,*h=list(map(int,open(0).read().split()))
a=[0]*n
for i in range(1,n):
j=max(0,i-k)
a[i]=min(A+abs(h[i]-H) for A,H in zip(a[j:i],h[j:i]))
print((a[-1])) | n,k,*h=list(map(int,open(0).read().split()))
a=[0]*n
for i in range(1,n):
j=max(0,i-k)
HH=h[i]
a[i]=min(A+abs(HH-H) for A,H in zip(a[j:i],h[j:i]))
print((a[-1])) | p03161 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
de... | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for... | p03161 |
MAX = 10**9
n, k = list(map(int, input().split()))
cost = list(map(int, input().split()))
dp = [MAX] * (n)
dp[0] = 0
for i in range(1, n):
for j in range(max(0, i-k), i+1):
dp[i] = min(dp[i] ,dp[j] + abs(cost[i] - cost[j]))
print((dp[-1]))
| #!/usr/bin/env pypy
import sys
inp = sys.stdin.readline
out = print
MAX = 10**9
n, k = map(int, inp().split())
cost = list(map(int, inp().split()))
dp = [MAX] * (n)
dp[0] = 0
for i in range(1, n):
dp[i] = min(dp[j] + abs(cost[i] - cost[j]) for j in range(max(0, i - k), i))
out(dp[-1])
| p03161 |
n, k = list(map(int, input().split()))
h_list = list(map(int, input().split()))
costs = [0] * n
costs[1] = abs(h_list[0] - h_list[1])
start = 0
for i in range(2, n):
if h_list[i] == 0:
costs[i] = costs[i-1]
continue
else:
v = h_list[i]
tmp = []
start = max(0, i-k)
... | n, k = list(map(int, input().split()))
h_list = list(map(int, input().split()))
costs = [0] * n
costs[1] = abs(h_list[0] - h_list[1])
start = 0
for i in range(2, n):
tmp = []
v = h_list[i]
start = max(0, i-k)
costs[i] = min(abs(v - h_j) + c for h_j, c in zip(h_list[start:i], costs[start:i]))
... | p03161 |
import math
import operator as op
from functools import reduce
from fractions import Fraction as frac
def ncr(n, r):
r = min(r, n-r)
numer = reduce(op.mul, list(range(n, n-r, -1)), 1)
denom = reduce(op.mul, list(range(1, r+1)), 1)
return numer / denom
"""
int(input())
map(int,input().split(... | import sys
def input():
return sys.stdin.readline().strip()
def main():
nk=list(map(int,input().split()))
h=list(map(int,input().split()))
n=nk[0]
k=nk[1]
dp=[10**9]*n
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
dp[i]=min(dp[j]+abs(h[i]-h[j]) for j in ran... | p03161 |
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from math import *
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bi... | import sys
def input():
return sys.stdin.readline().strip()
def main():
nk=list(map(int,input().split()))
h=list(map(int,input().split()))
n=nk[0]
k=nk[1]
dp=[10**9]*n
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
dp[i]=min(dp[j]+abs(h[i]-h[j]) for j in ran... | p03161 |
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * n
dp[0] = 0
for i in range(1, n):
pre = min(k,i)
costs_pre = [0] * pre
for j in range(1,pre+1):
costs_pre[j-1] = dp[i-j] + abs(h[i-j]-h[i])
dp[i] = min(costs_pre)
print((dp[n-1])) | n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0] * n
for i in range(1, n):
mincost = 10 ** 9
for j in range(1, min(i+1, k+1)):
mincost = min(mincost, dp[i-j] + abs(h[i]-h[i-j]))
dp[i] = mincost
print((dp[n-1])) | p03161 |
from sys import stdin, setrecursionlimit as srl
from threading import stack_size, Thread
from math import *
from collections import *
from heapq import *
srl(int(1e9)+7)
stack_size(int(1e8))
'''
deque
1) append
2) appendleft
3) pop
4) popleft
5) insert, remove, index, count, extend, extendleft, reverse... | def solve():
#start here
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
dp = [0 for i in range(n)]
for i in range(1, n):
x = float('inf')
for j in range(1, 1 + min(k, i)):
x = min(x, dp[i-j] + abs(h[i]-h[i-j]))
dp[i] = x
p... | p03161 |
N, K = list(map(int, input().split()))
H = [int(i) for i in input().split()]
dp = [0 for _ in range(N)]
dp[0] = 0
for i in range(1, N):
dp[i] = min([dp[j] + abs(H[j] - H[i]) for j in range(max(0, i-K), i)])
print((dp[N-1])) | def main():
N, K = list(map(int, input().split()))
H = [int(i) for i in input().split()]
dp = [0 for _ in range(N)]
dp[0] = 0
for i in range(1, N):
dp[i] = min([dp[j] + abs(H[j] - H[i]) for j in range(max(0, i-K), i)])
print((dp[N-1]))
if __name__ == '__main__':
main... | p03161 |
ni = lambda: int(eval(input()))
nm = lambda: list(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(max(0,i-k),i):
dp[i] = min(dp[i], dp[j] + abs(h[j]-h[i]))
print((dp[n-1]))
| ni = lambda: int(eval(input()))
nm = lambda: list(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)):
dp[j] = min(dp[j], dp[i] + abs(h[j]-h[i]))
print((dp[n-1]))
| p03161 |
N,K = list(map(int,input().split()))
H = list(map(int,input().split()))
# DPテーブル
DP = [float('inf')]*N
# 初期条件
DP[0] = 0
for i in range(0,N):
for j in range(1,K+1):
if i+j >= N:
break
DP[i+j] = min(DP[i+j],DP[i]+abs(H[i]-H[i+j]))
print((DP[N-1])) | N,K = list(map(int,input().split()))
H = list(map(int,input().split()))
# DPテーブル
DP = [float('inf')]*N
# 初期条件
DP[0] = 0
DP[1] = abs(H[1]-H[0])
for i in range(2,N):
DP[i] = min(DP[i-j]+abs(H[i]-H[i-j]) for j in range(1,min(i,K)+1))
print((DP[N-1])) | p03161 |
INF = float('inf')
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(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[N-1]))
| INF = float('inf')
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(N):
for j in range(K):
j += 1
if i + j < N:
dp[i+j] = min(dp[i+j], dp[i] + abs(h[i+j] - h[i]))
print((dp[N-1]))
| p03161 |
n,k=list(map(int,input().split()))
h=[int(l) for l in input().split()]
dp=[0,abs(h[0]-h[1])]
for i in range(2,n):
ans=10**15
num=i-k
if num<0:
num=-1
else:
num-=1
for j in range(i-1,num,-1):
ans=min(abs(h[i]-h[j])+dp[j],ans)
dp.append(ans)
print((dp[n-1]))
| from sys import stdin,stdout
n,k=list(map(int,stdin.readline().split()))
h=[int(l) for l in stdin.readline().split()]
dp=[0,abs(h[0]-h[1])]
for i in range(2,n):
ans=10**15
num=i-k
if num<0:
num=-1
else:
num-=1
for j in range(i-1,num,-1):
ans=min(abs(h[i]-h[j])+dp[... | p03161 |
def a():
N, K = [int(n) for n in input().split()]
h = [int(n) for n in input().split()]
# dp[i]はi番目までたどり着くのに必要な最小コスト
# dp[0] = 0
# dp[1] = |h[1] - h[0]|
# dp[i] = min(dp[0]+h[i]-h[0], dp[1]+h[i]-h[1], ...)
dp = [0] * N
dp[0] = 0
dp[1] = abs(h[1] - h[0])
for i in range(2... | def main():
N, K = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
dp = [-1]*N
dp[0] = 0
for i in range(1,N):
res = -1
for j in range(1, K+1):
if i - j < 0:
break
new = dp[i-j] + abs(A[i] - A[i-j])
... | p03161 |
import sys
sys.setrecursionlimit(100000)
N, K = list(map(int, input().split()))
H = list(map(int ,input().split()))
cost = [-1]*N
def sumOfCost(i):
if cost[i] >= 0:
return cost[i]
elif i == 0:
soc = 0
else:
soc = 1000000000
for j in range(1, min(i+1,K+1)):
if i-j < 0:
... | import sys
sys.setrecursionlimit(100000)
N, K = list(map(int, input().split()))
H = list(map(int ,input().split()))
cost = [-1]*N
def sumOfCost(i):
if cost[i] >= 0:
return cost[i]
elif i == 0:
soc = 0
else:
soc = 1000000000
for j in reversed(list(range(1, min(i+1,K+1)))):
... | p03161 |
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [float('inf')] * N
dp[0] = 0
for i in range(1, N):
for j in range(1, K + 1):
if i - j < 0:
break
dp[i] = min(dp[i], dp[i - j] + abs(H[i - j] - H[i]))
print((dp[-1])) | N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
dp = [10 ** 10] * N
dp[0] = 0
for i in range(1, N):
for j in range(1, K + 1):
if i - j < 0:
break
dp[i] = min(dp[i], dp[i - j] + abs(H[i - j] - H[i]))
print((dp[-1])) | p03161 |
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
dp = [10**100]*n
dp[0] = 0
for i in range(1,n):
for j in range(1,k+1):
if i-j >= 0:
dp[i] = min(dp[i-j]+abs(h[i]-h[i-j]),dp[i])
else:
break
print((dp[-1])) | n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
inf = 10**12
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[-1])) | p03161 |
n, k = [int(x) for x in input().split()]
hs = [int(x) for x in input().split()]
dp = [0] * n
inf = 1 << 30
for i in range(1, min(k,n)):
smallest = inf
for j in range(i):
smallest = min(smallest, dp[j] + abs(hs[i] - hs[j]))
dp[i] = smallest
if k < n:
for i in range(k, n):
smallest = inf
for... | n, k = [int(x) for x in input().split()]
hs = [int(x) for x in input().split()]
dp = [0] * n
for i in range(1, min(k,n)):
dp[i] = min([dpj + abs(hs[i] - hj) for dpj, hj in zip(dp[:i], hs[:i])])
if k < n:
for i in range(k, n):
dp[i] = min([dpj + abs(hs[i] - hj) for dpj, hj in zip(dp[i-k:i], hs[i-k:i])... | p03161 |
# 配るDP
# Hは1-index
import sys
input = sys.stdin.readline
n, k = list(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 j in range(1, k + 1):
if i + j <= n:
dp[i + j] = min(dp[i + j], dp[i] + abs(H[i + j... | # 配るDP
# Hは1-index
# PyPyじゃないと厳しい。
# 二重for loop
import sys
input = sys.stdin.readline
n, k = list(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 j in range(1, k + 1):
if i + j <= n:
dp[i + j] = min... | p03161 |
N, K = list(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):
DP[i] = min(abs(h[i]-h[j]) + DP[j] for j in range(max(0, i-K), i))
print((DP[-1])) | def main():
N, K = list(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):
DP[i] = min(abs(h[i]-h[j]) + DP[j] for j in range(max(0, i-K), i))
print((DP[-1]))
main() | p03161 |
# 2019-11-13 01:53:22(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# from scipy.misc import comb # float
... | import sys
s = sys.stdin.readline().rstrip()
def main():
a, b = int(s[:2]), int(s[2:])
if 1 <= a <= 12:
if 1 <= b <= 12:
return 'AMBIGUOUS'
else:
return 'MMYY'
else:
if 1 <= b <= 12:
return 'YYMM'
else:
return '... | p03042 |
while 1:
r,c,q = list(map(int,input().split()))
if r == 0: break
R = [[0,0] for i in range(r)]
C = [[0,0] for i in range(c)]
for i in range(1,q+1):
A,B,order = list(map(int,input().split()))
if A == 0:
R[B] = [i,order]
else:
C[B] = [i,order]
ans = 0
for ri in range(r):
ans += sum(R[ri]... | import bisect
while 1:
r,c,q = list(map(int,input().split()))
if r == 0: break
R = [[0,0] for i in range(r)]
C = [[0,0] for i in range(c)]
for i in range(1,q+1):
A,B,order = list(map(int,input().split()))
if A == 0:
R[B] = [i,order]
else:
C[B] = [i,order]
c1 = sorted(C[ci][0] for ci in ran... | p00664 |
s=input()
print(s.upper()) | print(input().upper()) | p00020 |
def bowling(game):
game=list(map(int,game.split()))
score,thrw=0,1
for flame in range(10):
if game[thrw]==10:
score+=sum(game[thrw:thrw+3])
thrw+=1
elif game[thrw]+game[thrw+1]==10:
score+=10+game[thrw+2]
thrw+=2
else:
score+=game[thrw]+game[thrw+1]
thrw+=2
return game[0],score
... | def bowling(game):
game=list(map(int,game.split()))
score,thrw=0,1
for flame in range(10):
if game[thrw]==10:
score+=sum(game[thrw:thrw+3])
thrw+=1
elif game[thrw]+game[thrw+1]==10:
score+=10+game[thrw+2]
thrw+=2
else:
score+=sum(game[thrw:thrw+2])
thrw+=2
return game[0],score
... | p00152 |
import pprint
n = int(eval(input()))
dp = [{} for i in range(n + 1)]
s = "AGCT"
M = 10 ** 9 + 7
for j in range(n + 1):
for c1 in s:
for c2 in s:
for c3 in s:
dp[j][c1 + c2 + c3] = 0
dp[0]["TTT"] = 1
for l in range(n):
for c1 in s:
for c2 in s:
for c3 in s:
fo... | import pprint
n = int(eval(input()))
dp = [{} for i in range(n + 1)]
s = "AGCT"
M = 10 ** 9 + 7
for j in range(n + 1):
for c1 in s:
for c2 in s:
for c3 in s:
dp[j][c1 + c2 + c3] = 0
dp[0]["TTT"] = 1
for l in range(n):
for c1 in s:
for c2 in s:
for c3 in s:
fo... | p03088 |
from functools import lru_cache
def check(s):
bads = ["AGC", "ACG", "GAC"] + [b.format(_s) for b in ["AG{}C", "A{}GC"] for _s in "ACGT"]
return not any([x in s for x in bads])
def solve(string):
n = int(string)
@lru_cache(n * 4**3)
def dfs(pos, last3):
if pos == n:
... | def solve(string):
n = int(string)
dp = [[0] * 4 for _ in range(n)]
dp[0] = [1] * 4
for i in range(1, n):
base = sum(dp[i - 1])
for j in range(4):
dp[i][j] = base
# "AGC", "ACG", "GAC"
if i >= 2:
dp[i][1] -= dp[i - 2][0] + dp[i - 2][2]
... | p03088 |
N = int(eval(input()))
MOD = 10 ** 9 + 7
memo = [{} for i in range(N + 1)]
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i - 1], t[i] = t[i], t[i - 1]
if ''.join(t).count('AGC') >= 1:
return False
return True
def dfs(cur, last3):
... |
N = int(eval(input()))
MOD = 10 ** 9 + 7
memo = [{} for _ in range(N + 1)]
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i - 1], t[i] = t[i], t[i - 1]
if "".join(t).count("AGC") > 0:
return False
return True
def dfs(cur, l... | p03088 |
n = int(eval(input()))
dp = [[0]*16 for i in range(n)]
for j in range(16):
if j in [1,6,9]:
dp[1][j] = 1
else:
dp[1][j] = 1
for i in range(2,n):
for j in range(16):
k = j//4
dp[i][j] = dp[i-1][k]+dp[i-1][k+4]+dp[i-1][k+8]+dp[i-1][k+12]
if j == 1:
dp[i][j] -= dp[i-1][8]
... | n = int(eval(input()))
dp = [[0]*16 for i in range(n)]
for j in range(16):
dp[1][j] = 1
for i in range(2,n):
for j in range(16):
k = j//4
dp[i][j] = dp[i-1][k]+dp[i-1][k+4]+dp[i-1][k+8]+dp[i-1][k+12]
if j == 1:
dp[i][j] -= dp[i-1][8]
elif j == 6:
dp[i][j] -= dp[i-1][1]
... | p03088 |
from itertools import product
import re
N = int(eval(input()))
MOD = 10 ** 9 + 7
dp = [{''.join(last_3): 0 for last_3 in product('AGCT', repeat=3)} for i in range(N + 1)]
dp[0]['TTT'] = 1
NG_pattern = r'.*AGC|.*ACG|.*GAC|A.GC|AG.C|'
for i in range(1, N + 1):
for last_3 in product('AGCT', repeat=3):
... | from itertools import product
import re
N = int(eval(input()))
MOD = 10 ** 9 + 7
dp = [{''.join(last_3): 0 for last_3 in product('AGCT', repeat=3)} for i in range(N + 1)]
dp[0]['TTT'] = 1
NG_pattern = r'.*AGC|.*ACG|.*GAC|A.GC|AG.C|'
for i in range(N):
for last_3 in product('AGCT', repeat=3):
... | p03088 |
MOD=10**9+7
N=int(eval(input()))
if N==3:
print((61))
exit()
dp=[[[[1]*4 for c in range(4)] for b in range(4)] for a in range(4)]
for x in range(4):
dp[0][x][2][1]=0
dp[0][2][x][1]=0
dp[0][1][2][x]=0
dp[2][0][1][x]=0
dp[0][2][1][x]=0
dp[x][0][1][2]=0
dp[x][2][0][1]=0
dp[x... | MOD=10**9+7
N=int(eval(input()))
if N==3:
print((61))
exit()
dp=[[[[1]*4 for c in range(4)] for b in range(4)] for a in range(4)]
for x in range(4):
dp[0][x][2][1]=0
dp[0][2][x][1]=0
dp[0][1][2][x]=0
dp[2][0][1][x]=0
dp[0][2][1][x]=0
dp[x][0][1][2]=0
dp[x][2][0][1]=0
dp[x... | p03088 |
import re
def makelist(n, m):
return [[0 for i in range(m)] for j in range(n)]
N = int(eval(input()))
MOD = int(1e9) + 7
acgt = ["A", "C", "G", "T"]
changed = [".*AGC", ".*GAC", ".*ACG", ".*A.GC", ".*AG.C"]
abcl = [ a+b+c for a in acgt for b in acgt for c in acgt]
dp = {}
for now in abcl:
if... | import re
def makelist(n, m):
return [[0 for i in range(m)] for j in range(n)]
N = int(eval(input()))
MOD = int(1e9) + 7
acgt = ["A", "C", "G", "T"]
changed = list([re.compile(pat) for pat in [r".*AGC", r".*GAC", r".*ACG", r".*A.GC", r".*AG.C"]])
abcl = [ a+b+c for a in acgt for b in acgt for c in ac... | p03088 |
import re
def makelist(n, m):
return [[0 for i in range(m)] for j in range(n)]
N = int(eval(input()))
MOD = int(1e9) + 7
acgt = ["A", "C", "G", "T"]
changed = list([re.compile(pat) for pat in [r".*AGC", r".*GAC", r".*ACG", r".*A.GC", r".*AG.C"]])
abcl = [ a+b+c for a in acgt for b in acgt for c in ac... | import re
def makelist(n, m):
return [[0 for i in range(m)] for j in range(n)]
N = int(eval(input()))
MOD = int(1e9) + 7
acgt = ["A", "C", "G", "T"]
changed = list([re.compile(pat) for pat in [r"AGC", r"GAC", r"ACG", r"A.GC", r"AG.C"]])
abcl = [ a+b+c for a in acgt for b in acgt for c in acgt]
dp ... | p03088 |
#18:20
n = int(eval(input()))
mod = 10 ** 9 + 7
now = [[[[0 for _ in range(4)]
for _ in range(4)]
for _ in range(4)]
for _ in range(4)]
now[3][3][3][3] = 1
for _ in range(n):
last = now
now = [[[[0 for _ in range(4)]
for _ in range(4)]
for ... | n = int(eval(input()))
mod = 10 ** 9 + 7
now = [[[[0 for _ in range(4)] for _ in range(4)] for _ in range(4)] for _ in range(4)]
now[3][3][3][3] = 1
for _ in range(n):
last = now
now = [[[[0 for _ in range(4)] for _ in range(4)] for _ in range(4)] for _ in range(4)]
for i in range(4):
for j in range(4... | p03088 |
import itertools
L = [''.join(i) for i in itertools.product('0123', repeat=3)]
l = len(L)
mod = 10**9+7
AGC = '021'
ACG = '012'
GAC = '201'
nc3 = set([AGC, ACG, GAC])
AGGC = '0221'
AGTC = '0231'
ATGC = '0321'
nc4 = set([AGGC, AGTC, ATGC])
n = int(eval(input()))
dp = [[0]*l for _ in range(n+1)]
for... | #!/usr/bin python3
# -*- coding: utf-8 -*-
import itertools
L = [''.join(i) for i in itertools.product('0123', repeat=3)]
l = len(L)
mod = 10**9+7
AGC = '021'
ACG = '012'
GAC = '201'
nc3 = set([AGC, ACG, GAC])
AGGC = '0221'
AGTC = '0231'
ATGC = '0321'
nc4 = set([AGGC, AGTC, ATGC])
n = int(eval(i... | p03088 |
#!/usr/bin/env python3
#ABC122 D
#条件を満たさないものは以下の5通りで追加する文字列+3文字を見れば決まる
#ACG,GAC,AGC,A?GC,AG?C
n = int(eval(input()))
#メモ化再帰
memo = [{} for i in range(n+1)]
mod = 10**9 + 7
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i-1],t[i] = t[i],t[i-1]
if '... | #!/usr/bin/env python3
#ABC122 D
n = int(eval(input()))
mod = 10**9+7
dp = [[[[0]*4 for _ in range(4)] for _ in range(4)] for _ in range(n+1)]
#長さ0の文字列は1
#0,1,2(A,G,C)に関する制約しかないため
#Sは、TTTSと考えてもよい
dp[0][3][3][3] = 1
#swapしてAGCが発生しない文字列:=AGC,ACG,GAC,A?GC,AG?Cを含まない文字列
#A:=0,G:=1,C:=2,T:=3
#文字列の文字数
for i ... | p03088 |
from collections import defaultdict
N = int(eval(input()))
dp = [defaultdict(int) for _ in range(N+1)]
MOD = 10**9 + 7
dp[0]['TTT'] = 1
def ok(last4):
for i in range(4):
l = list(last4)
if i >= 1:
l[i-1], l[i] = l[i], l[i-1]
if 'AGC' in ''.join(l):
retu... | # ABC122D - We Like AGC
N, MOD = int(eval(input())), 10 ** 9 + 7
memo = [{} for i in range(N+1)]
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i-1], t[i] = t[i], t[i-1]
if ''.join(t).count('AGC') >= 1:
return False
return True
d... | p03088 |
N = int(eval(input()))
mod = 10 ** 9 + 7
memo = [{} for i in range(N+1)]
#print (memo)
#4文字を与えて条件に合致するかを判断
def check(last4):
for i in range(4):
t = list(last4) #4文字をリストに格納
if i >= 1: #最初の文字以外に着目する時
t[i-1], t[i] = t[i], t[i-1] #i番目とi-1番目を交換
if ''.join(t).count('AGC')... | N = int(eval(input()))
MOD = 10 ** 9 + 7
memo = [{} for _ in range(N + 1)]
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i - 1], t[i] = t[i], t[i - 1]
if ''.join(t).count('AGC') >= 1:
return False
return True
def dfs(cur, last3)... | p03088 |
n = int(eval(input()))
MOD = 10**9 + 7
# dp[i][x][y][z] 0:A 1:C 2:G 3:T
dp = [[[[0] * 4 for _ in range(4)] for _ in range(4)] for _ in range(n + 1)]
dp[0][3][3][3] = 1
for i in range(n):
for x in range(4):
for y in range(4):
for z in range(4):
for w in range(4):
... | n = int(eval(input()))
MOD = 10**9 + 7
# dp[i][x][y][z] 0:A 1:C 2:G 3:T
dp = [[[[0] * 4 for _ in range(4)] for _ in range(4)] for _ in range(n + 1)]
dp[0][3][3][3] = 1
for i in range(1, n+1):
for x in range(4):
for y in range(4):
for z in range(4):
for w in range(4):
... | p03088 |
N, MOD = int(eval(input())), 10 ** 9 + 7
memo = [{} for i in range(N+1)]
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i-1], t[i] = t[i], t[i-1]
if ''.join(t).count('AGC') >= 1:
return False
return True
def dfs(cur, last3):
if last3 in memo[cur]:
return memo[cur][last3]... | N, MOD = int(eval(input())), 10 ** 9 + 7
dp = [[[[0 for k in range(4)] for k in range(4)] for j in range(4)] for i in range(101)]
dp[0][3][3][3] = 1
for length in range(N):
for i in range(4):
for j in range(4):
for k in range(4):
if dp[length][i][j][k] == 0: continue
for a in range... | p03088 |
N, MOD = int(eval(input())), 10**9+7
memo = [{} for i in range(N+1)]
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i-1], t[i] = t[i], t[i-1]
if ''.join(t).count('AGC') >= 1:
return False
return True
def dfs(cur, last3):
#メモ化
... | #貰うDP
import itertools
N, MOD = int(eval(input())), 10**9+7
memo = [{'AGC':0, 'ACG':0, 'GAC':0} for i in range(N + 1)]
C = list('ACGT')
for c in itertools.product(C, C, C):
c = ''.join(c)
if c in memo[3]:
continue
else:
memo[3][c] = 1
def ok(last4):
for i in range(4):
... | p03088 |
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().spl... | import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().spl... | p03088 |
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().spl... | import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().spl... | p03088 |
# -*- coding: utf-8 -*-
import itertools
comb = list(map(''.join, itertools.product("ACGT", repeat=4)))
N = int(eval(input()))
dp = {c: [0, 0] for c in comb}
dp["TTTT"] = [1, 0]
for _ in range(N):
dp_new = {c: [0, 0] for c in comb}
for k in dp:
for b in "ACGT":
if k[2:4] + ... | # -*- coding: utf-8 -*-
N = int(eval(input()))
dp = {b: 1 for b in "ACGT"}
for _ in range(N - 1):
dp_new = {}
for k in dp:
for b in "ACGT":
n = k[-3:] + b
if n[-3:] in ("AGC", "ACG", "GAC") or n in ("ACGC", "AGGC", "ATGC", "AGCC", "AGGC", "AGTC"):
con... | p03088 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | p03088 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | p03088 |
N = int(eval(input()))
MOD = 10**9 + 7
memo = [{} for _ in range(N + 1)]
def isAGC(char4):
for i in range(4):
tmp = list(char4)
if i != 3:
tmp[i], tmp[i + 1] = tmp[i + 1], tmp[i]
if ''.join(tmp).count('AGC') >= 1:
return True
return False
def dfs(... | N = int(eval(input()))
MOD = 10**9 + 7
dp = [[[[0] * 4 for ___ in range(4)]for __ in range(4)]for _ in range(N + 1)]
for i in range(4):
for j in range(4):
for k in range(4):
dp[0][i][j][k] = 0
dp[1][i][j][k] = 1
dp[2][i][j][k] = 1
if i == 2 and j ==... | p03088 |
N = int(eval(input()))
MOD = 10 ** 9 + 7
C = 'ACGT'
dp = [{} for _ in range(N+1)]
def ok(l4):
if (l4[0:3] in ['AGC', 'GAC', 'ACG'] or
l4[1:4] in ['AGC', 'GAC', 'ACG'] or
l4[0:1] + l4[2:4] == 'AGC' or
l4[0:2] + l4[3:4] == 'AGC'):
return False
else:
return True
for c1 in C:... | import sys
N = int(eval(input()))
MOD = 10**9+7
ACGT = ['A', 'C', 'G', 'T']
# ?AGC
# ?GAC
# ?ACG
# A?GC
# AG?C
def ok(l4):
l3 = l4[1:4]
if l3 == 'AGC' or l3 =='GAC' or l3 == 'ACG':
return False
if l4[0] == 'A' and l4[2:4] == 'GC':
return False
if l4[0:2] == 'AG' and l4[3] == 'C':
r... | p03088 |
from functools import lru_cache
import sys
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
MOD = 10**9 + 7
def isOk(T):
for i in range(4):
t = list(T)
if i >= 1:
t[i - 1], t[i] = t[i], t[i - 1]
if 'AGC' in ''.join(t):
return False
return True... | from functools import lru_cache
import sys
sys.setrecursionlimit(10**7)
N = int(eval(input()))
MOD = 10**9 + 7
S = ['A', 'G', 'C', 'T']
M = set(['AGC', 'GAC', 'ACG'])
for s in S:
M.add(s + 'AGC')
M.add(s + 'GAC')
M.add(s + 'ACG')
M.add('A' + s + 'GC')
M.add('AG' + s + 'C')
@lru_ca... | p03088 |
# ちーともわからんので解説見た
# ら、悔しさあふれる感じ
# NGになる文字の並びは限定される。3文字のものは"ACG" "GAC", 4文字のものは"AxGC", "AGxC"
# ここで, "AAGC"とか"AGCC"なんてのを考え出すと「すでに"AGC"が含まれとるやんけ」->（だから何？）みたいなよくわからん思考に陥ってしまった
# （いまみてるのとそれ以前の3つを保存して探索すると結局かぶらず全探索できるので考えなくていい）
# n = input()
# なんで？？？？？？？？？？？
# これが無限ループになるの？？？？？？？？？？？？？？？？
# は？？？？？？？？？？？？？？？？？？？？？... | # 2回前までのを保存しておく全探索？
# -> ATGC ACGC AGGC の場合も条件を満たしてしまうので、3つ前までかも（気づくのに長時間かかった）
# -> AGxCの場合も気づかなかった...
# なぜかサンプル3が合わないがコードが間違ってるわけないので表記ミスと判断して提出（傲慢
# -> MODしてないだけだった...
n = int(eval(input()))
if n == 3:
print((61))
exit()
memo = {}
MOD = 10**9 + 7
def rec(i, pre3, pre2, pre1):
if pre3... | p03088 |
N, MOD = int(eval(input())), 10 ** 9 + 7
memo = [{} for i in range(N+1)]
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i-1], t[i] = t[i], t[i-1]
if ''.join(t).count('AGC') >= 1:
return False
return True
def dfs(cur, last3):
if last3... | N, MOD = int(eval(input())), 10 ** 9 + 7
memo = [{} for i in range(N+1)]
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i-1], t[i] = t[i], t[i-1]
if ''.join(t).count('AGC') >= 1:
return False
return True
def dfs(cur, last3):
if last3... | p03088 |
N, MOD = int(eval(input())), 10 ** 9 + 7
memo = [{} for i in range(N+1)]
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i-1], t[i] = t[i], t[i-1]
if ''.join(t).count('AGC') >= 1:
return False
return True
def dfs(cur, last3):
if last3... | N = int(eval(input()))
MOD = 10 ** 9 + 7
memo = [{} for _ in range(N)]
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i-1], t[i] = t[i], t[i-1]
if 'AGC' in ''.join(t):
return False
return True
def dfs(cur, last3):
if cur == N:
... | p03088 |
a = ['A', 'G', 'C', 'T']
l = ["GACA","GACC","GACT","AGGC","AGCA","AGCG","AGCC","AGCT","AGTC","ACGA","ACGG","ACGC","ACGT","ATGC"]
dict1_y = {}
dict1_n = {}
dict2_y = {}
dict2_n = {}
t = 3
p = 10**9+7
n = int(eval(input()))
for i in a:
for j in a:
for k in a:
s = i + j + k
... | n = int(eval(input()))
dict = {
3 : 61,
4 : 230 ,
5 : 865 ,
6 : 3247 ,
7 : 12185 ,
8 : 45719 ,
9 : 171531 ,
10 : 643550 ,
11 : 2414454 ,
12 : 9058467 ,
13 : 33985227 ,
14 : 127504505 ,
15 : 478366600 ,
16 : 794717734 ,
17 : 733354121 ,
18 : 261943303 ,
19 : 776803305 ,
20 : 580025381 ,
21 : 51688048... | p03088 |
n = int(eval(input()))
dp = [[0]*64 for i in range(n)]
#a,g,c =0,1,2
##末尾4文字見る必要がある。3文字ではない
def test(w,x,y,z):
s = ((0,1,2),(1,0,2),(0,2,1))
if (x,y,z) not in s and (w,y,z)!=(0,1,2) and (w,x,z)!=(0,1,2):##これ手でノーミスは無理なのだが、処理の実装を思いつく気がしない
return True
else:
return False
for ... | n = int(eval(input()))
dp = [0]*64
#dpの保持変更
#a,g,c =0,1,2
##末尾4文字見る必要がある。3文字ではない
def test(w,x,y,z):
s = ((0,1,2),(1,0,2),(0,2,1))
if (x,y,z) not in s and (w,y,z)!=(0,1,2) and (w,x,z)!=(0,1,2):##これ手でノーミスは無理なのだが、処理の実装を思いつく気がしない
return True
else:
return False
for i in range(6... | p03088 |
from functools import lru_cache
N = int(eval(input()))
mod = 10**9+7
def check(s):
for i in range(4):
l=list(s)
if i>0:
l[i-1],l[i]=l[i],l[i-1]
if "".join(l).count("AGC"):
return False
else:
return True
@lru_cache(maxsize=None)
def dfp(i,s... | N = int(eval(input()))
mod = 10**9+7
def check(s):
for i in range(4):
l=list(s)
if i>0:
l[i-1],l[i]=l[i],l[i-1]
if "".join(l).count("AGC"):
return False
else:
return True
memo=[dict() for _ in range(N)]
def dfp(i,seq):
if i==N:
... | p03088 |
"""
1.4種類の文字ATGC
2.AGCを作ってはならない
3.隣り合う文字を1箇所だけ入れ替えても、AGCになってはならない
3. が厄介
変えないAGC
0-1 A*GC
1-2 GAC
2-3 ACG
3-4 AG*C
とりあえず3文字分テーブルに持たせながらdp？
"""
mod = 10**9 + 7
N = int(eval(input()))
dp =[[[[0]*5 for i in range(5)] for j in range(5)] for n in range(108)]
nul = 0
A = 1
G = 2
C = 3
T = 4
"""... | n = int(eval(input()))
MOD = 10**9+7
d = {"A":0, "C":1, "G":2, "T":3}
dic = {}
dic_r = {}
for i0 in "ACGT":
for i1 in "ACGT":
for i2 in "ACGT":
v = 4**2*d[i2] + 4*d[i1] + d[i0]
k = i2+i1+i0
dic[k] = v
dic_r[v] = k
dp = [[0] * 64 for i in range(n)... | p03088 |
N = int(eval(input()))
MOD = 10**9 + 7
# dp[s][i][j][k] = str[s:s+3]が(i,j,k)となる個数の数え上げ
dp = [[[[0] * 4 for _ in range(4)] for _ in range(4)] for _ in range(N-2)]
# 初期条件
for i in range(4):
for j in range(4):
for k in range(4):
if i==0 and j==1 and k==2: continue #AGC
if... | N = int(eval(input()))
MOD = 10 ** 9 + 7
# dp[n][i][j][k]: str[n:n+3]で(i,j,k)となる個数
dp = [[[[0] * 4 for _ in range(4)] for _ in range(4)] for _ in range(N - 2)]
# 初期条件
for i in range(4):
for j in range(4):
for k in range(4):
if i == 0 and j == 1 and k == 2: # ACG
co... | p03088 |
# -*- coding: utf-8 -*-
"""
参考：https://img.atcoder.jp/abc122/editorial.pdf
・数え上げDP
・正規表現
"""
import sys, re
from itertools import product
from collections import Counter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): retu... | # -*- coding: utf-8 -*-
"""
参考：https://img.atcoder.jp/abc122/editorial.pdf
・数え上げDP
・正規表現
"""
import sys, re
from itertools import product
from collections import Counter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): retu... | p03088 |
# -*- coding: utf-8 -*-
"""
参考：https://img.atcoder.jp/abc122/editorial.pdf
・数え上げDP
"""
import sys
from itertools import product
from collections import Counter
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * ... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p03088 |
N, MOD = int(eval(input())), 10 ** 9 + 7
memo = [{} for _ in range(101)]
def ok(last4):
for i in range(4):
t = list(last4)
if i >= 1:
t[i-1], t[i] = t[i], t[i-1]
if ''.join(t).find('AGC') != -1:
return False
return True
def dfs(cur, last3):
if l... | N = int(eval(input()))
MOD = 10 ** 9 + 7
memo = [{} for _ in range(N)]
def ok(last4):
if last4.find('AGC') != -1:
return False
for i in range(3):
t = list(last4)
t[i], t[i+1] = t[i+1], t[i]
if ''.join(t).find('AGC') != -1:
return False
return True
... | p03088 |
# coding: utf-8
import sys
from functools import lru_cache
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
MOD = 10 ** 9 + 7
N = ir()
def ok(last4):
if last4.find('AGC') != -1:
return False
for i in range(3):
s = list(... | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
MOD = 10 ** 9 + 7
N = ir()
memo = [{} for _ in range(N+1)]
def ok(last4):
if last4.find('AGC') != -1:
return False
for i in range(3):
s = list(... | p03088 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.