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] + abs(H[tmp+1] - H[tmp-k]) for k in range(tmp+1)]
#print("candidates_a:", candidates)
dp[tmp+1] = min(candidates)
#print(dp)
for i in range(K-1, N-1):
#print("i", i, "H[i+1]", H[i+1])
#print("H:", [H[i - k] for k in range(K)])
#print("diff:", [H[i+1] - H[i - k] for k in range(K)])
#print("dp:", dp)
candidates = [dp[i-k] + abs(H[i+1] - H[i-k]) for k in range(K)]
#print("candidates:", candidates)
dp[i+1] = min(candidates)
#print(dp)
print((dp[N-1]))
if __name__ == "__main__":
resolve()
| 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)
print((dp[-1])) | 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]
)
]
)
print((dp[-1])) | 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__=="__main__":
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])) | 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>=0 and c<k):
m= min(m,dp[x]+abs(arr[i]-arr[x]))
x -= 1
c += 1
dp[i] = m
print((dp[-1])) | 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()))
def readFloatArray(self):
return [float(x) for x in input().split(" ")]
def main():
inp = Input()
n, k = inp.readIntArray()
height = inp.readIntArray()
cost = [1000000002 for i in range(n)]
cost[0] = 0
for i in range(n):
for j in range(1, k+1):
if (i + j) < n:
cost[i+j] = min(cost[i+j], cost[i] + abs(height[i+j] - height[i]))
print((cost[n-1]))
if __name__ == "__main__":
main()
| 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
#print(a)
print((a[-1])) | 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:
temp = c
dp[i] = temp
print((dp[-1])) | 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:i])])
print((dp[-1])) | 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__":
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__":
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
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((dp[N - 1])) | 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((dp[-1])) | 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 range(1, min(K, i) + 1)])
print((dp[N - 1]))
| 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_, h_ in zip(dp[x:i], h[x:i])])
print((dp[N - 1])) | 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('dp', dp)
ans = dp[-1]
print(ans)
| 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):
# v = dp[i - j] + abs(H[i] - H[i - j])
# dp[i] = min(dp[i], v)
# print('dp', dp)
ans = dp[-1]
print(ans)
| 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):
# v = dp[i - j] + abs(H[i] - H[i - j])
# dp[i] = min(dp[i], v)
# print('dp', dp)
ans = dp[-1]
print(ans)
| 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] = 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):
# v = dp[i - j] + abs(H[i] - H[i - j])
# dp[i] = min(dp[i], v)
# print('dp', dp)
ans = dp[-1]
print(ans)
| 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[-1])) | 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 > dj:
di = dj
dp[i] = di
print((dp[-1]))
if __name__ == "__main__":
main() | 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 > dj:
di = dj
dp[i] = di
print((dp[-1]))
if __name__ == "__main__":
main() | 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]):
d = dj + abs(hj-hi)
if di > d:
di = d
dp[i] = di
print((dp[-1]))
if __name__ == "__main__":
main() | 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] - h_li[i + j]))
print((dp[-1]))
| 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):
if i <= k:
dp[i] = min(abs(h[i] - h[i - j]) + dp[i - j] for j in range(1, i + 1))
else:
dp[i] = min(abs(h[i] - h[i - j]) + dp[i - j] for j in range(1, k + 1))
print((dp[n - 1]))
if __name__ == "__main__":
main()
| 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 range(max(0, i - k), i))
print((dp[n - 1]))
if __name__ == "__main__":
main() | 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:
a = v
dp[i] = a
print((dp[-1]))
| 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])
])
print((dp[n - 1]))
| 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()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
dp=[inf for _ in range(10**5+10)]
dp[0]=0
n,k=LI()
l=LI()
for i in range(n):
for j in range(1,k+1):
if i+j<n:
# print(dp[i],abs(l[i]-l[i+j]))
dp[i+j]=min(dp[i+j],dp[i]+abs(l[i]-l[i+j]))
# print(dp[:n])
return dp[n-1]
# main()
print((main()))
| 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 x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
n,k=LI()
h=LI()
h=[0]+h
h+=[inf]*k
dp=[inf]*114514
dp[1]=0
for i in range(1,n):
for j in range(1,k+1):
dp[i+j]=min(dp[i+j],dp[i]+abs(h[i+j]-h[i]))
# print(dp[:10])
return dp[n]
# main()
print((main()))
| 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)
for l in range(start, i):
tmp.append(abs(v - h_list[l])+costs[l])
if abs(v - h_list[l]) == 0:
break
costs[i] = min(tmp)
print((costs[-1]))
| 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]))
# for l in range(start, i):
# tmp.append(abs(v - h_list[l])+costs[l])
# if abs(v - h_list[l]) == 0:
# break
# costs[i] = min(tmp)
print((costs[-1]))
| 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())
list(map(int,input().split()))
"""
# t=int(input())
t=1
for term in range(t):
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 range(max(0,i-k),i))
print((dp[n-1])) | 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 range(max(0,i-k),i))
# for j in range(max(0,i-k),i):
# dp[i]=min(dp[j]+abs(h[i]-h[j]),dp[i])
print((dp[-1]))
if __name__ == "__main__":
main() | 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, bisect
from time import perf_counter
from fractions import Fraction
import copy
import time
# import numpy as np
starttime = time.time()
# import numpy as np
mod = int(pow(10, 9) + 7)
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(*var, end="\n"): sys.stdout.write(' '.join(map(str, var))+end)
def L(): return list(sp())
def sl(): return list(ssp())
def sp(): return list(map(int, data().split()))
def ssp(): return list(map(str, data().split()))
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]
try:
# sys.setrecursionlimit(int(pow(10,6)))
sys.stdin = open("input.txt", "r")
# sys.stdout = open("../output.txt", "w")
except:
pass
n,k=L()
H=L()
dp=[10**10 for i in range(n)]
dp[0]=0
dp[1]=abs(H[1]-H[0])
for i in range(2,n):
for j in range(1,k+1):
dp[i]=min(dp[i-j]+abs(H[i]-H[i-j]),dp[i])
print((dp[-1]))
endtime = time.time()
# print(f"Runtime of the program is {endtime - starttime}")
| 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 range(max(0,i-k),i))
# for j in range(max(0,i-k),i):
# dp[i]=min(dp[j]+abs(h[i]-h[j]),dp[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
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
6) rotate # negative value rotates to the left , positive to the right
'''
'''
heapq
minheap by default but can be used as maxheap by pushing elements after multiplying them with -1
1) heapify ( iterable )
2) heappush ( heap, element)
3) heappop (heap) # smallest is removed
4) heappushpop (heap, element)
5) heapreplace (heap, element) # same as heappushpop but first popped then pushed
'''
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
print((dp[n-1]))
Thread(target=solve).start() | 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
print((dp[n-1]))
solve() | 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[j],ans)
dp.append(ans)
print((dp[n-1]))
| 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, N):
dp[i] = min([dp[k] + abs(h[k] - h[i]) for k in range(max(i - K, 0), i)])
print((dp[N-1]))
if __name__ == "__main__":
a() | 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])
if res == -1:
res = new
continue
res = min(res, new)
dp[i] = res
print((dp[N-1]))
main() | 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:
break
soc = min(soc, sumOfCost(i-j)+abs(H[i]-H[i-j]))
cost[i] = soc
return soc
print(sumOfCost(N-1))
| 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)))):
soc = min(soc, sumOfCost(i-j)+abs(H[i]-H[i-j]))
cost[i] = soc
return soc
print(sumOfCost(N-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 j in range(i - k, i):
smallest = min(smallest, dp[j] + abs(hs[i] - hs[j]))
dp[i] = smallest
print((dp[n-1])) | 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])])
print((dp[-1])) | 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] - H[i]))
print((dp[n]))
| # 配る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(dp[i + j], dp[i] + abs(H[i + j] - H[i]))
print((dp[n]))
| 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 numpy as np
def main():
s = sys.stdin.readline().rstrip()
first, second = int(s[:2]), int(s[2:])
if 1 <= first <= 12:
if 1 <= second <= 12:
ans = 'AMBIGUOUS'
else:
ans = 'MMYY'
else:
if 1 <= second <= 12:
ans = 'YYMM'
else:
ans = 'NA'
print(ans)
if __name__ == "__main__":
main()
| 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 'NA'
if __name__ == '__main__':
ans = main()
print(ans) | 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][1] if R[ri][0] > C[ci][0] else C[ci][1] for ci in range(c))
print(ans) | 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 range(c) if C[ci][1] == 1)
c0 = sorted(C[ci][0] for ci in range(c) if C[ci][1] == 0)
ans = r*sum(C[ci][1] for ci in range(c))
for ri in range(r):
if R[ri][1] == 0:
ans -= bisect.bisect(c1,R[ri][0])
else:
ans += bisect.bisect(c0,R[ri][0])
print(ans) | 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
while 1:
n=eval(input())
if n==0:break
ls=[bowling(input()) for i in range(n)]
for k,s in sorted(sorted(ls),key=lambda x:x[1],reverse=True):
print(k,s) | 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
while 1:
n=eval(input())
if n==0:break
ls=[bowling(input()) for i in range(n)]
for k,s in sorted(sorted(ls),key=lambda x:x[1],reverse=1):
print(k,s) | 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:
for p in s:
if c2 == "A" and c3 == "G" and p == "C":
continue
if c1 == "A" and c3 == "G" and p == "C":
continue
if c1 == "A" and c2 == "G" and p == "C":
continue
if c2 == "G" and c3 == "A" and p == "C":
continue
if c2 == "A" and c3 == "C" and p == "G":
continue
dp[l + 1][c2 + c3 + p] += dp[l][c1 + c2 + c3]
dp[l + 1][c2 + c3 + p] = dp[l + 1][c2 + c3 + p] % M
ans = 0
for c1 in s:
for c2 in s:
for c3 in s:
ans += dp[n][c1 + c2 + c3]
ans = ans % M
print(ans)
| 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:
for p in s:
if c2 == "A" and c3 == "G" and p == "C":
continue
if c1 == "A" and c3 == "G" and p == "C":
continue
if c1 == "A" and c2 == "G" and p == "C":
continue
if c2 == "G" and c3 == "A" and p == "C":
continue
if c2 == "A" and c3 == "C" and p == "G":
continue
dp[l + 1][c2 + c3 + p] = (dp[l + 1][c2 + c3 + p] + dp[l][c1 + c2 + c3]) % M
ans = 0
for c1 in s:
for c2 in s:
for c3 in s:
ans += dp[n][c1 + c2 + c3]
ans = ans % M
print(ans)
| 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:
return 1
ans = 0
for _s in "ACGT":
ans += dfs(pos + 1, last3[1:] + _s) if check(last3 + _s) else 0
return ans % (10**9 + 7)
return str(dfs(0, "TTT"))
if __name__ == '__main__':
print((solve(eval(input()))))
| 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]
dp[i][2] -= dp[i - 2][0]
# "AG{}C", "A{}GC"
if i >= 3:
dp[i][1] -= dp[i - 3][0] * 3
dp[i][2] += dp[i - 3][2]
return str(sum(dp[n - 1]) % (10**9 + 7))
if __name__ == '__main__':
print((solve(eval(input()))))
| 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):
if last3 in memo[cur]:
return memo[cur][last3]
if cur == N:
return 1
ret = 0
for c in 'ACGT':
if ok(last3 + c):
ret = (ret + dfs(cur + 1, last3[1:] + c)) % MOD
memo[cur][last3] = ret
return ret
print((dfs(0, 'TTT')))
|
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, last3):
if last3 in memo[cur]:
return memo[cur][last3]
if cur == N:
return 1
ret = 0
for c in "ACGT":
if ok(last3 + c):
ret = (ret + dfs(cur + 1, last3[1:] + c)) % MOD
memo[cur][last3] = ret
return ret
print((dfs(0, "TTT")))
| 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]
elif j == 6:
dp[i][j] -= dp[i-1][1]
elif j == 9:
dp[i][j] -= dp[i-1][2]+dp[i-2][2]+dp[i-2][3]
elif j == 13:
dp[i][j] -= dp[i-2][2]
else:
continue
count = 0
for j in range(16):
count += dp[n-1][j]
print((count%1000000007)) | 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]
elif j == 9:
dp[i][j] -= dp[i-1][2]+dp[i-2][2]+dp[i-2][3]
elif j == 13:
dp[i][j] -= dp[i-2][2]
else:
continue
count = 0
for j in range(16):
count += dp[n-1][j]
print((count%1000000007)) | 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):
last_3 = ''.join(last_3)
for pre_s in 'AGCT':
if re.match(NG_pattern, pre_s + last_3).group():
continue
else:
dp[i][pre_s + last_3[:-1]] += dp[i - 1][last_3]
dp[i][pre_s + last_3[:-1]] %= MOD
print((sum(dp[-1].values()) % MOD))
| 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):
last_3 = ''.join(last_3)
for next_s in 'AGCT':
if re.match(NG_pattern, last_3 + next_s).group():
continue
else:
dp[i + 1][last_3[1:] + next_s] += dp[i][last_3]
dp[i + 1][last_3[1:] + next_s] %= MOD
print((sum(dp[-1].values()) % MOD))
| 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][0][2][1]=0
def f():
tmp=[[[[0]*4 for c in range(4)] for b in range(4)] for a in range(4)]
for a in range(4):
for b in range(4):
for c in range(4):
t=sum([dp[x][a][b][c] for x in range(4)])
t%=MOD
for d in range(4):
tmp[a][b][c][d]=t
for x in range(4):
tmp[0][x][2][1]=0
tmp[0][2][x][1]=0
tmp[x][0][1][2]=0
tmp[x][2][0][1]=0
tmp[x][0][2][1]=0
return tmp
for k in range(4, N):
dp=f()
print((sum([dp[a][b][c][d] for a in range(4) for b in range(4) for c in range(4) for d in range(4)])%MOD)) | 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][0][2][1]=0
def f():
tmp=[[[[0]*4 for c in range(4)] for b in range(4)] for a in range(4)]
for a in range(4):
for b in range(4):
for c in range(4):
t=sum([dp[x][a][b][c] for x in range(4)])
t%=MOD
for d in range(4):
tmp[a][b][c][d]=t
for x in range(4):
tmp[0][x][2][1]=0
tmp[0][2][x][1]=0
tmp[x][0][1][2]=0
tmp[x][2][0][1]=0
tmp[x][0][2][1]=0
return tmp
for k in range(4, N):
dp=f()
print((sum([sum([dp[a][b][c][d] for a in range(4) for b in range(4) for c in range(4)])%MOD for d in range(4)])%MOD)) | 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 any([re.match(ch, now) for ch in changed]):
dp[now] = 0
else:
dp[now] = 1
N -= 3
while N > 0:
dpNow = {}
for abc in abcl:
abc = abc[:min(N, 3)]
dpNow[abc] = 0
for key, value in list(dp.items()):
now = key + abc
if not any([re.match(ch, now) for ch in changed]):
dpNow[abc] += value
dpNow[abc] %= MOD
dp = dpNow
N -= 3
ans = 0
for v in list(dp.values()):
ans += v
ans %= MOD
print(ans)
| 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 = {}
for now in abcl:
if any([ch.match(now) for ch in changed]):
dp[now] = 0
else:
dp[now] = 1
N -= 3
while N > 0:
dpNow = {}
for abc in abcl:
abc = abc[:min(N, 3)]
dpNow[abc] = 0
for key, value in list(dp.items()):
now = key + abc
if not any([ch.match(now) for ch in changed]):
dpNow[abc] += value
dpNow[abc] %= MOD
dp = dpNow
N -= 3
ans = 0
for v in list(dp.values()):
ans += v
ans %= MOD
print(ans)
| 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 acgt]
dp = {}
for now in abcl:
if any([ch.match(now) for ch in changed]):
dp[now] = 0
else:
dp[now] = 1
N -= 3
while N > 0:
dpNow = {}
for abc in abcl:
abc = abc[:min(N, 3)]
dpNow[abc] = 0
for key, value in list(dp.items()):
now = key + abc
if not any([ch.match(now) for ch in changed]):
dpNow[abc] += value
dpNow[abc] %= MOD
dp = dpNow
N -= 3
ans = 0
for v in list(dp.values()):
ans += v
ans %= MOD
print(ans)
| 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 = {}
for now in abcl:
if any([ch.search(now) for ch in changed]):
dp[now] = 0
else:
dp[now] = 1
N -= 3
while N > 0:
dpNow = {}
for abc in abcl:
abc = abc[:min(N, 3)]
dpNow[abc] = 0
for key, value in list(dp.items()):
now = key + abc
if not any([ch.search(now) for ch in changed]):
dpNow[abc] += value
dpNow[abc] %= MOD
dp = dpNow
N -= 3
ans = 0
for v in list(dp.values()):
ans += v
ans %= MOD
print(ans)
| 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 _ in range(4)]
for _ in range(4)]
for i in range(4):
for j in range(4):
for k in range(4):
for l in range(4):
for m in range(4):
now[j][k][l][m] += last[i][j][k][l]
now[j][k][l][m] %= mod
for j in range(4):
now[j][0][1][2] = 0
now[j][1][0][2] = 0
now[j][0][2][1] = 0
for k in range(4):
now[0][k][1][2] = 0
for l in range(4):
now[0][1][l][2] = 0
ans = 0
for i in range(4):
for j in range(4):
for k in range(4):
for l in range(4):
ans += now[i][j][k][l]
print((ans % mod)) | 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):
for k in range(4):
for l in range(4):
for m in range(4):
now[j][k][l][m] += last[i][j][k][l]
now[j][k][l][m] %= mod
for h in range(4):
now[h][0][1][2] = 0
now[h][1][0][2] = 0
now[h][0][2][1] = 0
now[0][h][1][2] = 0
now[0][1][h][2] = 0
ans = 0
for j in range(4):
for k in range(4):
for l in range(4):
for m in range(4):
ans += now[j][k][l][m]
ans %= mod
print(ans) | 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 i in L:
if i in nc3: continue
dp[3][int(i, 4)] = 1
for i in range(3, n):
for jl in L:
for k in "0123":
nxt = jl[1:] + k
if nxt in nc3: continue
if jl+k in nc4: continue
dp[i+1][int(nxt, 4)] += dp[i][int(jl, 4)]
print((sum(dp[n])%mod)) | #!/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(input()))
dp = [[0]*l for _ in range(n+1)]
for i in L:
if i in nc3: continue
dp[3][int(i, 4)] = 1
for i in range(3, n):
for jl in L:
for k in "0123":
nxt = jl[1:] + k
if nxt in nc3: continue
if jl+k in nc4: continue
dp[i+1][int(nxt, 4)] += dp[i][int(jl, 4)]
print((sum(dp[n])%mod))
| 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 ''.join(t).count('AGC') >= 1:
return False
return True
def dfs(cur, last3):
if last3 in memo[cur]:
return memo[cur][last3]
if cur == n:
return 1
ret = 0
#AGCTを1文字ずつ追加してみる
for c in 'AGCT':
#cを追加したときにTrue(不適でない)なら
if ok(last3 + c):
#現在位置を1つ進めてcを追加した値を足す
ret = (ret + dfs(cur + 1, last3[1:] + c)) % mod
#値を格納
memo[cur][last3] = ret
return ret
print((dfs(0,'TTT')))
| #!/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 in range(n):
#最後から1文字目
for j in range(4):
#最後から2文字目
for k in range(4):
#条件に当てはまるものがない場合
if dp[i][j][k] == 0:
continue
#最後から3文字目
for l in range(4):
#新たに追加する文字
for a in range(4):
#ダメな5条件をカット
#AGCの場合
if a == 2 and j == 1 and k == 0:continue
#GACの場合
if a == 2 and j == 0 and k == 1:continue
#ACGの場合
if a == 1 and j == 2 and k == 0:continue
#A?GCの場合
if a == 2 and j == 1 and l == 0:continue
#AG?Cの場合
if a == 2 and k == 1 and l == 0:continue
#ダメの条件を抜けると、aを足した文字列が作れる
dp[i+1][a][j][k] += dp[i][j][k][l]
dp[i+1][a][j][k] %= mod
ans = 0
for j in range(4):
for k in range(4):
for l in range(4):
#長さnの全通り回収
ans += dp[n][j][k][l]
ans %= mod
print(ans)
| 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):
return False
return True
for n in range(N):
for s, cnt in list(dp[n].items()):
for c in 'AGCT':
ns = s+c
if ok(ns):
dp[n+1][ns[-3:]] = (dp[n+1][ns[-3:]]+cnt) % MOD
print((sum(dp[N].values()) % MOD))
| # 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
def dfs(cur, last3):
if last3 in memo[cur]:
return memo[cur][last3]
if cur == N:
return 1
ret = 0
for c in 'ACGT':
if ok(last3 + c):
ret = (ret + dfs(cur + 1, last3[1:] + c)) % MOD
memo[cur][last3] = ret
return ret
print((dfs(0, 'TTT')))
| 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') >= 1: #AGCが含まれているかどうかの確認
return False
return True
def dfs(cur, last3): #深さ優先探索
if last3 in memo[cur]:
return memo[cur][last3]
if cur == N:
return 1
ret = 0
for c in 'ATCG':
if check(last3+c):
ret = (ret+dfs(cur+1, last3[1:]+c))%mod
memo[cur][last3] = ret
return ret
print((dfs(0, 'TTT')))
#print (memo) | 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):
if last3 in memo[cur]:
return memo[cur][last3]
if cur == N:
return 1
ret = 0
for c in 'AGCT':
if ok(last3 + c):
ret = (ret + dfs(cur + 1, last3[1:] + c)) % MOD
memo[cur][last3] = ret
return ret
print((dfs(0, 'TTT'))) | 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):
if x == 0 and z == 2 and w == 1:
continue
elif y == 0 and z == 2 and w == 1:
continue
elif y == 2 and z == 0 and w == 1:
continue
elif y == 0 and z == 1 and w == 2:
continue
elif x == 0 and y == 2 and w == 1:
continue
dp[i+1][y][z][w] += dp[i][x][y][z]
dp[i+1][y][z][w] %= MOD
ans = 0
for x in range(4):
for y in range(4):
for z in range(4):
ans += dp[n][x][y][z]
ans %= MOD
print(ans)
| 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):
if x == 0 and z == 2 and w == 1:
continue
elif y == 0 and z == 2 and w == 1:
continue
elif y == 2 and z == 0 and w == 1:
continue
elif y == 0 and z == 1 and w == 2:
continue
elif x == 0 and y == 2 and w == 1:
continue
dp[i][y][z][w] += dp[i-1][x][y][z]
dp[i][y][z][w] %= MOD
ans = 0
for x in range(4):
for y in range(4):
for z in range(4):
ans += dp[n][x][y][z]
ans %= MOD
print(ans) | 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]
if cur == N:
return 1
ret = 0
for c in 'ACGT':
if ok(last3 + c):
ret = (ret + dfs(cur + 1, last3[1:] + c)) % MOD
memo[cur][last3] = ret
return ret
print((dfs(0, 'TTT'))) | 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(4):
if a == 2 and i == 1 and j == 0: continue
if a == 2 and i == 0 and j == 1: continue
if a == 1 and i == 2 and j == 0: continue
if a == 2 and i == 1 and k == 0: continue
if a == 2 and j == 1 and k == 0: continue
dp[length + 1][a][i][j] += dp[length][i][j][k]
dp[length + 1][a][i][j] %= MOD
ans = 0
for i in range(4):
for j in range(4):
for k in range(4):
ans += dp[N][i][j][k]
ans %= MOD
print(ans)
| 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]
#最後までたどり着いた数列
if cur == N:
return 1
#漸化式計算
ret = 0
for c in 'ACGT':
if ok(last3 + c):
ret = (ret + dfs(cur + 1, last3[1:] + c)) % MOD
memo[cur][last3] = ret
return ret
print((dfs(0, 'TTT'))) | #貰う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):
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]
ret = 0
for c in 'ACGT':
if ok(c + last3):
ret = (ret + dfs(cur - 1, c + last3[:-1])) % MOD
memo[cur][last3] = ret
return ret
def answer(n):
ans = 0
clist = list('ACGT')
for c in itertools.product(clist, clist, clist):
ch = ''.join(c)
ans += dfs(n, ch)
return ans % MOD
print((answer(N))) | 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().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(input())
from collections import Counter
from itertools import product
def main():
N = II()
dp = Counter()
dp['TTT'] += 1
for _ in range(N):
pre = dp
dp = Counter()
for p1, p2, p3, cur in product('ACGT', repeat=4):
if p2 + p1 + cur in ['AGC', 'GAC', 'ACG']:
continue
if p3 + p1 + cur == 'AGC':
continue
if p3 + p2 + cur == 'AGC':
continue
new = p2 + p1 + cur
old = p3 + p2 + p1
dp[new] = (dp[new] + pre[old]) % MOD
ans = sum(dp.values())
return ans % MOD
print((main())) | 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().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(input())
from collections import Counter
from itertools import product
def main():
N = II()
dp = Counter()
dp['000'] += 1
for _ in range(N):
pre = dp
dp = Counter()
for old, n in list(pre.items()):
for cur in 'AGCT':
new = old[-2:] + cur
if new in ['AGC', 'GAC', 'ACG']:
continue
if old[-3] + old[-1] + cur == 'AGC':
continue
if old[:-1] + cur == 'AGC':
continue
dp[new] = (dp[new] + n) % MOD
ans = sum(dp.values())
return ans % MOD
print((main())) | 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().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(input())
from collections import Counter
from itertools import product
def main():
N = II()
dp = Counter()
dp['000'] += 1
for _ in range(N):
pre = dp
dp = Counter()
for old, n in list(pre.items()):
for cur in 'AGCT':
new = old[-2:] + cur
if new in ['AGC', 'GAC', 'ACG']:
continue
if old[-3] + old[-1] + cur == 'AGC':
continue
if old[:-1] + cur == 'AGC':
continue
dp[new] = (dp[new] + n) % MOD
ans = sum(dp.values())
return ans % MOD
print((main())) | 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().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(input())
from collections import Counter
from itertools import product
def main():
N = II()
dp = Counter()
dp['000'] += 1
for _ in range(N):
pre = dp
dp = Counter()
for (p3, p2, p1), n in list(pre.items()):
for cur in 'AGCT':
if p2 + p1 + cur in ['AGC', 'GAC', 'ACG']:
continue
if p3 + p1 + cur == 'AGC':
continue
if p3 + p2 + cur == 'AGC':
continue
new = p2 + p1 + cur
dp[new] = (dp[new] + n) % MOD
ans = sum(dp.values())
return ans % MOD
print((main())) | 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] + b in ("AGC", "ACG", "GAC") or k[1:4] + b in ("ACGC", "AGGC", "ATGC", "AGCC", "AGGC", "AGTC"):
dp_new[k[1:4] + b][1] += dp[k][0] + dp[k][1]
else:
dp_new[k[1:4] + b][0] += dp[k][0]
dp_new[k[1:4] + b][1] += dp[k][1]
dp = dp_new
mod = int(1e9) + 7
print(((4 ** N - sum([dp[k][1] for k in dp])) % mod))
| # -*- 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"):
continue
else:
if n in dp_new:
dp_new[n] += dp[k]
else:
dp_new[n] = dp[k]
dp = dp_new
print((sum(dp.values()) % (10 ** 9 + 7)))
| 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, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b ) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, self.pow(b, self.m-2))
def pow(self, x, y):
if y == 0:
return 1
elif y == 1:
return x % self.m
elif y % 2 == 0:
return self.pow(x, y//2)**2 % self.m
else:
return self.pow(x, y//2)**2 * x % self.m
@mt
def slv(N):
if N==3:
return 61
m = Mod(10**9+7)
dp = {}
iv = [
'agc',
'acg',
'gac',
'aggc'
'acgc',
'atgc',
'agac',
'aggc',
'agtc',
]
for s in product('agct', repeat=4):
s = ''.join(s)
if not any(map(lambda x: x in s, iv)):
dp[s] = 1
for _ in range(N-4):
dp_ = Counter()
for k, v in dp.items():
for c in 'agct':
s = k + c
if not any(map(lambda x: x in s, iv)):
dp_[s[1:]] = m.add(v, dp_[s[1:]])
dp = dp_
ans = 0
for k, v in dp.items():
ans = m.add(ans, v)
return ans
def main():
N = read_int()
print(slv(N))
if __name__ == '__main__':
main()
| # -*- 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, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b ) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, self.pow(b, self.m-2))
def pow(self, x, y):
if y == 0:
return 1
elif y == 1:
return x % self.m
elif y % 2 == 0:
return self.pow(x, y//2)**2 % self.m
else:
return self.pow(x, y//2)**2 * x % self.m
@mt
def slv(N):
if N==3:
return 61
m = Mod(10**9+7)
dp = {}
iv = [
'agc',
'acg',
'gac',
'aggc'
'acgc',
'atgc',
'agac',
'aggc',
'agtc',
]
for s in product('agct', repeat=4):
s = ''.join(s)
if not any(map(lambda x: x in s, iv)):
dp[s] = 1
for _ in range(N-4):
dp_ = Counter()
for k, v in dp.items():
for c in 'agct':
s = k + c
s = s[1:]
if s in dp:
dp_[s] = m.add(v, dp_[s])
dp = dp_
ans = 0
for k, v in dp.items():
ans = m.add(ans, v)
return ans
def main():
N = read_int()
print(slv(N))
if __name__ == '__main__':
main()
| 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, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b ) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, self.pow(b, self.m-2))
def pow(self, x, y):
if y == 0:
return 1
elif y == 1:
return x % self.m
elif y % 2 == 0:
return self.pow(x, y//2)**2 % self.m
else:
return self.pow(x, y//2)**2 * x % self.m
@mt
def slv(N):
if N==3:
return 61
m = Mod(10**9+7)
dp = {}
iv = [
'agc',
'acg',
'gac',
'aggc'
'acgc',
'atgc',
'agac',
'aggc',
'agtc',
]
for s in product('agct', repeat=4):
s = ''.join(s)
if not any(map(lambda x: x in s, iv)):
dp[s] = 1
for _ in range(N-4):
dp_ = Counter()
for k, v in dp.items():
for c in 'agct':
s = k + c
s = s[1:]
if s in dp:
dp_[s] = m.add(v, dp_[s])
dp = dp_
ans = 0
for k, v in dp.items():
ans = m.add(ans, v)
return ans
def main():
N = read_int()
print(slv(N))
if __name__ == '__main__':
main()
| # -*- 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, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b ) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, self.pow(b, self.m-2))
def pow(self, x, y):
if y == 0:
return 1
elif y == 1:
return x % self.m
elif y % 2 == 0:
return self.pow(x, y//2)**2 % self.m
else:
return self.pow(x, y//2)**2 * x % self.m
@mt
def slv(N):
if N==3:
return 61
m = Mod(10**9+7)
dp = {}
iv = [
'agc',
'acg',
'gac',
'aggc'
'acgc',
'atgc',
'agac',
'aggc',
'agtc',
]
for s in product('agct', repeat=4):
s = ''.join(s)
if not any(map(lambda x: x in s, iv)):
dp[s] = 1
for _ in range(N-4):
dp_ = Counter()
for k, v in dp.items():
for c in 'agct':
s = k + c
s = s[1:]
if s in dp:
dp_[s] = m.add(v, dp_[s])
dp = dp_
return reduce(lambda x, y: m.add(x, y), dp.values())
def main():
N = read_int()
print(slv(N))
if __name__ == '__main__':
main()
| 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(cur, char3):
if char3 in memo[cur]:
return memo[cur][char3]
if cur == N:
return 1
ret = 0
for c in ['A', 'C', 'G', 'T']:
if not isAGC(char3 + c):
ret = (ret + dfs(cur + 1, char3[1:] + c)) % MOD
memo[cur][char3] = ret
return ret
print((dfs(0, 'XXX'))) | 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 == 1 and k == 0:
continue
elif i == 1 and j == 2 and k == 0:
continue
elif i == 2 and j == 0 and k == 1:
continue
dp[3][i][j][k] = 1
for n in range(3, N):
for i in range(4):
for j in range(4):
for k in range(4):
for c in range(4):
if c == 1 and i == 2 and j == 0:
continue
elif c == 2 and i == 1 and j == 0:
continue
elif c == 2 and i == 0 and j == 1:
continue
elif c == 2 and i == 1 and k == 0:
continue
elif c == 2 and j == 1 and k == 0:
continue
dp[n + 1][c][i][j] += dp[n][i][j][k]
dp[n + 1][c][i][j] %= MOD
ans = 0
for i in range(4):
for j in range(4):
for k in range(4):
ans += dp[N][i][j][k]
print((ans % MOD))
| 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:
for c2 in C:
for c3 in C:
l4 = 'X' + c1 + c2 + c3
if ok(l4):
dp[3][l4] = 1
else:
dp[3][l4] = 0
for i in range(4, N+1):
for l4 in list(dp[i-1].keys()):
for c in C:
next_l4 = l4[1:4] + c
if next_l4 not in dp[i]:
dp[i][next_l4] = 0
if ok(next_l4):
dp[i][next_l4] = (dp[i][next_l4] + dp[i-1][l4]) % MOD
ans = 0
for count in list(dp[N].values()):
ans = (ans + count) % MOD
print(ans) | 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':
return False
return True
# dp[i][l4] = i文字かつ末尾4文字がlast4な数
dp = [{} for _ in range(N+1)]
for c1 in ACGT:
for c2 in ACGT:
for c3 in ACGT:
l4 = 'X' + c1 + c2 + c3
if ok(l4):
dp[3][l4] = 1
else:
dp[3][l4] = 0
for i in range(4, N+1):
for l4 in list(dp[i-1].keys()):
for c in ACGT:
next_l4 = l4[1:4] + c
if not next_l4 in dp[i]:
dp[i][next_l4] = 0
if ok(next_l4):
dp[i][next_l4] += dp[i-1][l4]
print((sum(dp[N].values())%MOD)) | 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
@lru_cache(maxsize=None)
def search(n, prev):
if n == 0:
return 1
ret = 0
for s in ['A', 'G', 'C', 'T']:
t = (prev + s)[1:]
if isOk(t):
ret += search(n - 1, t)
ret %= MOD
return ret
print((search(N, 'ZZZZ'))) | 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_cache(maxsize=None)
def search(prev, length):
if length >= N:
return 1
ret = 0
for s in S:
T = prev + s
if not T in M:
T = T[:: -1][: 3][:: -1]
ret += search(T, length + 1)
return ret % MOD
ans = search('', 0)
print(ans)
| p03088 |
# ちーともわからんので解説見た
# ら、悔しさあふれる感じ
# NGになる文字の並びは限定される。3文字のものは"ACG" "GAC", 4文字のものは"AxGC", "AGxC"
# ここで, "AAGC"とか"AGCC"なんてのを考え出すと「すでに"AGC"が含まれとるやんけ」->（だから何？）みたいなよくわからん思考に陥ってしまった
# （いまみてるのとそれ以前の3つを保存して探索すると結局かぶらず全探索できるので考えなくていい）
# n = input()
# なんで？？？？？？？？？？？
# これが無限ループになるの？？？？？？？？？？？？？？？？
# は？？？？？？？？？？？？？？？？？？？？？？？？？？？
# def f(i, s):
# if i == n:
# return 1
# # print("now s : {}".format(s))
# ret = 0
# for c in "ACGT":
# print(s + c)
# is_include = True if "AGC" in s + c else False
# if is_include:
# continue
# ret += f(i + 1, s[1:] + c)
# return ret
# print(f(0, "xxx"))
# coding: utf-8
# Your code here!
n = int(eval(input()))
memo = {}
def f(i, s):
if (i, s) in memo:
return memo[(i, s)]
if i == n:
return 1
ret = 0
for c in "AGCT":
flag = False
for j in range(4):
t = list(s + c)
if j >= 1:
t[j], t[j - 1] = t[j - 1], t[j]
if "AGC" in "".join(t):
flag = True
if not flag:
ret += f(i + 1, s[1:] + c)
ret %= 10 ** 9 + 7
memo[(i, s)] = ret
return ret
print((f(0, "TTT")))
| # 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 == "A" and pre2 == "G" and pre1 == "C":
return 0
if pre3 == "G" and pre2 == "A" and pre1 == "C":
return 0
if pre3 == "A" and pre2 == "C" and pre1 == "G":
return 0
if (i, pre1, pre2, pre3) in memo:
return memo[(i, pre1, pre2, pre3)]
if i == n - 3:
return 1
else:
ret = 0
if (pre1 == "G" and pre2 == "A") or (pre1 == "A" and pre2 == "G"):
ret = rec(i + 1, pre2, pre1, "A") % MOD + rec(
i + 1, pre2, pre1, "G") % MOD + rec(i + 1, pre2, pre1,
"T") % MOD
elif pre1 == "C" and pre2 == "A":
ret = rec(i + 1, pre2, pre1, "C") % MOD + rec(
i + 1, pre2, pre1, "A") % MOD + rec(i + 1, pre2, pre1,
"T") % MOD
elif pre3 == "A" and pre1 == "G":
ret = rec(i + 1, pre2, pre1, "A") % MOD + rec(
i + 1, pre2, pre1, "G") % MOD + rec(i + 1, pre2, pre1,
"T") % MOD
elif pre3 == "A" and pre2 == "G":
ret = rec(i + 1, pre2, pre1, "A") % MOD + rec(
i + 1, pre2, pre1, "G") % MOD + rec(i + 1, pre2, pre1,
"T") % MOD
else:
ret = rec(i + 1, pre2, pre1,
"A") + rec(i + 1, pre2, pre1, "G") % MOD + rec(
i + 1, pre2, pre1, "C") % MOD + rec(
i + 1, pre2, pre1, "T") % MOD
ret %= MOD
memo[(i, pre1, pre2, pre3)] = ret
return ret
# 最初とりうるやつ（めんどい）
ans = 0
for i in ["A", "G", "C", "T"]:
for j in ["A", "G", "C", "T"]:
for k in ["A", "G", "C", "T"]:
ans += rec(0, i, j, k)
print((ans % MOD))
| 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]
if cur == N:
return 1
ret = 0
for c in ['A', 'C', 'G', 'T']:
if ok(last3 + c):
ret = (ret + dfs(cur + 1, last3[1:] + c)) % MOD
memo[cur][last3] = ret
return ret
print((dfs(0, 'TTT'))) | 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]
if cur == N:
return 1
ret = 0
for c in 'ACGT':
if ok(last3 + c):
ret = (ret + dfs(cur + 1, last3[1:] + c)) % MOD
memo[cur][last3] = ret
return ret
print((dfs(0, 'TTT'))) | 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]
if cur == N:
return 1
ret = 0
for c in 'ACGT':
if ok(last3 + c):
ret = (ret + dfs(cur + 1, last3[1:] + c)) % MOD
memo[cur][last3] = ret
return ret
print((dfs(0, 'TTT'))) | 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:
return 1
elif last3 in memo[cur]:
return memo[cur][last3]
else:
ret = 0
for c in 'ACGT':
if ok(last3 + c):
ret += dfs(cur + 1, last3[1:] + c)
ret = ret % MOD
memo[cur][last3] = ret
return ret
print((dfs(0, ' '))) | 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
dict1_y[s] = 0
dict1_n[s] = 0
dict2_y[s] = 0
dict2_n[s] = 0
for i in a:
for j in a:
for k in a:
s = i + j + k
if 'AGC' in s:
dict1_y[s] += 1
else:
tem1 = s[0]
tem2 = s[1]
new_s = tem2 + tem1 + s[2]
if 'AGC' in new_s:
dict1_y[s] += 1
else:
tem1 = s[1]
tem2 = s[2]
new_s = s[0] + tem2 + tem1
if 'AGC' in new_s:
dict1_y[s] += 1
else:
dict1_n[s] += 1
while t != n:
for k,v in list(dict1_y.items()):
for m in a:
key = m + k[0] + k[1]
dict2_y[key] += v
for k,v in list(dict1_n.items()):
for m in a:
new_s = m + k
key = m + k[0] + k[1]
if new_s in l:
dict2_y[key] += v
else:
dict2_n[key] += v
for i in a:
for j in a:
for k in a:
s = i + j + k
dict1_y[s] = dict2_y[s] % p
dict1_n[s] = dict2_n[s] % p
dict2_y[s] = 0
dict2_n[s] = 0
t += 1
ans = 0
for v in list(dict1_y.values()):
ans += v % p
print(((4**n - ans) % p))
| 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 ,
22 : 44657419 ,
23 : 737209731 ,
24 : 604119499 ,
25 : 159693437 ,
26 : 858533109 ,
27 : 639056669 ,
28 : 549054109 ,
29 : 996291083 ,
30 : 531294469 ,
31 : 23314687 ,
32 : 783022045 ,
33 : 855462856 ,
34 : 649970414 ,
35 : 68697295 ,
36 : 409213624 ,
37 : 604356692 ,
38 : 88638656 ,
39 : 978442997 ,
40 : 534833116 ,
41 : 763737161 ,
42 : 785892908 ,
43 : 123883652 ,
44 : 639213333 ,
45 : 181836645 ,
46 : 998121103 ,
47 : 124885216 ,
48 : 501575626 ,
49 : 39816123 ,
50 : 113468411 ,
51 : 799008836 ,
52 : 775465589 ,
53 : 256852905 ,
54 : 664630886 ,
55 : 971550783 ,
56 : 751629411 ,
57 : 51018086 ,
58 : 702530485 ,
59 : 725438992 ,
60 : 696683714 ,
61 : 792638194 ,
62 : 221791721 ,
63 : 149602322 ,
64 : 414054379 ,
65 : 986519078 ,
66 : 981760191 ,
67 : 305799096 ,
68 : 515140586 ,
69 : 406959393 ,
70 : 975058685 ,
71 : 245601370 ,
72 : 324759692 ,
73 : 673385295 ,
74 : 191483611 ,
75 : 570246669 ,
76 : 427196161 ,
77 : 781042769 ,
78 : 569725155 ,
79 : 842176273 ,
80 : 25328739 ,
81 : 847501730 ,
82 : 206282374 ,
83 : 353770801 ,
84 : 323137024 ,
85 : 371653459 ,
86 : 940737264 ,
87 : 123820509 ,
88 : 915711339 ,
89 : 847205021 ,
90 : 252858375 ,
91 : 718889563 ,
92 : 866398347 ,
93 : 738390145 ,
94 : 133009077 ,
95 : 333099663 ,
96 : 170591295 ,
97 : 329869205 ,
98 : 616680192 ,
99 : 597534442 ,
100 : 388130742
}
print((dict[n])) | 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 i in range(64):
x,y,z = i>>4,(i>>2)&3,i&3
if test(3,x,y,z):
dp[2][i]=1
for i in range(3,n):
for j in range(64):
w,x,y = j>>4,(j>>2)&3,j&3
"""
if w not in (0,1,2,3) or x not in (0,1,2,3) or y not in ( 0,1,2,3):
print(j,w,x,y)
exit()
"""
for z in range(4):
if test(w,x,y,z):
dp[i][(x<<4)+(y<<2)+z]+=dp[i-1][j]
#for i in range(16):
# ans+=dp[i][n-1]
ans = sum(dp[n-1])
ans%=10**9+7
print(ans)
| 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(64):
x,y,z = i>>4,(i>>2)&3,i&3
if test(3,x,y,z):
dp[i]=1
for i in range(3,n):
dp2 = [0]*64
for j in range(64):
w,x,y = j>>4,(j>>2)&3,j&3
"""
if w not in (0,1,2,3) or x not in (0,1,2,3) or y not in ( 0,1,2,3):
print(j,w,x,y)
exit()
"""
for z in range(4):
if test(w,x,y,z):
dp2[(x<<4)+(y<<2)+z]+=dp[j]
dp = dp2
#for i in range(16):
# ans+=dp[i][n-1]
ans = sum(dp)
ans%=10**9+7
print(ans)
| 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,seq):
ret=0
if i==N:
return 1
for s in ["A","G","C","T"]:
if check(seq+s):
ret=(ret+dfp(i+1,seq[1:]+s))%mod
return ret
print((dfp(0,"TTT"))) | 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:
return 1
if seq in memo[i]:
return memo[i][seq]
ret=0
for s in ["A","G","C","T"]:
if check(seq+s):
ret=(ret+dfp(i+1,seq[1:]+s))%mod
memo[i][seq] = ret
return ret
print((dfp(0,"TTT"))) | 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
"""
AGC
0-1 A*GC
1-2 GAC
2-3 ACG
3-4 AG*C
"""
dp[0][0][0][0] = 1
for n in range(N):
for n3 in range(5): # 3つ前
for n2 in range(5): # 2つ前
for n1 in range(5): # 1つ前
for s in range(1,5): # 今
if n2 == A and n1 == G and s == C: continue
if n3 == A and n1 == G and s == C: continue
if n2 == G and n1 == A and s == C: continue
if n2 == A and n1 == C and s == G: continue
if n3 == A and n2 == G and s == C: continue
# print(n,n1,n2,n3,s)
dp[n+1][n2][n1][s] += dp[n][n3][n2][n1]
ans = 0
for i in range(5):
for j in range(5):
for k in range(5):
ans += dp[N][i][j][k]
print((ans%mod)) | 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)]
for i in range(64):
dp[0][i] = 1
dp[0][dic["AGC"]] = 0
dp[0][dic["ACG"]] = 0
dp[0][dic["GAC"]] = 0
for i in range(n-3):
for j in range(64):
v = dic_r[j]
for s in "ACGT":
# AG*C
if v[0] == "A" and v[1] == "G":
if s != "C":
new = v[1]+v[2]+s
dp[i+1][dic[new]] += dp[i][dic[v]]
# A*GC
elif v[0] == "A" and v[2] == "G":
if s != "C":
new = v[1]+v[2]+s
dp[i+1][dic[new]] += dp[i][dic[v]]
# *GAC
elif v[1] == "G" and v[2] == "A":
if s != "C":
new = v[1]+v[2]+s
dp[i+1][dic[new]] += dp[i][dic[v]]
# *ACG
elif v[1] == "A" and v[2] == "C":
if s != "G":
new = v[1]+v[2]+s
dp[i+1][dic[new]] += dp[i][dic[v]]
# *AGC
elif v[1] == "A" and v[2] == "G":
if s != "C":
new = v[1]+v[2]+s
dp[i+1][dic[new]] += dp[i][dic[v]]
else:
new = v[1] + v[2] + s
dp[i+1][dic[new]] += dp[i][dic[v]]
continue
print((sum(dp[n-3])%MOD))
| 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 i==0 and j==2 and k==1: continue #ACG
if i==1 and j==0 and k==2: continue #GAC
dp[0][i][j][k] = 1
# 先頭から末尾に向けてループ
for i in range(N-3):
# 確定している文字列 (ppp,pp,p)
for ppp in range(4):
for pp in range(4):
for p in range(4):
# 次の文字 (n)
for n in range(4):
if pp==0 and p==1 and n==2: continue #AGC
if pp==0 and p==2 and n==1: continue #ACG
if pp==1 and p==0 and n==2: continue #GAC
if ppp==0 and p==1 and n==2: continue #A?GC
if ppp==0 and pp==1 and n==2: continue #AG?C
dp[i+1][pp][p][n] += dp[i][ppp][pp][p]
dp[i+1][pp][p][n] %= MOD
ans = 0
for i in range(4):
for j in range(4):
for k in range(4):
ans = (ans + dp[-1][i][j][k]) % MOD
print(ans) | 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
continue
if i == 0 and j == 2 and k == 1: # AGC
continue
if i == 2 and j == 0 and k == 1: # GAC
continue
dp[0][i][j][k] = 1
# 配るDP
for n in range(N - 3):
for i in range(4):
for j in range(4):
for k in range(4):
# c: 次の文字
for c in range(4):
if j == 0 and k == 1 and c == 2: # ?ACG
continue
if j == 0 and k == 2 and c == 1: # ?AGC
continue
if j == 2 and k == 0 and c == 1: # ?GAC
continue
if i == 0 and k == 2 and c == 1: # A?GC
continue
if i == 0 and j == 2 and c == 1: # AG?C
continue
dp[n+1][j][k][c] = (dp[n+1][j][k][c] + dp[n][i][j][k]) % MOD
ans = 0
for i in range(4):
for j in range(4):
for k in range(4):
ans = (ans + dp[-1][i][j][k]) % MOD
print(ans) | 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): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
N=INT()
# NGパターン一覧
patterns = [
# 任意の0か1文字
re.compile(r'^(.?)AGC(.?)$'),
re.compile(r'^(.?)GAC(.?)$'),
re.compile(r'^(.?)ACG(.?)$'),
# 任意の1文字
re.compile(r'^A.GC$'),
re.compile(r'^AG.C$'),
]
# dp[i][j] := 全部でi文字の時、最後の3文字がjとなる文字列の数
dp=[Counter() for i in range(N+1)]
keys = [''.join(key) for key in product('ACGT', repeat=3)]
# 3文字での初期値
for key in keys:
if key not in ['AGC', 'GAC', 'ACG']:
dp[3][key]=1
else:
dp[3][key]=0
for i in range(4, N+1):
for key in keys:
for nxt in 'ACGT':
# NGパターンのいずれにもマッチしないものだけ遷移させる
if not any([ptn.match(key+nxt) for ptn in patterns]):
dp[i][key[1:]+nxt]=(dp[i][key[1:]+nxt]+dp[i-1][key])%MOD
print(((sum(dp[N].values()))%MOD))
| # -*- 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): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
N=INT()
# NGパターン一覧
patterns = [
# 任意の0か1文字
re.compile(r'^(.?)AGC(.?)$'),
re.compile(r'^(.?)GAC(.?)$'),
re.compile(r'^(.?)ACG(.?)$'),
# 任意の1文字
re.compile(r'^A.GC$'),
re.compile(r'^AG.C$'),
]
# dp[i][j] := 全部でi文字の時、最後の3文字がjとなる文字列の数
dp=[Counter() for i in range(N+1)]
keys = [''.join(key) for key in product('ACGT', repeat=3)]
# 3文字での初期値
for key in keys:
if key not in ['AGC', 'GAC', 'ACG']:
dp[3][key]=1
keys = [''.join(key) for key in product('ACGT', repeat=4)]
for i in range(4, N+1):
for key in keys:
# NGパターンのいずれにもマッチしないものだけ遷移させる
if not any([ptn.match(key) for ptn in patterns]):
cur,nxt=key[:3],key[1:]
dp[i][nxt]=(dp[i][nxt]+dp[i-1][cur])%MOD
print(((sum(dp[N].values()))%MOD))
| 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] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
N=INT()
# dp[i][j] := 全部でi文字の時、最後の3文字がjとなる文字列の数
dp=[Counter() for i in range(N+1)]
keys = [''.join(key) for key in product('ACGT', repeat=3)]
# 3文字での初期値
for key in keys:
if key not in ['AGC', 'GAC', 'ACG']:
dp[3][key]=1
keys = [''.join(key) for key in product('ACGT', repeat=4)]
for i in range(4, N+1):
for key in keys:
for j in range(4):
tmp=list(key)
if j>=1:
# 隣同士をスワップさせる
tmp[j],tmp[j-1]=tmp[j-1],tmp[j]
if ''.join(tmp).count('AGC'):
break
else:
# 4パターンいずれもAGCを含まないものだけ遷移させる
cur,nxt=key[:3],key[1:]
dp[i][nxt]=(dp[i][nxt]+dp[i-1][cur])%MOD
print(((sum(dp[N].values()))%MOD))
| # -*- 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 range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7
N = INT()
# dp[i][j][k][l] := i文字目まで見て、3文字前がj、2文字前がk、1文字前がlである通り数
dp = list4d(N+1, 5, 5, 5, 0)
dp[0][0][0][0] = 1
# A: 1, C: 2, G: 3, T: 4
for i in range(N):
for j in range(5):
for k in range(5):
for l in range(5):
# A,C,G,Tへの遷移
for m in range(1, 5):
# AGC
if k == 1 and l == 3 and m == 2:
continue
# ACG
elif k == 1 and l == 2 and m == 3:
continue
# GAC
elif k == 3 and l == 1 and m == 2:
continue
# A?GC
elif j == 1 and l == 3 and m == 2:
continue
# AG?C
elif j == 1 and k == 3 and m == 2:
continue
dp[i+1][k][l][m] += dp[i][j][k][l]
dp[i+1][k][l][m] %= MOD
ans = 0
for j in range(5):
for k in range(5):
for l in range(5):
ans += dp[N][j][k][l]
ans %= MOD
print(ans)
| 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 last3 in memo[cur]:
return memo[cur][last3]
if cur == N:
return 1
ret = 0
for c in 'ACGT':
if ok(last3 + c):
ret = (ret + dfs(cur+1, last3[1:] + c)) % MOD
memo[cur][last3] = ret
return ret
print((dfs(0, 'TTT')))
| 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
def dfs(i, last3):
if i == N:
return 1
if last3 in memo[i]:
return memo[i][last3]
ret = 0
for s in 'ACGT':
if ok(last3+s):
ret = (ret + dfs(i+1, last3[1:]+s)) % MOD
memo[i][last3] = ret
return ret
answer = dfs(0, 'TTT')
print(answer)
| 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(last4)
s[i], s[i+1] = s[i+1], s[i]
if ''.join(s).find('AGC') != -1:
return False
return True
@lru_cache(None)
def dfs(i, last3):
if i == N:
return 1
ret = 0
for la in 'AGCT':
if ok(last3+la):
ret += dfs(i+1, last3[1:]+la)
return ret % MOD
answer = dfs(0, 'TTT')
print((answer % MOD))
| # 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(last4)
s[i], s[i+1] = s[i+1], s[i]
if ''.join(s).find('AGC') != -1:
return False
return True
def dfs(i, last3):
if i == N:
return 1
if last3 in memo[i]:
return memo[i][last3]
ret = 0
for la in 'AGCT':
if ok(last3+la):
ret += dfs(i+1, last3[1:]+la)
ret %= MOD
memo[i][last3] = ret
return ret
answer = dfs(0, 'TTT')
print((answer % MOD))
| p03088 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.