id
stringlengths 24
27
| content
stringlengths 37
384k
| max_stars_repo_path
stringlengths 51
51
|
|---|---|---|
condefects-python_data_101
|
Q=int(input())
A=[list(map(int,input().split())) for i in range(Q)]
B=[]
for i in range(Q):
if A[i][0] == 1:
B.append(A[i][0])
else:
print(B[-A[i][1]])
Q=int(input())
A=[list(map(int,input().split())) for i in range(Q)]
B=[]
for i in range(Q):
if A[i][0] == 1:
B.append(A[i][1])
else:
print(B[-A[i][1]])
|
ConDefects/ConDefects/Code/abc340_b/Python/54892821
|
condefects-python_data_102
|
Q = int(input())
A = []
for i in range(Q):
c, d = map(int, input().split())
if c == 1:
A.append(c)
else:
print(A[-d])
Q = int(input())
A = []
for i in range(Q):
c, d = map(int, input().split())
if c == 1:
A.append(d)
else:
print(A[-d])
|
ConDefects/ConDefects/Code/abc340_b/Python/54306887
|
condefects-python_data_103
|
N = int(input())
A = []
for i in range(N):
query, num = map(int,input().split())
if query == 1:
A.append(num)
elif query == 2:
print(A[-1])
N = int(input())
A = []
for i in range(N):
query, num = map(int,input().split())
if query == 1:
A.append(num)
elif query == 2:
print(A[-num])
|
ConDefects/ConDefects/Code/abc340_b/Python/54768693
|
condefects-python_data_104
|
Q = int(input())
A = []
for _ in range(Q):
t, k = map(int, input().split())
if t == 1:
A.append(t)
else:
print(A[-k])
Q = int(input())
A = []
for _ in range(Q):
t, k = map(int, input().split())
if t == 1:
A.append(k)
else:
print(A[-k])
|
ConDefects/ConDefects/Code/abc340_b/Python/54695651
|
condefects-python_data_105
|
from collections import deque
n,k=map(int,input().split())
a=[list(map(int,input().split())) for _ in range(n)]
q=int(input())
def root(s,t):
d=deque([(s,0)])
check=[0]*n
if s==t:
cnt=0
while d:
if cnt%100==0:
print(cnt)
cnt+=1
v,w=d.popleft()
for i in range(n):
if a[v][i]==1:
if i==t:
return(w+1)
if check[i]==0:
check[i]=1
d.append((i,w+1))
return -1
else:
while d:
v,w=d.popleft()
check[v]=1
for i in range(n):
if a[v][i]==1:
if i==t:
return(w+1)
if check[i]==0:
check[i]=1
d.append((i,w+1))
return -1
for i in range(q):
s,t=map(int,input().split())
s-=1
t-=1
s%=n
t%=n
print(root(s,t))
from collections import deque
n,k=map(int,input().split())
a=[list(map(int,input().split())) for _ in range(n)]
q=int(input())
def root(s,t):
d=deque([(s,0)])
check=[0]*n
if s==t:
cnt=0
while d:
cnt+=1
v,w=d.popleft()
for i in range(n):
if a[v][i]==1:
if i==t:
return(w+1)
if check[i]==0:
check[i]=1
d.append((i,w+1))
return -1
else:
while d:
v,w=d.popleft()
check[v]=1
for i in range(n):
if a[v][i]==1:
if i==t:
return(w+1)
if check[i]==0:
check[i]=1
d.append((i,w+1))
return -1
for i in range(q):
s,t=map(int,input().split())
s-=1
t-=1
s%=n
t%=n
print(root(s,t))
|
ConDefects/ConDefects/Code/arc159_a/Python/43796233
|
condefects-python_data_106
|
from collections import deque
n, k=map(int, input().split())
A =[[] for _ in range(n)]
for i in range(n):
a =list(map(int, input().split()))
for j in range(n):
if a[j] ==1:
A[i].append(j)
dist2 =[[-1] *n for _ in range(n)]
for i in range(n):
d =deque()
d.append(i)
v =d.pop()
for j in A[v]:
dist2[i][j] =1
d.append(j)
while d:
v =d.pop()
for j in A[v]:
if dist2[i][j] !=-1:
continue
dist2[i][j] =dist2[i][v] +1
d.append(j)
q =int(input())
for _ in range(q):
s, t=map(int, input().split())
s-=1
t-=1
print(dist2[s%n][t%n])
from collections import deque
n, k=map(int, input().split())
A =[[] for _ in range(n)]
for i in range(n):
a =list(map(int, input().split()))
for j in range(n):
if a[j] ==1:
A[i].append(j)
dist2 =[[-1] *n for _ in range(n)]
for i in range(n):
d =deque()
d.append(i)
v =d.pop()
for j in A[v]:
dist2[i][j] =1
d.append(j)
while d:
v =d.pop()
for j in A[v]:
if dist2[i][j] !=-1:
continue
dist2[i][j] =dist2[i][v] +1
d.appendleft(j)
q =int(input())
for _ in range(q):
s, t=map(int, input().split())
s-=1
t-=1
print(dist2[s%n][t%n])
|
ConDefects/ConDefects/Code/arc159_a/Python/41991860
|
condefects-python_data_107
|
from math import gcd
import sys
M = 10**18
def main():
input = sys.stdin.readline
N, K = map(int, input().split())
XY = [tuple(map(int, input().split())) for _ in range(N)]
if K == 1:
return 'Infinity'
S = set()
ans = 0
for i in range(N):
xi, yi = XY[i]
for j in range(i):
xj, yj = XY[j]
dx, dy = xi - xj, yi - yj
if dx < 0:
dx, dy = -dx, -dy
if dx == 0: dy = 1
if dy == 0: dx = 1
g = gcd(dx, dy)
dx, dy = dx // g, dy // g
b = M * yi - M * dy * xi // dx if dx != 0 else 0
if (dx, dy, b) in S: continue
S.add((dx, dy, b))
cnt = 2
for k in range(N):
if k == i or k == j: continue
xk, yk = XY[k]
if dx * (yk - yi) == dy * (xk - xi):
cnt += 1
if cnt >= K:
ans += 1
return ans
if __name__ == '__main__':
print(main())
from math import gcd
import sys
M = 10**18
def main():
input = sys.stdin.readline
N, K = map(int, input().split())
XY = [tuple(map(int, input().split())) for _ in range(N)]
if K == 1:
return 'Infinity'
S = set()
ans = 0
for i in range(N):
xi, yi = XY[i]
for j in range(i):
xj, yj = XY[j]
dx, dy = xi - xj, yi - yj
if dx < 0:
dx, dy = -dx, -dy
if dx == 0: dy = 1
if dy == 0: dx = 1
g = gcd(dx, dy)
dx, dy = dx // g, dy // g
b = M * yi - M * dy * xi // dx if dx != 0 else xi
if (dx, dy, b) in S: continue
S.add((dx, dy, b))
cnt = 2
for k in range(N):
if k == i or k == j: continue
xk, yk = XY[k]
if dx * (yk - yi) == dy * (xk - xi):
cnt += 1
if cnt >= K:
ans += 1
return ans
if __name__ == '__main__':
print(main())
|
ConDefects/ConDefects/Code/abc248_e/Python/45802660
|
condefects-python_data_108
|
N,K=map(int,input().split())
if K==1:
print("Infinity")
exit()
S=set()
def gcd(a,b):
if b==0:
return a
else:
return gcd(b,(a%b))
XY=[list(map(int,input().split())) for i in range(N)]
for i in range(N):
x0,y0=XY[i]
for j in range(i+1,N):
x1,y1=XY[j]
dx=x1-x0
dy=y1-y0
g=gcd(dx,dy)
dx//=g
dy//=g
if dx<0:
dx*=-1
dy*=-1
elif dx==0 and dy<0:
dy*=-1
z=dx*y0-dy*x0
cnt=0
for x,y in XY:
if dx*y+dy*x==z:
cnt+=1
if cnt>=K:
S.add((dx,dy,z))
print(len(S))
N,K=map(int,input().split())
if K==1:
print("Infinity")
exit()
S=set()
def gcd(a,b):
if b==0:
return a
else:
return gcd(b,(a%b))
XY=[list(map(int,input().split())) for i in range(N)]
for i in range(N):
x0,y0=XY[i]
for j in range(i+1,N):
x1,y1=XY[j]
dx=x1-x0
dy=y1-y0
g=gcd(dx,dy)
dx//=g
dy//=g
if dx<0:
dx*=-1
dy*=-1
elif dx==0 and dy<0:
dy*=-1
z=dx*y0-dy*x0
cnt=0
for x,y in XY:
if dx*y-dy*x==z:
cnt+=1
if cnt>=K:
S.add((dx,dy,z))
print(len(S))
|
ConDefects/ConDefects/Code/abc248_e/Python/45230444
|
condefects-python_data_109
|
N = int(input())
S=input()
ck=0
for i in range(N):
if S[i]!=S[-1-i]:
ck=1
if ck==0:
exit(print("Yes"))
if S[0]=="A" and S[-1]=="B":
exit(print("No"))
print("Yes")
N = int(input())
S=input()
ck=0
if S=="BA":
exit(print("No"))
for i in range(N):
if S[i]!=S[-1-i]:
ck=1
if ck==0:
exit(print("Yes"))
if S[0]=="A" and S[-1]=="B":
exit(print("No"))
print("Yes")
|
ConDefects/ConDefects/Code/arc145_a/Python/43402663
|
condefects-python_data_110
|
n = int(input())
s = list(input())
a = s[:n // 2]
b = list(reversed(s[(n + 1) // 2:]))
def main():
if a[0] != b[0]:
if a[0] == "A":
return False
return True
if main():
print("Yes")
else:
print("No")
n = int(input())
s = list(input())
a = s[:n // 2]
b = list(reversed(s[(n + 1) // 2:]))
def main():
if a[0] != b[0]:
if a[0] == "A":
return False
if n == 2:
return False
return True
if main():
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/arc145_a/Python/45268312
|
condefects-python_data_111
|
n=int(input())
s=input()
print('No' if s[0]=='A' and s[-1]=='B' else 'Yes')
n=int(input())
s=input()
print('No' if (s[0]=='A' and s[-1]=='B') or s=='BA' else 'Yes')
|
ConDefects/ConDefects/Code/arc145_a/Python/46163303
|
condefects-python_data_112
|
n=int(input())
s=list(input())
if "".join(s)=="AB":
print("No")
exit()
if s[0]=="B":
print("Yes")
exit()
if s[0]=="A" and s[-1]=="B":
print("No")
exit()
print("Yes")
n=int(input())
s=list(input())
if "".join(s)=="BA":
print("No")
exit()
if s[0]=="B":
print("Yes")
exit()
if s[0]=="A" and s[-1]=="B":
print("No")
exit()
print("Yes")
|
ConDefects/ConDefects/Code/arc145_a/Python/42736417
|
condefects-python_data_113
|
N = int(input())
S = input()
if S[0] == "B" and S[-1] == "A":
print("No")
elif S == "BA":
print("No")
else:
print("Yes")
N = int(input())
S = input()
if S[0] == "A" and S[-1] == "B":
print("No")
elif S == "BA":
print("No")
else:
print("Yes")
|
ConDefects/ConDefects/Code/arc145_a/Python/45555747
|
condefects-python_data_114
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
N = int(readline())
S = readline().rstrip()
if S[0] == 'A' and S[-1] == 'B':
print('No')
else:
print('Yes')
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
N = int(readline())
S = readline().rstrip()
if (S[0] == 'A' and S[-1] == 'B') or S == 'BA':
print('No')
else:
print('Yes')
|
ConDefects/ConDefects/Code/arc145_a/Python/42763842
|
condefects-python_data_115
|
n = int(input())
s = list(input())
if (s[0]=='A') and (s[-1]=='B'):
print('No')
else:
print('Yes')
n = int(input())
s = list(input())
if (s[0]=='A') and (s[-1]=='B'):
print('No')
elif (len(s)==2) and (s[0]!=s[-1]):
print('No')
else:
print('Yes')
|
ConDefects/ConDefects/Code/arc145_a/Python/45291396
|
condefects-python_data_116
|
# ARC145 A - AB Palindrome
# https://atcoder.jp/contests/arc145/tasks/arc145_a
def main():
N = int(input())
S = input()
ans = "Yes" if solve(N, S) is True else "No"
print(ans)
def solve(N: int, S: str) -> bool:
if S == "AA" or S == "BB":
return True
# 先頭文字が「A」、末尾文字が「B」のとき回文不可能
if S[0] == "A" and S[-1] == "B":
return False
# 先頭文字が「B」
if S[0] == "B":
return True
# 末尾文字が「A」
if S[-1] == "A":
return True
if __name__ == "__main__":
main()
# ARC145 A - AB Palindrome
# https://atcoder.jp/contests/arc145/tasks/arc145_a
def main():
N = int(input())
S = input()
ans = "Yes" if solve(N, S) is True else "No"
print(ans)
def solve(N: int, S: str) -> bool:
if S == "AA" or S == "BB":
return True
if S == "AB" or S == "BA":
return False
# 先頭文字が「A」、末尾文字が「B」のとき回文不可能
if S[0] == "A" and S[-1] == "B":
return False
# 先頭文字が「B」
if S[0] == "B":
return True
# 末尾文字が「A」
if S[-1] == "A":
return True
if __name__ == "__main__":
main()
|
ConDefects/ConDefects/Code/arc145_a/Python/43086658
|
condefects-python_data_117
|
inf = 10 ** 16
#頂点は1-index,下段は0-index
class LazySegTree:
#単位元と結合と作用をここで定義
Xunit = -inf
Aunit = 0
def Xf(self,x,y):
return max(x,y)
#Xf = max
def Af(self,a,b):
return a + b
#AのXへの作用
def operate(self,x,a):
return x + a
def __init__(self,N):
self.N = N
self.X = [self.Xunit] * (N + N)
self.A = [self.Aunit] * (N + N)
def build(self,seq):
for i,x in enumerate(seq,self.N):
self.X[i] = x
for i in range(self.N-1,0,-1):
self.X[i] = self.Xf(self.X[i<<1],self.X[i<<1 | 1])
def eval_at(self,i):
return self.operate(self.X[i],self.A[i])
def propagate_at(self,i):
self.X[i] = self.eval_at(i)
self.A[i<<1] = self.Af(self.A[i<<1],self.A[i])
self.A[i<<1 | 1] = self.Af(self.A[i<<1 | 1],self.A[i])
self.A[i] = self.Aunit
def propagate_above(self,i):
H = i.bit_length() - 1
for h in range(H,0,-1):
self.propagate_at(i >> h)
def recalc_above(self,i):
while i > 1:
i >>= 1
self.X[i] = self.Xf(self.eval_at(i << 1),self.eval_at(i << 1 | 1))
def update(self,i,x):
i += self.N
self.propagate_above(i)
self.X[i] = x
self.A[i] = self.Aunit
self.recalc_above(i)
def fold(self,L = 0,R = -1):
if R == -1:R = self.N
L += self.N
R += self.N
self.propagate_above(L // (L & -L))
self.propagate_above(R // (R & -R) -1)
vL = self.Xunit
vR = self.Xunit
while L < R:
if L & 1:
vL = self.Xf(vL,self.eval_at(L))
L += 1
if R & 1:
R -= 1
vR = self.Xf(self.eval_at(R),vR)
L >>= 1
R >>= 1
return self.Xf(vL,vR)
def operate_range(self,L,R,x):
#区間全体に作用させる
L += self.N
R += self.N
L0 = L // (L & -L)
R0 = R // (R & -R) - 1
self.propagate_above(L0)
self.propagate_above(R0)
while L < R:
if L & 1:
self.A[L] = self.Af(self.A[L],x)
L += 1
if R & 1:
R -= 1
self.A[R] = self.Af(self.A[R],x)
L >>= 1
R >>= 1
self.recalc_above(L0)
self.recalc_above(R0)
def write(self):
print(self.X)
def change(self,Xf,Xunit,Af,Aunit,operate):
self.Xf = Xf
self.Xunit = Xunit
self.Af = Af
self.Aunit = Aunit
self.operate = operate
N,B,Q = map(int,input().split())
a = list(map(int,input().split()))
l = [0] * N
l[0] = a[0] - B
for i in range(1,N):
l[i] = l[i-1] + a[i] - B
seg = LazySegTree(N)
seg.build(l)
for _ in range(Q):
c,x = map(int,input().split())
delta = x - a[c-1]
a[c-1] = x
seg.operate_range(c-1,N,delta)
tmp = seg.fold(0,N)
if tmp <= 0:
print(seg.fold(N - 1,N) / N + B)
continue
end = N
start = 0
while end - start > 1:
mid = end +start >> 1
if seg.fold(0,mid) >= 0:
end = mid
else:
start = mid
print(seg.fold(0,end) / end + B)
inf = 10 ** 16
#頂点は1-index,下段は0-index
class LazySegTree:
#単位元と結合と作用をここで定義
Xunit = -inf
Aunit = 0
def Xf(self,x,y):
return max(x,y)
#Xf = max
def Af(self,a,b):
return a + b
#AのXへの作用
def operate(self,x,a):
return x + a
def __init__(self,N):
self.N = N
self.X = [self.Xunit] * (N + N)
self.A = [self.Aunit] * (N + N)
def build(self,seq):
for i,x in enumerate(seq,self.N):
self.X[i] = x
for i in range(self.N-1,0,-1):
self.X[i] = self.Xf(self.X[i<<1],self.X[i<<1 | 1])
def eval_at(self,i):
return self.operate(self.X[i],self.A[i])
def propagate_at(self,i):
self.X[i] = self.eval_at(i)
self.A[i<<1] = self.Af(self.A[i<<1],self.A[i])
self.A[i<<1 | 1] = self.Af(self.A[i<<1 | 1],self.A[i])
self.A[i] = self.Aunit
def propagate_above(self,i):
H = i.bit_length() - 1
for h in range(H,0,-1):
self.propagate_at(i >> h)
def recalc_above(self,i):
while i > 1:
i >>= 1
self.X[i] = self.Xf(self.eval_at(i << 1),self.eval_at(i << 1 | 1))
def update(self,i,x):
i += self.N
self.propagate_above(i)
self.X[i] = x
self.A[i] = self.Aunit
self.recalc_above(i)
def fold(self,L = 0,R = -1):
if R == -1:R = self.N
L += self.N
R += self.N
self.propagate_above(L // (L & -L))
self.propagate_above(R // (R & -R) -1)
vL = self.Xunit
vR = self.Xunit
while L < R:
if L & 1:
vL = self.Xf(vL,self.eval_at(L))
L += 1
if R & 1:
R -= 1
vR = self.Xf(self.eval_at(R),vR)
L >>= 1
R >>= 1
return self.Xf(vL,vR)
def operate_range(self,L,R,x):
#区間全体に作用させる
L += self.N
R += self.N
L0 = L // (L & -L)
R0 = R // (R & -R) - 1
self.propagate_above(L0)
self.propagate_above(R0)
while L < R:
if L & 1:
self.A[L] = self.Af(self.A[L],x)
L += 1
if R & 1:
R -= 1
self.A[R] = self.Af(self.A[R],x)
L >>= 1
R >>= 1
self.recalc_above(L0)
self.recalc_above(R0)
def write(self):
print(self.X)
def change(self,Xf,Xunit,Af,Aunit,operate):
self.Xf = Xf
self.Xunit = Xunit
self.Af = Af
self.Aunit = Aunit
self.operate = operate
N,B,Q = map(int,input().split())
a = list(map(int,input().split()))
l = [0] * N
l[0] = a[0] - B
for i in range(1,N):
l[i] = l[i-1] + a[i] - B
seg = LazySegTree(N)
seg.build(l)
for _ in range(Q):
c,x = map(int,input().split())
delta = x - a[c-1]
a[c-1] = x
seg.operate_range(c-1,N,delta)
tmp = seg.fold(0,N)
if tmp < 0:
print(seg.fold(N - 1,N) / N + B)
continue
end = N
start = 0
while end - start > 1:
mid = end +start >> 1
if seg.fold(0,mid) >= 0:
end = mid
else:
start = mid
print(seg.fold(0,end) / end + B)
|
ConDefects/ConDefects/Code/abc292_h/Python/39455718
|
condefects-python_data_118
|
import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
inf = 10**18
class SegmentTree:
# 初期化処理
# f : SegmentTreeにのせるモノイド
# default : fに対する単位元
def __init__(self, size, f=lambda x,y : min(x,y), default=inf):
self.size = 2**(size-1).bit_length() # 簡単のため要素数Nを2冪にする
self.default = default
self.dat = [default]*(self.size*2) # 要素を単位元で初期化
self.f = f
def update(self, i, x):
i += self.size
self.dat[i] = x
while i > 0:
i >>= 1
self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])
def updatef(self, i, x):
i += self.size
self.dat[i] = self.f(self.dat[i],x)
while i > 0:
i >>= 1
self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])
def query(self, l, r):
l += self.size
r += self.size
lres, rres = self.default, self.default
while l < r:
if l & 1:
lres = self.f(lres, self.dat[l])
l += 1
if r & 1:
r -= 1
rres = self.f(self.dat[r], rres) # モノイドでは可換律は保証されていないので演算の方向に注意
l >>= 1
r >>= 1
res = self.f(lres, rres)
return res
def query2(self):
s = 1
#print(self.size)
while s<self.size:
#print(s)
if self.dat[s*2]>self.dat[s*2+1]:
s = s*2
else:
s = s*2+1
return s-self.size
def query3(self, x):
s = 1
if self.dat[1][1] < x:
return -1
#print(self.dat)
while s < self.size:
if self.dat[s*2][1] >= x:
s = s * 2
else:
x -= self.dat[s*2][0]
s = s * 2+1
return s - self.size
n,b,q = na()
a = [i - b for i in na()]
def f(a, b):
c = a[0]+b[0]
return c, max(a[0], a[0]+b[1])
e = (0, -inf)
st = SegmentTree(n, f, e)
for i in range(n):
st.update(i, (a[i], a[i]))
#-2, -5,3,3,2
#-2, 4, 3,3,2
for _ in range(q):
c, x = na()
c -= 1
st.update(c, (x-b, x-b))
y = st.query3(0)
"""print(y)
for i in range(n):
print(st.query(0, i+1))"""
if y == -1:
print(st.query(0, n)[0]/n+b)
else:
print(st.query(0, y+1)[0]/(y+1)+b)
import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
inf = 10**18
class SegmentTree:
# 初期化処理
# f : SegmentTreeにのせるモノイド
# default : fに対する単位元
def __init__(self, size, f=lambda x,y : min(x,y), default=inf):
self.size = 2**(size-1).bit_length() # 簡単のため要素数Nを2冪にする
self.default = default
self.dat = [default]*(self.size*2) # 要素を単位元で初期化
self.f = f
def update(self, i, x):
i += self.size
self.dat[i] = x
while i > 0:
i >>= 1
self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])
def updatef(self, i, x):
i += self.size
self.dat[i] = self.f(self.dat[i],x)
while i > 0:
i >>= 1
self.dat[i] = self.f(self.dat[i*2], self.dat[i*2+1])
def query(self, l, r):
l += self.size
r += self.size
lres, rres = self.default, self.default
while l < r:
if l & 1:
lres = self.f(lres, self.dat[l])
l += 1
if r & 1:
r -= 1
rres = self.f(self.dat[r], rres) # モノイドでは可換律は保証されていないので演算の方向に注意
l >>= 1
r >>= 1
res = self.f(lres, rres)
return res
def query2(self):
s = 1
#print(self.size)
while s<self.size:
#print(s)
if self.dat[s*2]>self.dat[s*2+1]:
s = s*2
else:
s = s*2+1
return s-self.size
def query3(self, x):
s = 1
if self.dat[1][1] < x:
return -1
#print(self.dat)
while s < self.size:
if self.dat[s*2][1] >= x:
s = s * 2
else:
x -= self.dat[s*2][0]
s = s * 2+1
return s - self.size
n,b,q = na()
a = [i - b for i in na()]
def f(a, b):
c = a[0]+b[0]
return c, max(a[1], a[0]+b[1])
e = (0, -inf)
st = SegmentTree(n, f, e)
for i in range(n):
st.update(i, (a[i], a[i]))
#-2, -5,3,3,2
#-2, 4, 3,3,2
for _ in range(q):
c, x = na()
c -= 1
st.update(c, (x-b, x-b))
y = st.query3(0)
"""print(y)
for i in range(n):
print(st.query(0, i+1))"""
if y == -1:
print(st.query(0, n)[0]/n+b)
else:
print(st.query(0, y+1)[0]/(y+1)+b)
|
ConDefects/ConDefects/Code/abc292_h/Python/40600464
|
condefects-python_data_119
|
#####segfunc#####
def Sum(x, y):
return x+y
#################
class SegTree:
#init(init_val, ide_ele): 配列init_valで初期化 O(N)
#update(k, x): k番目の値をxに更新 O(logN)
#query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
def __init__(self, init_val, segfunc, ide_ele):
#init_val: 配列の初期値
#segfunc: 区間にしたい操作
#ide_ele: 単位元
#n: 要素数
#num: n以上の最小の2のべき乗
#tree: セグメント木(1-index)
n = len(init_val)
self.segfunc = segfunc
self.ide_ele = ide_ele
self.num = 1 << (n - 1).bit_length()
self.tree = [ide_ele] * 2 * self.num
# 配列の値を葉にセット
for i in range(n):
self.tree[self.num + i] = init_val[i]
# 構築していく
for i in range(self.num - 1, 0, -1):
self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])
def update(self, k, x):
#k番目の値をxに更新
#k: index(0-index)
#x: update value
k += self.num
self.tree[k] = x
while k > 1:
self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
k >>= 1
def query(self, l, r):
#[l, r)のsegfuncしたものを得る
#l: index(0-index)
#r: index(0-index)
res = self.ide_ele
l += self.num
r += self.num
while l < r:
if l & 1:
res = self.segfunc(res,self.tree[l])
l += 1
if r & 1:
res = self.segfunc(res,self.tree[r - 1])
l >>= 1
r >>= 1
return res
def func(a,b):
if a[-1]>b[-1]:
a,b=b,a
return (a[0]+b[0],max(a[1],a[0]+b[1]),max(a[-1],b[-1]))
'''
セグ木に(0からiまでの合計、0からj(j<=i)までの方形の最大値)
を乗せる。
'''
N,B,Q=map(int,input().split())
A=list(map(int,input().split()))
st=SegTree([(A[i]-B,A[i]-B,i) for i in range(N)],func,(0,-10**15,-1))
for _ in range(Q):
C,X=map(int,input().split())
st.update(C-1,(X-B,X-B))
left,right=0,N
while right-left>1:
mid=(right+left)//2
q=st.query(0,mid)
if q[1]>=0:
right=mid
else:
left=mid
print(st.query(0,right)[0]/right+B)
#####segfunc#####
def Sum(x, y):
return x+y
#################
class SegTree:
#init(init_val, ide_ele): 配列init_valで初期化 O(N)
#update(k, x): k番目の値をxに更新 O(logN)
#query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
def __init__(self, init_val, segfunc, ide_ele):
#init_val: 配列の初期値
#segfunc: 区間にしたい操作
#ide_ele: 単位元
#n: 要素数
#num: n以上の最小の2のべき乗
#tree: セグメント木(1-index)
n = len(init_val)
self.segfunc = segfunc
self.ide_ele = ide_ele
self.num = 1 << (n - 1).bit_length()
self.tree = [ide_ele] * 2 * self.num
# 配列の値を葉にセット
for i in range(n):
self.tree[self.num + i] = init_val[i]
# 構築していく
for i in range(self.num - 1, 0, -1):
self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])
def update(self, k, x):
#k番目の値をxに更新
#k: index(0-index)
#x: update value
k += self.num
self.tree[k] = x
while k > 1:
self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
k >>= 1
def query(self, l, r):
#[l, r)のsegfuncしたものを得る
#l: index(0-index)
#r: index(0-index)
res = self.ide_ele
l += self.num
r += self.num
while l < r:
if l & 1:
res = self.segfunc(res,self.tree[l])
l += 1
if r & 1:
res = self.segfunc(res,self.tree[r - 1])
l >>= 1
r >>= 1
return res
def func(a,b):
if a[-1]>b[-1]:
a,b=b,a
return (a[0]+b[0],max(a[1],a[0]+b[1]),max(a[-1],b[-1]))
'''
セグ木に(0からiまでの合計、0からj(j<=i)までの方形の最大値)
を乗せる。
'''
N,B,Q=map(int,input().split())
A=list(map(int,input().split()))
st=SegTree([(A[i]-B,A[i]-B,i) for i in range(N)],func,(0,-10**15,-1))
for _ in range(Q):
C,X=map(int,input().split())
st.update(C-1,(X-B,X-B,C-1))
left,right=0,N
while right-left>1:
mid=(right+left)//2
q=st.query(0,mid)
if q[1]>=0:
right=mid
else:
left=mid
print(st.query(0,right)[0]/right+B)
|
ConDefects/ConDefects/Code/abc292_h/Python/52014767
|
condefects-python_data_120
|
B, G = map(int, input().split())
if B > G:
print("Bat")
else:
print("Grove")
B, G = map(int, input().split())
if B > G:
print("Bat")
else:
print("Glove")
|
ConDefects/ConDefects/Code/abc334_a/Python/54632654
|
condefects-python_data_121
|
n = int(input())
phrase = input().lower()
operation = int(input())
alphabet = "abcdefghijklmnopqrstuvwsyz"
for i in range(operation):
original, become = input().split()
alphabet = alphabet.replace(original, become)
new = ""
for ch in phrase:
new += alphabet[ord(ch)-97]
print(new)
n = int(input())
phrase = input().lower()
operation = int(input())
alphabet = "abcdefghijklmnopqrstuvwxyz"
for i in range(operation):
original, become = input().split()
alphabet = alphabet.replace(original, become)
new = ""
for ch in phrase:
new += alphabet[ord(ch)-97]
print(new)
|
ConDefects/ConDefects/Code/abc342_c/Python/54936668
|
condefects-python_data_122
|
from atcoder.lazysegtree import LazySegTree
from atcoder.segtree import SegTree
from math import log2,log,floor,ceil,gcd
from itertools import *
from collections import *
from copy import deepcopy
from heapq import *
import sys
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
def lcm(x,y):
return (x*y)//gcd(x,y)
# def op(ele1, ele2):
# return ele1 + ele2
# def mapping(func, ele):
# return func + ele
# def composition(func_upper, func_lower):
# return func_upper + func_lower
##############################################################################
N=int(input())
S=list(input())
Q=int(input())
D=defaultdict(set)
D2=defaultdict(list)
for i in range(N):
D[S[i]].add(S[i])
D2[S[i]].append(i)
for i in range(Q):
c,d=map(str,input().split())
D[d]|=D[c]
D[c]=set()
ans=S[:]
for i in D.keys():
li=list(D[i])
for j in li:
for k in D2[j]:
ans[k]=i
print("".join(ans))
from atcoder.lazysegtree import LazySegTree
from atcoder.segtree import SegTree
from math import log2,log,floor,ceil,gcd
from itertools import *
from collections import *
from copy import deepcopy
from heapq import *
import sys
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
def lcm(x,y):
return (x*y)//gcd(x,y)
# def op(ele1, ele2):
# return ele1 + ele2
# def mapping(func, ele):
# return func + ele
# def composition(func_upper, func_lower):
# return func_upper + func_lower
##############################################################################
N=int(input())
S=list(input())
Q=int(input())
D=defaultdict(set)
D2=defaultdict(list)
for i in range(N):
D[S[i]].add(S[i])
D2[S[i]].append(i)
for i in range(Q):
c,d=map(str,input().split())
if d==c:
continue
D[d]|=D[c]
D[c]=set()
ans=S[:]
for i in D.keys():
li=list(D[i])
for j in li:
for k in D2[j]:
ans[k]=i
print("".join(ans))
|
ConDefects/ConDefects/Code/abc342_c/Python/54516554
|
condefects-python_data_123
|
from collections import deque
def slidemin(X, k):
q = deque([])
ret = []
for i in range(len(X)):
while q and q[-1][1] >= X[i]:
q.pop()
deque.append(q, (i + k, X[i]))
if q[0][0] == i:
deque.popleft(q)
if i >= k-1:
ret.append(q[0][1])
return ret
N, A, B, C, D = map(int, input().split())
X = [int(a) for a in input().split()]
SX = [0] * (N + 1)
for i, x in enumerate(X):
SX[i+1] = SX[i] + X[i]
Y = [[0] * (N - i + 1) for i in range(N + 1)]
Y[1] = X[:]
for i in range(2, N + 1):
for j in range(N - i + 1):
s = SX[j+i] - SX[j]
Y[i][j] = max(-Y[i-1][j+1] + X[j], -Y[i-1][j] + X[j+i-1])
for cost, tries in ((A, B), (C, D)):
if i - tries <= 0:
for j in range(N - i + 1):
s = SX[j+i] - SX[j]
Y[i][j] = max(Y[i][j], s - cost)
continue
ii = i - tries
T = Y[ii][:]
for j in range(N - ii + 1):
T[j] += SX[j+ii] - SX[j]
TT = slidemin(T, tries)
for j in range(N - i + 1):
s = SX[j+i] - SX[j]
Y[i][j] = max(Y[i][j], -TT[j] + s - cost)
print(Y[-1][-1])
from collections import deque
def slidemin(X, k):
q = deque([])
ret = []
for i in range(len(X)):
while q and q[-1][1] >= X[i]:
q.pop()
deque.append(q, (i + k, X[i]))
if q[0][0] == i:
deque.popleft(q)
if i >= k-1:
ret.append(q[0][1])
return ret
N, A, B, C, D = map(int, input().split())
X = [int(a) for a in input().split()]
SX = [0] * (N + 1)
for i, x in enumerate(X):
SX[i+1] = SX[i] + X[i]
Y = [[0] * (N - i + 1) for i in range(N + 1)]
Y[1] = X[:]
for i in range(2, N + 1):
for j in range(N - i + 1):
s = SX[j+i] - SX[j]
Y[i][j] = max(-Y[i-1][j+1] + X[j], -Y[i-1][j] + X[j+i-1])
for cost, tries in ((A, B), (C, D)):
if i - tries <= 0:
for j in range(N - i + 1):
s = SX[j+i] - SX[j]
Y[i][j] = max(Y[i][j], s - cost)
continue
ii = i - tries
T = Y[ii][:]
for j in range(N - ii + 1):
T[j] += SX[j+ii] - SX[j]
TT = slidemin(T, tries + 1)
for j in range(N - i + 1):
s = SX[j+i] - SX[j]
Y[i][j] = max(Y[i][j], -TT[j] + s - cost)
print(Y[-1][-1])
|
ConDefects/ConDefects/Code/abc303_g/Python/41795359
|
condefects-python_data_124
|
#ABC303G Bags Game
'''
両端から1袋もらう。
A円賄賂してB個もらうか、C円賄賂してD個もらうか。
愚直な区間DPを書くと
DP[i][L][R]: 手番がiで、区間が[L,R)のとき、最適な操作をしたときのなにか
i=0: 高橋君(先手), X-Yを格納 i=1: 青木君(後手), Y-Xを格納
初期化はDP[i][x][x]=0
遷移はi=0なら max(DP[1][区間]+利得), i=1なら min(DP[0][区間]-利得)
ただ遷移がきついかな。L,Rの選び方でO(N^2)はいいけれど。
左右から取るクエリはO(1)だからこれはそのままでよくて、
区間クエリかな･･･ 累積和取っておけば楽できないかな？
大変そうだけど実装しよう。
しまった、これ連続した区間を根こそぎするわけじゃないのか。
いや、まだなんとかなる。取らない区間は連続しているから･･･
取らない区間の最小値を探す感じで遷移をすれば大丈夫だろう。
くっっそやばい実装になるんですが 本当にこれでいいんですか
前処理 O(N^2 * logN)、本処理O(N^2 * logN)だから正当！という話もあるんでしょうけれど
やっっっっっばいなこれ、方針はわかるけど実装が重すぎる
よく考えたら先手番･後手番でDPをふたつ持つ必要ないな？
DP[L][R]: 区間[L,R)からゲームを開始したときの、プレイヤーの最大利得
とすればDP減らせる。そうしろ。
SegTreeだとTLE スライド最小値を使います
'''
#Segment Tree: O(logN)
class SegmentTree: # Segment Tree
def __init__(self,n,identity_e,combine_f): # 適応条件: 単位元eがある、互換可能
self._n=n; self._size=1 # モノイド(単位元)の例:
while self._size<self._n:self._size<<=1 # 足し算 0, かけ算 1, 最小 INF,
self._identity_e=identity_e # 最大 -INF, LCM(最小公倍数) 1
self._combine_f=combine_f #
self._node=[self._identity_e]*2*self._size # combine_f には関数を指定する
# def文で関数を自作してもいいし、
def build(self,array): # from operator import xor
assert len(array)==self._n,'array too large' # のようにimportしてもよい
for i,v in enumerate(array,start=self._size): #
self._node[i]=v # build: セグ木を建てる
for i in range(self._size-1,0,-1): # 異常時はassert関数でエラーを報告
self._node[i]=self._combine_f(self._node[i<<1|0],self._node[i<<1|1])
#
def update(self,index,value): # update: 一点更新 O(logN)
i=self._size+index; self._node[i]=value # 地点i(0-indexed)を更新する
while i-1: # 同時に上位のセグメントも更新する
i>>=1 #
self._node[i]=self._combine_f(self._node[i<<1|0],self._node[i<<1|1])
#
def fold(self,L,R): # fold: 区間取得 O(logN)
L+=self._size; R+=self._size # 区間 [L,R) の特定値を取得する
vL,vR=[self._identity_e]*2 #
while L<R: # nodeの遷移の考え方
if L&1: # ---1--- L: 自身より右の最小
vL=self._combine_f(vL,self._node[L]) # -2- -3- R: 自身-1より左の最小
L+=1 # 4 5 6 7 Rは計算より先に-1の
if R&1: # 処理をする点に注意
R-=1 # R---1---L
vR=self._combine_f(self._node[R],vR) # R-2- LLL. 例: L=6, R=5
L>>=1; R>>=1 # .R.5 L 7 Rの移動が変則的
return self._combine_f(vL,vR) # ←R L→
#スライド最小値: A[i,i+d)の区間幅Kの最小値を与える 左端は超過する点に注意
from collections import deque
def slide_min(A,d):
N=len(A); L=[0]*N; Q=deque()
for i in range(N-1,-1,-1):
while len(Q) and Q[0]>=i+d: Q.popleft() #番長が卒業
while len(Q) and A[Q[-1]]>A[i]: Q.pop() #優秀な後輩
Q.append(i); L[i]=A[Q[0]]
return L
f=lambda:list(map(int,input().split()))
#入力受取 sX[i]: X[:i-1]の累積和、X[L:R]の和はsX[R]-sX[L]で計算可能
N,A,B,C,D=f(); X=f(); sX=[0]*(N+1)
for i in range(N): sX[i+1]=sX[i]+X[i]
#DP[L][R]: 手番がiのとき、区間[L,R)に対して最適行動をしたときのX-Y ないし Y-X
DP=[[-10**18]*(N+1) for _ in range(N+1)]
for L in range(N+1): DP[L][L]=0
#幅が小さい順にDPを更新
for d in range(1,N+1):
qB,qD=min(B,d),min(D,d); restB,restD=d-qB,d-qD
#nB,nD: DP[L][R](予想される被害額)にX[L,R]を足した値
nB,nD=[0]*(N-restB+1),[0]*(N-restD+1)
for i in range(N-restB+1): nB[i]=sX[i+restB]-sX[i]+DP[i][i+restB]
for i in range(N-restD+1): nD[i]=sX[i+restD]-sX[i]+DP[i][i+restD]
'''
#SegTree: O(NlogN)で毎回更新 だとTLE
STB=SegmentTree(N-restB+1,10**18,min); STB.build(nB)
STD=SegmentTree(N-restD+1,10**18,min); STD.build(nD)
'''
#スライド最小値: O(N)でnB,nDの区間最小値を決定
smB,smD=slide_min(nB,d),slide_min(nD,d)
#DP[Lt][Lt+d]を計算
for Lt in range(N-d+1):
Rt=Lt+d
#クエリ1. 左右から1個ずつ取る
DP[Lt][Rt]=max(DP[Lt][Rt], X[Lt]-DP[Lt+1][Rt], X[Rt-1]-DP[Lt][Rt-1])
#クエリ2. 左右からqB/qD個取り、連続するrestB/restD個を残す
DP[Lt][Rt]=max(DP[Lt][Rt], sX[Rt]-sX[Lt]-A-smB[Lt], sX[Rt]-sX[Lt]-C-smD[Lt])
print(DP[0][N])
#ABC303G Bags Game
'''
両端から1袋もらう。
A円賄賂してB個もらうか、C円賄賂してD個もらうか。
愚直な区間DPを書くと
DP[i][L][R]: 手番がiで、区間が[L,R)のとき、最適な操作をしたときのなにか
i=0: 高橋君(先手), X-Yを格納 i=1: 青木君(後手), Y-Xを格納
初期化はDP[i][x][x]=0
遷移はi=0なら max(DP[1][区間]+利得), i=1なら min(DP[0][区間]-利得)
ただ遷移がきついかな。L,Rの選び方でO(N^2)はいいけれど。
左右から取るクエリはO(1)だからこれはそのままでよくて、
区間クエリかな･･･ 累積和取っておけば楽できないかな？
大変そうだけど実装しよう。
しまった、これ連続した区間を根こそぎするわけじゃないのか。
いや、まだなんとかなる。取らない区間は連続しているから･･･
取らない区間の最小値を探す感じで遷移をすれば大丈夫だろう。
くっっそやばい実装になるんですが 本当にこれでいいんですか
前処理 O(N^2 * logN)、本処理O(N^2 * logN)だから正当！という話もあるんでしょうけれど
やっっっっっばいなこれ、方針はわかるけど実装が重すぎる
よく考えたら先手番･後手番でDPをふたつ持つ必要ないな？
DP[L][R]: 区間[L,R)からゲームを開始したときの、プレイヤーの最大利得
とすればDP減らせる。そうしろ。
SegTreeだとTLE スライド最小値を使います
'''
#Segment Tree: O(logN)
class SegmentTree: # Segment Tree
def __init__(self,n,identity_e,combine_f): # 適応条件: 単位元eがある、互換可能
self._n=n; self._size=1 # モノイド(単位元)の例:
while self._size<self._n:self._size<<=1 # 足し算 0, かけ算 1, 最小 INF,
self._identity_e=identity_e # 最大 -INF, LCM(最小公倍数) 1
self._combine_f=combine_f #
self._node=[self._identity_e]*2*self._size # combine_f には関数を指定する
# def文で関数を自作してもいいし、
def build(self,array): # from operator import xor
assert len(array)==self._n,'array too large' # のようにimportしてもよい
for i,v in enumerate(array,start=self._size): #
self._node[i]=v # build: セグ木を建てる
for i in range(self._size-1,0,-1): # 異常時はassert関数でエラーを報告
self._node[i]=self._combine_f(self._node[i<<1|0],self._node[i<<1|1])
#
def update(self,index,value): # update: 一点更新 O(logN)
i=self._size+index; self._node[i]=value # 地点i(0-indexed)を更新する
while i-1: # 同時に上位のセグメントも更新する
i>>=1 #
self._node[i]=self._combine_f(self._node[i<<1|0],self._node[i<<1|1])
#
def fold(self,L,R): # fold: 区間取得 O(logN)
L+=self._size; R+=self._size # 区間 [L,R) の特定値を取得する
vL,vR=[self._identity_e]*2 #
while L<R: # nodeの遷移の考え方
if L&1: # ---1--- L: 自身より右の最小
vL=self._combine_f(vL,self._node[L]) # -2- -3- R: 自身-1より左の最小
L+=1 # 4 5 6 7 Rは計算より先に-1の
if R&1: # 処理をする点に注意
R-=1 # R---1---L
vR=self._combine_f(self._node[R],vR) # R-2- LLL. 例: L=6, R=5
L>>=1; R>>=1 # .R.5 L 7 Rの移動が変則的
return self._combine_f(vL,vR) # ←R L→
#スライド最小値: A[i,i+d)の区間幅Kの最小値を与える 左端は超過する点に注意
from collections import deque
def slide_min(A,d):
N=len(A); L=[0]*N; Q=deque()
for i in range(N-1,-1,-1):
while len(Q) and Q[0]>=i+d: Q.popleft() #番長が卒業
while len(Q) and A[Q[-1]]>A[i]: Q.pop() #優秀な後輩
Q.append(i); L[i]=A[Q[0]]
return L
f=lambda:list(map(int,input().split()))
#入力受取 sX[i]: X[:i-1]の累積和、X[L:R]の和はsX[R]-sX[L]で計算可能
N,A,B,C,D=f(); X=f(); sX=[0]*(N+1)
for i in range(N): sX[i+1]=sX[i]+X[i]
#DP[L][R]: 手番がiのとき、区間[L,R)に対して最適行動をしたときのX-Y ないし Y-X
DP=[[-10**18]*(N+1) for _ in range(N+1)]
for L in range(N+1): DP[L][L]=0
#幅が小さい順にDPを更新
for d in range(1,N+1):
qB,qD=min(B,d),min(D,d); restB,restD=d-qB,d-qD
#nB,nD: DP[L][R](予想される被害額)にX[L,R]を足した値
nB,nD=[0]*(N-restB+1),[0]*(N-restD+1)
for i in range(N-restB+1): nB[i]=sX[i+restB]-sX[i]+DP[i][i+restB]
for i in range(N-restD+1): nD[i]=sX[i+restD]-sX[i]+DP[i][i+restD]
'''
#SegTree: O(NlogN)で毎回更新 だとTLE
STB=SegmentTree(N-restB+1,10**18,min); STB.build(nB)
STD=SegmentTree(N-restD+1,10**18,min); STD.build(nD)
'''
#スライド最小値: O(N)でnB,nDの区間最小値を決定
smB,smD=slide_min(nB,d-restB+1),slide_min(nD,d-restD+1)
#DP[Lt][Lt+d]を計算
for Lt in range(N-d+1):
Rt=Lt+d
#クエリ1. 左右から1個ずつ取る
DP[Lt][Rt]=max(DP[Lt][Rt], X[Lt]-DP[Lt+1][Rt], X[Rt-1]-DP[Lt][Rt-1])
#クエリ2. 左右からqB/qD個取り、連続するrestB/restD個を残す
DP[Lt][Rt]=max(DP[Lt][Rt], sX[Rt]-sX[Lt]-A-smB[Lt], sX[Rt]-sX[Lt]-C-smD[Lt])
print(DP[0][N])
|
ConDefects/ConDefects/Code/abc303_g/Python/41906923
|
condefects-python_data_125
|
N = int(input())
AC = sorted([[*list(map(int, input().split())), i+1] for i in range(N)], key=lambda x:x[1])
_max = AC[0][1]
not_discarded = [AC[0][2]]
for i in AC:
if _max < i[0]:
not_discarded.append(i[2])
_max = i[0]
print(len(not_discarded))
print(*sorted(not_discarded))
N = int(input())
AC = sorted([[*list(map(int, input().split())), i+1] for i in range(N)], key=lambda x:x[1])
_max = AC[0][0]
not_discarded = [AC[0][2]]
for i in AC:
if _max < i[0]:
not_discarded.append(i[2])
_max = i[0]
print(len(not_discarded))
print(*sorted(not_discarded))
|
ConDefects/ConDefects/Code/abc354_c/Python/54752444
|
condefects-python_data_126
|
def rerooting():
# dfs1 bottom-up
dp1=[E]*n
for v in order[::-1]:
dp1[v]=g(dp1[v],v)
p=par[v]
if p!=-1:
dp1[p]=merge(dp1[p],f(dp1[v],p,v))
# dfs2 top-down
dp2=[E]*n
ans=[E]*n
for v in order:
s=len(edge[v])
cumR=[E]*(s+1)
cumR[s]=E
for i in range(s,0,-1):
u=edge[v][i-1]
if u==par[v]:
cumR[i-1]=merge(cumR[i],f(dp2[v],v,u))
else:
cumR[i-1]=merge(cumR[i],f(dp1[u],v,u))
cumL=E
for i in range(s):
u=edge[v][i]
if u!=par[v]:
val=merge(cumL,cumR[i+1])
dp2[u]=g(val,v)
cumL=merge(cumL,f(dp1[u],v,u))
else:
cumL=merge(cumL,f(dp2[v],v,u))
ans[v]=calc_ans(cumL,v)
return ans
E=(0,0,0,0) # cnt,depth,cost1,cost2
def f(res,v,v_child):
cnt,depth,cost1,cost2=res
return (cnt,depth,cost1,-(1+cost2)+cost1)
def g(res,v):
cnt,depth,sum_cost1,diff=res
cnt+=1
depth+=1
cost1=min(sum_cost1+2,2*cnt-depth)
cost2=sum_cost1-diff
return (cnt,depth,cost1,cost2)
def merge(a,b):
return (a[0]+b[0],max(a[1],b[1]),a[2]+b[2],max(a[3],b[3]))
def calc_ans(res,v):
return res
from sys import stdin
input=lambda :stdin.readline()[:-1]
n=int(input())
edge=[[] for i in range(n)]
for i in range(n-1):
x,y=map(lambda x:int(x)-1,input().split())
edge[x].append(y)
edge[y].append(x)
# make order table
# root = 0
order=[]
par=[-1]*n
todo=[0]
while todo:
v=todo.pop()
order.append(v)
for u in edge[v]:
if u!=par[v]:
par[u]=v
todo.append(u)
ans=rerooting()
ANS=1<<30
for v in range(n):
ANS=min(ANS,ans[i][2]-ans[i][3])
print(ANS)
def rerooting():
# dfs1 bottom-up
dp1=[E]*n
for v in order[::-1]:
dp1[v]=g(dp1[v],v)
p=par[v]
if p!=-1:
dp1[p]=merge(dp1[p],f(dp1[v],p,v))
# dfs2 top-down
dp2=[E]*n
ans=[E]*n
for v in order:
s=len(edge[v])
cumR=[E]*(s+1)
cumR[s]=E
for i in range(s,0,-1):
u=edge[v][i-1]
if u==par[v]:
cumR[i-1]=merge(cumR[i],f(dp2[v],v,u))
else:
cumR[i-1]=merge(cumR[i],f(dp1[u],v,u))
cumL=E
for i in range(s):
u=edge[v][i]
if u!=par[v]:
val=merge(cumL,cumR[i+1])
dp2[u]=g(val,v)
cumL=merge(cumL,f(dp1[u],v,u))
else:
cumL=merge(cumL,f(dp2[v],v,u))
ans[v]=calc_ans(cumL,v)
return ans
E=(0,0,0,0) # cnt,depth,cost1,cost2
def f(res,v,v_child):
cnt,depth,cost1,cost2=res
return (cnt,depth,cost1,-(1+cost2)+cost1)
def g(res,v):
cnt,depth,sum_cost1,diff=res
cnt+=1
depth+=1
cost1=min(sum_cost1+2,2*cnt-depth)
cost2=sum_cost1-diff
return (cnt,depth,cost1,cost2)
def merge(a,b):
return (a[0]+b[0],max(a[1],b[1]),a[2]+b[2],max(a[3],b[3]))
def calc_ans(res,v):
return res
from sys import stdin
input=lambda :stdin.readline()[:-1]
n=int(input())
edge=[[] for i in range(n)]
for i in range(n-1):
x,y=map(lambda x:int(x)-1,input().split())
edge[x].append(y)
edge[y].append(x)
# make order table
# root = 0
order=[]
par=[-1]*n
todo=[0]
while todo:
v=todo.pop()
order.append(v)
for u in edge[v]:
if u!=par[v]:
par[u]=v
todo.append(u)
ans=rerooting()
ANS=1<<30
for v in range(n):
ANS=min(ANS,ans[v][2]-ans[v][3])
print(ANS)
|
ConDefects/ConDefects/Code/arc179_d/Python/54184092
|
condefects-python_data_127
|
import sys
def input():
return sys.stdin.readline().rstrip()
from collections import deque
def main():
N, M = map(int, input().split())
link1 = [[] for _ in range(N)]
link2 = [[] for _ in range(N)]
inf = float('inf')
dist1 = [inf]*N
dist1[0] = 0
dist2 = [inf]*N
dist2[-1] = 0
for i in range(N):
S = [int(s) for s in input()]
for j in range(M):
if not S[j]:
continue
link1[i].append(i+j+1)
link2[i+j+1].append(i)
D = deque([0])
while D:
d = D.popleft()
for l in link1[d]:
if dist1[l] == inf:
dist1[l] = dist1[d]+1
D.append(l)
D = deque([N-1])
while D:
d = D.popleft()
for l in link2[d]:
if dist2[l] == inf:
dist2[l] = dist2[d]+1
D.append(l)
for i in range(1, N-1):
ans = inf
for j in range(max(0, i-M+1), i):
for l in link1[j]:
if l == i:
continue
ans = min(ans, 1+dist1[j]+dist2[l])
if ans == inf:
print(-1)
else:
print(ans)
if __name__ == "__main__":
main()
import sys
def input():
return sys.stdin.readline().rstrip()
from collections import deque
def main():
N, M = map(int, input().split())
link1 = [[] for _ in range(N)]
link2 = [[] for _ in range(N)]
inf = float('inf')
dist1 = [inf]*N
dist1[0] = 0
dist2 = [inf]*N
dist2[-1] = 0
for i in range(N):
S = [int(s) for s in input()]
for j in range(M):
if not S[j]:
continue
link1[i].append(i+j+1)
link2[i+j+1].append(i)
D = deque([0])
while D:
d = D.popleft()
for l in link1[d]:
if dist1[l] == inf:
dist1[l] = dist1[d]+1
D.append(l)
D = deque([N-1])
while D:
d = D.popleft()
for l in link2[d]:
if dist2[l] == inf:
dist2[l] = dist2[d]+1
D.append(l)
for i in range(1, N-1):
ans = inf
for j in range(max(0, i-M+1), i):
for l in link1[j]:
if l <= i:
continue
ans = min(ans, 1+dist1[j]+dist2[l])
if ans == inf:
print(-1)
else:
print(ans)
if __name__ == "__main__":
main()
|
ConDefects/ConDefects/Code/abc291_f/Python/45788276
|
condefects-python_data_128
|
from collections import defaultdict, deque
import sys, math, bisect, heapq, copy
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
from itertools import permutations
sys.setrecursionlimit(10**6)
def INT(): # 整数1つ
return int(input())
def LINT(): # 整数複数個
return map(int, input().split())
def HINT(N=0): #整数N個(スペース区切り)(各値にプラスする値N)
return [int(i)+N for i in input().split()]
Yes = lambda: print("Yes")
No = lambda: print("No")
INF = 10 ** 18
# = [None for _ in range()]
# = [[None for _ in range()] for _ in range()]
# = [input() for _ in range()] ##文字列行列用
# = list(map(str, input().split())) #複数文字列用
# for i,v in enumerate(path)] ##iでインデックス、vで配列の要素を返す
# print(*li,sep="")
"""for _ in range(m):
u,v=LINT()
u-=1
v-=1
path[u].add(v)
path[v].add(u)"""
n,m=LINT()
dp=[INF for _ in range(n)]
dp[0]=0
path=[set() for _ in range(n)]
rpath=[set() for _ in range(n)]
rdp=[INF for _ in range(n)]
rdp[-1]=0
for i in range(n):
s=list(input())
for j in range(m):
if s[j]=="1":
path[i].add(i+j+1)
rpath[i+j+1].add(i)
dp[i+j+1]=min(dp[i]+1,dp[i+j+1])
for i in reversed(range(n)):
for j in rpath[i]:
rdp[j]=min(rdp[i]+1,rdp[j])
ans=[]
for k in range(1,n-1):
a=INF
for i in range(max(0,k-m),k):
for j in path[i]:
if j==k:
continue
a=min(a,dp[i]+rdp[j]+1)
if a!=INF:
ans.append(a)
else:
ans.append(-1)
print(*ans)
from collections import defaultdict, deque
import sys, math, bisect, heapq, copy
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
from itertools import permutations
sys.setrecursionlimit(10**6)
def INT(): # 整数1つ
return int(input())
def LINT(): # 整数複数個
return map(int, input().split())
def HINT(N=0): #整数N個(スペース区切り)(各値にプラスする値N)
return [int(i)+N for i in input().split()]
Yes = lambda: print("Yes")
No = lambda: print("No")
INF = 10 ** 18
# = [None for _ in range()]
# = [[None for _ in range()] for _ in range()]
# = [input() for _ in range()] ##文字列行列用
# = list(map(str, input().split())) #複数文字列用
# for i,v in enumerate(path)] ##iでインデックス、vで配列の要素を返す
# print(*li,sep="")
"""for _ in range(m):
u,v=LINT()
u-=1
v-=1
path[u].add(v)
path[v].add(u)"""
n,m=LINT()
dp=[INF for _ in range(n)]
dp[0]=0
path=[set() for _ in range(n)]
rpath=[set() for _ in range(n)]
rdp=[INF for _ in range(n)]
rdp[-1]=0
for i in range(n):
s=list(input())
for j in range(m):
if s[j]=="1":
path[i].add(i+j+1)
rpath[i+j+1].add(i)
dp[i+j+1]=min(dp[i]+1,dp[i+j+1])
for i in reversed(range(n)):
for j in rpath[i]:
rdp[j]=min(rdp[i]+1,rdp[j])
ans=[]
for k in range(1,n-1):
a=INF
for i in range(max(0,k-m),k):
for j in path[i]:
if j<=k:
continue
a=min(a,dp[i]+rdp[j]+1)
if a!=INF:
ans.append(a)
else:
ans.append(-1)
print(*ans)
|
ConDefects/ConDefects/Code/abc291_f/Python/45488021
|
condefects-python_data_129
|
from collections import deque
from collections import defaultdict
from bisect import bisect_left
import sys
sys.setrecursionlimit(1000000)
from heapq import heappop, heappush
N,M=map(int, input().split())
Pos=[]
for _ in range(N):
s=input()
Pos.append(s)
dis1=[1<<60]*N
dis1[0]=0
que=deque()
que.append(0)
while(que):
v=que.popleft()
for i in range(M):
if Pos[v][i]=="1":
if dis1[v]+1 < dis1[v+i+1]:
que.append(v+i+1)
dis1[v+i+1]=dis1[v]+1
dis2=[1<<60]*N
dis2[-1]=0
for i in range(N-2, -1, -1):
for j in range(M):
if Pos[i][j]=="1":
if dis2[i+j+1]+1 < dis2[i]:
dis2[i]=dis2[i+j+1]+1
Ans=[]
for k in range(1, N-1):
ans=1<<60
for i in range(max(0, k-M+1),k):
for j in range(M):
if Pos[i][j]=="1" and i+j+1 != k:
ans=min(ans, dis1[i]+1+dis2[i+j+1])
if ans==1<<60: ans=-1
Ans.append(ans)
print(*Ans)
from collections import deque
from collections import defaultdict
from bisect import bisect_left
import sys
sys.setrecursionlimit(1000000)
from heapq import heappop, heappush
N,M=map(int, input().split())
Pos=[]
for _ in range(N):
s=input()
Pos.append(s)
dis1=[1<<60]*N
dis1[0]=0
que=deque()
que.append(0)
while(que):
v=que.popleft()
for i in range(M):
if Pos[v][i]=="1":
if dis1[v]+1 < dis1[v+i+1]:
que.append(v+i+1)
dis1[v+i+1]=dis1[v]+1
dis2=[1<<60]*N
dis2[-1]=0
for i in range(N-2, -1, -1):
for j in range(M):
if Pos[i][j]=="1":
if dis2[i+j+1]+1 < dis2[i]:
dis2[i]=dis2[i+j+1]+1
Ans=[]
for k in range(1, N-1):
ans=1<<60
for i in range(max(0, k-M+1),k):
for j in range(M):
if Pos[i][j]=="1" and i+j+1 > k:
ans=min(ans, dis1[i]+1+dis2[i+j+1])
if ans==1<<60: ans=-1
Ans.append(ans)
print(*Ans)
|
ConDefects/ConDefects/Code/abc291_f/Python/46006070
|
condefects-python_data_130
|
import sys
input=lambda:sys.stdin.readline().rstrip()
N=int(input())
A=list(map(int,input().split()))
print(sum([abs(A[i-1]-A[i]) for i in range(N)])//2)
import sys
input=lambda:sys.stdin.readline().rstrip()
N=int(input())
A=list(map(int,input().split()))
print(max(sum([abs(A[i-1]-A[i]) for i in range(N)])//2,*A))
|
ConDefects/ConDefects/Code/arc136_c/Python/29821665
|
condefects-python_data_131
|
N = int(input())
A = list(map(int, input().split()))
B = []
before = A[-1]
for a in A:
B.append(a - before)
before = a
ans = sum([b for b in B if b > 0])
print(max(ans, min(A)))
N = int(input())
A = list(map(int, input().split()))
B = []
before = A[-1]
for a in A:
B.append(a - before)
before = a
ans = sum([b for b in B if b > 0])
print(max(ans, max(A)))
|
ConDefects/ConDefects/Code/arc136_c/Python/29773426
|
condefects-python_data_132
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = [(i, 0) for i in a] + [(i, 1) for i in b]
c.sort()
ans = "No"
for i in range(n + m - 1):
if c[i][1] == c[i + 1][1]:
ans = "Yes"
print(ans)
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = [(i, 0) for i in a] + [(i, 1) for i in b]
c.sort()
ans = "No"
for i in range(n + m - 1):
if c[i][1] == c[i + 1][1] == 0:
ans = "Yes"
print(ans)
|
ConDefects/ConDefects/Code/abc355_b/Python/55005403
|
condefects-python_data_133
|
N, M = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = "No"
C = sorted(A + B)
for i in range(len(C)-1):
if (C[i] in A and C[i+1] in A) or (C[i] in B and C[i+1] in B):
ans = "Yes"
print(ans)
N, M = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = "No"
C = sorted(A + B)
for i in range(len(C)-1):
if C[i] in A and C[i+1] in A:
ans = "Yes"
print(ans)
|
ConDefects/ConDefects/Code/abc355_b/Python/55114037
|
condefects-python_data_134
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = []
for aa in a:
c.append((aa, 1))
for bb in b:
c.append((bb, 2))
c.sort()
for i in range(n + m - 1):
if c[i][1] == c[i+1][1]:
print("Yes")
exit()
print("No")
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = []
for aa in a:
c.append((aa, 1))
for bb in b:
c.append((bb, 2))
c.sort()
for i in range(n + m - 1):
if c[i][1] == 1 and c[i+1][1] == 1:
print("Yes")
exit()
print("No")
|
ConDefects/ConDefects/Code/abc355_b/Python/55109474
|
condefects-python_data_135
|
N, M = map(int, input().split())
A = set(map(int, input().split()))
B = set(map(int, input().split()))
C = sorted(list(A | B))
for i in range(N - 1):
if C[i] in A and C[i + 1] in A:
print('Yes')
exit()
print('No')
N, M = map(int, input().split())
A = set(map(int, input().split()))
B = set(map(int, input().split()))
C = sorted(list(A | B))
for i in range(N + M - 1):
if C[i] in A and C[i + 1] in A:
print('Yes')
exit()
print('No')
|
ConDefects/ConDefects/Code/abc355_b/Python/55062153
|
condefects-python_data_136
|
N, L = map(int, input().split())
la = map(int, input().split())
from math import inf
dp = [inf] * (200005)
dp[0] = 0
for i in range(1, L-1):
w = i * (L-i)
for j in range(w, 200005):
dp[j] = min(dp[j], dp[j-w]+1)
for i in la:
if dp[i]==inf: print(-1)
else: print(dp[i])
N, L = map(int, input().split())
la = map(int, input().split())
from math import inf
dp = [inf] * (200005)
dp[0] = 0
for i in range(1, L):
w = i * (L-i)
for j in range(w, 200005):
dp[j] = min(dp[j], dp[j-w]+1)
for i in la:
if dp[i]==inf: print(-1)
else: print(dp[i])
|
ConDefects/ConDefects/Code/arc178_c/Python/53727508
|
condefects-python_data_137
|
N,X=map(int,input().split())
DP=[0]*(X+1) #DP[n]=現在n円払えるか
DP[0]=1
for i in range(N):
a,b=map(int,input().split())
for n in range(X+1):
for c in range(1,b+1):
if 0<=n-c*a and DP[n-c*a]:
DP[n]=1
print("Yes" if DP[X] else "No")
N,X=map(int,input().split())
DP=[0]*(X+1) #DP[n]=現在n円払えるか
DP[0]=1
for i in range(N):
a,b=map(int,input().split())
for n in reversed(range(X+1)):
for c in range(1,b+1):
if 0<=n-c*a and DP[n-c*a]:
DP[n]=1
print("Yes" if DP[X] else "No")
|
ConDefects/ConDefects/Code/abc286_d/Python/45059364
|
condefects-python_data_138
|
import sys
import math
from collections import defaultdict
from collections import Counter
from functools import lru_cache
sys.setrecursionlimit(10 ** 8)
MOD1 = 10**9 + 7
def main():
n, x = map(int, sys.stdin.readline().split())
a, b = [], []
for _ in range(n):
ai, bi = map(int, sys.stdin.readline().split())
a.append(ai)
b.append(bi)
# @lru_cache(maxsize=None)
# def rec(index, s):
# if s == x:
# return True
#
# if index == n:
# return False
#
# for i in range(b[index] + 1):
# if rec(index + 1, s + i * a[index]):
# return True
# return False
#
# if rec(0, 0):
# print("Yes")
# else:
# print("No")
dp = [[False for _ in range(x + 1)] for _ in range(n + 1)]
dp[0][0] = True
for i in range(n):
for j in range(x + 1):
for k in range(b[i] + 1):
if j >= k * a[i]:
dp[i + 1][j] = dp[i][j] or dp[i][j - k * a[i]]
if dp[n][x]:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
import sys
import math
from collections import defaultdict
from collections import Counter
from functools import lru_cache
sys.setrecursionlimit(10 ** 8)
MOD1 = 10**9 + 7
def main():
n, x = map(int, sys.stdin.readline().split())
a, b = [], []
for _ in range(n):
ai, bi = map(int, sys.stdin.readline().split())
a.append(ai)
b.append(bi)
# @lru_cache(maxsize=None)
# def rec(index, s):
# if s == x:
# return True
#
# if index == n:
# return False
#
# for i in range(b[index] + 1):
# if rec(index + 1, s + i * a[index]):
# return True
# return False
#
# if rec(0, 0):
# print("Yes")
# else:
# print("No")
dp = [[False for _ in range(x + 1)] for _ in range(n + 1)]
dp[0][0] = True
for i in range(n):
for j in range(x + 1):
for k in range(b[i] + 1):
if j >= k * a[i]:
dp[i + 1][j] = dp[i + 1][j] or dp[i][j - k * a[i]]
if dp[n][x]:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
|
ConDefects/ConDefects/Code/abc286_d/Python/45471607
|
condefects-python_data_139
|
n, x = map(int, input().split())
a = [0 for _ in range(n)]
b = [0 for _ in range(n)]
for i in range(n):
a[i], b[i] = map(int, input().split())
dp = [[False for _ in range(x + 1)] for _ in range(n + 1)]
for i in range(n + 1):
dp[i][0] = True
for i in range(n):
for j in range(x):
for k in range(b[i] + 1):
if dp[i][j]:
if j + (k * a[i]) <= x:
dp[i + 1][j + (k * a[i])] = True
if dp[-1][-1]:
print("Yes")
else:
print("No")
n, x = map(int, input().split())
a = [0 for _ in range(n)]
b = [0 for _ in range(n)]
for i in range(n):
a[i], b[i] = map(int, input().split())
dp = [[False for _ in range(x + 1)] for _ in range(n + 1)]
for i in range(n + 1):
dp[i][0] = True
for i in range(n):
for j in range(x + 1):
for k in range(b[i] + 1):
if dp[i][j]:
if j + (k * a[i]) <= x:
dp[i + 1][j + (k * a[i])] = True
if dp[-1][-1]:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc286_d/Python/45787313
|
condefects-python_data_140
|
import sys
input = lambda: sys.stdin.readline().rstrip()
# sys.setrecursionlimit(10**7)
# sys.set_int_max_str_digits(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
def mp():return map(int,input().split())
def lmp():return list(map(int,input().split()))
def lm1(LIST): return list(map(lambda x:x-1, LIST))
def mps(A):return [tuple(map(int, input().split())) for _ in range(A)]
def stoi(LIST):return list(map(int,LIST))
def itos(LIST):return list(map(str,LIST))
def atoi(LIST): return [ord(i)-ord("a") for i in LIST]
def Atoi(LIST): return [ord(i)-ord("A") for i in LIST]
def LT(LIST,N): return LIST[bisect.bisect_left(LIST,N)-1]
def LE(LIST,N): return LIST[bisect.bisect_right(LIST,N)-1]
def GT(LIST,N): return LIST[bisect.bisect_right(LIST,N)]
def GE(LIST,N): return LIST[bisect.bisect_left(LIST,N)]
def bitA(X,A):return X & 1<<A == 1<<A
def gtoi(x,y,h,w):return x*w+y
import math
import bisect
import heapq
import time
import random as rd
import itertools
from copy import copy as cc
from copy import deepcopy as dc
from itertools import accumulate, product
from collections import Counter, defaultdict, deque
def ceil(U,V):return (U+V-1)//V
def modf1(N,MOD):return (N-1)%MOD+1
def printmat(list):
for i in list:print(*i)
m4 = [[1,0],[0,1],[-1,0],[0,-1]]
m8 = [[-1,-1],[-1,0],[-1,1],[0,-1],[0,1],[1,-1],[1,0],[1,1]]
inf = (1<<63)-1
mod = 998244353
n,k,l = mp()
ans = 0
for i in range(1,n+1):
if i <= n-k:
ans *= max(0,l+1-i)
else:
ans *= max(0,l-(n-k))
ans %= mod
print(ans)
import sys
input = lambda: sys.stdin.readline().rstrip()
# sys.setrecursionlimit(10**7)
# sys.set_int_max_str_digits(10**6)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
def mp():return map(int,input().split())
def lmp():return list(map(int,input().split()))
def lm1(LIST): return list(map(lambda x:x-1, LIST))
def mps(A):return [tuple(map(int, input().split())) for _ in range(A)]
def stoi(LIST):return list(map(int,LIST))
def itos(LIST):return list(map(str,LIST))
def atoi(LIST): return [ord(i)-ord("a") for i in LIST]
def Atoi(LIST): return [ord(i)-ord("A") for i in LIST]
def LT(LIST,N): return LIST[bisect.bisect_left(LIST,N)-1]
def LE(LIST,N): return LIST[bisect.bisect_right(LIST,N)-1]
def GT(LIST,N): return LIST[bisect.bisect_right(LIST,N)]
def GE(LIST,N): return LIST[bisect.bisect_left(LIST,N)]
def bitA(X,A):return X & 1<<A == 1<<A
def gtoi(x,y,h,w):return x*w+y
import math
import bisect
import heapq
import time
import random as rd
import itertools
from copy import copy as cc
from copy import deepcopy as dc
from itertools import accumulate, product
from collections import Counter, defaultdict, deque
def ceil(U,V):return (U+V-1)//V
def modf1(N,MOD):return (N-1)%MOD+1
def printmat(list):
for i in list:print(*i)
m4 = [[1,0],[0,1],[-1,0],[0,-1]]
m8 = [[-1,-1],[-1,0],[-1,1],[0,-1],[0,1],[1,-1],[1,0],[1,1]]
inf = (1<<63)-1
mod = 998244353
n,k,l = mp()
ans = 1
for i in range(1,n+1):
if i <= n-k:
ans *= max(0,l+1-i)
else:
ans *= max(0,l-(n-k))
ans %= mod
print(ans)
|
ConDefects/ConDefects/Code/arc172_b/Python/50474956
|
condefects-python_data_141
|
DIV = 998244353
if True:
n, k, l = map(int, input().split())
print(n, k, l)
ans = 1
for i in range(n):
m = n-k
print(m)
diff = min(m, i)
ans *= l-diff
ans %= DIV
print(ans)
DIV = 998244353
if True:
n, k, l = map(int, input().split())
ans = 1
for i in range(n):
m = n-k
diff = min(m, i)
ans *= l-diff
ans %= DIV
print(ans)
|
ConDefects/ConDefects/Code/arc172_b/Python/51109428
|
condefects-python_data_142
|
from collections import deque
N,M = map(int,input().split())
edge = []
for _ in range(M):
a,b,w = map(int,input().split())
a-=1
b-=1
edge.append((a,b,w))
def const_color(G):
c = [-1] * N
q = deque()
for st in range(N):
if c[st] == -1:
q.append(st)
c[st] = 0
while q:
now = q.popleft()
for nx in G[now]:
if c[nx] == -1:
c[nx] = c[now] ^ 1
q.append(nx)
return c
def is_binary(G,edge):
c = const_color(G)
for a,b in edge:
if c[a] != c[b]:
pass
else:
return False
return True
def const_G(x):
G = [[] for _ in range(N)]
new_edge = []
for a,b,w in edge:
if w < x:
G[a].append(b)
G[b].append(a)
new_edge.append((a,b))
return G,new_edge
def is_ok(x):
G,new_edge = const_G(x)
return is_binary(G,new_edge)
INF = float('inf')
G0,edge0 = const_G(INF)
e0 = [[] for _ in range(N)]
ans = INF
for a,b,w in edge:
e0[a].append(w)
e0[b].append(w)
for i in range(N):
e0[i].sort()
if len(e0[i]) >= 2:
path_length = e0[i][0] + e0[i][1]
ans = min(ans,path_length)
if is_binary(G0,edge0):
print(ans)
else:
ok = 0
ng = 10 ** 9 + 1
while (ng-ok) > 1:
x = (ng + ok) // 2
if is_ok(x):
ok = x
else:
ng = x
ans = min(ok,ans)
print(ans)
from collections import deque
N,M = map(int,input().split())
edge = []
for _ in range(M):
a,b,w = map(int,input().split())
a-=1
b-=1
edge.append((a,b,w))
def const_color(G):
c = [-1] * N
q = deque()
for st in range(N):
if c[st] == -1:
q.append(st)
c[st] = 0
while q:
now = q.popleft()
for nx in G[now]:
if c[nx] == -1:
c[nx] = c[now] ^ 1
q.append(nx)
return c
def is_binary(G,edge):
c = const_color(G)
for a,b in edge:
if c[a] != c[b]:
pass
else:
return False
return True
def const_G(x):
G = [[] for _ in range(N)]
new_edge = []
for a,b,w in edge:
if w < x:
G[a].append(b)
G[b].append(a)
new_edge.append((a,b))
return G,new_edge
def is_ok(x):
G,new_edge = const_G(x)
return is_binary(G,new_edge)
INF = float('inf')
G0,edge0 = const_G(INF)
e0 = [[] for _ in range(N)]
ans = INF
for a,b,w in edge:
e0[a].append(w)
e0[b].append(w)
for i in range(N):
e0[i].sort()
if len(e0[i]) >= 2:
path_length = e0[i][0] + e0[i][1]
ans = min(ans,path_length)
if is_binary(G0,edge0):
print(ans)
else:
ok = 0
ng = 10 ** 9 + 1
while (ng-ok) > 1:
x = (ng + ok) // 2
if is_ok(x):
ok = x
else:
ng = x
ans = min(ok,ans)
print(ans)
|
ConDefects/ConDefects/Code/arc165_c/Python/45716699
|
condefects-python_data_143
|
import sys
n,m = map(int, sys.stdin.readline().split())
mp = map(int, sys.stdin.read().split())
abc = list(zip(mp,mp, mp))
graph = [[] for i in range(n+1)]
for a,b,c in abc:
graph[a].append((b,c))
graph[b].append((a,c))
ok = float("inf")
# ng = 0
minng = 1000000007
for i in range(1, n+1):
graph[i].sort(key=lambda x: x[1])
if ok > graph[i][0][1]:
ok = graph[i][0][1]
if len(graph[i]) >= 2:
temp = graph[i][0][1] + graph[i][1][1]
if minng > temp:
minng = temp
ng = minng + 1
def bipw(graph, w):
# 二部グラフであるかどうか判定する
# 二部グラフであるならば、同じ色を結ぶ最短パスの最小値がw以上か判定する
# graph[v]:= [(nv, c)]
n = len(graph) - 1
# -1: 未訪問, 0or1: グループ分け
visited = [-1 for i in range(n+1)]
for i in range(1, n+1):
if visited[i] != -1:
continue
visited[i] = 0
que = [i]
while que:
nque = []
while que:
v = que.pop()
for nv, c in graph[v]:
if c >= w:
break
if visited[nv] == visited[v]:
return False
if visited[nv] == -1:
visited[nv] = visited[v] ^ 1
nque.append(nv)
else:
continue
que = nque
return True
def solve(mid):
global n
global graph
if bipw(graph, mid):
return True
else:
return False
while abs(ok-ng) > 1:
mid = (ok+ng)//2
# print(ok,ng)
if solve(mid):
ok = mid
else:
ng = mid
print(ok)
import sys
n,m = map(int, sys.stdin.readline().split())
mp = map(int, sys.stdin.read().split())
abc = list(zip(mp,mp, mp))
graph = [[] for i in range(n+1)]
for a,b,c in abc:
graph[a].append((b,c))
graph[b].append((a,c))
ok = float("inf")
# ng = 0
minng = 2000000001
for i in range(1, n+1):
graph[i].sort(key=lambda x: x[1])
if ok > graph[i][0][1]:
ok = graph[i][0][1]
if len(graph[i]) >= 2:
temp = graph[i][0][1] + graph[i][1][1]
if minng > temp:
minng = temp
ng = minng + 1
def bipw(graph, w):
# 二部グラフであるかどうか判定する
# 二部グラフであるならば、同じ色を結ぶ最短パスの最小値がw以上か判定する
# graph[v]:= [(nv, c)]
n = len(graph) - 1
# -1: 未訪問, 0or1: グループ分け
visited = [-1 for i in range(n+1)]
for i in range(1, n+1):
if visited[i] != -1:
continue
visited[i] = 0
que = [i]
while que:
nque = []
while que:
v = que.pop()
for nv, c in graph[v]:
if c >= w:
break
if visited[nv] == visited[v]:
return False
if visited[nv] == -1:
visited[nv] = visited[v] ^ 1
nque.append(nv)
else:
continue
que = nque
return True
def solve(mid):
global n
global graph
if bipw(graph, mid):
return True
else:
return False
while abs(ok-ng) > 1:
mid = (ok+ng)//2
# print(ok,ng)
if solve(mid):
ok = mid
else:
ng = mid
print(ok)
|
ConDefects/ConDefects/Code/arc165_c/Python/45733476
|
condefects-python_data_144
|
import sys
n,m = map(int, sys.stdin.readline().split())
mp = map(int, sys.stdin.read().split())
abc = list(zip(mp,mp, mp))
graph = [[] for i in range(n+1)]
for a,b,c in abc:
graph[a].append((b,c))
graph[b].append((a,c))
ok = float("inf")
minng = 2000000001
for i in range(1, n+1):
graph[i].sort(key=lambda x: x[1])
if ok > graph[i][0][1]:
ok = graph[i][0][1]
if len(graph[i]) >= 2:
temp = graph[i][0][1] + graph[i][1][1]
if minng > temp:
minng = temp
print(minng)
exit()
ng = minng + 1
# def bipw(graph, w):
# # 二部グラフであるかどうか判定する
# # 二部グラフであるならば、同じ色を結ぶ最短パスの最小値がw以上か判定する
# # graph[v]:= [(nv, c)]
# n = len(graph) - 1
# # -1: 未訪問, 0or1: グループ分け
# visited = [-1 for i in range(n+1)]
# for i in range(1, n+1):
# if visited[i] != -1:
# continue
# visited[i] = 0
# que = [i]
# while que:
# nque = []
# while que:
# v = que.pop()
# for nv, c in graph[v]:
# if c >= w:
# break
# if visited[nv] == visited[v]:
# return False
# if visited[nv] == -1:
# visited[nv] = visited[v] ^ 1
# nque.append(nv)
# else:
# continue
# que = nque
# return True
def solve(mid):
global n
global graph
visited = [-1 for i in range(n+1)]
for i in range(1, n+1):
if visited[i] != -1:
continue
visited[i] = 0
que = [i]
while que:
nque = []
while que:
v = que.pop()
for nv, c in graph[v]:
if c >= mid:
break
if visited[nv] == visited[v]:
return False
if visited[nv] == -1:
visited[nv] = visited[v] ^ 1
nque.append(nv)
else:
continue
que = nque
return True
while abs(ok-ng) > 1:
mid = (ok+ng)//2
# print(ok,ng)
if solve(mid):
ok = mid
else:
ng = mid
print(ok)
import sys
n,m = map(int, sys.stdin.readline().split())
mp = map(int, sys.stdin.read().split())
abc = list(zip(mp,mp, mp))
graph = [[] for i in range(n+1)]
for a,b,c in abc:
graph[a].append((b,c))
graph[b].append((a,c))
ok = float("inf")
minng = 2000000001
for i in range(1, n+1):
graph[i].sort(key=lambda x: x[1])
if ok > graph[i][0][1]:
ok = graph[i][0][1]
if len(graph[i]) >= 2:
temp = graph[i][0][1] + graph[i][1][1]
if minng > temp:
minng = temp
ng = minng + 1
# def bipw(graph, w):
# # 二部グラフであるかどうか判定する
# # 二部グラフであるならば、同じ色を結ぶ最短パスの最小値がw以上か判定する
# # graph[v]:= [(nv, c)]
# n = len(graph) - 1
# # -1: 未訪問, 0or1: グループ分け
# visited = [-1 for i in range(n+1)]
# for i in range(1, n+1):
# if visited[i] != -1:
# continue
# visited[i] = 0
# que = [i]
# while que:
# nque = []
# while que:
# v = que.pop()
# for nv, c in graph[v]:
# if c >= w:
# break
# if visited[nv] == visited[v]:
# return False
# if visited[nv] == -1:
# visited[nv] = visited[v] ^ 1
# nque.append(nv)
# else:
# continue
# que = nque
# return True
def solve(mid):
global n
global graph
visited = [-1 for i in range(n+1)]
for i in range(1, n+1):
if visited[i] != -1:
continue
visited[i] = 0
que = [i]
while que:
nque = []
while que:
v = que.pop()
for nv, c in graph[v]:
if c >= mid:
break
if visited[nv] == visited[v]:
return False
if visited[nv] == -1:
visited[nv] = visited[v] ^ 1
nque.append(nv)
else:
continue
que = nque
return True
while abs(ok-ng) > 1:
mid = (ok+ng)//2
# print(ok,ng)
if solve(mid):
ok = mid
else:
ng = mid
print(ok)
|
ConDefects/ConDefects/Code/arc165_c/Python/45734816
|
condefects-python_data_145
|
f=lambda:map(int,input().split());N,M=f()
I=1<<60
D=[[I]*N for x in range(N)]
for m in range(M):u,v,c=f();D[u-1][v-1]=min(D[u-1][v-1],c)
for i in range(N):
for j in range(N):
for k in range(N):
D[j][k]=min(D[j][k],D[j][i]+D[i][k])
dp=[[I]*N for bit in range(1<<N)]
for bit in range(1,1<<N):
lst=[i for i in range(N) if bit&1<<i]
if len(lst)==1:
dp[bit][lst[0]]=0
else:
for i in lst:
for j in lst:
if i==j:
continue
dp[bit][i]=min(dp[bit][i],dp[bit^1<<i][j]+D[j][i])
ans=min(dp[-1])
if ans==I:
ans="No"
print(ans)
f=lambda:map(int,input().split());N,M=f()
I=1<<60
D=[[I]*N for x in range(N)]
for m in range(M):u,v,c=f();D[u-1][v-1]=min(D[u-1][v-1],c)
for i in range(N):
for j in range(N):
for k in range(N):
D[j][k]=min(D[j][k],D[j][i]+D[i][k])
dp=[[I]*N for bit in range(1<<N)]
for bit in range(1,1<<N):
lst=[i for i in range(N) if bit&1<<i]
if len(lst)==1:
dp[bit][lst[0]]=0
else:
for i in lst:
for j in lst:
if i==j:
continue
dp[bit][i]=min(dp[bit][i],dp[bit^1<<i][j]+D[j][i])
ans=min(dp[-1])
if ans>I//2:
ans="No"
print(ans)
|
ConDefects/ConDefects/Code/abc338_f/Python/52776716
|
condefects-python_data_146
|
from collections import deque
n,m=map(int,input().split())
vuw=[list(map(int,input().split())) for i in range(m)]
INF=10**18
wf=[[INF]*n for i in range(n)]
for v,u,w in vuw:
v-=1
u-=1
wf[v][u]=w
for i in range(n):
wf[i][i]=0
for k in range(n):
for i in range(n):
for j in range(n):
wf[i][j]=min(wf[i][j], wf[i][k]+wf[k][j])
dp=[[INF]*n for i in range(2**n)]
for i in range(n):
dp[1<<i][i]=0
for k in range(2**n):
for i in range(n):
if not (k>>i)&1: continue
for j in range(n):
if (k>>j)&1: continue
if wf[i][j]==INF: continue
dp[k|(1<<j)][j]=min(dp[k|(1<<j)][j], dp[k][i]+wf[i][j])
ans=min(dp[(2**n)-1])
if INF<=ans: print("No")
else: print(ans)
from collections import deque
n,m=map(int,input().split())
vuw=[list(map(int,input().split())) for i in range(m)]
INF=10**18
wf=[[INF]*n for i in range(n)]
for v,u,w in vuw:
v-=1
u-=1
wf[v][u]=w
for i in range(n):
wf[i][i]=0
for k in range(n):
for i in range(n):
for j in range(n):
wf[i][j]=min(wf[i][j], wf[i][k]+wf[k][j])
dp=[[INF]*n for i in range(2**n)]
for i in range(n):
dp[1<<i][i]=0
for k in range(2**n):
for i in range(n):
if not (k>>i)&1: continue
for j in range(n):
if (k>>j)&1: continue
if wf[i][j]==INF: continue
dp[k|(1<<j)][j]=min(dp[k|(1<<j)][j], dp[k][i]+wf[i][j])
ans=min(dp[(2**n)-1])
if 10**16<=ans: print("No")
else: print(ans)
|
ConDefects/ConDefects/Code/abc338_f/Python/53731825
|
condefects-python_data_147
|
# -*- coding: utf-8 -*-
INF = float("inf")
n, m = map(int, input().split())
# d[u][v] := 頂点 u, v の最短距離
d = [[INF] * n for _ in range(n)]
graph: list[list[tuple[int, int]]] = [[] for _ in range(n)]
for _ in range(m):
u, v, w = map(int, input().split())
graph[u - 1].append((v - 1, w))
d[u - 1][v - 1] = w
for k in range(n):
for u in range(n):
for v in range(n):
d[u][v] = min(d[u][v], d[u][k] + d[k][v])
# dp[s][t] := 最終地点が t で、訪れた頂点集合が s であるような最短経路長
dp = [[INF] * n for _ in range(1 << n)]
for start in range(n):
dp[1 << start][start] = 0
for s in range(1 << n):
for u in range(n):
if s & (1 << u) == 0:
continue
for v, w in graph[u]:
dp[s | (1 << v)][v] = min(dp[s | (1 << v)][v], dp[s][u] + d[u][v])
ans = INF
for t in range(n):
ans = min(ans, dp[-1][t])
if ans == INF:
print("No")
else:
print(ans)
# -*- coding: utf-8 -*-
INF = float("inf")
n, m = map(int, input().split())
# d[u][v] := 頂点 u, v の最短距離
d = [[INF] * n for _ in range(n)]
graph: list[list[tuple[int, int]]] = [[] for _ in range(n)]
for _ in range(m):
u, v, w = map(int, input().split())
graph[u - 1].append((v - 1, w))
d[u - 1][v - 1] = w
for k in range(n):
for u in range(n):
for v in range(n):
d[u][v] = min(d[u][v], d[u][k] + d[k][v])
# dp[s][t] := 最終地点が t で、訪れた頂点集合が s であるような最短経路長
dp = [[INF] * n for _ in range(1 << n)]
for start in range(n):
dp[1 << start][start] = 0
for s in range(1 << n):
for u in range(n):
if s & (1 << u) == 0:
continue
for v in range(n):
dp[s | (1 << v)][v] = min(dp[s | (1 << v)][v], dp[s][u] + d[u][v])
ans = INF
for t in range(n):
ans = min(ans, dp[-1][t])
if ans == INF:
print("No")
else:
print(ans)
|
ConDefects/ConDefects/Code/abc338_f/Python/52236687
|
condefects-python_data_148
|
R=range;f=lambda:map(int,input().split());N,M=f()
I=1<<60
D=[[I]*N for x in R(N)]
for m in R(M):u,v,c=f();D[u-1][v-1]=min(D[u-1][v-1],c)
for a in R(N**3):i,j,k=a//N//N,a//N%N,a%N;D[j][k]=min(D[j][k],D[j][i]+D[i][k])
d=[[I]*N for b in R(1<<N)]
for b in R(1,1<<N):
L=[i for i in R(N)if b&1<<i]
if len(L)==1:
d[b][L[0]]=0
else:
for i in L:
for j in L:
d[b][i]=min(d[b][i],d[b^1<<i][j]+D[j][i]+I*(i==j))
a=min(d[-1]);print([a,"No"][a>i//2])
R=range;f=lambda:map(int,input().split());N,M=f()
I=1<<60
D=[[I]*N for x in R(N)]
for m in R(M):u,v,c=f();D[u-1][v-1]=min(D[u-1][v-1],c)
for a in R(N**3):i,j,k=a//N//N,a//N%N,a%N;D[j][k]=min(D[j][k],D[j][i]+D[i][k])
d=[[I]*N for b in R(1<<N)]
for b in R(1,1<<N):
L=[i for i in R(N)if b&1<<i]
if len(L)==1:
d[b][L[0]]=0
else:
for i in L:
for j in L:
d[b][i]=min(d[b][i],d[b^1<<i][j]+D[j][i]+I*(i==j))
a=min(d[-1]);print([a,"No"][a>I//2])
|
ConDefects/ConDefects/Code/abc338_f/Python/52776877
|
condefects-python_data_149
|
N, M = map(int, input().split())
G = [[] for _ in range(N)]
for _ in range(M):
U, V, W = map(int, input().split())
G[U-1].append((V-1, W))
def func(n):
for _ in range(M-1):
for i in range(N):
for v, w in G[i]:
dist[n][v] = min(dist[n][v], dist[n][i]+w)
INF = float("inf")
dist = [[INF]*N for _ in range(N)]
for i in range(N):
dist[i][i] = 0
func(i)
dp = [[INF]*N for _ in range(1<<N)]
for i in range(N):
dp[1<<i][i] = 0
for i in range(1<<N):
for j in range(N):
if dp[i][j] != INF:
for k in range(N):
dp[i|(1<<k)][k] = min(dp[i|(1<<k)][k], dp[i][j]+dist[j][k])
for i in range(N):
dp[-1][i] += min(dist[i])
print(min(dp[-1]) if min(dp[-1]) != INF else "No")
N, M = map(int, input().split())
G = [[] for _ in range(N)]
for _ in range(M):
U, V, W = map(int, input().split())
G[U-1].append((V-1, W))
def func(n):
for _ in range(M):
for i in range(N):
for v, w in G[i]:
dist[n][v] = min(dist[n][v], dist[n][i]+w)
INF = float("inf")
dist = [[INF]*N for _ in range(N)]
for i in range(N):
dist[i][i] = 0
func(i)
dp = [[INF]*N for _ in range(1<<N)]
for i in range(N):
dp[1<<i][i] = 0
for i in range(1<<N):
for j in range(N):
if dp[i][j] != INF:
for k in range(N):
dp[i|(1<<k)][k] = min(dp[i|(1<<k)][k], dp[i][j]+dist[j][k])
for i in range(N):
dp[-1][i] += min(dist[i])
print(min(dp[-1]) if min(dp[-1]) != INF else "No")
|
ConDefects/ConDefects/Code/abc338_f/Python/53230147
|
condefects-python_data_150
|
from collections import deque
N,M = map(int, input().split())
inf = 1<<30
dist = [[inf]*N for _ in range(N)]
for _ in range(M):
u,v,w = map(int, input().split())
dist[u-1][v-1] = w
for i in range(N):
dist[i][i] = 0
for k in range(N):
for i in range(N):
for j in range(N):
dist[i][j] = min(dist[i][j], dist[i][k]+dist[k][j])
dp = [[inf]*N for _ in range(2**N)]
for i in range(N):
dp[1<<i][i] = 0
for i in range(2**N):
for u in range(N):
if dp[i][u] == inf:
continue
for v in range(N):
k = i | 1<<v
dp[k][v] = min(dp[k][v], dp[i][u]+dist[u][v])
ans = min(dp[(1<<N)-1])
if ans == inf:
ans = "No"
print(ans)
from collections import deque
N,M = map(int, input().split())
inf = 1<<30
dist = [[inf]*N for _ in range(N)]
for _ in range(M):
u,v,w = map(int, input().split())
dist[u-1][v-1] = w
for i in range(N):
dist[i][i] = 0
for k in range(N):
for i in range(N):
for j in range(N):
dist[i][j] = min(dist[i][j], dist[i][k]+dist[k][j])
dp = [[inf]*N for _ in range(2**N)]
for i in range(N):
dp[1<<i][i] = 0
for i in range(2**N):
for u in range(N):
if dp[i][u] == inf:
continue
for v in range(N):
if dist[u][v] == inf:
continue
k = i | 1<<v
dp[k][v] = min(dp[k][v], dp[i][u]+dist[u][v])
ans = min(dp[(1<<N)-1])
if ans == inf:
ans = "No"
print(ans)
|
ConDefects/ConDefects/Code/abc338_f/Python/52289901
|
condefects-python_data_151
|
N,M=map(int,input().split())
INF=10**9
#Warshall-Froid
D=[[INF for _ in range(N)] for _ in range(N)]
for i in range(N):D[i][i]=0
for _ in range(M):
u,v,d=map(int,input().split())
D[u-1][v-1]=d
for j in range(N):
for i in range(N):
for k in range(N):
D[i][k]=min(D[i][k],D[i][j]+D[j][k])
#dp[bit][i]:bitを訪問済、最後がiの最短距離
dp=[[INF for _ in range(N)] for _ in range(1<<N)]
for i in range(N):
dp[1<<i][i]=0
for bit in range(1,1<<N):
for j in range(N):
if (bit>>j)&1:
continue
nbit=bit|(1<<j)
for i in range(N):
dp[nbit][j]=min(dp[nbit][j],dp[bit][i]+D[i][j])
ans=min(dp[-1])
print("No" if ans==INF else ans)
N,M=map(int,input().split())
INF=10**9
#Warshall-Froid
D=[[INF for _ in range(N)] for _ in range(N)]
for i in range(N):D[i][i]=0
for _ in range(M):
u,v,d=map(int,input().split())
D[u-1][v-1]=d
for j in range(N):
for i in range(N):
for k in range(N):
if D[i][j]==INF or D[j][k]==INF:continue
D[i][k]=min(D[i][k],D[i][j]+D[j][k])
#dp[bit][i]:bitを訪問済、最後がiの最短距離
dp=[[INF for _ in range(N)] for _ in range(1<<N)]
for i in range(N):
dp[1<<i][i]=0
for bit in range(1,1<<N):
for j in range(N):
if (bit>>j)&1:
continue
nbit=bit|(1<<j)
for i in range(N):
if dp[bit][i]==INF or D[i][j]==INF:continue
dp[nbit][j]=min(dp[nbit][j],dp[bit][i]+D[i][j])
ans=min(dp[-1])
print("No" if ans==INF else ans)
|
ConDefects/ConDefects/Code/abc338_f/Python/54703600
|
condefects-python_data_152
|
import sys
# import math
# from bisect import *
# from collections import *
# from functools import *
# from heapq import *
# from itertools import *
# from random import *
# from string import *
# from types import GeneratorType
# region fastio
input = lambda: sys.stdin.readline().rstrip()
sint = lambda: int(input())
mint = lambda: map(int, input().split())
ints = lambda: list(map(int, input().split()))
# print = lambda d: sys.stdout.write(str(d) + "\n")
# endregion fastio
# # region interactive
# def printQry(a, b) -> None:
# sa = str(a)
# sb = str(b)
# print(f"? {sa} {sb}", flush = True)
# def printAns(ans) -> None:
# s = str(ans)
# print(f"! {s}", flush = True)
# # endregion interactive
# # region dfsconvert
# def bootstrap(f, stack=[]):
# def wrappedfunc(*args, **kwargs):
# if stack:
# return f(*args, **kwargs)
# else:
# to = f(*args, **kwargs)
# while True:
# if type(to) is GeneratorType:
# stack.append(to)
# to = next(to)
# else:
# stack.pop()
# if not stack:
# break
# to = stack[-1].send(to)
# return to
# return wrappedfunc
# # endregion dfsconvert
MOD = 998244353
# MOD = 10 ** 9 + 7
# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))
def solve() -> None:
n = sint()
nums = ints()
ans = 0
for i in range(1, n + 1): # 选择i个数
dp = [[0] * n for _ in range(n + 1)]
dp[0][0] = 1
for x in nums: # 枚举所有数字
for j in range(i, 0, -1): # 前面选择了j个数
for k in range(i): # 模i余为k
dp[j][(k + x) % i] = (dp[j][(k + x) % i] + dp[j - 1][k]) % MOD
ans += dp[i][0]
print(ans)
solve()
import sys
# import math
# from bisect import *
# from collections import *
# from functools import *
# from heapq import *
# from itertools import *
# from random import *
# from string import *
# from types import GeneratorType
# region fastio
input = lambda: sys.stdin.readline().rstrip()
sint = lambda: int(input())
mint = lambda: map(int, input().split())
ints = lambda: list(map(int, input().split()))
# print = lambda d: sys.stdout.write(str(d) + "\n")
# endregion fastio
# # region interactive
# def printQry(a, b) -> None:
# sa = str(a)
# sb = str(b)
# print(f"? {sa} {sb}", flush = True)
# def printAns(ans) -> None:
# s = str(ans)
# print(f"! {s}", flush = True)
# # endregion interactive
# # region dfsconvert
# def bootstrap(f, stack=[]):
# def wrappedfunc(*args, **kwargs):
# if stack:
# return f(*args, **kwargs)
# else:
# to = f(*args, **kwargs)
# while True:
# if type(to) is GeneratorType:
# stack.append(to)
# to = next(to)
# else:
# stack.pop()
# if not stack:
# break
# to = stack[-1].send(to)
# return to
# return wrappedfunc
# # endregion dfsconvert
MOD = 998244353
# MOD = 10 ** 9 + 7
# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))
def solve() -> None:
n = sint()
nums = ints()
ans = 0
for i in range(1, n + 1): # 选择i个数
dp = [[0] * n for _ in range(n + 1)]
dp[0][0] = 1
for x in nums: # 枚举所有数字
for j in range(i, 0, -1): # 前面选择了j个数
for k in range(i): # 模i余为k
dp[j][(k + x) % i] = (dp[j][(k + x) % i] + dp[j - 1][k]) % MOD
ans = (ans + dp[i][0]) % MOD
print(ans)
solve()
|
ConDefects/ConDefects/Code/abc262_d/Python/44381954
|
condefects-python_data_153
|
p,q=map(str, input().split())
li=[3,4,8,9,14,23]
long=0
short=0
if p=='A':
short=0
elif p=='B':
short=li[0]
elif p=='C':
short=li[1]
elif p=='D':
short=li[2]
elif p=='E':
short=li[3]
elif p=='F':
short=li[4]
elif p=='G':
short=li[5]
if q=='A':
short=0
elif q=='B':
long=li[0]
elif q=='C':
long=li[1]
elif q=='D':
long=li[2]
elif q=='E':
long=li[3]
elif q=='F':
long=li[4]
elif q=='G':
long=li[5]
print(abs(long-short))
p,q=map(str, input().split())
li=[3,4,8,9,14,23]
long=0
short=0
if p=='A':
short=0
elif p=='B':
short=li[0]
elif p=='C':
short=li[1]
elif p=='D':
short=li[2]
elif p=='E':
short=li[3]
elif p=='F':
short=li[4]
elif p=='G':
short=li[5]
if q=='A':
long=0
elif q=='B':
long=li[0]
elif q=='C':
long=li[1]
elif q=='D':
long=li[2]
elif q=='E':
long=li[3]
elif q=='F':
long=li[4]
elif q=='G':
long=li[5]
print(abs(long-short))
|
ConDefects/ConDefects/Code/abc305_b/Python/46169156
|
condefects-python_data_154
|
def is_palindrome(s):
return s == s[::-1]
def solve(n, k, s):
k %= 2 * n
s_inv = s[::-1]
if k < n:
t = s_inv[:k]
else:
t = s_inv + s_inv[-(k-n):]
return "Yes" if all(is_palindrome(x) for x in [s+t, t+s]) else "No"
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
s = input()
print(solve(n, k, s))
def is_palindrome(s):
return s == s[::-1]
def solve(n, k, s):
k %= 2 * n
s_inv = s[::-1]
if k < n:
t = s_inv[:k]
else:
t = s_inv[:k-n] + s_inv
return "Yes" if all(is_palindrome(x) for x in [s+t, t+s]) else "No"
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
s = input()
print(solve(n, k, s))
|
ConDefects/ConDefects/Code/arc155_a/Python/45899321
|
condefects-python_data_155
|
def main():
T = int(input())
for _ in range(T):
N, K = map(int, input().split())
S = list(input())
if K < N:
L1 = S + S[:K][::-1]
L2 = S[:K][::-1] + S
for i in range(N+K):
if L1[i] != L1[-i-1] or L2[i] != L2[-i-1]:
break
else:
print("Yes")
continue
print("No")
continue
l = N
for i in range(1, N+1):
if not N % i == 0:
continue
for j in range(N // i):
if j % 2 == 1:
for k in range(i):
if S[i*(j+1)-k-1] != S[k]:
break
else:
continue
break
else:
for k in range(i):
if S[i*j + k] != S[k]:
break
else:
continue
break
else:
l = min(l, i)
break
if (N+K) % (2*l) == 0:
print("Yes")
continue
elif (N+k) % l == 0:
for i in range(l):
if S[i] != S[l-i-1]:
break
else:
print("Yes")
continue
print("No")
continue
else:
print("No")
continue
if __name__ == "__main__":
main()
def main():
T = int(input())
for _ in range(T):
N, K = map(int, input().split())
S = list(input())
if K < N:
L1 = S + S[:K][::-1]
L2 = S[:K][::-1] + S
for i in range(N+K):
if L1[i] != L1[-i-1] or L2[i] != L2[-i-1]:
break
else:
print("Yes")
continue
print("No")
continue
l = N
for i in range(1, N+1):
if not N % i == 0:
continue
for j in range(N // i):
if j % 2 == 1:
for k in range(i):
if S[i*(j+1)-k-1] != S[k]:
break
else:
continue
break
else:
for k in range(i):
if S[i*j + k] != S[k]:
break
else:
continue
break
else:
l = min(l, i)
break
if (N+K) % (2*l) == 0:
print("Yes")
continue
elif (N+K) % l == 0:
for i in range(l):
if S[i] != S[l-i-1]:
break
else:
print("Yes")
continue
print("No")
continue
else:
print("No")
continue
if __name__ == "__main__":
main()
|
ConDefects/ConDefects/Code/arc155_a/Python/40182881
|
condefects-python_data_156
|
#!/usr/bin/env python3
YES = "Yes" # type: str
NO = "No" # type: str
def is_symmetrical(S: str):
N = len(S)
for i in range(N):
if S[i] != S[N-i-1]:
return False
return True
# K < 2Nの場合
def can_solve(S, K):
N = len(S)
S_inv = S[::-1]
if K <= N:
T = S_inv[-K:]
else:
T = S_inv[:K-N] + S_inv
new_S1 = S + T
new_S2 = T + S
return is_symmetrical(new_S1) and is_symmetrical(new_S2)
# Generated by 2.12.0 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
T = int(input())
for t in range(T):
N, K = map(int, input().split())
S = input()
if (K // (2*N)) % 2 == 1:
S = S[::-1]
if can_solve(S, K % (2*N)):
print(YES)
else:
print(NO)
if __name__ == '__main__':
main()
#!/usr/bin/env python3
YES = "Yes" # type: str
NO = "No" # type: str
def is_symmetrical(S: str):
N = len(S)
for i in range(N):
if S[i] != S[N-i-1]:
return False
return True
# K < 2Nの場合
def can_solve(S, K):
N = len(S)
S_inv = S[::-1]
if K <= N:
T = S_inv[N-K:]
else:
T = S_inv[:K-N] + S_inv
new_S1 = S + T
new_S2 = T + S
return is_symmetrical(new_S1) and is_symmetrical(new_S2)
# Generated by 2.12.0 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
T = int(input())
for t in range(T):
N, K = map(int, input().split())
S = input()
if (K // (2*N)) % 2 == 1:
S = S[::-1]
if can_solve(S, K % (2*N)):
print(YES)
else:
print(NO)
if __name__ == '__main__':
main()
|
ConDefects/ConDefects/Code/arc155_a/Python/44408199
|
condefects-python_data_157
|
for _ in range(int(input())):
n,k = map(int,input().split())
S = input()
k %= 2*n
T = "".join(S[~i] if i < n else S[i-k] for i in range(k))
if S+T == (S+T)[::-1] and T+S == (T+S)[::-1]:
print("Yes")
else:
print("No")
for _ in range(int(input())):
n,k = map(int,input().split())
S = input()
k %= 2*n
T = "".join(S[~i] if i < n else S[~(i-k)] for i in range(k))
if S+T == (S+T)[::-1] and T+S == (T+S)[::-1]:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/arc155_a/Python/40823834
|
condefects-python_data_158
|
N,A,B = map(int,input().split())
P,Q,R,S = map(int,input().split())
k1_min = max(1-A,1-B)
k1_max = min(N-A,N-B)
k2_min = max(1-A,B-N)
k2_max = min(N-A,B-1)
Z = [['.' for _ in range(S-R+1)] for _ in range(Q-P+1)]
if A<B:
for i in range(P,Q+1):
for j in range(R,S+1):
if i == j-(B+k1_min)+1:
Z[i-P][j-R] = '#'
if i+j == A+B:
Z[i-P][j-R] = '#'
else:
for i in range(P,Q+1):
for j in range(R,S+1):
if i-(A+k1_min)+1 == j:
Z[i-P][j-R] = '#'
if i+j == A+B:
Z[i-P][j-R] = '#'
for i in Z:
print(*i)
N,A,B = map(int,input().split())
P,Q,R,S = map(int,input().split())
k1_min = max(1-A,1-B)
k1_max = min(N-A,N-B)
k2_min = max(1-A,B-N)
k2_max = min(N-A,B-1)
Z = [['.' for _ in range(S-R+1)] for _ in range(Q-P+1)]
if A<B:
for i in range(P,Q+1):
for j in range(R,S+1):
if i == j-(B+k1_min)+1:
Z[i-P][j-R] = '#'
if i+j == A+B:
Z[i-P][j-R] = '#'
else:
for i in range(P,Q+1):
for j in range(R,S+1):
if i-(A+k1_min)+1 == j:
Z[i-P][j-R] = '#'
if i+j == A+B:
Z[i-P][j-R] = '#'
for i in Z:
print(''.join(i))
|
ConDefects/ConDefects/Code/abc230_c/Python/54240175
|
condefects-python_data_159
|
# import sys
# sys.setrecursionlimit(10**6)
# sys.set_int_max_str_digits(10**6)
# mod = 998244353
# ds = [(-1,0),(0,1),(1,0),(0,-1)]
# alph = 'abcdefghijklmnopqrstuvwxyz'
def rint():
return list(map(int, input().split()))
# S = input()
N, = rint()
A = rint()
def sub(A):
ret = [0]*N
height = 0
for i in range(len(A)):
height += 1
if A[i] < height:
height = A[i]
ret[i] = height
return ret
L = sub(A)
R = sub(A[::-1])
ans = 1
for i in range(N):
ans = max(ans, min(L[i], R[i]))
print(ans)
# import sys
# sys.setrecursionlimit(10**6)
# sys.set_int_max_str_digits(10**6)
# mod = 998244353
# ds = [(-1,0),(0,1),(1,0),(0,-1)]
# alph = 'abcdefghijklmnopqrstuvwxyz'
def rint():
return list(map(int, input().split()))
# S = input()
N, = rint()
A = rint()
def sub(A):
ret = [0]*N
height = 0
for i in range(len(A)):
height += 1
if A[i] < height:
height = A[i]
ret[i] = height
return ret
L = sub(A)
R = sub(A[::-1])[::-1]
ans = 1
for i in range(N):
ans = max(ans, min(L[i], R[i]))
print(ans)
|
ConDefects/ConDefects/Code/abc336_d/Python/54268398
|
condefects-python_data_160
|
N = int(input())
A = list(map(int, input().split()))
s = [0]
for a in A:
s.append(min(s[-1] + 1, a))
t = [0]
for a in A[::-1]:
t.append(min(t[-1] + 1, a))
ans = 0
for i in range(N // 2 + 1):
ans = max(ans, min(s[i+1], t[N-i]))
print(ans)
N = int(input())
A = list(map(int, input().split()))
s = [0]
for a in A:
s.append(min(s[-1] + 1, a))
t = [0]
for a in A[::-1]:
t.append(min(t[-1] + 1, a))
ans = 0
for i in range(N):
ans = max(ans, min(s[i+1], t[N-i]))
print(ans)
|
ConDefects/ConDefects/Code/abc336_d/Python/54930029
|
condefects-python_data_161
|
n,*a = map(int,open(0).read().split())
b = [1]*n
for i in range(n-1):
if a[i]>b[i]:
b[i+1] = b[i] + 1
else: b[i+1] = a[i] + 1
c = [1]*n
for i in range(n-1,0,-1):
if a[i]>c[i]:
c[i-1] = c[i] + 1
else: c[i-1] = a[i] + 1
d = [1]*n
for i in range(n):
if a[i]>=b[i] or a[i]>=c[i]:
d[i] = min(b[i],c[i])
print(d,max(d))
n,*a = map(int,open(0).read().split())
b = [1]*n
for i in range(n-1):
if a[i]>b[i]:
b[i+1] = b[i] + 1
else: b[i+1] = a[i] + 1
c = [1]*n
for i in range(n-1,0,-1):
if a[i]>c[i]:
c[i-1] = c[i] + 1
else: c[i-1] = a[i] + 1
d = [1]*n
for i in range(n):
if a[i]>=b[i] or a[i]>=c[i]:
d[i] = min(b[i],c[i])
print(max(d))
|
ConDefects/ConDefects/Code/abc336_d/Python/54315975
|
condefects-python_data_162
|
n = int(input())
a = list(map(int, input().split()))
l = [0]*(n)
r = [0]*(n)
l[0] = 1
r[0] = 1
for i in range(1, n):
l[i] = min(l[i - 1] + 1, a[i])
for i in range(1, n):
r[i] = min(r[i - 1] + 1, a[n - i])
ans = 1
for i in range(n):
if ans < min(l[i], r[n - i - 1]):
ans = min(l[i], r[n - i - 1])
print(ans)
n = int(input())
a = list(map(int, input().split()))
l = [0]*(n)
r = [0]*(n)
l[0] = 1
r[0] = 1
for i in range(1, n):
l[i] = min(l[i - 1] + 1, a[i])
for i in range(1, n):
r[i] = min(r[i - 1] + 1, a[n - i - 1])
ans = 1
for i in range(n):
if ans < min(l[i], r[n - i - 1]):
ans = min(l[i], r[n - i - 1])
print(ans)
|
ConDefects/ConDefects/Code/abc336_d/Python/53237033
|
condefects-python_data_163
|
import sys
sys.setrecursionlimit(10**7)
read_int = lambda: int(sys.stdin.readline())
read_ints = lambda: list(map(int, sys.stdin.readline().split(" ")))
read_float = lambda: float(sys.stdin.readline())
read_floats = lambda: list(map(float, sys.stdin.readline().split(" ")))
def get_logger(debug=True):
if not debug:
return type("Dummy", (object,), {"debug": lambda self, a: None})()
import logging
logger = logging.getLogger("")
logger.setLevel(logging.DEBUG)
handler = logging.StreamHandler(sys.stdout)
handler.setFormatter(logging.Formatter("[%(funcName)s:%(lineno)s] %(message)s"))
logger.addHandler(handler)
return logger
# -------------------------------
log = get_logger(False)
N = read_int()
a = read_ints()
ans = 0
a[0], a[N - 1] = 1, 1
for i in range(1, N):
if a[i] > a[i - 1]:
a[i] = a[i - 1] + 1
for i in range(N - 2, -1, -1):
if a[i] > a[i + 1]:
a[i] = a[i + 1] + 1
ans = max(ans, a[i])
print(ans)
import sys
sys.setrecursionlimit(10**7)
read_int = lambda: int(sys.stdin.readline())
read_ints = lambda: list(map(int, sys.stdin.readline().split(" ")))
read_float = lambda: float(sys.stdin.readline())
read_floats = lambda: list(map(float, sys.stdin.readline().split(" ")))
def get_logger(debug=True):
if not debug:
return type("Dummy", (object,), {"debug": lambda self, a: None})()
import logging
logger = logging.getLogger("")
logger.setLevel(logging.DEBUG)
handler = logging.StreamHandler(sys.stdout)
handler.setFormatter(logging.Formatter("[%(funcName)s:%(lineno)s] %(message)s"))
logger.addHandler(handler)
return logger
# -------------------------------
log = get_logger(False)
N = read_int()
a = read_ints()
ans = 1
a[0], a[N - 1] = 1, 1
for i in range(1, N):
if a[i] > a[i - 1]:
a[i] = a[i - 1] + 1
for i in range(N - 2, -1, -1):
if a[i] > a[i + 1]:
a[i] = a[i + 1] + 1
ans = max(ans, a[i])
print(ans)
|
ConDefects/ConDefects/Code/abc336_d/Python/54659671
|
condefects-python_data_164
|
n = int(input())
s = input()
c = list(map(int, input().split()))
zo = [0]
oz = [0]
for i in range(n):
if i % 2:
if s[i] == '1':
oz.append(oz[-1]+c[i])
zo.append(zo[-1])
else:
zo.append(zo[-1]+c[i])
oz.append(oz[-1])
else:
if s[i] == '1':
zo.append(zo[-1]+c[i])
oz.append(oz[-1])
else:
oz.append(oz[-1]+c[i])
zo.append(zo[-1])
mn = float('inf')
for i in range(1, n):
mn = min(mn, oz[i-1] + zo[-1]-zo[i-1], zo[i-1] + oz[-1]-oz[i-1])
print(mn)
n = int(input())
s = input()
c = list(map(int, input().split()))
zo = [0]
oz = [0]
for i in range(n):
if i % 2:
if s[i] == '1':
oz.append(oz[-1]+c[i])
zo.append(zo[-1])
else:
zo.append(zo[-1]+c[i])
oz.append(oz[-1])
else:
if s[i] == '1':
zo.append(zo[-1]+c[i])
oz.append(oz[-1])
else:
oz.append(oz[-1]+c[i])
zo.append(zo[-1])
mn = float('inf')
for i in range(1, n):
mn = min(mn, oz[i] + zo[-1]-zo[i], zo[i] + oz[-1]-oz[i])
print(mn)
|
ConDefects/ConDefects/Code/abc346_d/Python/54469627
|
condefects-python_data_165
|
N=int(input())
S=list(input())
C=list(map(int,input().split()))
ans=1<<32
oi=[0]*(N+1)
io=[0]*(N+1)
oi_=[0]*(N+1)
io_=[0]*(N+1)
for i in range(N):
oi[i+1]=oi[i]
io[i+1]=io[i]
oi_[N-i-1]=oi_[N-i]
io_[N-i-1]=io_[N-i]
if i%2==0:
if S[i]=='1':
oi[i+1]+=C[i]
else:
io[i+1]+=C[i]
else:
if S[i]=='0':
oi[i+1]+=C[i]
else:
io[i+1]+=C[i]
if (N-i-1)%2==0:
if S[N-i-1]=='0':
oi_[N-i-1]+=C[N-i-1]
else:
io_[N-i-1]+=C[N-i-1]
else:
if S[N-i-1]=='1':
oi_[N-i-1]+=C[N-i-1]
else:
io_[N-i-1]+=C[N-i-1]
for i in range(1,N):
ans=min(ans,oi[i]+oi_[i],io[i]+io_[i])
print(ans)
N=int(input())
S=list(input())
C=list(map(int,input().split()))
ans=1<<64
oi=[0]*(N+1)
io=[0]*(N+1)
oi_=[0]*(N+1)
io_=[0]*(N+1)
for i in range(N):
oi[i+1]=oi[i]
io[i+1]=io[i]
oi_[N-i-1]=oi_[N-i]
io_[N-i-1]=io_[N-i]
if i%2==0:
if S[i]=='1':
oi[i+1]+=C[i]
else:
io[i+1]+=C[i]
else:
if S[i]=='0':
oi[i+1]+=C[i]
else:
io[i+1]+=C[i]
if (N-i-1)%2==0:
if S[N-i-1]=='0':
oi_[N-i-1]+=C[N-i-1]
else:
io_[N-i-1]+=C[N-i-1]
else:
if S[N-i-1]=='1':
oi_[N-i-1]+=C[N-i-1]
else:
io_[N-i-1]+=C[N-i-1]
for i in range(1,N):
ans=min(ans,oi[i]+oi_[i],io[i]+io_[i])
print(ans)
|
ConDefects/ConDefects/Code/abc346_d/Python/53744023
|
condefects-python_data_166
|
N = int(input())
S = list(str(input()))
C = list(map(int, input().split()))
A = []
B = []
for i in range(N+1):
if i == 0:
A.append(0)
B.append(0)
elif int(S[i-1]) == i % 2:
A.append(A[i-1] + C[i-1])
B.append(B[i-1])
else:
A.append(A[i-1])
B.append(B[i-1] + C[i-1])
ans = 10 ** 20
for j in range(N):
ans = min(ans, A[j]-A[0] + B[N]-B[j], B[j]-B[0] + A[N]-A[j])
print(ans)
N = int(input())
S = list(str(input()))
C = list(map(int, input().split()))
A = []
B = []
for i in range(N+1):
if i == 0:
A.append(0)
B.append(0)
elif int(S[i-1]) == i % 2:
A.append(A[i-1] + C[i-1])
B.append(B[i-1])
else:
A.append(A[i-1])
B.append(B[i-1] + C[i-1])
ans = 10 ** 20
for j in range(1, N):
ans = min(ans, A[j]-A[0] + B[N]-B[j], B[j]-B[0] + A[N]-A[j])
print(ans)
|
ConDefects/ConDefects/Code/abc346_d/Python/54999312
|
condefects-python_data_167
|
N = int(input())
S = input()
C = list(map(int, input().split()))
zeroichi = ['1' if i%2 == 1 else '0' for i in range(10**6) ]
ichizero = ['0' if i%2 == 1 else '1' for i in range(10**6) ]
ZL = [0]*(N+1)
Crev = C[::-1]
#0スタートパターン左
for i in range(N):
tmp = 0
if S[i] != zeroichi[i]:
tmp = C[i]
ZL[i+1] = ZL[i]+tmp
#0スタートパターン右
ZR = [0]*(N+1)
Srev = S[::-1]
for i in range(N):
tmp = 0
if Srev[i] != zeroichi[i]:
tmp = Crev[i]
ZR[i+1] = ZR[i]+tmp
#1スタートパターン左
OL = [0]*(N+1)
for i in range(N):
tmp = 0
if S[i] != ichizero[i]:
tmp = C[i]
OL[i+1] = OL[i]+tmp
#0スタートパターン右
OR = [0]*(N+1)
for i in range(N):
tmp = 0
if Srev[i] != ichizero[i]:
tmp = Crev[i]
OR[i+1] = OR[i]+tmp
if N % 2 == 0: #偶数なら、０スタ０スタ、１スタ１スタで比べる
ANS = 10**50
for i in range(N):
ANS = min((OL[i]+OR[N-i]),ZL[i]+ZR[N-i],ANS)
print(ANS)
else:
ANS = 10**50
for i in range(N):
ANS = min((OL[i]+ZR[N-i]),ZL[i]+OR[N-i],ANS)
print(ANS)
N = int(input())
S = input()
C = list(map(int, input().split()))
zeroichi = ['1' if i%2 == 1 else '0' for i in range(10**6) ]
ichizero = ['0' if i%2 == 1 else '1' for i in range(10**6) ]
ZL = [0]*(N+1)
Crev = C[::-1]
#0スタートパターン左
for i in range(N):
tmp = 0
if S[i] != zeroichi[i]:
tmp = C[i]
ZL[i+1] = ZL[i]+tmp
#0スタートパターン右
ZR = [0]*(N+1)
Srev = S[::-1]
for i in range(N):
tmp = 0
if Srev[i] != zeroichi[i]:
tmp = Crev[i]
ZR[i+1] = ZR[i]+tmp
#1スタートパターン左
OL = [0]*(N+1)
for i in range(N):
tmp = 0
if S[i] != ichizero[i]:
tmp = C[i]
OL[i+1] = OL[i]+tmp
#0スタートパターン右
OR = [0]*(N+1)
for i in range(N):
tmp = 0
if Srev[i] != ichizero[i]:
tmp = Crev[i]
OR[i+1] = OR[i]+tmp
if N % 2 == 0: #偶数なら、０スタ０スタ、１スタ１スタで比べる
ANS = 10**50
for i in range(1,N):
ANS = min((OL[i]+OR[N-i]),ZL[i]+ZR[N-i],ANS)
print(ANS)
else:
ANS = 10**50
for i in range(N):
ANS = min((OL[i]+ZR[N-i]),ZL[i]+OR[N-i],ANS)
print(ANS)
|
ConDefects/ConDefects/Code/abc346_d/Python/53935383
|
condefects-python_data_168
|
import sys
input = sys.stdin.readline
inf = 10 ** 18
def read(dtype=int):
return list(map(dtype, input().split()))
n, = read()
s, = read(str)
s = list(map(int, s))
c = read()
dp = [[inf, inf], [inf, inf]]
dp[s[0] ^ 1][0] = c[0]
dp[s[0]][0] = 0
for i in range(1, n):
ndp = [[inf, inf], [inf, inf]]
for k in range(2):
cost = k and c[i]
for x in range(2):
for y in range(2):
same = s[i] == x ^ k
if y and same:
continue
ndp[s[i] ^ k][same | y] = min(
ndp[s[i] ^ k][same | y], dp[x][y] + cost)
dp = ndp
print(min(map(min, dp)))
import sys
input = sys.stdin.readline
inf = 10 ** 18
def read(dtype=int):
return list(map(dtype, input().split()))
n, = read()
s, = read(str)
s = list(map(int, s))
c = read()
dp = [[inf, inf], [inf, inf]]
dp[s[0] ^ 1][0] = c[0]
dp[s[0]][0] = 0
for i in range(1, n):
ndp = [[inf, inf], [inf, inf]]
for k in range(2):
cost = k and c[i]
for x in range(2):
for y in range(2):
same = s[i] == x ^ k
if y and same:
continue
ndp[s[i] ^ k][same | y] = min(
ndp[s[i] ^ k][same | y], dp[x][y] + cost)
dp = ndp
print(min(dp[0][1], dp[1][1]))
|
ConDefects/ConDefects/Code/abc346_d/Python/54740445
|
condefects-python_data_169
|
N = int(input())
S = input()
C = list(map(int,input().split()))
OI = [0 for i in range(N)]
IO = [0 for i in range(N)]
if S[0] == "0":
OI[0] = 0
IO[0] = C[0]
else:
IO[0] = 0
OI[0] = C[0]
for i in range(1,N):
if S[i] == "0" and i % 2 == 0:
IO[i] = IO[i-1] + C[i]
OI[i] = OI[i-1]
elif S[i] == "0" and i % 2 == 1:
OI[i] = OI[i - 1] + C[i]
IO[i] = IO[i - 1]
if S[i] == "1" and i % 2 == 0:
OI[i] = OI[i-1] + C[i]
IO[i] = IO[i-1]
elif S[i] == "1" and i % 2 == 1:
IO[i] = IO[i - 1] + C[i]
OI[i] = OI[i - 1]
ans = set()
for i in range(N):
ans.add((OI[-1]-OI[i])+(IO[i]))
ans.add(IO[-1]-IO[i]+(OI[i]))
print(min(ans))
N = int(input())
S = input()
C = list(map(int,input().split()))
OI = [0 for i in range(N)]
IO = [0 for i in range(N)]
if S[0] == "0":
OI[0] = 0
IO[0] = C[0]
else:
IO[0] = 0
OI[0] = C[0]
for i in range(1,N):
if S[i] == "0" and i % 2 == 0:
IO[i] = IO[i-1] + C[i]
OI[i] = OI[i-1]
elif S[i] == "0" and i % 2 == 1:
OI[i] = OI[i - 1] + C[i]
IO[i] = IO[i - 1]
if S[i] == "1" and i % 2 == 0:
OI[i] = OI[i-1] + C[i]
IO[i] = IO[i-1]
elif S[i] == "1" and i % 2 == 1:
IO[i] = IO[i - 1] + C[i]
OI[i] = OI[i - 1]
ans = set()
for i in range(N-1):
ans.add((OI[-1]-OI[i])+(IO[i]))
ans.add(IO[-1]-IO[i]+(OI[i]))
print(min(ans))
|
ConDefects/ConDefects/Code/abc346_d/Python/54543042
|
condefects-python_data_170
|
n=int(input())
S=str(input())
C=list(map(int,input().split()))
mask=0
for i in range(n):
if int(S[i])==i%2:
mask|=1<<i
cost1=sum(C[i] for i in range(n) if mask>>i&1)
cost2=sum(C)-cost1
def changecost(mk,cost1,cost2):
costlist=[]
for i in range(n-1):
if i==0:
cost1i=cost1
cost2i=cost2
if (mk>>i)&1:
cost1i-=C[i]
cost2i+=C[i]
else:
cost1i+=C[i]
cost2i-=C[i]
costlist.append(cost1i)
costlist.append(cost2i)
return (min(costlist[1:]))
print(changecost(mask,cost1,cost2))
n=int(input())
S=str(input())
C=list(map(int,input().split()))
mask=0
for i in range(n):
if int(S[i])==i%2:
mask|=1<<i
cost1=sum(C[i] for i in range(n) if mask>>i&1)
cost2=sum(C)-cost1
def changecost(mk,cost1,cost2):
costlist=[]
for i in range(n-1):
if i==0:
cost1i=cost1
cost2i=cost2
if (mk>>i)&1:
cost1i-=C[i]
cost2i+=C[i]
else:
cost1i+=C[i]
cost2i-=C[i]
costlist.append(cost1i)
costlist.append(cost2i)
return (min(costlist))
print(changecost(mask,cost1,cost2))
|
ConDefects/ConDefects/Code/abc346_d/Python/54675380
|
condefects-python_data_171
|
N = int(input())
a = list(input())
a_cost = list(map(int,input().split())) + [0]
zo = [0 for _ in range(N)]
oz = [0 for _ in range(N)]
for an in range(N):
if a[an] == str(0 + an % 2):
zo[an] = zo[an -1]
oz[an] = oz[an -1] + a_cost[an]
elif a[an] == str((1 + an) % 2):
zo[an] = zo[an -1] + a_cost[an]
oz[an] = oz[an -1]
min_m = 10 ** 24
x = zo[-1]
y = oz[-1]
for n in range(N):
min_m = min(min_m, zo[n] -oz[n]+y, oz[n]-zo[n] +x)
print(min_m)
#print(zo,oz)
N = int(input())
a = list(input())
a_cost = list(map(int,input().split())) + [0]
zo = [0 for _ in range(N)]
oz = [0 for _ in range(N)]
for an in range(N):
if a[an] == str(0 + an % 2):
zo[an] = zo[an -1]
oz[an] = oz[an -1] + a_cost[an]
elif a[an] == str((1 + an) % 2):
zo[an] = zo[an -1] + a_cost[an]
oz[an] = oz[an -1]
min_m = 10 ** 24
x = zo[-1]
y = oz[-1]
for n in range(N-1):
min_m = min(min_m, zo[n] -oz[n]+y, oz[n]-zo[n] +x)
print(min_m)
#print(zo,oz)
|
ConDefects/ConDefects/Code/abc346_d/Python/55040229
|
condefects-python_data_172
|
n = int(input())
P = list(map(int,input().split()))
l = n - 2
r = n - 1
while P[l] < P[r] :
l -= 1
r -= 1
r = n - 1
while P[l] < P[r] :
r -= 1
P[l] , P[r] = P[r] , P[l]
L = P[: l + 1]
R = P[r - 1 :]
R = sorted(R , reverse = True)
print(*(L + R))
n = int(input())
P = list(map(int,input().split()))
l = n - 2
r = n - 1
while P[l] < P[r] :
l -= 1
r -= 1
r = n - 1
while P[l] < P[r] :
r -= 1
P[l] , P[r] = P[r] , P[l]
L = P[: l + 1]
R = P[l + 1 :]
R = sorted(R , reverse = True)
print(*(L + R))
|
ConDefects/ConDefects/Code/abc276_c/Python/52142770
|
condefects-python_data_173
|
N = int(input())
P = list(map(int, input().split()))
# どの桁から右を変更するか決め、変更する先頭を、最適なものに入れ替える
for i in range(1, N):
if P[-(i+1)] < min(P[-i:]):
continue
else:
mx = 0
for j, c in enumerate(P[-i:]):
if c < P[-(i+1)] and mx <c:
mx = c # P[-(i+1)]より小さい数の中で最大を探す
jj = j
P[-(i+1)], P[-(i-jj)] = P[-(i-jj)], P[-(i+1)] # 入れ替える
break
#変更する残りの数を最大に並べ直す。
Q = P[:-i] + sorted(P[-(i+1):], reverse=True)
print(*Q)
N = int(input())
P = list(map(int, input().split()))
# どの桁から右を変更するか決め、変更する先頭を、最適なものに入れ替える
for i in range(1, N):
if P[-(i+1)] < min(P[-i:]):
continue
else:
mx = 0
for j, c in enumerate(P[-i:]):
if c < P[-(i+1)] and mx <c:
mx = c # P[-(i+1)]より小さい数の中で最大を探す
jj = j
P[-(i+1)], P[-(i-jj)] = P[-(i-jj)], P[-(i+1)] # 入れ替える
break
#変更する残りの数を最大に並べ直す。
Q = P[:-i] + sorted(P[-i:], reverse=True)
print(*Q)
|
ConDefects/ConDefects/Code/abc276_c/Python/53488308
|
condefects-python_data_174
|
N = int(input())
P = list(map(int,input().split()))
for i in range(N):
if P[-i] > P[-i - 1]:
continue
else:
num = P[-i - 1]
a = i
break
A = P[N - a - 1:] # 変化させる部分
A.sort()
B = []
B.append(A[A.index(num) - 1]) # 変化する数字の一番左
A.pop(A.index(num) - 1)
A.sort(reverse=True) # Bの後ろは逆順
print(*P[:N - a - 1] + B + A)
N = int(input())
P = list(map(int,input().split()))
for i in range(1, N + 1):
if P[-i] > P[-i - 1]:
continue
else:
num = P[-i - 1]
a = i
break
A = P[N - a - 1:] # 変化させる部分
A.sort()
B = []
B.append(A[A.index(num) - 1]) # 変化する数字の一番左
A.pop(A.index(num) - 1)
A.sort(reverse=True) # Bの後ろは逆順
print(*P[:N - a - 1] + B + A)
|
ConDefects/ConDefects/Code/abc276_c/Python/54054587
|
condefects-python_data_175
|
T = int(input())
def compare(t1, t2):
length = min(len(t1), len(t2))
for i in range(length):
if t1[i] > t2[i]:
return False
if t1[i] < t2[i]:
return True
if len(t1) > len(t2):
return False
else:
return True
for i in range(T):
N = int(input())
S = input()
flag = False
for i in range(1, N):
tem1 = S[:i]
tem2 = S[i:]
if compare(tem1, tem2):
flag = True
break
if not flag:
print("No")
else:
print("Yes")
T = int(input())
def compare(t1, t2):
length = min(len(t1), len(t2))
for i in range(length):
if t1[i] > t2[i]:
return False
if t1[i] < t2[i]:
return True
if len(t1) >= len(t2):
return False
else:
return True
for i in range(T):
N = int(input())
S = input()
flag = False
for i in range(1, N):
tem1 = S[:i]
tem2 = S[i:]
if compare(tem1, tem2):
flag = True
break
if not flag:
print("No")
else:
print("Yes")
|
ConDefects/ConDefects/Code/arc163_a/Python/45954819
|
condefects-python_data_176
|
from collections import Counter
t=int(input())
for _ in range(t):
n=int(input())
s=list(input())
c=Counter(s)
s0=s[0]
if n==2:
s1=s[1]
if s0==s1 or s0>s1:
print('No')
continue
else:
print('Yes')
continue
for i in range(1,n):
ss=s[i]
if s0<ss or (s0==ss and s0<''.join(s[i:])):
print('Yes')
break
else:
print('No')
from collections import Counter
t=int(input())
for _ in range(t):
n=int(input())
s=list(input())
c=Counter(s)
s0=s[0]
if n==2:
s1=s[1]
if s0==s1 or s0>s1:
print('No')
continue
else:
print('Yes')
continue
for i in range(1,n):
ss=s[i]
if s0<ss or (s0==ss and ''.join(s[:i])<''.join(s[i:])):
print('Yes')
break
else:
print('No')
|
ConDefects/ConDefects/Code/arc163_a/Python/44208378
|
condefects-python_data_177
|
def solve():
n=int(input())
s=input()
for k in range(1,n):
flag = True
for i in range(min(k,n-k)):
if s[i]<s[k+i]:
print("Yes")
return
elif s[i]==s[k+i]:
continue
else:
flag = False
break
if flag and k<=n-k:
print("Yes")
return
print("No")
for i in range(int(input())):
solve()
def solve():
n=int(input())
s=input()
for k in range(1,n):
flag = True
for i in range(min(k,n-k)):
if s[i]<s[k+i]:
print("Yes")
return
elif s[i]==s[k+i]:
continue
else:
flag = False
break
if flag and k<n-k:
print("Yes")
return
print("No")
for i in range(int(input())):
solve()
|
ConDefects/ConDefects/Code/arc163_a/Python/45935608
|
condefects-python_data_178
|
import sys
from numba import njit, i4
input = sys.stdin.readline
def read():
return list(map(int, input().strip().split()))
t = int(input())
def solve():
n = int(input())
s = input().strip()
if max(s[1:]) > s[0]:
return 1
if max(s[1:]) < s[0]:
return 0
n = len(s)
z = [0] * n
r = l = 0
for i in range(1, n):
if i <= r:
z[i] = min(z[i - l], r - i + 1)
while i + z[i] < n and s[z[i]] == s[i + z[i]]:
z[i] += 1
if i + z[i] - 1 > r:
r = i + z[i] - 1
l = i
if z[i] < i and i + z[i] < n and s[i + z[i]] > s[z[i]] or z[i] > i or z[i] == i and (i+1) * 2 < n:
return 1
return 0
for _ in range(t):
if solve():
print("Yes")
else:
print("No")
import sys
from numba import njit, i4
input = sys.stdin.readline
def read():
return list(map(int, input().strip().split()))
t = int(input())
def solve():
n = int(input())
s = input().strip()
if max(s[1:]) > s[0]:
return 1
if max(s[1:]) < s[0]:
return 0
n = len(s)
z = [0] * n
r = l = 0
for i in range(1, n):
if i <= r:
z[i] = min(z[i - l], r - i + 1)
while i + z[i] < n and s[z[i]] == s[i + z[i]]:
z[i] += 1
if i + z[i] - 1 > r:
r = i + z[i] - 1
l = i
if z[i] < i and i + z[i] < n and s[i + z[i]] > s[z[i]] or z[i] > i or z[i] == i and i * 2 < n:
return 1
return 0
for _ in range(t):
if solve():
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/arc163_a/Python/46203182
|
condefects-python_data_179
|
def solve():
N = int(input())
S = input()
for i in range(1, N):
if S[0] < S[i]:
print('Yes')
return
print('No')
return
T = int(input())
for i in range(T):
solve()
def solve():
N = int(input())
S = input()
for i in range(1, N):
if S[0:i] < S[i:]:
print('Yes')
return
print('No')
return
T = int(input())
for i in range(T):
solve()
|
ConDefects/ConDefects/Code/arc163_a/Python/44094167
|
condefects-python_data_180
|
from collections import deque
t=int(input())
for i in range(t):
n=int(input())
s=list(map(str,input()))
s1,s2=s,deque()
tt=False
ss=True
for i in range(n-1):
s2.appendleft(s1[-1])
s1.pop()
for j in range(min(len(s1),len(s2))):
if ord(s1[j])<ord(s2[j]):
print("Yes")
tt=True
break
elif ord(s1[j])>ord(s2[j]):
ss=False
break
if not tt and ss and len(s1)<len(s2):
tt=True
print("Yes")
if tt:
break
if not tt:
print("No")
from collections import deque
t=int(input())
for i in range(t):
n=int(input())
s=list(map(str,input()))
s1,s2=s,deque()
tt=False
for i in range(n-1):
ss=True
s2.appendleft(s1[-1])
s1.pop()
for j in range(min(len(s1),len(s2))):
if ord(s1[j])<ord(s2[j]):
print("Yes")
tt=True
break
elif ord(s1[j])>ord(s2[j]):
ss=False
break
if not tt and ss and len(s1)<len(s2):
tt=True
print("Yes")
if tt:
break
if not tt:
print("No")
|
ConDefects/ConDefects/Code/arc163_a/Python/44822043
|
condefects-python_data_181
|
T = int(input())
for _ in range(T):
N = int(input())
S = input()
base = S[0]
isOk = False
for i in range(1,N):
if S[:i] <= S[i:]:
isOk = True
print("Yes")
break
if not isOk:
print("No")
T = int(input())
for _ in range(T):
N = int(input())
S = input()
base = S[0]
isOk = False
for i in range(1,N):
if S[:i] < S[i:]:
isOk = True
print("Yes")
break
if not isOk:
print("No")
|
ConDefects/ConDefects/Code/arc163_a/Python/45436271
|
condefects-python_data_182
|
T = int(input())
for i in range(T):
N = int(input())
S = input()
a = False
for j in range(1, N):
if S[0:j] < S[j]:
print("Yes")
a = True
break
elif S[0] == S[j]:
b = False
nex = 1
while not b:
nex += 1
if j + nex >= N:
break
if S[0:j] < S[j:j + nex]:
print("Yes")
a = True
b = True
if b:
break
if not a:
print("No")
T = int(input())
for i in range(T):
N = int(input())
S = input()
a = False
for j in range(1, N):
if S[0:j] < S[j]:
print("Yes")
a = True
break
elif S[0] == S[j]:
b = False
nex = 1
while not b:
nex += 1
if j + nex > N:
break
if S[0:j] < S[j:j + nex]:
print("Yes")
a = True
b = True
if b:
break
if not a:
print("No")
|
ConDefects/ConDefects/Code/arc163_a/Python/45308371
|
condefects-python_data_183
|
t=int(input())
for i in range(t):
input()
s=input()
cnt=0
for j in range(1,len(s)-1):
if s[j:]>s[:j]:
cnt=1
if cnt:print("Yes")
else:print("No")
t=int(input())
for i in range(t):
input()
s=input()
cnt=0
for j in range(1,len(s)):
if s[j:]>s[:j]:
cnt=1
if cnt:print("Yes")
else:print("No")
|
ConDefects/ConDefects/Code/arc163_a/Python/44451011
|
condefects-python_data_184
|
Q=int(input())
for _ in range(Q):
A=list(map(int,input().split()))
v=list(map(int,input().split()))
if v[4]<A[4]:
print('No')
continue
v[4]-=A[4]
A[4]=0
if v[3]+v[4]<A[3]:
print('No')
continue
if v[3]>=A[3]:
v[3]-=A[3]
A[3]=0
else:
A[3]-=v[3]
v[3]=0
v[0]+=A[3]
v[4]-=A[3]
A[3]=0
if v[2]+v[3]+v[4]<A[2]:
print('No')
continue
if v[2]>=A[2]:
v[2]-=A[2]
A[2]=0
else:
A[2]-=v[2]
v[2]=0
if v[4]>=A[2]:
v[1]+=A[2]
v[4]-=A[2]
A[2]=0
else:
v[1]+=v[4]
A[2]-=v[4]
v[4]=0
v[0]+=A[2]
v[3]-=A[2]
A[2]=0
n=2*(v[4]+v[3])+v[2]+v[1]
m=5*v[4]+4*v[3]+3*v[2]+2*v[1]+v[0]
if n>=A[1] and m>=A[0]:
print('Yes')
else:
print('No')
Q=int(input())
for _ in range(Q):
A=list(map(int,input().split()))
v=list(map(int,input().split()))
if v[4]<A[4]:
print('No')
continue
v[4]-=A[4]
A[4]=0
if v[3]+v[4]<A[3]:
print('No')
continue
if v[3]>=A[3]:
v[3]-=A[3]
A[3]=0
else:
A[3]-=v[3]
v[3]=0
v[0]+=A[3]
v[4]-=A[3]
A[3]=0
if v[2]+v[3]+v[4]<A[2]:
print('No')
continue
if v[2]>=A[2]:
v[2]-=A[2]
A[2]=0
else:
A[2]-=v[2]
v[2]=0
if v[4]>=A[2]:
v[1]+=A[2]
v[4]-=A[2]
A[2]=0
else:
v[1]+=v[4]
A[2]-=v[4]
v[4]=0
v[0]+=A[2]
v[3]-=A[2]
A[2]=0
n=2*(v[4]+v[3])+v[2]+v[1]
m=5*v[4]+4*v[3]+3*v[2]+2*v[1]+v[0]
if n>=A[1] and m>=2*A[1]+A[0]:
print('Yes')
else:
print('No')
|
ConDefects/ConDefects/Code/abc226_g/Python/48936036
|
condefects-python_data_185
|
Q=int(input())
for _ in range(Q):
A=list(map(int,input().split()))
B=list(map(int,input().split()))
if B[4]<A[4]:
print('No')
continue
B[4]-=A[4]
A[4]=0
if A[3]>B[3]+B[4]:
print('No')
continue
if B[3]>A[3]:
B[3]-=A[3]
A[3]=0
else:
A[3]-=B[3]
B[3]=0
B[4]-=A[3]
B[0]+=A[3]
if A[2]>B[2]+B[3]+B[4]:
print('No')
continue
if B[2]>A[2]:
B[2]-=A[2]
A[2]=0
else:
A[2]-=B[2]
B[2]=0
if B[4]>A[2]:
B[4]-=A[2]
B[1]+=A[2]
A[2]=0
else:
A[2]-=B[4]
B[1]+=B[4]
B[4]=0
B[3]-=A[2]
A[0]+=A[2]
if A[1]>B[1]+B[2]+2*B[3]+2*B[4]:
print('No')
continue
if A[0]+2*A[1]>B[0]+2*B[1]+3*B[2]+4*B[3]+5*B[4]:
print('No')
else:
print('Yes')
Q=int(input())
for _ in range(Q):
A=list(map(int,input().split()))
B=list(map(int,input().split()))
if B[4]<A[4]:
print('No')
continue
B[4]-=A[4]
A[4]=0
if A[3]>B[3]+B[4]:
print('No')
continue
if B[3]>A[3]:
B[3]-=A[3]
A[3]=0
else:
A[3]-=B[3]
B[3]=0
B[4]-=A[3]
B[0]+=A[3]
if A[2]>B[2]+B[3]+B[4]:
print('No')
continue
if B[2]>A[2]:
B[2]-=A[2]
A[2]=0
else:
A[2]-=B[2]
B[2]=0
if B[4]>A[2]:
B[4]-=A[2]
B[1]+=A[2]
A[2]=0
else:
A[2]-=B[4]
B[1]+=B[4]
B[4]=0
B[3]-=A[2]
B[0]+=A[2]
if A[1]>B[1]+B[2]+2*B[3]+2*B[4]:
print('No')
continue
if A[0]+2*A[1]>B[0]+2*B[1]+3*B[2]+4*B[3]+5*B[4]:
print('No')
else:
print('Yes')
|
ConDefects/ConDefects/Code/abc226_g/Python/52807136
|
condefects-python_data_186
|
import sys
readline=sys.stdin.readline
T=int(readline())
for t in range(T):
A=list(map(int,readline().split()))
B=list(map(int,readline().split()))
ans="Yes"
if A[4]>B[4]:
ans="No"
B[4]-=A[4]
mi=min(A[3],B[3])
A[3]-=mi
B[3]-=mi
if A[3]>B[4]:
ans="No"
B[4]-=A[3]
B[0]+=A[3]
mi=min(A[2],B[2])
A[2]-=mi
B[2]-=mi
mi=min(A[2],B[4])
A[2]-=mi
B[4]-=mi
B[1]+=mi
if A[2]>B[3]:
ans="No"
B[3]-=A[2]
B[0]+=A[2]
if A[1]>B[1]+B[2]+B[3]//2+B[4]//2 or A[0]+2*A[1]>B[0]+2*B[1]+3*B[2]+4*B[3]+5*B[4]:
ans="No"
print(ans)
import sys
readline=sys.stdin.readline
T=int(readline())
for t in range(T):
A=list(map(int,readline().split()))
B=list(map(int,readline().split()))
ans="Yes"
if A[4]>B[4]:
ans="No"
B[4]-=A[4]
mi=min(A[3],B[3])
A[3]-=mi
B[3]-=mi
if A[3]>B[4]:
ans="No"
B[4]-=A[3]
B[0]+=A[3]
mi=min(A[2],B[2])
A[2]-=mi
B[2]-=mi
mi=min(A[2],B[4])
A[2]-=mi
B[4]-=mi
B[1]+=mi
if A[2]>B[3]:
ans="No"
B[3]-=A[2]
B[0]+=A[2]
if A[1]>B[1]+B[2]+B[3]*2+B[4]*2 or A[0]+2*A[1]>B[0]+2*B[1]+3*B[2]+4*B[3]+5*B[4]:
ans="No"
print(ans)
|
ConDefects/ConDefects/Code/abc226_g/Python/48239634
|
condefects-python_data_187
|
from collections import Counter
mod = 998244353
n,k = map(int,input().split())
a = list(map(int,input().split()))
a_c = Counter(a)
v = [0] * (n+1)
for i, c in a_c.items():
v[c] += 1
for i in range(n-1,0,-1):
v[i] += v[i+1]
dp = [[0] * (n+1) for i in range(n+1)]
dp[0][1] = 1
i = 1
for g in range(1, n+1):
l = v[g]
for s in range(l):
for j in range(1, n+1):
dp[i][j] = ((j+(g>1)) * dp[i-1][j] + (i-j+(g==1)) * dp[i-1][j-1]) % mod
i += 1
print(dp[n][k+1])
from collections import Counter
mod = 998244353
n,k = map(int,input().split())
a = list(map(int,input().split()))
a_c = Counter(a)
v = [0] * (n+1)
for i, c in a_c.items():
v[c] += 1
for i in range(n-1,0,-1):
v[i] += v[i+1]
dp = [[0] * (n+1) for i in range(n+1)]
dp[0][1] = 1
i = 1
for g in range(1, n+1):
l = v[g]
for s in range(l):
for j in range(1, n+1):
dp[i][j] = ((j-1+g) * dp[i-1][j] + (i-j+2-g) * dp[i-1][j-1]) % mod
i += 1
print(dp[n][k+1])
|
ConDefects/ConDefects/Code/abc267_g/Python/35931814
|
condefects-python_data_188
|
import bisect
import collections
import functools
import heapq
import itertools
import math
import operator
import string
import sys
readline = sys.stdin.readline
LS = lambda: readline().strip()
LI = lambda: int(readline().strip())
LLS = lambda: readline().strip().split()
LL = lambda: list(map(int, readline().strip().split()))
LLMI = lambda: list(map((1).__rsub__, LL()))
a, b, C = LL()
c = C.bit_count()
xyz2 = a + b + c
if xyz2 % 2 == 1:
print(-1)
quit()
xyz = xyz2 // 2
x = xyz - b
y = xyz - c
z = xyz - a
if x < 0 or y < 0 or z < 0:
print(-1)
quit()
mask1 = 0
mask2 = C
for _ in range(x):
mask1 += mask2 & -mask2
mask2 -= mask2 & -mask2
mask3 = 0
for i in range(60):
if (mask1 >> i & 1 == 0) and (mask2 >> i & 1 == 0):
if mask3.bit_count() < y:
mask3 |= 1 << i
else:
break
mask1 |= mask3
mask2 |= mask3
if mask1 >= (1 << 60) or mask2 >= (1 << 60):
print(-1)
quit()
print(mask1, mask2)
import bisect
import collections
import functools
import heapq
import itertools
import math
import operator
import string
import sys
readline = sys.stdin.readline
LS = lambda: readline().strip()
LI = lambda: int(readline().strip())
LLS = lambda: readline().strip().split()
LL = lambda: list(map(int, readline().strip().split()))
LLMI = lambda: list(map((1).__rsub__, LL()))
a, b, C = LL()
c = C.bit_count()
xyz2 = a + b + c
if xyz2 % 2 == 1:
print(-1)
quit()
xyz = xyz2 // 2
x = xyz - b
y = xyz - c
z = xyz - a
if x < 0 or y < 0 or z < 0:
print(-1)
quit()
mask1 = 0
mask2 = C
for _ in range(x):
mask1 += mask2 & -mask2
mask2 -= mask2 & -mask2
mask3 = 0
for i in range(60):
if (mask1 >> i & 1 == 0) and (mask2 >> i & 1 == 0):
if mask3.bit_count() < y:
mask3 |= 1 << i
else:
break
mask1 |= mask3
mask2 |= mask3
if mask1.bit_count() != a or mask2.bit_count() != b:
print(-1)
quit()
print(mask1, mask2)
|
ConDefects/ConDefects/Code/abc347_d/Python/55147936
|
condefects-python_data_189
|
a,b,C=map(int,input().split())
rev=False
if a<b:
a,b=b,a
rev=True
s=bin(C)
S=s[2:]
N=len(S)
A=0
B=0
bit=[]
for i in range(N):
j=N-1-i
if S[j]=='1':
bit.append(i)
if a-b>len(bit) or (a-b)%2!=len(bit)%2:
exit(print(-1))
cnt=len(bit)
d=a-b
base=b-(cnt-d)//2
next=False
for i in range(60):
if not i in bit:
if base>0:
if a==0 or b==0:
exit(print(-1))
A+=2**i
B+=2**i
base-=1
a-=1
else:
if d>0:
if a==0:
exit(print(-1))
A+=2**i
d-=1
a-=1
else:
if next:
if b==0:
exit(print(-1))
B+=2**i
next=False
b-=1
else:
if a==0:
exit(print(-1))
A+=2**i
next=True
a-=1
if rev:
print(B,A)
else:
print(A,B)
a,b,C=map(int,input().split())
rev=False
if a<b:
a,b=b,a
rev=True
s=bin(C)
S=s[2:]
N=len(S)
A=0
B=0
bit=[]
for i in range(N):
j=N-1-i
if S[j]=='1':
bit.append(i)
if a-b>len(bit) or (a-b)%2!=len(bit)%2 or a+b>120-len(bit):
exit(print(-1))
cnt=len(bit)
d=a-b
base=b-(cnt-d)//2
next=False
for i in range(60):
if not i in bit:
if base>0:
if a==0 or b==0:
exit(print(-1))
A+=2**i
B+=2**i
base-=1
a-=1
else:
if d>0:
if a==0:
exit(print(-1))
A+=2**i
d-=1
a-=1
else:
if next:
if b==0:
exit(print(-1))
B+=2**i
next=False
b-=1
else:
if a==0:
exit(print(-1))
A+=2**i
next=True
a-=1
if rev:
print(B,A)
else:
print(A,B)
|
ConDefects/ConDefects/Code/abc347_d/Python/54756307
|
condefects-python_data_190
|
a,b,c = map(int, input().split())
cbit = []
popcount = 0
for i in range(60):
if c & 1<<i != 0:
cbit.append(1)
popcount += 1
else:
cbit.append(0)
# print(cbit,popcount)
if a+b >= popcount and (a+b)%2 == popcount%2:
d = (a+b-popcount)//2
if a-d < 0 or b-d < 0:
print(-1)
elif a+b+c > 120:
print(-1)
else:
# print(a,b,d)
ansa = 0
ansb = 0
acount = 0
dcount = 0
flag = True
if a-d == 0:
flag = False
flag2 = True
if d == 0:
flag2 = False
for i,ibit in enumerate(cbit):
if ibit == 1:
if flag:
ansa += 1<<i
acount += 1
if acount == a-d:
flag = False
else:
ansb += 1<<i
else:
if flag2:
ansa += 1<<i
ansb += 1<<i
dcount += 1
if dcount == d:
flag2 = False
print(ansa,ansb)
# print(ansa.bit_count(),ansb.bit_count(),ansa^ansb)
else:
print(-1)
a,b,c = map(int, input().split())
cbit = []
popcount = 0
for i in range(60):
if c & 1<<i != 0:
cbit.append(1)
popcount += 1
else:
cbit.append(0)
# print(cbit,popcount)
if a+b >= popcount and (a+b)%2 == popcount%2:
d = (a+b-popcount)//2
if a-d < 0 or b-d < 0:
print(-1)
elif a+b+popcount > 120:
print(-1)
else:
# print(a,b,d)
ansa = 0
ansb = 0
acount = 0
dcount = 0
flag = True
if a-d == 0:
flag = False
flag2 = True
if d == 0:
flag2 = False
for i,ibit in enumerate(cbit):
if ibit == 1:
if flag:
ansa += 1<<i
acount += 1
if acount == a-d:
flag = False
else:
ansb += 1<<i
else:
if flag2:
ansa += 1<<i
ansb += 1<<i
dcount += 1
if dcount == d:
flag2 = False
print(ansa,ansb)
# print(ansa.bit_count(),ansb.bit_count(),ansa^ansb)
else:
print(-1)
|
ConDefects/ConDefects/Code/abc347_d/Python/54755669
|
condefects-python_data_191
|
a, b, C = map(int, input().split())
def popcount(X, digit):
ret = 0
for i in range(digit):
if (1 << i & X):
ret += 1
return(ret)
c = popcount(C, 60)
if a + b + c > 120 or (a + b + c) % 2 == 1:
print(-1)
exit()
if a > b + c or b > a + c or c > a + b:
print(-1)
exit()
n00 = 60 - (a + b + c) // 2
n01 = (-a + b + c) // 2
n10 = (a - b + c) // 2
n11 = (a + b - c) // 2
X = ['0'] * 60
Y = ['0'] * 60
for i in range(60):
if (1 << i & C):
if n10 > 0:
X[59 - i] = '1'
n10 -= 1
else:
Y[59 - i] = '1'
n01 -= 1
else:
if n11 > 0:
X[59 - i] = '1'
Y[59 - i] = '1'
n11 -= 1
else:
n00 -= 1
print(int(('').join(map(str, X))), int(('').join(map(str, Y))))
a, b, C = map(int, input().split())
def popcount(X, digit):
ret = 0
for i in range(digit):
if (1 << i & X):
ret += 1
return(ret)
c = popcount(C, 60)
if a + b + c > 120 or (a + b + c) % 2 == 1:
print(-1)
exit()
if a > b + c or b > a + c or c > a + b:
print(-1)
exit()
n00 = 60 - (a + b + c) // 2
n01 = (-a + b + c) // 2
n10 = (a - b + c) // 2
n11 = (a + b - c) // 2
X = ['0'] * 60
Y = ['0'] * 60
for i in range(60):
if (1 << i & C):
if n10 > 0:
X[59 - i] = '1'
n10 -= 1
else:
Y[59 - i] = '1'
n01 -= 1
else:
if n11 > 0:
X[59 - i] = '1'
Y[59 - i] = '1'
n11 -= 1
else:
n00 -= 1
print(int(('').join(map(str, X)), 2), int(('').join(map(str, Y)), 2))
|
ConDefects/ConDefects/Code/abc347_d/Python/55134495
|
condefects-python_data_192
|
n = int(input())
s = input()
t = input()
a = []
for i in range(n):
if s[i] != t[i]:
if t[i] == "A":
a.append(0)
else:
a.append(1)
ans = 0
left = 0
right = 0
need = 0
for i in a:
if i == 0:
left += 1
else:
right += 1
if left < right:
need += 1
right -= 1
else:
ans += 1
left -= 1
right -= 1
# print(a)
before_A = False
last_B = False
for i in range(n):
if s[i] == "A" and t[i] == "B" and before_A is False:
print(-1)
exit()
if s[i] == "A":
before_A = True
if s[i] == "B" and t[i] == "A":
last_B = True
if t[i] == "B":
last_B = False
if last_B:
print(-1)
exit()
print(ans + left + right + need)
n = int(input())
s = input()
t = input()
a = []
for i in range(n):
if s[i] != t[i]:
if t[i] == "A":
a.append(0)
else:
a.append(1)
ans = 0
left = 0
right = 0
need = 0
for i in a:
if i == 0:
left += 1
else:
right += 1
if left < right:
need += 1
right -= 1
else:
ans += 1
left -= 1
right -= 1
# print(a)
before_A = False
last_B = False
for i in range(n):
if s[i] == "A" and t[i] == "B" and before_A is False:
print(-1)
exit()
if t[i] == "A":
before_A = True
if s[i] == "B" and t[i] == "A":
last_B = True
if t[i] == "B":
last_B = False
if last_B:
print(-1)
exit()
print(ans + left + right + need)
|
ConDefects/ConDefects/Code/arc170_a/Python/54960940
|
condefects-python_data_193
|
N, M = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(N)]
Asum = [[0]*M for _ in range(N)]
for i in range(N):
Asum[i][0] = A[i][0]
for j in range(1, M):
Asum[i][j] = Asum[i][j-1] + A[i][j]
if i > 0:
for j in range(M):
Asum[i][j] += Asum[i-1][j]
ans = 0
for m in range(1, 6): # 最小値
histo = [0]*M
for imax in range(N):
for j in range(M):
if A[imax][j] < m:
histo[j] = 0
else:
histo[j] += 1
lr = [[j, j] for j in range(M)]
left = [(-1, -1)] # (hight, id)
for j in range(M):
while left[-1][0] >= histo[j]:
left.pop()
lr[j][0] = left[-1][1]
left.append((histo[j], j))
right = [(-1, M)]
for j in range(M)[::-1]:
while right[-1][0] >= histo[j]:
right.pop()
lr[j][1] = right[-1][1] - 1
right.append((histo[j], j))
for j in range(M):
if histo[j] > 0:
l, r = lr[j]
u = imax - histo[j]
sum = Asum[imax][r]
if l >= 0:
sum -= Asum[imax][l]
if u >= 0:
sum += Asum[u][l]
if u >= 0:
sum -= Asum[u][r]
ans = max(ans, sum*m)
print(ans)
N, M = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(N)]
Asum = [[0]*M for _ in range(N)]
for i in range(N):
Asum[i][0] = A[i][0]
for j in range(1, M):
Asum[i][j] = Asum[i][j-1] + A[i][j]
if i > 0:
for j in range(M):
Asum[i][j] += Asum[i-1][j]
ans = 0
for m in range(1, 301): # 最小値
histo = [0]*M
for imax in range(N):
for j in range(M):
if A[imax][j] < m:
histo[j] = 0
else:
histo[j] += 1
lr = [[j, j] for j in range(M)]
left = [(-1, -1)] # (hight, id)
for j in range(M):
while left[-1][0] >= histo[j]:
left.pop()
lr[j][0] = left[-1][1]
left.append((histo[j], j))
right = [(-1, M)]
for j in range(M)[::-1]:
while right[-1][0] >= histo[j]:
right.pop()
lr[j][1] = right[-1][1] - 1
right.append((histo[j], j))
for j in range(M):
if histo[j] > 0:
l, r = lr[j]
u = imax - histo[j]
sum = Asum[imax][r]
if l >= 0:
sum -= Asum[imax][l]
if u >= 0:
sum += Asum[u][l]
if u >= 0:
sum -= Asum[u][r]
ans = max(ans, sum*m)
print(ans)
|
ConDefects/ConDefects/Code/abc311_g/Python/43899768
|
condefects-python_data_194
|
import sys
# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = -1-(-1 << 31)
# inf = -1-(-1 << 62)
# md = 10**9+7
md = 998244353
def z_algorithm(target):
len_t = len(target)
lcp = [-1]*len_t
top = 1
right = 0
lcp[0] = 0
while top < len_t:
while top+right < len_t and target[right] == target[top+right]:
right += 1
lcp[top] = right
left = 1
if right == 0:
top += 1
continue
while left+lcp[left] < right and left < right:
lcp[top+left] = lcp[left]
left += 1
top += left
right -= left
return lcp
n=II()
ss=[[ord(c) for c in SI()] for _ in range(n)]
cost=[[-1]*n for _ in range(n)]
rem=set()
for i in range(n):
if i in rem:continue
s=ss[i]
for j in range(n):
if i==j:continue
if j in rem:continue
t=ss[j]
cost[i][j]=len(t)
lcp=z_algorithm(t+[0]+s)
for k in range(len(t)+1,len(lcp)):
if lcp[k]==len(t):
rem.add(j)
break
if k+lcp[k]==len(lcp):
cost[i][j]=len(t)-lcp[k]
break
rem=sorted(rem,reverse=True)
for i in rem:
cost.pop(i)
n-=1
for i in range(n):
for j in rem:cost[i].pop(j)
def chmin(i,j,val):
if val<dp[i][j]:dp[i][j]=val
dp=[[inf]*n for _ in range(1<<n)]
for i in range(n):dp[1<<i][i]=len(ss[i])
for s in range(1,1<<n):
for i in range(n):
pre=dp[s][i]
if pre==inf:continue
for j in range(n):
if s>>j&1:continue
ns=s|1<<j
chmin(ns,j,pre+cost[i][j])
print(min(dp[-1]))
import sys
# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = -1-(-1 << 31)
# inf = -1-(-1 << 62)
# md = 10**9+7
md = 998244353
def z_algorithm(target):
len_t = len(target)
lcp = [-1]*len_t
top = 1
right = 0
lcp[0] = 0
while top < len_t:
while top+right < len_t and target[right] == target[top+right]:
right += 1
lcp[top] = right
left = 1
if right == 0:
top += 1
continue
while left+lcp[left] < right and left < right:
lcp[top+left] = lcp[left]
left += 1
top += left
right -= left
return lcp
n=II()
ss=[[ord(c) for c in SI()] for _ in range(n)]
cost=[[-1]*n for _ in range(n)]
rem=set()
for i in range(n):
if i in rem:continue
s=ss[i]
for j in range(n):
if i==j:continue
if j in rem:continue
t=ss[j]
cost[i][j]=len(t)
lcp=z_algorithm(t+[0]+s)
for k in range(len(t)+1,len(lcp)):
if lcp[k]==len(t):
rem.add(j)
break
if k+lcp[k]==len(lcp):
cost[i][j]=len(t)-lcp[k]
break
rem=sorted(rem,reverse=True)
for i in rem:
ss.pop(i)
cost.pop(i)
n-=1
for i in range(n):
for j in rem:cost[i].pop(j)
# p2D(cost)
def chmin(i,j,val):
if val<dp[i][j]:dp[i][j]=val
dp=[[inf]*n for _ in range(1<<n)]
for i in range(n):dp[1<<i][i]=len(ss[i])
for s in range(1,1<<n):
for i in range(n):
pre=dp[s][i]
if pre==inf:continue
for j in range(n):
if s>>j&1:continue
ns=s|1<<j
chmin(ns,j,pre+cost[i][j])
print(min(dp[-1]))
|
ConDefects/ConDefects/Code/abc343_g/Python/51192628
|
condefects-python_data_195
|
import bisect, collections, copy, heapq, itertools, math, string
import random
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
from collections import deque
from collections import Counter
from collections import defaultdict
import bisect
from functools import reduce
from functools import lru_cache
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD99 = 998244353
INF = 10 ** 7
class string:
def sa_is(s,upper):
n=len(s)
if n==0:
return []
if n==1:
return [0]
if n==2:
if (s[0]<s[1]):
return [0,1]
else:
return [1,0]
sa=[0]*n
ls=[0]*n
for i in range(n-2,-1,-1):
ls[i]=ls[i+1] if (s[i]==s[i+1]) else (s[i]<s[i+1])
sum_l=[0]*(upper+1)
sum_s=[0]*(upper+1)
for i in range(n):
if not(ls[i]):
sum_s[s[i]]+=1
else:
sum_l[s[i]+1]+=1
for i in range(upper+1):
sum_s[i]+=sum_l[i]
if i<upper:
sum_l[i+1]+=sum_s[i]
def induce(lms):
for i in range(n):
sa[i]=-1
buf=sum_s[:]
for d in lms:
if d==n:
continue
sa[buf[s[d]]]=d
buf[s[d]]+=1
buf=sum_l[:]
sa[buf[s[n-1]]]=n-1
buf[s[n-1]]+=1
for i in range(n):
v=sa[i]
if v>=1 and not(ls[v-1]):
sa[buf[s[v-1]]]=v-1
buf[s[v-1]]+=1
buf=sum_l[:]
for i in range(n-1,-1,-1):
v=sa[i]
if v>=1 and ls[v-1]:
buf[s[v-1]+1]-=1
sa[buf[s[v-1]+1]]=v-1
lms_map=[-1]*(n+1)
m=0
for i in range(1,n):
if not(ls[i-1]) and ls[i]:
lms_map[i]=m
m+=1
lms=[]
for i in range(1,n):
if not(ls[i-1]) and ls[i]:
lms.append(i)
induce(lms)
if m:
sorted_lms=[]
for v in sa:
if lms_map[v]!=-1:
sorted_lms.append(v)
rec_s=[0]*m
rec_upper=0
rec_s[lms_map[sorted_lms[0]]]=0
for i in range(1,m):
l=sorted_lms[i-1]
r=sorted_lms[i]
end_l=lms[lms_map[l]+1] if (lms_map[l]+1<m) else n
end_r=lms[lms_map[r]+1] if (lms_map[r]+1<m) else n
same=True
if end_l-l!=end_r-r:
same=False
else:
while(l<end_l):
if s[l]!=s[r]:
break
l+=1
r+=1
if (l==n) or (s[l]!=s[r]):
same=False
if not(same):
rec_upper+=1
rec_s[lms_map[sorted_lms[i]]]=rec_upper
rec_sa=string.sa_is(rec_s,rec_upper)
for i in range(m):
sorted_lms[i]=lms[rec_sa[i]]
induce(sorted_lms)
return sa
def suffix_array_upper(s,upper):
assert 0<=upper
for d in s:
assert 0<=d and d<=upper
return string.sa_is(s,upper)
def suffix_array(s):
n=len(s)
if type(s)==str:
s2=[ord(i) for i in s]
return string.sa_is(s2,255)
else:
idx=list(range(n))
idx.sort(key=lambda x:s[x])
s2=[0]*n
now=0
for i in range(n):
if (i& s[idx[i-1]]!=s[idx[i]]):
now+=1
s2[idx[i]]=now
return string.sa_is(s2,now)
def lcp_array(s,sa):
n=len(s)
assert n>=1
rnk=[0]*n
for i in range(n):
rnk[sa[i]]=i
lcp=[0]*(n-1)
h=0
for i in range(n):
if h>0:
h-=1
if rnk[i]==0:
continue
j=sa[rnk[i]-1]
while(j+h<n and i+h<n):
if s[j+h]!=s[i+h]:
break
h+=1
lcp[rnk[i]-1]=h
return lcp
def z_algorithm(s):
n=len(s)
if n==0:
return []
z=[0]*n
i=1;j=0
while(i<n):
z[i]=0 if (j+z[j]<=i) else min(j+z[j]-i,z[i-j])
while((i+z[i]<n) and (s[z[i]]==s[i+z[i]])):
z[i]+=1
if (j+z[j]<i+z[i]):
j=i
i+=1
z[0]=n
return z
def main():
N = I()
words = []
for i in range(N):
w = S()
words.append(w)
ban = set()
for i in range(N):
for j in range(N):
if i == j:
continue
T1, T2 = words[i], words[j]
if T1 in T2:
ban.add(T1)
for b in ban:
words.remove(b)
N = len(words)
uncommon = [[0] * N for _ in range(N)]
for i in range(N):
for j in range(N):
if i == j:
continue
T1,T2 = words[i], words[j]
T = T2 + T1
common = 0
TZ = string.z_algorithm(T)
for k in range(len(T2), len(T2) + len(T1)):
nowco = TZ[k]
if nowco == len(T2) + len(T1) - k:
common = max(nowco, common)
uncommon[i][j] = len(T2) - common
dp = [[INF] * N for _ in range(1 << N)]
for i in range(N):
dp[1<<i][i] = len(words[i])
for s in range(1 << N):
for now in range(N):
if not s >> now & 1:
continue
for goto in range(N):
if s >> goto & 1:
continue
s_goto = s | (1 << goto)
dp[s_goto][goto] = min(dp[s_goto][goto], dp[s][now] + uncommon[now][goto])
print(min(dp[(1<<N)-1]))
if __name__ == "__main__":
main()
import bisect, collections, copy, heapq, itertools, math, string
import random
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
from collections import deque
from collections import Counter
from collections import defaultdict
import bisect
from functools import reduce
from functools import lru_cache
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD99 = 998244353
INF = 10 ** 7
class string:
def sa_is(s,upper):
n=len(s)
if n==0:
return []
if n==1:
return [0]
if n==2:
if (s[0]<s[1]):
return [0,1]
else:
return [1,0]
sa=[0]*n
ls=[0]*n
for i in range(n-2,-1,-1):
ls[i]=ls[i+1] if (s[i]==s[i+1]) else (s[i]<s[i+1])
sum_l=[0]*(upper+1)
sum_s=[0]*(upper+1)
for i in range(n):
if not(ls[i]):
sum_s[s[i]]+=1
else:
sum_l[s[i]+1]+=1
for i in range(upper+1):
sum_s[i]+=sum_l[i]
if i<upper:
sum_l[i+1]+=sum_s[i]
def induce(lms):
for i in range(n):
sa[i]=-1
buf=sum_s[:]
for d in lms:
if d==n:
continue
sa[buf[s[d]]]=d
buf[s[d]]+=1
buf=sum_l[:]
sa[buf[s[n-1]]]=n-1
buf[s[n-1]]+=1
for i in range(n):
v=sa[i]
if v>=1 and not(ls[v-1]):
sa[buf[s[v-1]]]=v-1
buf[s[v-1]]+=1
buf=sum_l[:]
for i in range(n-1,-1,-1):
v=sa[i]
if v>=1 and ls[v-1]:
buf[s[v-1]+1]-=1
sa[buf[s[v-1]+1]]=v-1
lms_map=[-1]*(n+1)
m=0
for i in range(1,n):
if not(ls[i-1]) and ls[i]:
lms_map[i]=m
m+=1
lms=[]
for i in range(1,n):
if not(ls[i-1]) and ls[i]:
lms.append(i)
induce(lms)
if m:
sorted_lms=[]
for v in sa:
if lms_map[v]!=-1:
sorted_lms.append(v)
rec_s=[0]*m
rec_upper=0
rec_s[lms_map[sorted_lms[0]]]=0
for i in range(1,m):
l=sorted_lms[i-1]
r=sorted_lms[i]
end_l=lms[lms_map[l]+1] if (lms_map[l]+1<m) else n
end_r=lms[lms_map[r]+1] if (lms_map[r]+1<m) else n
same=True
if end_l-l!=end_r-r:
same=False
else:
while(l<end_l):
if s[l]!=s[r]:
break
l+=1
r+=1
if (l==n) or (s[l]!=s[r]):
same=False
if not(same):
rec_upper+=1
rec_s[lms_map[sorted_lms[i]]]=rec_upper
rec_sa=string.sa_is(rec_s,rec_upper)
for i in range(m):
sorted_lms[i]=lms[rec_sa[i]]
induce(sorted_lms)
return sa
def suffix_array_upper(s,upper):
assert 0<=upper
for d in s:
assert 0<=d and d<=upper
return string.sa_is(s,upper)
def suffix_array(s):
n=len(s)
if type(s)==str:
s2=[ord(i) for i in s]
return string.sa_is(s2,255)
else:
idx=list(range(n))
idx.sort(key=lambda x:s[x])
s2=[0]*n
now=0
for i in range(n):
if (i& s[idx[i-1]]!=s[idx[i]]):
now+=1
s2[idx[i]]=now
return string.sa_is(s2,now)
def lcp_array(s,sa):
n=len(s)
assert n>=1
rnk=[0]*n
for i in range(n):
rnk[sa[i]]=i
lcp=[0]*(n-1)
h=0
for i in range(n):
if h>0:
h-=1
if rnk[i]==0:
continue
j=sa[rnk[i]-1]
while(j+h<n and i+h<n):
if s[j+h]!=s[i+h]:
break
h+=1
lcp[rnk[i]-1]=h
return lcp
def z_algorithm(s):
n=len(s)
if n==0:
return []
z=[0]*n
i=1;j=0
while(i<n):
z[i]=0 if (j+z[j]<=i) else min(j+z[j]-i,z[i-j])
while((i+z[i]<n) and (s[z[i]]==s[i+z[i]])):
z[i]+=1
if (j+z[j]<i+z[i]):
j=i
i+=1
z[0]=n
return z
def main():
N = I()
words = []
for i in range(N):
w = S()
words.append(w)
words = list(set(words))
N = len(words)
ban = set()
for i in range(N):
for j in range(N):
if i == j:
continue
T1, T2 = words[i], words[j]
if T1 in T2:
ban.add(T1)
for b in ban:
words.remove(b)
N = len(words)
uncommon = [[0] * N for _ in range(N)]
for i in range(N):
for j in range(N):
if i == j:
continue
T1,T2 = words[i], words[j]
T = T2 + T1
common = 0
TZ = string.z_algorithm(T)
for k in range(len(T2), len(T2) + len(T1)):
nowco = TZ[k]
if nowco == len(T2) + len(T1) - k:
common = max(nowco, common)
uncommon[i][j] = len(T2) - common
dp = [[INF] * N for _ in range(1 << N)]
for i in range(N):
dp[1<<i][i] = len(words[i])
for s in range(1 << N):
for now in range(N):
if not s >> now & 1:
continue
for goto in range(N):
if s >> goto & 1:
continue
s_goto = s | (1 << goto)
dp[s_goto][goto] = min(dp[s_goto][goto], dp[s][now] + uncommon[now][goto])
print(min(dp[(1<<N)-1]))
if __name__ == "__main__":
main()
|
ConDefects/ConDefects/Code/abc343_g/Python/50999715
|
condefects-python_data_196
|
def fatores_primos(n):
dois = 0
tres = 0
while n % 2 == 0:
dois += 1
n //= 2
while n % 3 == 0:
tres += 1
n //= 3
return dois, tres, n
t = int(input())
entrada = list(map(int, input().split()))
lista = []
for e in entrada:
lista.append(fatores_primos(e))
menor_x = float('inf')
menor_y = float('inf')
r = lista[0][2]
v = 1
for tupla in lista:
if tupla[2] != r:
v = 0
break
if tupla[0] < menor_x:
menor_x = tupla[0]
if tupla[1] < menor_y:
menor_y = tupla[1]
if not v:
print(-1)
else:
cont = 0
for tupla in lista:
if tupla[0] > menor_x:
cont += tupla[0] - menor_x
elif tupla[1] > menor_y:
cont += tupla[1] - menor_y
print(cont)
def fatores_primos(n):
dois = 0
tres = 0
while n % 2 == 0:
dois += 1
n //= 2
while n % 3 == 0:
tres += 1
n //= 3
return dois, tres, n
t = int(input())
entrada = list(map(int, input().split()))
lista = []
for e in entrada:
lista.append(fatores_primos(e))
menor_x = float('inf')
menor_y = float('inf')
r = lista[0][2]
v = 1
for tupla in lista:
if tupla[2] != r:
v = 0
break
if tupla[0] < menor_x:
menor_x = tupla[0]
if tupla[1] < menor_y:
menor_y = tupla[1]
if not v:
print(-1)
else:
cont = 0
for tupla in lista:
if tupla[0] > menor_x:
cont += tupla[0] - menor_x
if tupla[1] > menor_y:
cont += tupla[1] - menor_y
print(cont)
|
ConDefects/ConDefects/Code/abc276_d/Python/45111251
|
condefects-python_data_197
|
# import系 ---
from math import gcd
# 入力用 ---
INT = lambda: int(input())
MI = lambda: map(int, input().split())
MI_DEC = lambda: map(lambda x: int(x) - 1, input().split())
LI = lambda: list(map(int, input().split()))
LS = lambda: input().split()
# リストの最大公約数 ---
def gcd_all(li):
g = li[0]
for c in li[1:]:
g = gcd(g, c)
return g
# コード ---
N = INT()
a_list = LI()
gcd_a = gcd_all(a_list)
cnt = 0
for a in a_list:
a //= gcd_a
while a % 2 == 0:
cnt += 1
a //= 2
while a % 3 == 0:
cnt += 1
a //= 2
if a > 1:
print(-1)
exit()
print(cnt)
# import系 ---
from math import gcd
# 入力用 ---
INT = lambda: int(input())
MI = lambda: map(int, input().split())
MI_DEC = lambda: map(lambda x: int(x) - 1, input().split())
LI = lambda: list(map(int, input().split()))
LS = lambda: input().split()
# リストの最大公約数 ---
def gcd_all(li):
g = li[0]
for c in li[1:]:
g = gcd(g, c)
return g
# コード ---
N = INT()
a_list = LI()
gcd_a = gcd_all(a_list)
cnt = 0
for a in a_list:
a //= gcd_a
while a % 2 == 0:
cnt += 1
a //= 2
while a % 3 == 0:
cnt += 1
a //= 3
if a > 1:
print(-1)
exit()
print(cnt)
|
ConDefects/ConDefects/Code/abc276_d/Python/45303110
|
condefects-python_data_198
|
n=int(input())
count=[[0]*10 for _ in range(10)]
time=[[] for _ in range(10)]
for i in range(n):
s=input()
for x in range(10):
s_x=int(s[x])
count[s_x][x]+=1
time[s_x].append(i+(count[s_x][x]-1)*10)
ans=10**100
for i in range(10):
ans=min(ans,max(time[i]))
print(ans)
n=int(input())
count=[[0]*10 for _ in range(10)]
time=[[] for _ in range(10)]
for i in range(n):
s=input()
for x in range(10):
s_x=int(s[x])
count[s_x][x]+=1
time[s_x].append(x+(count[s_x][x]-1)*10)
ans=10**100
for i in range(10):
ans=min(ans,max(time[i]))
print(ans)
|
ConDefects/ConDefects/Code/abc252_c/Python/45002861
|
condefects-python_data_199
|
n = int(input())
s = [list(input()) for _ in range(n)]
ans = 100
for i in range(10):
num = str(i)
slot = [False for _ in range(n)]
for j in range(10*(n+5)):
for k in range(n):
if slot[k] == False and s[k][(j)%10] == num:
slot[k] = True
break
if all(slot):
ans = min(ans,j)
break
print(ans)
n = int(input())
s = [list(input()) for _ in range(n)]
ans = 100000
for i in range(10):
num = str(i)
slot = [False for _ in range(n)]
for j in range(10*(n+5)):
for k in range(n):
if slot[k] == False and s[k][(j)%10] == num:
slot[k] = True
break
if all(slot):
ans = min(ans,j)
break
print(ans)
|
ConDefects/ConDefects/Code/abc252_c/Python/46168111
|
condefects-python_data_200
|
N,M=map(int,input().split())
G=[[] for i in range(N)]
into=[0]*N
b=[0]*N
E=[[] for i in range(N)]
for i in range(M):
s,t=map(int,input().split())
s-=1
t-=1
into[t]+=1
G[s].append(t)
E[t].append(s)
b[t]+=1
from collections import deque
S=deque()
keep=[0]*N
K=[[] for i in range(N+1)]
result=[0]*N
dp=[0]*N
for i in range(N):
l,r=map(int,input().split())
K[l].append(i)
keep[i]=r*10**10+i
dp[i]=r
for i in range(N):
if b[i]==0:
S.append(i)
while S:
x=S.popleft()
for y in E[x]:
b[y]-=1
dp[y]=min(dp[y],dp[x])
if b[y]==0:
S.append(y)
topo=[False]*N
ran=[False]*N
from heapq import heappush,heappop
S=[]
for i in range(N):
if into[i]==0:
topo[i]=True
for l in range(1,N+1):
for y in K[l]:
ran[y]=True
if topo[y]==True:
heappush(S,dp[y]*10**10+y)
if len(S)==0:
print('No')
exit()
w=heappop(S)
r=w//(10**10)
pos=w%(10**10)
if r<l:
print('No')
exit()
result[pos]=l
for x in G[pos]:
into[x]-=1
if into[x]==0:
topo[x]=True
if ran[x]==True:
heappush(S,dp[x]*10**10+x)
print('Yes')
print(*result)
N,M=map(int,input().split())
G=[[] for i in range(N)]
into=[0]*N
b=[0]*N
E=[[] for i in range(N)]
for i in range(M):
s,t=map(int,input().split())
s-=1
t-=1
into[t]+=1
G[s].append(t)
E[t].append(s)
b[s]+=1
from collections import deque
S=deque()
keep=[0]*N
K=[[] for i in range(N+1)]
result=[0]*N
dp=[0]*N
for i in range(N):
l,r=map(int,input().split())
K[l].append(i)
keep[i]=r*10**10+i
dp[i]=r
for i in range(N):
if b[i]==0:
S.append(i)
while S:
x=S.popleft()
for y in E[x]:
b[y]-=1
dp[y]=min(dp[y],dp[x])
if b[y]==0:
S.append(y)
topo=[False]*N
ran=[False]*N
from heapq import heappush,heappop
S=[]
for i in range(N):
if into[i]==0:
topo[i]=True
for l in range(1,N+1):
for y in K[l]:
ran[y]=True
if topo[y]==True:
heappush(S,dp[y]*10**10+y)
if len(S)==0:
print('No')
exit()
w=heappop(S)
r=w//(10**10)
pos=w%(10**10)
if r<l:
print('No')
exit()
result[pos]=l
for x in G[pos]:
into[x]-=1
if into[x]==0:
topo[x]=True
if ran[x]==True:
heappush(S,dp[x]*10**10+x)
print('Yes')
print(*result)
|
ConDefects/ConDefects/Code/abc304_h/Python/48697427
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.