id
stringlengths 24
27
| content
stringlengths 37
384k
| max_stars_repo_path
stringlengths 51
51
|
|---|---|---|
condefects-python_data_2001
|
from functools import*
def ask(i,j,k):
print('?',i+1,j+1,k+1)
return input() == "No"
n = int(input())
p = 0
for i in range(1,n):
if ask(i,i,p):
p = i
P = [0]*n
def cmp(i,j):
return ask(p,i,j)
for p,i in enumerate(sorted(range(n),key=cmp_to_key(cmp)),1):
P[i] = p
print('!',*P)
from functools import*
def ask(i,j,k):
print('?',i+1,j+1,k+1)
return input() == "No"
n = int(input())
p = 0
for i in range(1,n):
if ask(i,i,p):
p = i
P = [0]*n
def cmp(i,j):
return 1-2*ask(p,i,j)
for p,i in enumerate(sorted(range(n),key=cmp_to_key(cmp)),1):
P[i] = p
print('!',*P)
|
ConDefects/ConDefects/Code/arc154_d/Python/38556628
|
condefects-python_data_2002
|
from random import shuffle
def judge(i, j, k):
# print("i, j, k =", i, j, k)
if X[i] + X[j] + 1 > X[k]:
# print(">> Yes")
return 1
# print(">> No")
return 0
def ask(i, j, k):
if 1 or not DEBUG:
print("?", i + 1, j + 1, k + 1)
if DEBUG:
return judge(i, j, k)
ret = input()
if ret == "Yes":
return 1
return 0
def comp(i, j):
return ask(i, x, j)
DEBUG = 0
if DEBUG:
N = 10
X = [i for i in range(N)]
shuffle(X)
X = [4, 6, 9, 3, 0, 1, 2, 5, 7, 8]
print("X =", X)
else:
N = int(input())
if N == 1:
print(1)
exit()
x = 0
for i in range(1, N):
if ask(i, i, x) == 0:
x = i
if DEBUG:
print("x =", x)
def check(l, r):
global Y
if r == l + 1:
return
m = l + r >> 1
check(l, m)
check(m, r)
i = l
j = m
C = []
if DEBUG and (l, r) == (0, 4):
print("!!!!! l, r =", l, r)
while i < m and j < r:
if comp(Y[i], Y[j]):
if DEBUG and (l, r) == (0, 4):
print("comp", i, j, "True")
C.append(Y[j])
j += 1
else:
if DEBUG and (l, r) == (0, 4):
print("comp", i, j, "False")
C.append(Y[i])
i += 1
if DEBUG and (l, r) == (0, 4):
print("C =", C)
while i < m:
C.append(Y[i])
i += 1
while j < r:
C.append(Y[j])
j += 1
for i in range(len(C)):
Y[l+i] = C[i]
if DEBUG:
print("l, r =", l, r)
print("Y =", Y, Y[l:r])
Y = [x] + [i for i in range(N) if i != x]
check(1, N)
if DEBUG:
print("X =", X)
print("Y =", Y)
ans = [0] * N
for i, a in enumerate(Y):
ans[a] = i + 1
print("!", *ans)
from random import shuffle
def judge(i, j, k):
# print("i, j, k =", i, j, k)
if X[i] + X[j] + 1 > X[k]:
# print(">> Yes")
return 1
# print(">> No")
return 0
def ask(i, j, k):
if 1 or not DEBUG:
print("?", i + 1, j + 1, k + 1)
if DEBUG:
return judge(i, j, k)
ret = input()
if ret == "Yes":
return 1
return 0
def comp(i, j):
return ask(i, x, j)
DEBUG = 0
if DEBUG:
N = 10
X = [i for i in range(N)]
shuffle(X)
X = [4, 6, 9, 3, 0, 1, 2, 5, 7, 8]
print("X =", X)
else:
N = int(input())
if N == 1:
print("!", 1)
exit()
x = 0
for i in range(1, N):
if ask(i, i, x) == 0:
x = i
if DEBUG:
print("x =", x)
def check(l, r):
global Y
if r == l + 1:
return
m = l + r >> 1
check(l, m)
check(m, r)
i = l
j = m
C = []
if DEBUG and (l, r) == (0, 4):
print("!!!!! l, r =", l, r)
while i < m and j < r:
if comp(Y[i], Y[j]):
if DEBUG and (l, r) == (0, 4):
print("comp", i, j, "True")
C.append(Y[j])
j += 1
else:
if DEBUG and (l, r) == (0, 4):
print("comp", i, j, "False")
C.append(Y[i])
i += 1
if DEBUG and (l, r) == (0, 4):
print("C =", C)
while i < m:
C.append(Y[i])
i += 1
while j < r:
C.append(Y[j])
j += 1
for i in range(len(C)):
Y[l+i] = C[i]
if DEBUG:
print("l, r =", l, r)
print("Y =", Y, Y[l:r])
Y = [x] + [i for i in range(N) if i != x]
check(1, N)
if DEBUG:
print("X =", X)
print("Y =", Y)
ans = [0] * N
for i, a in enumerate(Y):
ans[a] = i + 1
print("!", *ans)
|
ConDefects/ConDefects/Code/arc154_d/Python/38271304
|
condefects-python_data_2003
|
from functools import cmp_to_key
def ask(i,j,k):
print("?",i,j,k)
return input() == "Yes"
class box():
def __init__(self,i):
self.i = i
def __lt__(self,other):
return ask(other.i,now,self.i)
N = int(input())
for i in range(3703):
ask(1,1,1)
now = 1
for i in range(2,N+1):
if ask(now,now,i):
now = i
li = [box(i+1) for i in range(N)]
li.sort()
X = [-1]*N
for i in range(N):
X[li[i].i-1] = i+1
print("!",*X)
from functools import cmp_to_key
def ask(i,j,k):
print("?",i,j,k)
return input() == "Yes"
class box():
def __init__(self,i):
self.i = i
def __lt__(self,other):
return ask(other.i,now,self.i)
N = int(input())
for i in range(3702):
ask(1,1,1)
now = 1
for i in range(2,N+1):
if ask(now,now,i):
now = i
li = [box(i+1) for i in range(N)]
li.sort()
X = [-1]*N
for i in range(N):
X[li[i].i-1] = i+1
print("!",*X)
|
ConDefects/ConDefects/Code/arc154_d/Python/43287084
|
condefects-python_data_2004
|
import sys
def resolve():
input = sys.stdin.readline
memo = {}
def q(i, j, k):
if i > j:
i, j = j, i
t = (i, j, k)
if t in memo:
return memo[t]
if i == k or j == k:
return True
print("?", i, j, k, flush=True)
memo[t] = input() == "Yes"
return memo[t]
n = int(input())
x = 1
for i in range(2, n + 1):
if not q(i, i, x):
x = i
from collections import deque
queue = deque(deque([x]) for x in range(1, n + 1))
while len(queue) > 1:
# print(queue)
l = queue.popleft()
r = queue.popleft()
a = deque()
li = l.popleft()
ri = r.popleft()
while True:
if q(li, x, ri):
a.append(ri)
if not r:
a.append(li)
break
ri = r.popleft()
else:
a.append(li)
if not l:
a.append(ri)
break
li = l.popleft()
queue.append(a + l + r)
ans = [None] * n
for i, j in enumerate(queue[0], start=1):
ans[j - 1] = i
print("!", *ans, flush=True)
if __name__ == "__main__":
resolve()
import sys
def resolve():
input = sys.stdin.readline
memo = {}
def q(i, j, k):
if i > j:
i, j = j, i
t = (i, j, k)
if t in memo:
return memo[t]
if i == k or j == k:
return True
print("?", i, j, k, flush=True)
memo[t] = input().rstrip() == "Yes"
return memo[t]
n = int(input())
x = 1
for i in range(2, n + 1):
if not q(i, i, x):
x = i
from collections import deque
queue = deque(deque([x]) for x in range(1, n + 1))
while len(queue) > 1:
# print(queue)
l = queue.popleft()
r = queue.popleft()
a = deque()
li = l.popleft()
ri = r.popleft()
while True:
if q(li, x, ri):
a.append(ri)
if not r:
a.append(li)
break
ri = r.popleft()
else:
a.append(li)
if not l:
a.append(ri)
break
li = l.popleft()
queue.append(a + l + r)
ans = [None] * n
for i, j in enumerate(queue[0], start=1):
ans[j - 1] = i
print("!", *ans, flush=True)
if __name__ == "__main__":
resolve()
|
ConDefects/ConDefects/Code/arc154_d/Python/38487427
|
condefects-python_data_2005
|
n=int(input())
mn=0
for q in range(1,n):
print("?",mn+1,mn+1,q+1)
s=input()
if s=="Yes":
mn=q
Ans=[0]
for q in range(1,n):
ansa=0
ansb=len(Ans)
while ansa!=ansb:
vid=ansa+(ansb-ansa)//2
print("?",vid+1,mn+1,q+1)
s=input()
if s=="Yes":
ansb=vid
else:
ansa=vid+1
Ans=Ans[:ansa]+[q]+Ans[ansa:]
B=[]
for q in range(n):
B.append(Ans.index(q)+1)
print("!",*B)
n=int(input())
mn=0
for q in range(1,n):
print("?",mn+1,mn+1,q+1)
s=input()
if s=="Yes":
mn=q
Ans=[0]
for q in range(1,n):
ansa=0
ansb=len(Ans)
while ansa!=ansb:
vid=ansa+(ansb-ansa)//2
print("?",Ans[vid]+1,mn+1,q+1)
s=input()
if s=="Yes":
ansb=vid
else:
ansa=vid+1
Ans=Ans[:ansa]+[q]+Ans[ansa:]
B=[]
for q in range(n):
B.append(Ans.index(q)+1)
print("!",*B)
|
ConDefects/ConDefects/Code/arc154_d/Python/38265701
|
condefects-python_data_2006
|
def func():
# 入力を取得
S = input()
print(sorted(S))
if __name__ == '__main__':
func()
def func():
# 入力を取得
S = input()
print(*sorted(S), sep='')
if __name__ == '__main__':
func()
|
ConDefects/ConDefects/Code/abc242_b/Python/45803292
|
condefects-python_data_2007
|
n = int(input())
q = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
from ortools.sat.python import cp_model
import sys
model = cp_model.CpModel()
ub = 10**6 + 10
x = model.NewIntVar(0, ub, 'x')
y = model.NewIntVar(0, ub, 'y')
for i in range(n):
model.Add(a[i] * x + b[i] * y <= q[i])
model.Maximize(x + y)
solver = cp_model.CpSolver()
status = solver.Solve(model)
if status == cp_model.OPTIMAL:
print(solver.ObjectiveValue())
print("x, y = ",solver.Value(x),solver.Value(y), file = sys.stderr)
else:
assert False
n = int(input())
q = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
from ortools.sat.python import cp_model
import sys
model = cp_model.CpModel()
ub = 10**6 + 10
x = model.NewIntVar(0, ub, 'x')
y = model.NewIntVar(0, ub, 'y')
for i in range(n):
model.Add(a[i] * x + b[i] * y <= q[i])
model.Maximize(x + y)
solver = cp_model.CpSolver()
status = solver.Solve(model)
if status == cp_model.OPTIMAL:
print(int(solver.ObjectiveValue()))
print("x, y = ",solver.Value(x),solver.Value(y), file = sys.stderr)
else:
assert False
|
ConDefects/ConDefects/Code/abc338_c/Python/54431526
|
condefects-python_data_2008
|
n=int(input())
q=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
am=10**6
for i in range(n):
if a[i]==0:
continue
if am>q[i]//a[i]:
am=q[i]//a[i]
bm=10**6
for i in range(n):
if b[i]==0:
continue
if bm>q[i]//b[i]:
bm=q[i]//b[i]
ans=am
t=0
k=[]
for i in range(n):
if am*a[i]==0:
k.append(q[i])
else:
k.append(q[i]-(am*a[i]))
kk=False
def check():
for i in range(n):
if k[i]<b[i]:
return False
return True
for i in range(am):
while check():
t+=1
if t==bm:
kk=True
break
for o in range(n):
k[o]-=b[o]
for o in range(n):
k[o]+=a[o]
if ans<t+am-i:
ans=t+am-i
if kk:
break
print(ans)
n=int(input())
q=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
am=10**6
for i in range(n):
if a[i]==0:
continue
if am>q[i]//a[i]:
am=q[i]//a[i]
bm=10**6
for i in range(n):
if b[i]==0:
continue
if bm>q[i]//b[i]:
bm=q[i]//b[i]
ans=am
t=0
k=[]
for i in range(n):
if am*a[i]==0:
k.append(q[i])
else:
k.append(q[i]-(am*a[i]))
kk=False
def check():
for i in range(n):
if k[i]<b[i]:
return False
return True
for i in range(am+1):
while check():
t+=1
if t==bm:
kk=True
break
for o in range(n):
k[o]-=b[o]
for o in range(n):
k[o]+=a[o]
if ans<t+am-i:
ans=t+am-i
if kk:
break
print(ans)
|
ConDefects/ConDefects/Code/abc338_c/Python/54514586
|
condefects-python_data_2009
|
N = int(input())
Q,A,B = list(map(int,input().split())),list(map(int,input().split())),list(map(int,input().split()))
ans = 0
Acnt,Bcnt = 0,0
while all(x >= 0 for x in Q):
Q = [x - y for x, y in zip(Q, A)]
Acnt += 1
Q = [x + y for x, y in zip(Q, A)]
Acnt -=1
ans = max(ans,Acnt)
print("A :",Acnt)
while Acnt>=0:
while all(x >= 0 for x in Q):
Q = [x - y for x, y in zip(Q, B)]
Bcnt += 1
Q = [x + y for x, y in zip(Q, B)]
Bcnt -= 1
ans = max(ans,Acnt+Bcnt)
Acnt -=1
Q = [x + y for x, y in zip(Q, A)]
print(ans)
N = int(input())
Q,A,B = list(map(int,input().split())),list(map(int,input().split())),list(map(int,input().split()))
ans = 0
Acnt,Bcnt = 0,0
while all(x >= 0 for x in Q):
Q = [x - y for x, y in zip(Q, A)]
Acnt += 1
Q = [x + y for x, y in zip(Q, A)]
Acnt -=1
ans = max(ans,Acnt)
#print("A :",Acnt)
while Acnt>=0:
while all(x >= 0 for x in Q):
Q = [x - y for x, y in zip(Q, B)]
Bcnt += 1
Q = [x + y for x, y in zip(Q, B)]
Bcnt -= 1
ans = max(ans,Acnt+Bcnt)
Acnt -=1
Q = [x + y for x, y in zip(Q, A)]
print(ans)
|
ConDefects/ConDefects/Code/abc338_c/Python/54294909
|
condefects-python_data_2010
|
N = int(input())
material = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
def canmake(K): #K人分の料理を作れるか判定
judge = False
for i in range(K):
local_judge = True
for j in range(N):
if A[j]*i + B[j]*(K-i) > material[j]:
local_judge = False
if local_judge == True:
judge = True
return judge
L, R = 0, 10**6
while R-L > 1:
C = (R+L)//2
if canmake(C):
L = C
else:
R = C
print(L)
N = int(input())
material = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
def canmake(K): #K人分の料理を作れるか判定
judge = False
for i in range(K):
local_judge = True
for j in range(N):
if A[j]*i + B[j]*(K-i) > material[j]:
local_judge = False
if local_judge == True:
judge = True
return judge
L, R = 0, 10**7
while R-L > 1:
C = (R+L)//2
if canmake(C):
L = C
else:
R = C
print(L)
|
ConDefects/ConDefects/Code/abc338_c/Python/54397398
|
condefects-python_data_2011
|
n = int(input())
q = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
def solve(p):
#ans = False
for j in range(p+1):
flag = True
for i in range(n):
if j*a[i]+(p-j)*b[i]>q[i]:
flag = False
break
if flag ==True:
return True
return False
ok = 0
no = 10**6+1
mid = (ok+no)//2
while ok+1<no:
if solve(mid):
ok = mid
else:
no = mid
mid = (ok+no)//2
print(ok)
n = int(input())
q = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
def solve(p):
#ans = False
for j in range(p+1):
flag = True
for i in range(n):
if j*a[i]+(p-j)*b[i]>q[i]:
flag = False
break
if flag ==True:
return True
return False
ok = 0
no = 2*10**6+1
mid = (ok+no)//2
while ok+1<no:
if solve(mid):
ok = mid
else:
no = mid
mid = (ok+no)//2
print(ok)
|
ConDefects/ConDefects/Code/abc338_c/Python/54499412
|
condefects-python_data_2012
|
n=int(input())
q=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
inf=float("inf")
for x in range(max(q)+1):
y=inf
for i in range(n):
if q[i]<x*a[i]:
y=-inf
break
elif b[i]>0:
y=min((q[i]-x*a[i])//b[i],x)
ans=max(ans,x+y)
print(ans)
n=int(input())
q=list(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
inf=float("inf")
for x in range(max(q)+1):
y=inf
for i in range(n):
if q[i]<x*a[i]:
y=-inf
break
elif b[i]>0:
y=min((q[i]-x*a[i])//b[i],y)
ans=max(ans,x+y)
print(ans)
|
ConDefects/ConDefects/Code/abc338_c/Python/54491236
|
condefects-python_data_2013
|
n = int(input())
q_s = list(map(int, input().split()))
a_s = list(map(int, input().split()))
b_s = list(map(int, input().split()))
max_num = 0
flag = False
for i in range(10**6):
number_of_a = i
for j in range(n):
if b_s[j] == 0:
continue
number_of_b = (q_s[j] - a_s[j] * number_of_a) // b_s[j]
for k in range(n):
if a_s[k] * number_of_a + b_s[k] * number_of_b > q_s[k]:
number_of_b = -100000000000000
break
if k == n - 1:
flag = True
if flag:
if max_num < number_of_a + number_of_b:
max_num = number_of_a + number_of_b
print(max_num)
n = int(input())
q_s = list(map(int, input().split()))
a_s = list(map(int, input().split()))
b_s = list(map(int, input().split()))
max_num = 0
flag = False
for i in range(10**6 + 1):
number_of_a = i
for j in range(n):
if b_s[j] == 0:
continue
number_of_b = (q_s[j] - a_s[j] * number_of_a) // b_s[j]
for k in range(n):
if a_s[k] * number_of_a + b_s[k] * number_of_b > q_s[k]:
number_of_b = -100000000000000
break
if k == n - 1:
flag = True
if flag:
if max_num < number_of_a + number_of_b:
max_num = number_of_a + number_of_b
print(max_num)
|
ConDefects/ConDefects/Code/abc338_c/Python/54924810
|
condefects-python_data_2014
|
n=int(input())
q=tuple(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
amax=10**7
bmax=10**7
for k,i in enumerate(a):
if i!=0:
x=q[k]//i
if x <amax:
amax=x
x=0
for k,i in enumerate(b):
if i!=0:
x=q[k]//i
if x <bmax:
bmax=x
mi=10**7
if amax >bmax:
ans=amax
for i in range(amax+1)[::-1]:
for k,j in enumerate(a):
if b[k]!=0:
y=q[k]-(i*j)
x=y//b[k]
else:
x=10**7
if x<mi:
mi=x
if mi+i>ans:
ans=mi+i
else:
ans=bmax
for i in range(bmax+1)[::-1]:
for k,j in enumerate(b):
if a[k]!=0:
y=q[k]-(i*j)
x=y//a[k]
else:
x=10**7
if x<mi:
mi=x
if mi+i>ans:
ans=mi+i
print(ans)
n=int(input())
q=tuple(map(int,input().split()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
amax=10**7
bmax=10**7
for k,i in enumerate(a):
if i!=0:
x=q[k]//i
if x <amax:
amax=x
x=0
for k,i in enumerate(b):
if i!=0:
x=q[k]//i
if x <bmax:
bmax=x
mi=10**7
if amax >bmax:
ans=amax
for i in range(amax+1)[::-1]:
mi=10**7
for k,j in enumerate(a):
if b[k]!=0:
y=q[k]-(i*j)
x=y//b[k]
else:
x=10**7
if x<mi:
mi=x
if mi+i>ans:
ans=mi+i
else:
ans=bmax
for i in range(bmax+1)[::-1]:
mi=10**7
for k,j in enumerate(b):
if a[k]!=0:
y=q[k]-(i*j)
x=y//a[k]
else:
x=10**7
if x<mi:
mi=x
if mi+i>ans:
ans=mi+i
print(ans)
|
ConDefects/ConDefects/Code/abc338_c/Python/54437216
|
condefects-python_data_2015
|
n=int(input())
count=0
for i in range (n):
s=input()
if s=="for":
count= count+1
if count > n/2:
print("Yes")
else:
print("No")
n=int(input())
count=0
for i in range (n):
s=input()
if s=="For":
count= count+1
if count > n/2:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc287_a/Python/45997845
|
condefects-python_data_2016
|
n=int(input())
count=0
for i in range (n):
s=input()
if s=="For":
count=count+1
print(s,count)
print(count)
if count >n/2:
print("Yes")
else:
print("No")
n=int(input())
count=0
for i in range (n):
s=input()
if s=="For":
count=count+1
if count >n/2:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc287_a/Python/45997981
|
condefects-python_data_2017
|
n = int(input())
result = 0
for _ in range(n):
if "For" == input():
result += 1
if result >= n // 2:
print("Yes")
else:
print("No")
n = int(input())
result = 0
for _ in range(n):
if "For" == input():
result += 1
if result > n // 2:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc287_a/Python/45662090
|
condefects-python_data_2018
|
n = int(input())
count = 0
for i in range(n):
a = input()
if a == 'for':
count= count + 1
else :
count=count
if count > n/2 :
print('Yes')
else:
print('No')
n = int(input())
count = 0
for i in range(n):
a = input()
if a == 'For':
count= count + 1
else :
count=count
if count > n/2 :
print('Yes')
else:
print('No')
|
ConDefects/ConDefects/Code/abc287_a/Python/45997889
|
condefects-python_data_2019
|
n=int(input())
count=0
for i in range(n):
s=input()
if s=="For":
count=count+1
print(s,count)
print(count)
if count>n/2:
print("Yes")
else:
print("No")
n=int(input())
count=0
for i in range(n):
s=input()
if s=="For":
count=count+1
if count>n/2:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc287_a/Python/45997875
|
condefects-python_data_2020
|
h,w=list(map(int,input().split()))
a=[input() for _ in range(h)]
n=int(input())
rce=[list(map(int,input().split())) for _ in range(n)]
rc={(rce[i][0]-1,rce[i][1]-1):rce[i][2] for i in range(n)}
for i in range(h):
for j in range(w):
if a[i][j]=="S":
s=(i,j)
if a[i][j]=="T":
t=(i,j)
if not(s in rc):
exit(print("No"))
ans=set()
aans=set()
aaans=set()
ans.add(s)
aans.add(s)
def sk(b,n):
global ans,aans
do=((1,0),(-1,0),(0,1),(0,-1))
si=set()
si.add(b)
ti=set()
ti.add(b)
ki=set()
x=0
while (not(len(ti)==0))or(x!=n):
x+=1
for i in ti:
for j in do:
k=(i[0]+j[0],i[1]+j[1])
if (0>k[0])or(h<=k[0])or(0>k[1])or(w<=k[1]):#サイズを変えるならここ
continue
if (a[k[0]][k[1]]=="#"):#障害物がいらないならここを消す
continue
if not(k in si):
ki.add(k)
si.add(k)
if (k in rc.keys())and(not(k in ans)):
ans.add(k)
aaans.add(k)
if k==t:
exit(print("Yes"))
ti=ki
ki=set()
return -1
while aans:
for i in aans:
sk(i,rc[i])
aans=aaans
aaans=set()
print("No")
h,w=list(map(int,input().split()))
a=[input() for _ in range(h)]
n=int(input())
rce=[list(map(int,input().split())) for _ in range(n)]
rc={(rce[i][0]-1,rce[i][1]-1):rce[i][2] for i in range(n)}
for i in range(h):
for j in range(w):
if a[i][j]=="S":
s=(i,j)
if a[i][j]=="T":
t=(i,j)
if not(s in rc):
exit(print("No"))
ans=set()
aans=set()
aaans=set()
ans.add(s)
aans.add(s)
def sk(b,n):
global ans,aans
do=((1,0),(-1,0),(0,1),(0,-1))
si=set()
si.add(b)
ti=set()
ti.add(b)
ki=set()
x=0
while (not(len(ti)==0))and(x!=n):
x+=1
for i in ti:
for j in do:
k=(i[0]+j[0],i[1]+j[1])
if (0>k[0])or(h<=k[0])or(0>k[1])or(w<=k[1]):#サイズを変えるならここ
continue
if (a[k[0]][k[1]]=="#"):#障害物がいらないならここを消す
continue
if not(k in si):
ki.add(k)
si.add(k)
if (k in rc.keys())and(not(k in ans)):
ans.add(k)
aaans.add(k)
if k==t:
exit(print("Yes"))
ti=ki
ki=set()
return -1
while aans:
for i in aans:
sk(i,rc[i])
aans=aaans
aaans=set()
print("No")
|
ConDefects/ConDefects/Code/abc348_d/Python/54754604
|
condefects-python_data_2021
|
s,t,m=map(int,input().split())
dp=[[-1]*t for i in range(t)]
g=[[] for i in range(s)]
for i in range(m):
a,b=map(int,input().split())
g[a-1].append(b-s-1)
for i in range(s):
if not g[i]:
continue
for x in g[i]:
for y in g[i]:
if x==y:
continue
if dp[x][y]!=-1:
exit(print(x+t,y+t,dp[x][y]+1,i+1))
else:
dp[x][y]=i
print(-1)
s,t,m=map(int,input().split())
dp=[[-1]*t for i in range(t)]
g=[[] for i in range(s)]
for i in range(m):
a,b=map(int,input().split())
g[a-1].append(b-s-1)
for i in range(s):
if not g[i]:
continue
for x in g[i]:
for y in g[i]:
if x==y:
continue
if dp[x][y]!=-1:
exit(print(x+s+1,y+s+1,dp[x][y]+1,i+1))
else:
dp[x][y]=i
print(-1)
|
ConDefects/ConDefects/Code/abc260_f/Python/46046400
|
condefects-python_data_2022
|
n,m = map(int,input().split())
hunaka = [[1] * n for _ in range(n)]
for _ in range(m):
a = list(map(int,input().split()))
for i in range (n-1):
x,y = a[i],a[i+1]
hunaka[x-1][y-1]=0
hunaka[y-1][x-1]=0
ans = sum(sum(row) for row in hunaka) - n
print(ans/2)
n,m = map(int,input().split())
hunaka = [[1] * n for _ in range(n)]
for _ in range(m):
a = list(map(int,input().split()))
for i in range (n-1):
x,y = a[i],a[i+1]
hunaka[x-1][y-1]=0
hunaka[y-1][x-1]=0
ans = sum(sum(row) for row in hunaka) - n
print(ans//2)
|
ConDefects/ConDefects/Code/abc303_b/Python/45560009
|
condefects-python_data_2023
|
n=int(input())
tx=[list(map(int,input().split())) for _ in range(n)]
K_max,k=0,0
ans=[]
cnt=[0]*(n+1)
for t,x in tx[::-1]:
if t==1:
if cnt[x]<0:
cnt[x]+=1
ans.append(1)
else:
ans.append(0)
k-=1
else:
cnt[x]-=1
k+=1
K_max=max(K_max,k)
if min(cnt)==0:
print(K_max)
print(*ans[::-1])
else:
print(-1)
n=int(input())
tx=[list(map(int,input().split())) for _ in range(n)]
K_max,k=0,0
ans=[]
cnt=[0]*(n+1)
for t,x in tx[::-1]:
if t==1:
if cnt[x]<0:
cnt[x]+=1
ans.append(1)
k-=1
else:
ans.append(0)
else:
cnt[x]-=1
k+=1
K_max=max(K_max,k)
if min(cnt)==0:
print(K_max)
print(*ans[::-1])
else:
print(-1)
|
ConDefects/ConDefects/Code/abc333_e/Python/52477249
|
condefects-python_data_2024
|
from collections import deque
n = int(input())
a = [list(map(int,input().split())) for i in range(n)]
d = {}
s = [0] * n
b = []
ans = 0
for i in range(n):
if a[i][0] == 1:
x = a[i][1]
if x in d:
d[x].append(i)
else:
d[x] = deque([i])
for i in range(n):
if a[n-1-i][0] == 2:
x = a[n-1-i][1]
if x in d:
if d:
while d[x]:
j = d[x].pop()
if j < n-1-i:
s[j] += 1
s[n-1-i] -= 1
b.append(j)
break
if len(d) == 0 and n-1-i <j:
ans = -1
else:
ans = -1
break
else:
ans = -1
break
for i in range(1,n):
s[i] += s[i-1]
p = set(b)
k = []
for i in range(n):
if a[i][0] == 1:
if i in p:
k.append(1)
else:
k.append(0)
if ans == 0:
ans = max(s)
print(ans)
print(*k)
else:
print(ans)
from collections import deque
n = int(input())
a = [list(map(int,input().split())) for i in range(n)]
d = {}
s = [0] * n
b = []
ans = 0
for i in range(n):
if a[i][0] == 1:
x = a[i][1]
if x in d:
d[x].append(i)
else:
d[x] = deque([i])
for i in range(n):
if a[n-1-i][0] == 2:
x = a[n-1-i][1]
if x in d:
if d:
while d[x]:
j = d[x].pop()
if j < n-1-i:
s[j] += 1
s[n-1-i] -= 1
b.append(j)
break
if n-1-i < j:
ans = -1
else:
ans = -1
break
else:
ans = -1
break
for i in range(1,n):
s[i] += s[i-1]
p = set(b)
k = []
for i in range(n):
if a[i][0] == 1:
if i in p:
k.append(1)
else:
k.append(0)
if ans == 0:
ans = max(s)
print(ans)
print(*k)
else:
print(ans)
|
ConDefects/ConDefects/Code/abc333_e/Python/53773546
|
condefects-python_data_2025
|
from collections import deque
n=int(input())
A=[]
for i in range(n+1):
A.append(deque())
Q=[]
for i in range(n):
t,x=map(int,input().split())
Q.append([t,x])
S=set()
for i in range(n-1,-1,-1):
t,x=Q[i][0],Q[i][1]
if t==1:
if len(A[x])>0:
A[x].pop()
S.add(i)
if t==2:
A[x].append(i)
for i in range(n):
if len(A[i])>0:
print(-1)
exit()
cnt=0
k=0
ans=[]
for i in range(n):
t,x=Q[i][0],Q[i][1]
if t==1:
if i in S:
cnt+=1
ans.append(1)
else:
ans.append(0)
if t==2:
cnt-=1
k=max(k,cnt)
print(k,*ans)
from collections import deque
n=int(input())
A=[]
for i in range(n+1):
A.append(deque())
Q=[]
for i in range(n):
t,x=map(int,input().split())
Q.append([t,x])
S=set()
for i in range(n-1,-1,-1):
t,x=Q[i][0],Q[i][1]
if t==1:
if len(A[x])>0:
A[x].pop()
S.add(i)
if t==2:
A[x].append(i)
for i in range(n+1):
if len(A[i])>0:
print(-1)
exit()
cnt=0
k=0
ans=[]
for i in range(n):
t,x=Q[i][0],Q[i][1]
if t==1:
if i in S:
cnt+=1
ans.append(1)
else:
ans.append(0)
if t==2:
cnt-=1
k=max(k,cnt)
print(k,*ans)
|
ConDefects/ConDefects/Code/abc333_e/Python/52260050
|
condefects-python_data_2026
|
from collections import defaultdict
def main():
N = ini()
orders = []
essential = defaultdict(list)
for i in range(N):
t, x = mapint()
orders.append((t, x))
if t == 1:
essential[x].append(i)
essential_list = []
for i in range(N-1, -1, -1):
t, x = orders[i]
if t == 2:
index = float("inf")
while index > i:
if not essential[x]:
print(-1)
return
index = essential[x].pop()
essential_list.append(index)
essential_list = sorted(essential_list)[::-1]
ans = []
cnt = 0
max_cnt = 0
for i in range(N):
t, x = orders[i]
if t == 1:
if essential_list and essential_list[-1] == i:
essential_list.pop()
cnt += 1
ans.append(1)
else:
ans.append(0)
else:
max_cnt = max(max_cnt, cnt)
cnt = 0
print(max_cnt)
for a in ans:
print(a, end=" ")
def ini(): return int(input())
def mapint(): return map(int, input().split())
def mapint0(): return map(lambda x: int(x)-1, input().split())
def mapstr(): return input().split()
def lint(): return list(map(int, input().split()))
def lint0(): return list(map(lambda x: int(x)-1, input().split()))
def lstr(): return list(input().rstrip())
def errprint(*x): return None if atcenv else print(*x, file=sys.stderr)
if __name__=="__main__":
import sys, os
input = sys.stdin.readline
atcenv = os.environ.get("ATCODER", 0)
main()
from collections import defaultdict
def main():
N = ini()
orders = []
essential = defaultdict(list)
for i in range(N):
t, x = mapint()
orders.append((t, x))
if t == 1:
essential[x].append(i)
essential_list = []
for i in range(N-1, -1, -1):
t, x = orders[i]
if t == 2:
index = float("inf")
while index > i:
if not essential[x]:
print(-1)
return
index = essential[x].pop()
essential_list.append(index)
essential_list = sorted(essential_list)[::-1]
ans = []
cnt = 0
max_cnt = 0
for i in range(N):
t, x = orders[i]
if t == 1:
if essential_list and essential_list[-1] == i:
essential_list.pop()
cnt += 1
ans.append(1)
else:
ans.append(0)
else:
max_cnt = max(max_cnt, cnt)
cnt -= 1
print(max_cnt)
for a in ans:
print(a, end=" ")
def ini(): return int(input())
def mapint(): return map(int, input().split())
def mapint0(): return map(lambda x: int(x)-1, input().split())
def mapstr(): return input().split()
def lint(): return list(map(int, input().split()))
def lint0(): return list(map(lambda x: int(x)-1, input().split()))
def lstr(): return list(input().rstrip())
def errprint(*x): return None if atcenv else print(*x, file=sys.stderr)
if __name__=="__main__":
import sys, os
input = sys.stdin.readline
atcenv = os.environ.get("ATCODER", 0)
main()
|
ConDefects/ConDefects/Code/abc333_e/Python/52758263
|
condefects-python_data_2027
|
import sys
readline = sys.stdin.readline
#n = int(readline())
#*a, = map(int,readline().split())
# b = [list(map(int,readline().split())) for _ in range()]
n,k = map(int,readline().split())
s = readline().strip()
y = s.count("Y")
x = n-y
if x <= k:
# x を全部 y に変える
# y のうち k 個を x に変える
k -= x
s = ["X" if i == "Y" else "Y" for i in s]
s = "".join(s)
k = y-k
#print(s,k)
# x が k 個以上
# x のうち k 個を y に変える
ans = 0
for i in range(1,n):
if s[i-1] == s[i] == "Y": ans += 1
*r, = map(len,s.split("Y"))
r = r[1:-1]
if s.count("Y") == 0:
print(k-1)
exit()
#print(s,k,ans,r)
r.sort(reverse=1)
while r:
v = r.pop()
if v==0: continue
if v <= k:
k -= v
ans += v+1
else:
ans += k
k = 0
if k: ans += k
print(ans)
import sys
readline = sys.stdin.readline
#n = int(readline())
#*a, = map(int,readline().split())
# b = [list(map(int,readline().split())) for _ in range()]
n,k = map(int,readline().split())
s = readline().strip()
y = s.count("Y")
x = n-y
if x <= k:
# x を全部 y に変える
# y のうち k 個を x に変える
k -= x
s = ["X" if i == "Y" else "Y" for i in s]
s = "".join(s)
k = y-k
#print(s,k)
# x が k 個以上
# x のうち k 個を y に変える
ans = 0
for i in range(1,n):
if s[i-1] == s[i] == "Y": ans += 1
*r, = map(len,s.split("Y"))
r = r[1:-1]
if s.count("Y") == 0:
print(max(0,k-1))
exit()
#print(s,k,ans,r)
r.sort(reverse=1)
while r:
v = r.pop()
if v==0: continue
if v <= k:
k -= v
ans += v+1
else:
ans += k
k = 0
if k: ans += k
print(ans)
|
ConDefects/ConDefects/Code/arc157_b/Python/42828291
|
condefects-python_data_2028
|
N,K = map(int,input().split())
S = input()
X = S.count("X")
if X < K:
K = N-K
T = []
for s in S:
if s == "X":
T.append("Y")
else:
T.append("X")
S = T
if all(s == "X" for s in S):
print(K-1)
exit()
C = [10**6]
state = 0
cnt = 0
ans = 0
for i in range(1,N):
if state == 0:
if S[i-1] == "Y" and S[i] == "X":
cnt = 1
state = 1
else:
if S[i-1] == "X" and S[i] == "Y":
C.append(cnt)
state = 0
cnt = 0
else:
cnt += 1
if S[i-1] == "Y" and S[i] == "Y":
ans += 1
C.sort()
for c in C:
if K >= c:
ans += c+1
K -= c
else:
ans += K
break
print(ans)
N,K = map(int,input().split())
S = input()
X = S.count("X")
if X < K:
K = N-K
T = []
for s in S:
if s == "X":
T.append("Y")
else:
T.append("X")
S = T
if all(s == "X" for s in S):
print(max(0,K-1))
exit()
C = [10**6]
state = 0
cnt = 0
ans = 0
for i in range(1,N):
if state == 0:
if S[i-1] == "Y" and S[i] == "X":
cnt = 1
state = 1
else:
if S[i-1] == "X" and S[i] == "Y":
C.append(cnt)
state = 0
cnt = 0
else:
cnt += 1
if S[i-1] == "Y" and S[i] == "Y":
ans += 1
C.sort()
for c in C:
if K >= c:
ans += c+1
K -= c
else:
ans += K
break
print(ans)
|
ConDefects/ConDefects/Code/arc157_b/Python/43416351
|
condefects-python_data_2029
|
import sys
sys.setrecursionlimit(10**7)
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 LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())
N, K = MI()
S = S()
count_x, count_y = 0, 0
for s in S:
if s == "X":
count_x += 1
else:
count_y += 1
def calc(S, N, K): # K <= count_x の場合
y_pos = []
for i in range(N):
if S[i] == "Y":
y_pos.append(i)
if y_pos == []:
return max(0, K - 1)
diff = [y_pos[_ + 1] - y_pos[_] - 1 for _ in range(len(y_pos) - 1)]
diff.sort()
res = K
s = 0
for d in diff:
if d == 0: # 元々Yが隣り合っている
res += 1
s += d
if s <= K:
res += 1
else:
break
return res
if K <= count_x:
ans = calc(S, N, K)
else:
inverse_S = "".join(["X" if s == "Y" else "Y" for s in S])
ans = calc(inverse_S, N, N - K)
print(ans)
import sys
sys.setrecursionlimit(10**7)
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 LI2(): return list(map(int,sys.stdin.readline().rstrip()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def LS2(): return list(sys.stdin.readline().rstrip())
N, K = MI()
S = S()
count_x, count_y = 0, 0
for s in S:
if s == "X":
count_x += 1
else:
count_y += 1
def calc(S, N, K): # K <= count_x の場合
y_pos = []
for i in range(N):
if S[i] == "Y":
y_pos.append(i)
if y_pos == []:
return max(0, K - 1)
diff = [y_pos[_ + 1] - y_pos[_] - 1 for _ in range(len(y_pos) - 1)]
diff.sort()
res = K
s = 0
for d in diff:
s += d
if s <= K:
res += 1
else:
break
return res
if K <= count_x:
ans = calc(S, N, K)
else:
inverse_S = "".join(["X" if s == "Y" else "Y" for s in S])
ans = calc(inverse_S, N, N - K)
print(ans)
|
ConDefects/ConDefects/Code/arc157_b/Python/44930646
|
condefects-python_data_2030
|
import sys
N, K = map(int,input().split())
S = list(input())
x_cnt = 0
for i in range(N):
if S[i] == "X":
x_cnt += 1
if N == 1:
print(0)
sys.exit()
if x_cnt < K:
for i in range(N):
if S[i] == "X":
S[i] = "Y"
elif S[i] == "Y":
S[i] = "X"
K = N-K
if S == ["X"]*N:
print(min(0,K-1))
sys.exit()
haba = []
now = 0
for i in range(N):
if S[i] == "X":
now += 1
elif S[i] == "Y":
haba.append(now)
now = 0
haba.append(now)
haba = haba[1:-1]
haba.sort()
ans = 0
for h in haba:
if h <= K:
K -= h
ans += h+1
else:
break
ans += K
print(ans)
import sys
N, K = map(int,input().split())
S = list(input())
x_cnt = 0
for i in range(N):
if S[i] == "X":
x_cnt += 1
if N == 1:
print(0)
sys.exit()
if x_cnt < K:
for i in range(N):
if S[i] == "X":
S[i] = "Y"
elif S[i] == "Y":
S[i] = "X"
K = N-K
if S == ["X"]*N:
print(max(0,K-1))
sys.exit()
haba = []
now = 0
for i in range(N):
if S[i] == "X":
now += 1
elif S[i] == "Y":
haba.append(now)
now = 0
haba.append(now)
haba = haba[1:-1]
haba.sort()
ans = 0
for h in haba:
if h <= K:
K -= h
ans += h+1
else:
break
ans += K
print(ans)
|
ConDefects/ConDefects/Code/arc157_b/Python/43913220
|
condefects-python_data_2031
|
N,K=map(int,input().split())
S=list(input())+["Z"]
xcount=0
for i in range(N):
if S[i]=="X":
xcount+=1
if K>xcount:
for i in range(N):
if S[i]=="X":
S[i]="Y"
elif S[i]=="Y":
S[i]="X"
K=K-xcount
hq=[]
from heapq import *
heapify(hq)
for i in range(N+1):
if i==0:
count=1
l=0
continue
if S[i]!=S[i-1]:
if S[i-1]=="X":
heappush(hq,(count,l,i))
count=0
l=i
count+=1
s=(-1,-1,-1)
e=(-1,-1,-1)
while len(hq) and K:
c,l,r=heappop(hq)
if l==0:
s=(c,l,r)
continue
if r==N:
e=(c,l,r)
continue
if K>=c:
for i in range(l,r):
S[i]="Y"
K-=c
else:
for i in range(l,l+K):
S[i]="Y"
K=0
if K:
c,l,r=s
for i in reversed(range(max(0,r-K),r)):
S[i]="Y"
K-=1
if K:
c,l,r=e
for i in range(l,r):
S[i]="Y"
ans=0
for i in range(1,N):
if S[i]==S[i-1]=="Y":
ans+=1
print(ans)
N,K=map(int,input().split())
S=list(input())+["Z"]
xcount=0
for i in range(N):
if S[i]=="X":
xcount+=1
if K>xcount:
for i in range(N):
if S[i]=="X":
S[i]="Y"
elif S[i]=="Y":
S[i]="X"
K=N-K
hq=[]
from heapq import *
heapify(hq)
for i in range(N+1):
if i==0:
count=1
l=0
continue
if S[i]!=S[i-1]:
if S[i-1]=="X":
heappush(hq,(count,l,i))
count=0
l=i
count+=1
s=(-1,-1,-1)
e=(-1,-1,-1)
while len(hq) and K:
c,l,r=heappop(hq)
if l==0:
s=(c,l,r)
continue
if r==N:
e=(c,l,r)
continue
if K>=c:
for i in range(l,r):
S[i]="Y"
K-=c
else:
for i in range(l,l+K):
S[i]="Y"
K=0
if K:
c,l,r=s
for i in reversed(range(max(0,r-K),r)):
S[i]="Y"
K-=1
if K:
c,l,r=e
for i in range(l,r):
S[i]="Y"
ans=0
for i in range(1,N):
if S[i]==S[i-1]=="Y":
ans+=1
print(ans)
|
ConDefects/ConDefects/Code/arc157_b/Python/43050544
|
condefects-python_data_2032
|
def solve(k, s):
res = 0
lst = []
for s_i in s:
if lst and lst[-1][0] == s_i:lst[-1][1] += 1
else:lst.append([s_i, 1])
x, edge_x = [], 0
for i in range(len(lst)):
l_i, cnt = lst[i]
if i in [0, len(lst) - 1] and l_i == "X":edge_x += cnt
elif l_i == "X":x.append(cnt)
else:res += cnt - 1
for x_i in sorted(x):
if k - x_i >= 0:
k -= x_i
res += x_i + 1
else:
res += k
k -= x_i
break
if k > 0:
res += k
return res
n, k = map(int, input().split())
s = list(input())
x = s.count("X")
if n == x:
ans = 0 if k == 0 else k - 1
elif k <= x:
ans = solve(k, s)
else:
"""
全部ひっくり返す->返しすぎたｎ-ｋ個をもとに戻す
これは反転させたｓに対してｘ(x<=k)個反転させるのと同じ動作
"""
ans = solve(n - k, ["X" if s_i == "Y" else "Y" for s_i in s])
print(ans)
def solve(k, s):
res = 0
lst = []
for s_i in s:
if lst and lst[-1][0] == s_i:lst[-1][1] += 1
else:lst.append([s_i, 1])
x, edge_x = [], 0
for i in range(len(lst)):
l_i, cnt = lst[i]
if i in [0, len(lst) - 1] and l_i == "X":edge_x += cnt
elif l_i == "X":x.append(cnt)
else:res += cnt - 1
for x_i in sorted(x):
if k - x_i >= 0:
k -= x_i
res += x_i + 1
else:
res += k
k -= x_i
break
if k > 0:
res += k
return res
n, k = map(int, input().split())
s = list(input())
x = s.count("X")
if n == x:
ans = 0 if k == 0 else k - 1
elif x == 0:
ans = max(0, n - k - 1)
elif k <= x:
ans = solve(k, s)
else:
"""
全部ひっくり返す->返しすぎたｎ-ｋ個をもとに戻す
これは反転させたｓに対してｘ(x<=k)個反転させるのと同じ動作
"""
ans = solve(n - k, ["X" if s_i == "Y" else "Y" for s_i in s])
print(ans)
|
ConDefects/ConDefects/Code/arc157_b/Python/45276579
|
condefects-python_data_2033
|
H = int(input())
now = 0
day = 0
while now <= H:
now = 2**day
day += 1
print(day)
H = int(input())
now = 0
day = 0
while now <= H:
now+= 1<<day
day += 1
print(day)
|
ConDefects/ConDefects/Code/abc354_a/Python/54993286
|
condefects-python_data_2034
|
from math import log2, ceil
def strict_ceil(number):
if number == ceil(number):
return number + 1
return ceil(number)
H = int(input())
print(strict_ceil(log2(H + 1)))
from math import log2, ceil
def strict_ceil(number):
if number == ceil(number):
return int(number + 1)
return ceil(number)
H = int(input())
print(strict_ceil(log2(H + 1)))
|
ConDefects/ConDefects/Code/abc354_a/Python/54934155
|
condefects-python_data_2035
|
N = int(input())
P = 0
i = 0
while (N > P):
P += 2 ** i
i += 1
print(i)
N = int(input())
P = 0
i = 0
while (N >= P):
P += 2 ** i
i += 1
print(i)
|
ConDefects/ConDefects/Code/abc354_a/Python/54982154
|
condefects-python_data_2036
|
H = int(input())
a = 0
i = 1
while True:
a = a + 2 ** i
i += 1
if a > H:
print(i)
break
H = int(input())
a = 0
i = 1
while True:
a = a + 2 ** i
i += 1
if a >= H:
print(i)
break
|
ConDefects/ConDefects/Code/abc354_a/Python/55041411
|
condefects-python_data_2037
|
H = int(input())
for i in range(H):
n = (2 ** i) - 1
if H < n:
print(i)
break
H = int(input())
for i in range(10 ** 9):
n = (2 ** i) - 1
if H < n:
print(i)
break
|
ConDefects/ConDefects/Code/abc354_a/Python/54981924
|
condefects-python_data_2038
|
h = int(input())
cnt = 0
plant = 0
while plant < h:
plant = plant + 2**cnt
cnt += 1
print(cnt)
h = int(input())
cnt = 1
plant = 0
while plant < h:
plant = plant + 2**cnt
cnt += 1
print(cnt)
|
ConDefects/ConDefects/Code/abc354_a/Python/55104399
|
condefects-python_data_2039
|
H = int(input())
P = 0
for i in range(H):
P += pow(2, i)
if P > H:
print(i + 1)
break
H = int(input())
P = 0
for i in range(H + 1):
P += pow(2, i)
if P > H:
print(i + 1)
break
|
ConDefects/ConDefects/Code/abc354_a/Python/54981846
|
condefects-python_data_2040
|
H = int(input())
height = 0
days = 1
while height <= H:
height += 2 ** days
days += 1
print(days)
H = int(input())
height = 0
days = 0
while height <= H:
height += 2 ** days
days += 1
print(days)
|
ConDefects/ConDefects/Code/abc354_a/Python/54935160
|
condefects-python_data_2041
|
(n,x,y),a,b=[[*map(int,s.split())]for s in open(0)]
INF=1<<60
dp=[INF]*(1<<n)
dp[0]=0
for s in range(1<<n):
c=s.bit_count()
for i in range(n):
if s>>i&1:
continue
d=str(bin(s)[i+2:]).count('1')
dp[s|(1<<i)]=min(dp[s|(1<<i)],dp[s]+(i+d-c)*y+abs(a[i]-b[c])*x)
print(dp[-1])
(n,x,y),a,b=[[*map(int,s.split())]for s in open(0)]
INF=1<<60
dp=[INF]*(1<<n)
dp[0]=0
for s in range(1<<n):
c=s.bit_count()
for i in range(n):
if s>>i&1:
continue
d=str(bin(s)[::-1][i:]).count('1')
dp[s|(1<<i)]=min(dp[s|(1<<i)],dp[s]+(i+d-c)*y+abs(a[i]-b[c])*x)
print(dp[-1])
|
ConDefects/ConDefects/Code/abc232_f/Python/54006538
|
condefects-python_data_2042
|
N,A,B,P,Q=map(int,input().split())
mod=998244353
def sugoroku(X,start):
dp=[[0 for _ in range(N+1)] for _ in range(N+1)]
dp[0][start]=1
for i in range(N):
for j in range(N+1):
for k in range(1,X+1):
denominator=pow(X,-1,mod)
if j+k>=N:
dp[i+1][N]+=dp[i][j]*denominator%mod
else:
dp[i+1][j+k]+=dp[i][j]*denominator%mod
return dp
T_dp=sugoroku(P,A)
A_dp=sugoroku(Q,B)
answer=0
for i in range(N):
answer+=(1-A_dp[i][-1])*T_dp[i+1][-1]
answer%=mod
print(answer%mod)
N,A,B,P,Q=map(int,input().split())
mod=998244353
def sugoroku(X,start):
dp=[[0 for _ in range(N+1)] for _ in range(N+1)]
dp[0][start]=1
for i in range(N):
for j in range(N+1):
for k in range(1,X+1):
denominator=pow(X,-1,mod)
if j+k>=N:
dp[i+1][N]+=dp[i][j]*denominator%mod
else:
dp[i+1][j+k]+=dp[i][j]*denominator%mod
return dp
T_dp=sugoroku(P,A)
A_dp=sugoroku(Q,B)
answer=0
for i in range(N):
answer+=(1-A_dp[i][-1])*(T_dp[i+1][-1]-T_dp[i][-1])
answer%=mod
print(answer%mod)
|
ConDefects/ConDefects/Code/abc298_e/Python/46008577
|
condefects-python_data_2043
|
A = list(map(int, input().split()))
ans = 0
for i in range(64):
ans += A[i] * 2 ** A[i]
print(ans)
A = list(map(int, input().split()))
ans = 0
for i in range(64):
ans += A[i] * (2 ** i)
print(ans)
|
ConDefects/ConDefects/Code/abc306_b/Python/45767909
|
condefects-python_data_2044
|
A = list(map(int,input().split()))
S = 0
import math
for i in range(63):
S = S + A[i]*(pow(2,i))
print(S)
A = list(map(int,input().split()))
S = 0
import math
for i in range(64):
S = S + A[i]*(pow(2,i))
print(S)
|
ConDefects/ConDefects/Code/abc306_b/Python/45442211
|
condefects-python_data_2045
|
import sys
input = lambda: sys.stdin.readline().strip()
a = list(map(int, input().split()))
ans = 0
for i in range(63):
if a[i] == 0:
continue
else:
ans += (2 ** i)
print(ans)
import sys
input = lambda: sys.stdin.readline().strip()
a = list(map(int, input().split()))
ans = 0
for i in range(64):
if a[i] == 0:
continue
else:
ans += (2 ** i)
print(ans)
|
ConDefects/ConDefects/Code/abc306_b/Python/45523037
|
condefects-python_data_2046
|
# https://atcoder.jp/contests/arc173/tasks/arc173_b
import sys; input: lambda _: sys.stdin.readline().rstrip()
# import pypyjit; pypyjit.set_param('max_unroll_recursion=-1')
sys.setrecursionlimit(10001000)
int1=lambda x: int(x) - 1
def isonline(u, v, w):
dw0, dw1 = w[0] - u[0], w[1] - u[1]
dv0, dv1 = v[0] - u[0], v[1] - u[1]
return dw1*dv0 == dv1*dw0
N = int(input())
P = [list(map(int, input().split())) for _ in range(N)]
ret = 0
for i in range(N):
for j in range(i):
cnt = 0
for k in range(N):
if isonline(P[i], P[j], P[k]):
cnt += 1
ret = max(ret, cnt)
u = min(ret//2, N-ret)
if cnt-2*u >= 3:
print(u)
else:
print(N//3)
# https://atcoder.jp/contests/arc173/tasks/arc173_b
import sys; input: lambda _: sys.stdin.readline().rstrip()
# import pypyjit; pypyjit.set_param('max_unroll_recursion=-1')
sys.setrecursionlimit(10001000)
int1=lambda x: int(x) - 1
def isonline(u, v, w):
dw0, dw1 = w[0] - u[0], w[1] - u[1]
dv0, dv1 = v[0] - u[0], v[1] - u[1]
return dw1*dv0 == dv1*dw0
N = int(input())
P = [list(map(int, input().split())) for _ in range(N)]
ret = 0
for i in range(N):
for j in range(i):
cnt = 0
for k in range(N):
if isonline(P[i], P[j], P[k]):
cnt += 1
ret = max(ret, cnt)
u = min(ret//2, N-ret)
if ret-2*u >= 3:
print(u)
else:
print(N//3)
|
ConDefects/ConDefects/Code/arc173_b/Python/52906431
|
condefects-python_data_2047
|
from math import floor
line_dict = {}
n = int(input())
points = []
for i in range(n):
x, y = map(int, input().split())
points.append((x, y))
for i in range(n):
for j in range(i + 1, n):
if points[i][0] - points[j][0] == 0:
key = f"slope:inf, intercept:{points[i][0]}"
if line_dict.get(key, None):
line_dict[key].add(points[i])
line_dict[key].add(points[j])
else:
line_dict[key] = set()
line_dict[key].add(points[i])
line_dict[key].add(points[j])
else:
slope = (points[j][1] - points[i][1])/(points[j][0] - points[i][0])
intercept = points[j][1] - points[j][0] * slope
key = f"slope:{slope}, intercept:{intercept}"
if line_dict.get(key,None):
line_dict[key].add(points[i])
line_dict[key].add(points[j])
else:
line_dict[key] = set()
line_dict[key].add(points[i])
line_dict[key].add(points[j])
max_in_line = - 1
for elements in line_dict.values():
max_in_line = max(max_in_line, len(elements))
imp = n - floor(n/3) + 1
if max_in_line < imp:
print(floor(n/3))
else:
print(n - imp)
from math import floor
line_dict = {}
n = int(input())
points = []
for i in range(n):
x, y = map(int, input().split())
points.append((x, y))
for i in range(n):
for j in range(i + 1, n):
if points[i][0] - points[j][0] == 0:
key = f"slope:inf, intercept:{points[i][0]}"
if line_dict.get(key, None):
line_dict[key].add(points[i])
line_dict[key].add(points[j])
else:
line_dict[key] = set()
line_dict[key].add(points[i])
line_dict[key].add(points[j])
else:
slope = (points[j][1] - points[i][1])/(points[j][0] - points[i][0])
intercept = points[j][1] - points[j][0] * slope
key = f"slope:{slope}, intercept:{intercept}"
if line_dict.get(key,None):
line_dict[key].add(points[i])
line_dict[key].add(points[j])
else:
line_dict[key] = set()
line_dict[key].add(points[i])
line_dict[key].add(points[j])
max_in_line = - 1
for elements in line_dict.values():
max_in_line = max(max_in_line, len(elements))
imp = n - floor(n/3) + 1
if max_in_line < imp:
print(floor(n/3))
else:
print(n - max_in_line)
|
ConDefects/ConDefects/Code/arc173_b/Python/51178140
|
condefects-python_data_2048
|
N=int(input())
P=[list(map(int,input().split())) for i in range(N)]
lin={}
for i in range(N-1):
a,b=P[i]
for j in range(i+1,N):
c,d=P[j]
lin=[b-d,c-a,a*b-b*c]
count=0
for k in range(N):
x,y=P[k]
if lin[0]*x+lin[1]*y+lin[2]==0:
count+=1
if count>N-N//3:
print(N-count)
exit()
print(N//3)
N=int(input())
P=[list(map(int,input().split())) for i in range(N)]
lin={}
for i in range(N-1):
a,b=P[i]
for j in range(i+1,N):
c,d=P[j]
lin=[b-d,c-a,a*d-b*c]
count=0
for k in range(N):
x,y=P[k]
if lin[0]*x+lin[1]*y+lin[2]==0:
count+=1
if count>N-N//3:
print(N-count)
exit()
print(N//3)
|
ConDefects/ConDefects/Code/arc173_b/Python/51168394
|
condefects-python_data_2049
|
n = int(input())
import sys
input = sys.stdin.readline
mp = map(int, sys.stdin.read().split())
xy = list(zip(mp,mp))
stack = []
cnt = 0
ans = 0
for i in range(n):
if cnt < 2:
stack.append(i)
cnt += 1
continue
xi,yi = xy[i]
flag = False
for ji in range(cnt):
if flag:
break
j = stack[ji]
xj,yj = xy[j]
dx = xi-xj
dy = yi-yj
# if dx == 0:
# # dx = 0
# dy = 0
# else:
# # if dx < 0:
# # dx = -dx
# # dy = -dy
# pass
for ki in range(ji+1, cnt):
if flag:
break
k = stack[ki]
xk,yk = xy[k]
ex = xi-xk
ey = yi-yk
# if ex == 0:
# # ex = 0
# ey = 0
# else:
# # if ex < 0:
# # ex = -ex
# # ey = -ey
# pass
# if (dx == ex) & (dy == ey):
# print("a", i,j,k)
# continue
# elif dx == 0:
# print("b", i,j,k)
# pass
# elif ex == 0:
# print("c", i,j,k)
# pass
# else:
if (dx == 0) | (ex == 0):
if dx == ex:
continue
else:
pass
elif (dx * ey) == (dy * ex):
# print("d", i,j,k)
continue
else:
# print("e", i,j,k)
pass
stack.remove(k)
stack.remove(j)
cnt -= 2
ans += 1
flag = True
if not flag:
stack.append(i)
cnt += 1
if cnt < 3:
print(ans)
exit()
j = stack[0]
k = stack[1]
# xj,yj = xy[j]
# xk,yk = xy[k]
def line(p,q):
"""
2点p(px,py),q(qx,qy)を通る直線ax+by+c=0のa,b,cを返す
"""
px,py = p
qx,qy = q
a = py - qy
b = qx - px
c = px*qy - py-qx
return a,b,c
a,b,c = line(xy[j], xy[k])
cnt = 0
for i in range(n):
xi,yi = xy[i]
if (a*xi + b*yi + c) == 0:
cnt += 1
else:
pass
if cnt >= (n-n//3):
print(n-cnt)
else:
print(n//3)
# print(ans)
n = int(input())
import sys
input = sys.stdin.readline
mp = map(int, sys.stdin.read().split())
xy = list(zip(mp,mp))
stack = []
cnt = 0
ans = 0
for i in range(n):
if cnt < 2:
stack.append(i)
cnt += 1
continue
xi,yi = xy[i]
flag = False
for ji in range(cnt):
if flag:
break
j = stack[ji]
xj,yj = xy[j]
dx = xi-xj
dy = yi-yj
# if dx == 0:
# # dx = 0
# dy = 0
# else:
# # if dx < 0:
# # dx = -dx
# # dy = -dy
# pass
for ki in range(ji+1, cnt):
if flag:
break
k = stack[ki]
xk,yk = xy[k]
ex = xi-xk
ey = yi-yk
# if ex == 0:
# # ex = 0
# ey = 0
# else:
# # if ex < 0:
# # ex = -ex
# # ey = -ey
# pass
# if (dx == ex) & (dy == ey):
# print("a", i,j,k)
# continue
# elif dx == 0:
# print("b", i,j,k)
# pass
# elif ex == 0:
# print("c", i,j,k)
# pass
# else:
if (dx == 0) | (ex == 0):
if dx == ex:
continue
else:
pass
elif (dx * ey) == (dy * ex):
# print("d", i,j,k)
continue
else:
# print("e", i,j,k)
pass
stack.remove(k)
stack.remove(j)
cnt -= 2
ans += 1
flag = True
if not flag:
stack.append(i)
cnt += 1
if cnt < 3:
print(ans)
exit()
j = stack[0]
k = stack[1]
# xj,yj = xy[j]
# xk,yk = xy[k]
def line(p,q):
"""
2点p(px,py),q(qx,qy)を通る直線ax+by+c=0のa,b,cを返す
"""
px,py = p
qx,qy = q
a = py - qy
b = qx - px
c = px*qy - py*qx
return a,b,c
a,b,c = line(xy[j], xy[k])
cnt = 0
for i in range(n):
xi,yi = xy[i]
if (a*xi + b*yi + c) == 0:
cnt += 1
else:
pass
if cnt >= (n-n//3):
print(n-cnt)
else:
print(n//3)
# print(ans)
|
ConDefects/ConDefects/Code/arc173_b/Python/51157170
|
condefects-python_data_2050
|
M = int(input())
D = list(map(int, input().split()))
middleD = (sum(D)+1)/2
sumD = 0
for i in range(M):
sumD += D[i]
if sumD >= middleD:
print(i+1, middleD - sumD + D[i])
break
M = int(input())
D = list(map(int, input().split()))
middleD = int((sum(D)+1)/2)
sumD = 0
for i in range(M):
sumD += D[i]
if sumD >= middleD:
print(i+1, middleD - sumD + D[i])
break
|
ConDefects/ConDefects/Code/abc315_b/Python/46054320
|
condefects-python_data_2051
|
M=int(input())
D=list(map(int,input().split()))
half=(sum(D)+1)/2
for i in range(M):
if half-D[i]<=0:
print(i+1,half)
break
else:
half-=D[i]
M=int(input())
D=list(map(int,input().split()))
half=int((sum(D)+1)/2)
for i in range(M):
if half-D[i]<=0:
print(i+1,half)
break
else:
half-=D[i]
|
ConDefects/ConDefects/Code/abc315_b/Python/46027434
|
condefects-python_data_2052
|
m = int(input())
d = list(map(int, input().split()))
mid = (sum(d) + 1) // 2
i = 0
while True:
if mid - d[i] >=0 and m != 1:
mid -= d[i]
i += 1
else:
print(i+1, mid)
break
m = int(input())
d = list(map(int, input().split()))
mid = (sum(d) + 1) // 2
i = 0
while True:
if mid - d[i] > 0 and m != 1:
mid -= d[i]
i += 1
else:
print(i+1, mid)
break
|
ConDefects/ConDefects/Code/abc315_b/Python/45969003
|
condefects-python_data_2053
|
M = int(input())
D = list(map(int, input().split()))
X = (sum(D)+1)//2
S = 0
print(X)
for i in range(M):
S = S + D[i]
if S >= X:
exit(print(i+1, X-S+D[i]))
M = int(input())
D = list(map(int, input().split()))
X = (sum(D)+1)//2
S = 0
for i in range(M):
S = S + D[i]
if S >= X:
exit(print(i+1, X-S+D[i]))
exit(print(str(i+1) + ' ' + str(X - S + D[i])))
|
ConDefects/ConDefects/Code/abc315_b/Python/45937526
|
condefects-python_data_2054
|
M = int(input())
D = list(map(int, input().split()))
mid = (sum(D) + 1) // 2
for i in range(M):
mid -= D[i]
if mid < 0:
print(i+1, mid+D[i])
break
elif mid == 0:
print(i+1, D[i-1])
break
M = int(input())
D = list(map(int, input().split()))
mid = (sum(D) + 1) // 2
for i in range(M):
mid -= D[i]
if mid < 0:
print(i+1, mid+D[i])
break
elif mid == 0:
print(i+1, D[i])
break
|
ConDefects/ConDefects/Code/abc315_b/Python/46021749
|
condefects-python_data_2055
|
N = int(input())
S = input()
print(max([S.rfind('A'), S.rfind('B'), S.rfind('C')])+1)
N = int(input())
S = input()
print(max([S.find('A'), S.find('B'), S.find('C')])+1)
|
ConDefects/ConDefects/Code/abc311_a/Python/46012329
|
condefects-python_data_2056
|
n = int(input())
result = [char for char in input()]
flag_a = 0
flag_b = 0
flag_c = 0
for i in range(n):
if result[i] == 'A':
flag_a = 1
elif result[i] == 'B':
flag_b = 1
elif result[i] == 'C':
flag_c = 1
if flag_a + flag_b + flag_c == 3:
print(i)
break
n = int(input())
result = [char for char in input()]
flag_a = 0
flag_b = 0
flag_c = 0
for i in range(n):
if result[i] == 'A':
flag_a = 1
elif result[i] == 'B':
flag_b = 1
elif result[i] == 'C':
flag_c = 1
if flag_a + flag_b + flag_c == 3:
print(i + 1)
break
|
ConDefects/ConDefects/Code/abc311_a/Python/45962858
|
condefects-python_data_2057
|
n = int(input())
s = input()
a,b,c = 0,0,0
for i in range(n):
if s[i] == 'A':
a = 1
if s[i] == 'B':
b = 1
if s[i] == 'C':
c = 1
if a*b*c == 1:
print(i)
exit()
n = int(input())
s = input()
a,b,c = 0,0,0
for i in range(n):
if s[i] == 'A':
a = 1
if s[i] == 'B':
b = 1
if s[i] == 'C':
c = 1
if a*b*c == 1:
print(i+1)
exit()
|
ConDefects/ConDefects/Code/abc311_a/Python/45791225
|
condefects-python_data_2058
|
N = int(input())
S = input()
a = S.find("A")
b = S.find("B")
c = S.find("C")
print(max(a,b,c))
N = int(input())
S = input()
a = S.find("A")
b = S.find("B")
c = S.find("C")
print(max(a,b,c)+1)
|
ConDefects/ConDefects/Code/abc311_a/Python/45775601
|
condefects-python_data_2059
|
import sys
N=int(input())
S=str(input())
a=0
b=0
c=0
n=0
S=list(S)
for i in range(N):
if a>=1 and b>=1 and c>=1:
print(n)
sys.exit()
elif S[i]=='A':
n+=1
a+=1
elif S[i]=='B':
n+=1
b+=1
elif S[i]=='C':
n+=1
c+=1
else:
n+=1
import sys
N=int(input())
S=str(input())
a=0
b=0
c=0
n=0
S=list(S)
for i in range(N+1):
if a>=1 and b>=1 and c>=1:
print(n)
sys.exit()
elif S[i]=='A':
n+=1
a+=1
elif S[i]=='B':
n+=1
b+=1
elif S[i]=='C':
n+=1
c+=1
else:
n+=1
|
ConDefects/ConDefects/Code/abc311_a/Python/46036400
|
condefects-python_data_2060
|
from collections import defaultdict
mod = 998244353
kaijou = [1]
kaijou_ = [1]
for i in range(1,2*10**5+1):
k = kaijou[-1]*i
k %= mod
kaijou.append(k)
k = pow(k,mod-2,mod)
kaijou_.append(k)
def comb(n,r):
if n < r:
return 0
res = kaijou[n]
res *= kaijou_[r]
res %= mod
res *= kaijou_[n-r]
res %= mod
return res
N,M,K = map(int,input().split())
d = defaultdict(int)
for i in range(M):
a,b = map(int,input().split())
d[a] ^= 1
d[b] ^= 1
a = 0
for i in range(1,N+1):
a += d[i]
b = N - a
ans = 0
for i in range(K):
k = 2*i
if k > K:
break
r = comb(a,k)
r *= comb(b,K-k)
r %= mod
ans += r
ans %= mod
print(ans)
from collections import defaultdict
mod = 998244353
kaijou = [1]
kaijou_ = [1]
for i in range(1,2*10**5+1):
k = kaijou[-1]*i
k %= mod
kaijou.append(k)
k = pow(k,mod-2,mod)
kaijou_.append(k)
def comb(n,r):
if n < r:
return 0
res = kaijou[n]
res *= kaijou_[r]
res %= mod
res *= kaijou_[n-r]
res %= mod
return res
N,M,K = map(int,input().split())
d = defaultdict(int)
for i in range(M):
a,b = map(int,input().split())
d[a] ^= 1
d[b] ^= 1
a = 0
for i in range(1,N+1):
a += d[i]
b = N - a
ans = 0
for i in range(K+1):
k = 2*i
if k > K:
break
r = comb(a,k)
r *= comb(b,K-k)
r %= mod
ans += r
ans %= mod
print(ans)
|
ConDefects/ConDefects/Code/abc262_e/Python/44831745
|
condefects-python_data_2061
|
n = int(input())
s = input()
result = set()
ch = s[0]
length = 1
result.add((ch, length))
for i in range(1, n):
if s[i-1] == s[i]:
length += 1
result.add((ch, length))
else:
ch = s[i]
length = 1
result.add((ch, length))
result = len(result)
n = int(input())
s = input()
result = set()
ch = s[0]
length = 1
result.add((ch, length))
for i in range(1, n):
if s[i-1] == s[i]:
length += 1
result.add((ch, length))
else:
ch = s[i]
length = 1
result.add((ch, length))
print(len(result))
|
ConDefects/ConDefects/Code/abc329_c/Python/54204891
|
condefects-python_data_2062
|
from collections import defaultdict
N = int(input())
S = list(input())
d = defaultdict(int)
a = 1
for i in range(N-1):
if S[i]==S[i+1]: a += 1
else: a = 1
d[S[i]] = max(d[S[i]], a)
ans = 0
for i in d.values(): ans += i
print(ans)
from collections import defaultdict
N = int(input())
if N==1: exit(print(1))
S = list(input())
d = defaultdict(int)
a = 1
for i in range(N-1):
if S[i]==S[i+1]: a += 1
else: a = 1
d[S[i]] = max(d[S[i]], a)
ans = 0
for i in d.values(): ans += i
#print(d)
print(ans)
|
ConDefects/ConDefects/Code/abc329_c/Python/54527271
|
condefects-python_data_2063
|
n = int(input())
lsts = list(input())
ords = [ord(x) - ord("a") for x in lsts]
apb = [0] * 26
apb[ords[0]] = 1
cnt = 1
for i in range(1,n):
if i == n-1:
apb[ords[i]] = max(cnt, apb[ords[i]])
continue
if ords[i] == ords[i+1]:
cnt += 1
continue
elif ords[i] != ords[i+1]:
apb[ords[i]] = max(cnt, apb[ords[i]])
cnt = 1
continue
print(sum(apb))
n = int(input())
lsts = list(input())
ords = [ord(x) - ord("a") for x in lsts]
apb = [0] * 26
apb[ords[0]] = 1
cnt = 1
for i in range(n):
if i == n-1:
apb[ords[i]] = max(cnt, apb[ords[i]])
continue
if ords[i] == ords[i+1]:
cnt += 1
continue
elif ords[i] != ords[i+1]:
apb[ords[i]] = max(cnt, apb[ords[i]])
cnt = 1
continue
print(sum(apb))
|
ConDefects/ConDefects/Code/abc329_c/Python/54412437
|
condefects-python_data_2064
|
def calc1(a, m, t):
if t == -1:
return len(a) // 2
if len(a) < 2:
return 0
bit = 1 << t
b = []
c = []
for i in a:
if i & bit: c.append(i)
else: b.append(i)
if m & bit: return calc2(b, c, m, t - 1)
else:
if len(b) > len(c): b, c = c, b
res = len(b) + min((len(c) - len(b)) // 2, calc1(c, m, t - 1))
return res
def calc2(b, c, m, t):
if t == -1: return min(len(b), len(c))
if len(b) == 0 or len(c) == 0: return 0
bit = 1 << t
d = []
e = []
f = []
g = []
for i in b:
if i & bit: e.append(i)
else: d.append(i)
for i in c:
if i & bit: g.append(i)
else: f.append(i)
if m & bit:
return calc2(e, f, m, t - 1) + calc2(d, g, m, t - 1)
else:
res = min(len(e), len(f)) + min(len(d), len(g))
if len(e) > len(f) and len(g) > len(d):
res += min(len(e) - len(f), len(g) - len(d), calc2(e, g, m, t - 1))
elif len(e) < len(f) and len(g) < len(d):
res += min(len(f) - len(e), len(d) - len(g), calc2(d, f, m, t - 1))
return res
n = int(input())
a = list(map(int, input().split()))
l = 0
r = 10 ** 10
while l + 1 < r:
m = (l + r) // 2
if calc1(a, m, 29) >= (n + 1) // 2: l = m
else: r = m
print(l)
def calc1(a, m, t):
if t == -1:
return len(a) // 2
if len(a) < 2:
return 0
bit = 1 << t
b = []
c = []
for i in a:
if i & bit: c.append(i)
else: b.append(i)
if m & bit: return calc2(b, c, m, t - 1)
else:
if len(b) > len(c): b, c = c, b
res = len(b) + min((len(c) - len(b)) // 2, calc1(c, m, t - 1))
return res
def calc2(b, c, m, t):
if t == -1: return min(len(b), len(c))
if len(b) == 0 or len(c) == 0: return 0
bit = 1 << t
d = []
e = []
f = []
g = []
for i in b:
if i & bit: e.append(i)
else: d.append(i)
for i in c:
if i & bit: g.append(i)
else: f.append(i)
if m & bit:
return calc2(e, f, m, t - 1) + calc2(d, g, m, t - 1)
else:
res = min(len(e), len(f)) + min(len(d), len(g))
if len(e) > len(f) and len(g) > len(d):
res += min(len(e) - len(f), len(g) - len(d), calc2(e, g, m, t - 1))
elif len(e) < len(f) and len(g) < len(d):
res += min(len(f) - len(e), len(d) - len(g), calc2(d, f, m, t - 1))
return res
n = int(input())
a = list(map(int, input().split()))
l = 0
r = 1 << 30
while l + 1 < r:
m = (l + r) // 2
if calc1(a, m, 29) >= (n + 1) // 2: l = m
else: r = m
print(l)
|
ConDefects/ConDefects/Code/abc304_g/Python/41991921
|
condefects-python_data_2065
|
N=int(input())
A=list(map(int,input().split()))
limit=(N+1)//2
def f1(d,C,x):
if len(C)<=1:
return 0
if d==-1:
return len(C)//2
c0=[]
c1=[]
for i in C:
if (i>>d)&1==0:
c0.append(i)
else:
c1.append(i)
if len(c0)>len(c1):
c0,c1=c1,c0
if (x>>d)&1==0:
return len(c0)+min((len(c1)-len(c0))//2,f1(d-1,c1,x))
else:
return f2(d-1,c0,c1,x)
def f2(dd,C,D,x):
if min(len(C),len(D))==0:
return 0
if dd==-1:
return min(len(C),len(D))
c0=[]
c1=[]
for i in C:
if (i>>dd)&1==0:
c0.append(i)
else:
c1.append(i)
d0=[]
d1=[]
for i in D:
if (i>>dd)&1==0:
d0.append(i)
else:
d1.append(i)
if (x>>dd)&1==0:
mc0d1=min(len(c0),len(d1))
mc1d0=min(len(c1),len(d0))
c0_r=len(c0)-mc0d1
c1_r=len(c1)-mc1d0
d0_r=len(d0)-mc1d0
d1_r=len(d1)-mc0d1
t=mc0d1+mc1d0
if min(c0_r,d0_r)>0:
t+=min(f2(dd-1,c0,d0,x),c0_r,d0_r)
if min(c1_r,d1_r)>0:
t+=min(f2(dd-1,c1,d1,x),c1_r,d1_r)
return t
else:
return f2(dd-1,c0,d1,x)+f2(dd-1,c1,d0,x)
def func(C,x):
r=f1(30,C,x)
if r>=limit:
return True
else:
return False
l=[0,2**30]
while l[1]-l[0]>2:
lm=(l[0]+l[1])//2
if func(A,lm):
l[0]=lm
else:
l[1]=lm
print(l[0])
N=int(input())
A=list(map(int,input().split()))
limit=(N+1)//2
def f1(d,C,x):
if len(C)<=1:
return 0
if d==-1:
return len(C)//2
c0=[]
c1=[]
for i in C:
if (i>>d)&1==0:
c0.append(i)
else:
c1.append(i)
if len(c0)>len(c1):
c0,c1=c1,c0
if (x>>d)&1==0:
return len(c0)+min((len(c1)-len(c0))//2,f1(d-1,c1,x))
else:
return f2(d-1,c0,c1,x)
def f2(dd,C,D,x):
if min(len(C),len(D))==0:
return 0
if dd==-1:
return min(len(C),len(D))
c0=[]
c1=[]
for i in C:
if (i>>dd)&1==0:
c0.append(i)
else:
c1.append(i)
d0=[]
d1=[]
for i in D:
if (i>>dd)&1==0:
d0.append(i)
else:
d1.append(i)
if (x>>dd)&1==0:
mc0d1=min(len(c0),len(d1))
mc1d0=min(len(c1),len(d0))
c0_r=len(c0)-mc0d1
c1_r=len(c1)-mc1d0
d0_r=len(d0)-mc1d0
d1_r=len(d1)-mc0d1
t=mc0d1+mc1d0
if min(c0_r,d0_r)>0:
t+=min(f2(dd-1,c0,d0,x),c0_r,d0_r)
if min(c1_r,d1_r)>0:
t+=min(f2(dd-1,c1,d1,x),c1_r,d1_r)
return t
else:
return f2(dd-1,c0,d1,x)+f2(dd-1,c1,d0,x)
def func(C,x):
r=f1(30,C,x)
if r>=limit:
return True
else:
return False
l=[0,2**30]
while l[1]-l[0]>=2:
lm=(l[0]+l[1])//2
if func(A,lm):
l[0]=lm
else:
l[1]=lm
print(l[0])
|
ConDefects/ConDefects/Code/abc304_g/Python/41999726
|
condefects-python_data_2066
|
p=998244353;f=[1,1];e=[1];N=1<<21;R=range
for i in R(N):f+=(f[-1]+f[-2])%p,
for i in R(2,N,2):e+=e[-1]*f[i]**2%p,
for i in[*open(0)][1:]:h,w=map(int,sorted(i.split()));print(e[h]*pow(f[h*2+1],w-h,p)%p)
p=998244353;f=[1,1];e=[1];N=1<<21;R=range
for i in R(N):f+=(f[-1]+f[-2])%p,
for i in R(2,N,2):e+=e[-1]*f[i]**2%p,
for i in[*open(0)][1:]:h,w=sorted(map(int,i.split()));print(e[h]*pow(f[h*2+1],w-h,p)%p)
|
ConDefects/ConDefects/Code/arc166_c/Python/49538058
|
condefects-python_data_2067
|
import sys
sys.setrecursionlimit(10**8)
from sys import stdin
#import numba as nb
#from numba import b1, i4, i8, f8
from collections import defaultdict
from collections import Counter
from collections import deque
import heapq
#import networkx as nx
from itertools import combinations,permutations
from functools import cmp_to_key
import math
import bisect
import sys
sys.setrecursionlimit(10**8)
from sys import stdin
#import numba as nb
#from numba import b1, i4, i8, f8
from collections import defaultdict
from collections import Counter
from collections import deque
import heapq
#import networkx as nx
from itertools import combinations,permutations
from functools import cmp_to_key
import math
import bisect
import numpy as np
import copy
import random
from collections import defaultdict
class LazySegTree_RUQ:
def __init__(self,init_val,segfunc,ide_ele):
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
self.lazy = [None]*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 gindex(self,l,r):
l += self.num
r += self.num
lm = l>>(l&-l).bit_length()
rm = r>>(r&-r).bit_length()
while r>l:
if l<=lm:
yield l
if r<=rm:
yield r
r >>= 1
l >>= 1
while l:
yield l
l >>= 1
def propagates(self,*ids):
for i in reversed(ids):
v = self.lazy[i]
if v is None:
continue
self.lazy[i] = None
self.lazy[2*i] = v
self.lazy[2*i+1] = v
self.tree[2*i] = v
self.tree[2*i+1] = v
def update(self,l,r,x):
ids = self.gindex(l,r)
self.propagates(*self.gindex(l,r))
l += self.num
r += self.num
while l<r:
if l&1:
self.lazy[l] = x
self.tree[l] = x
l += 1
if r&1:
self.lazy[r-1] = x
self.tree[r-1] = x
r >>= 1
l >>= 1
for i in ids:
self.tree[i] = self.segfunc(self.tree[2*i], self.tree[2*i+1])
def query(self,l,r):
ids = self.gindex(l,r)
self.propagates(*self.gindex(l,r))
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
class LazySegTree_RAQ: #0-index
def __init__(self,init_val,segfunc,ide_ele):
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
self.lazy = [0]*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 gindex(self,l,r):
l += self.num
r += self.num
lm = l>>(l&-l).bit_length()
rm = r>>(r&-r).bit_length()
while r>l:
if l<=lm:
yield l
if r<=rm:
yield r
r >>= 1
l >>= 1
while l:
yield l
l >>= 1
def propagates(self,*ids):
for i in reversed(ids):
v = self.lazy[i]
if v==0:
continue
self.lazy[i] = 0
self.lazy[2*i] += v
self.lazy[2*i+1] += v
self.tree[2*i] += v
self.tree[2*i+1] += v
def add(self,l,r,x):
ids = self.gindex(l,r)
l += self.num
r += self.num
while l<r:
if l&1:
self.lazy[l] += x
self.tree[l] += x
l += 1
if r&1:
self.lazy[r-1] += x
self.tree[r-1] += x
r >>= 1
l >>= 1
for i in ids:
self.tree[i] = self.segfunc(self.tree[2*i], self.tree[2*i+1]) + self.lazy[i]
def query(self,l,r):
self.propagates(*self.gindex(l,r))
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
class SegTree:
"""
init(init_val, ide_ele): 配列init_valで初期化 O(N)
update(k, x): k番目の値をxに更新 O(N)
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
class UnionFind():# 0-index
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
def __str__(self):
return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
def z_alg(s):
l=len(s)
d=[0]*(l+1)
d[0]=l
i=1
while i<l:
j=d[i]
while i+j<l and s[i+j]==s[j]:
j+=1
d[i]=j
k=1
while d[k]<j-k:
d[i+k]=d[k]
k+=1
d[i+k]=max(0,j-k)
i+=k
return d
class Bit:# 1-index
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.tree[i] += x
i += i & -i
def prime_f(n):
k=2
z=defaultdict(int)
while n>=k**2:
if n%k==0:
z[k]+=1
n//=k
else:
k+=1
if n>1:
z[n]+=1
return z
def pr_fac(n):
counter = Counter()
p=2
while p**2<n:
while n % p == 0:
counter[p] += 1
n //= p
p+=1
if n != 1:
counter[n] += 1
s=[]
for key, value in counter.items():
for i in range(value):
s.append(key)
return s
def base_change(n,nb,ob=10):
n10=int(str(n),ob)
dig="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
q=[]
if n10==0:
return "0"
while n10>0:
q.append(dig[n10%nb])
n10//=nb
return "".join(q[::-1])
mod=998244353
inf=1<<60
lim=3*10**6
fact=[1,1]
inv=[0,1]
factinv=[1,1]
alp="abcdefghijklmnopqrstuvwxyz"
dalp={alp[i]:i for i in range(26)}
def factorial():
for i in range(2,lim):
fact.append((fact[-1]*i)%mod)
inv.append((-(mod//i)*inv[mod%i])%mod)
factinv.append((factinv[-1]*inv[-1])%mod)
return
def binom(a,b):
if 0<=b<=a:
return (fact[a]*factinv[b]*factinv[a-b])%mod
else:
return 0
def cumsum(l):
c=[0]
for li in l:
c.append(c[-1]+li)
return c
def flws(d): # Floyd-Warshall法で各頂点i,jについてiからjへの最短経路を求める。dには(i,j)成分が辺i->jの重み(ない場合はinf,i=jなら0)になっている行列を渡す。nを頂点数としてO(n^3)
n=len(d)
dwf=[d for __ in range(n+1)]
for i in range(1,n+1):
for j in range(n):
for k in range(n):
dwf[i][j][k]=min(dwf[i-1][j][k],dwf[i-1][j][i-1]+dwf[i-1][i-1][k])
return dwf[-1]
def dijk(n,e,start):# n:num of vertices, e:edges are one-way, dict-form of a:[(b_i,c_i)] c_i:cost of a->b_i, 0-index vertices
d=[inf]*n
d[start]=0
q=[(0,start)]
prev=[-1]*n
heapq.heapify(q)
while len(q)>0:
xt=heapq.heappop(q)
dx,x=xt
for yc in e[x]:
y,c=yc
if d[y]>d[x]+c:
d[y]=d[x]+c
prev[y]=x
heapq.heappush((d[y],y))
return d,prev
def long_mul(a,b): #a,bはstring
f=[int(a[max(0,len(a)-(i+1)*5):len(a)-i*5]) for i in range((len(a)-1)//5+1)]
g=[int(b[max(0,len(b)-(i+1)*5):len(b)-i*5]) for i in range((len(b)-1)//5+1)]
fft_len = 1
while 2 * fft_len < len(f) + len(g):
fft_len *= 2
fft_len *= 2
# フーリエ変換
Ff = np.fft.rfft(f, fft_len)
Fg = np.fft.rfft(g, fft_len)
# 各点積
Fh = Ff * Fg
# フーリエ逆変換
h = np.fft.irfft(Fh, fft_len)
# 小数になっているので、整数にまるめる
h = np.rint(h).astype(np.int64)
for i in range(len(h)-1):
h[i+1]+=h[i]//(10**5)
h[i]%=(10**5)
h=[str(hi).zfill(5) for hi in h]
return "".join(h[::-1]).lstrip("0")
def long_mod(a,m):
z=0
for i in range(len(a)):
z=(z*10+int(a[i]))%m
return z
# factorial()
#############
# inf=1<<30
def main(n,uv):
z=[[0]*n for _ in range(n)]
d=[set() for _ in range(n)]
for i in range(n-1):
d[uv[i][0]-1].add(uv[i][1]-1)
d[uv[i][1]-1].add(uv[i][0]-1)
l=[len(d[i]) for i in range(n)]
q=deque([i for i in range(n) if l[i]==1])
for i in range(n):
z[i][0]=1
last=-1
while len(q)>0:
x=q.popleft()
last=x
sx1=sum([z[x][i]*(i+1) for i in range(n)])
sx0=sum(z[x])
for y in d[x]:
l[y]-=1
if l[y]==1:
q.append(y)
for i in range(n-1)[::-1]:
z[y][i+1]=z[y][i]*sx1*(i+1)+z[y][i+1]*sx0
z[y][i+1]%=mod
z[y][0]*=sx0
z[y][0]%=mod
# print(z)
print(sum(z[last]))
# print(z)
return
n,=map(int,input().split())
# x=list(map(int,input().split()))
# a=list(map(int,input().split()))
# b=list(map(int,input().split()))
# n,m,k=input().split()
# nxy=list(input().split())
# a=[input() for _ in range(n)]
# x=[int(input()) for _ in range(q)]
# s=input()
# t=input()
# cp=[input().split() for __ in range(q)]
uv=[list(map(int,input().split())) for __ in range(n-1)]
# c=list(map(int,input().split()))
# n=1000
# a=[str(random.randint(1,10**20)) for _ in range(n)]
main(n,uv)
# for _ in range(t):
# n,a,b=map(int,input().split())
# # a=list(map(int,input().split()))
# # b=list(map(int,input().split()))
# main(n,a,b)
import sys
sys.setrecursionlimit(10**8)
from sys import stdin
#import numba as nb
#from numba import b1, i4, i8, f8
from collections import defaultdict
from collections import Counter
from collections import deque
import heapq
#import networkx as nx
from itertools import combinations,permutations
from functools import cmp_to_key
import math
import bisect
import sys
sys.setrecursionlimit(10**8)
from sys import stdin
#import numba as nb
#from numba import b1, i4, i8, f8
from collections import defaultdict
from collections import Counter
from collections import deque
import heapq
#import networkx as nx
from itertools import combinations,permutations
from functools import cmp_to_key
import math
import bisect
import numpy as np
import copy
import random
from collections import defaultdict
class LazySegTree_RUQ:
def __init__(self,init_val,segfunc,ide_ele):
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
self.lazy = [None]*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 gindex(self,l,r):
l += self.num
r += self.num
lm = l>>(l&-l).bit_length()
rm = r>>(r&-r).bit_length()
while r>l:
if l<=lm:
yield l
if r<=rm:
yield r
r >>= 1
l >>= 1
while l:
yield l
l >>= 1
def propagates(self,*ids):
for i in reversed(ids):
v = self.lazy[i]
if v is None:
continue
self.lazy[i] = None
self.lazy[2*i] = v
self.lazy[2*i+1] = v
self.tree[2*i] = v
self.tree[2*i+1] = v
def update(self,l,r,x):
ids = self.gindex(l,r)
self.propagates(*self.gindex(l,r))
l += self.num
r += self.num
while l<r:
if l&1:
self.lazy[l] = x
self.tree[l] = x
l += 1
if r&1:
self.lazy[r-1] = x
self.tree[r-1] = x
r >>= 1
l >>= 1
for i in ids:
self.tree[i] = self.segfunc(self.tree[2*i], self.tree[2*i+1])
def query(self,l,r):
ids = self.gindex(l,r)
self.propagates(*self.gindex(l,r))
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
class LazySegTree_RAQ: #0-index
def __init__(self,init_val,segfunc,ide_ele):
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
self.lazy = [0]*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 gindex(self,l,r):
l += self.num
r += self.num
lm = l>>(l&-l).bit_length()
rm = r>>(r&-r).bit_length()
while r>l:
if l<=lm:
yield l
if r<=rm:
yield r
r >>= 1
l >>= 1
while l:
yield l
l >>= 1
def propagates(self,*ids):
for i in reversed(ids):
v = self.lazy[i]
if v==0:
continue
self.lazy[i] = 0
self.lazy[2*i] += v
self.lazy[2*i+1] += v
self.tree[2*i] += v
self.tree[2*i+1] += v
def add(self,l,r,x):
ids = self.gindex(l,r)
l += self.num
r += self.num
while l<r:
if l&1:
self.lazy[l] += x
self.tree[l] += x
l += 1
if r&1:
self.lazy[r-1] += x
self.tree[r-1] += x
r >>= 1
l >>= 1
for i in ids:
self.tree[i] = self.segfunc(self.tree[2*i], self.tree[2*i+1]) + self.lazy[i]
def query(self,l,r):
self.propagates(*self.gindex(l,r))
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
class SegTree:
"""
init(init_val, ide_ele): 配列init_valで初期化 O(N)
update(k, x): k番目の値をxに更新 O(N)
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
class UnionFind():# 0-index
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
def __str__(self):
return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
def z_alg(s):
l=len(s)
d=[0]*(l+1)
d[0]=l
i=1
while i<l:
j=d[i]
while i+j<l and s[i+j]==s[j]:
j+=1
d[i]=j
k=1
while d[k]<j-k:
d[i+k]=d[k]
k+=1
d[i+k]=max(0,j-k)
i+=k
return d
class Bit:# 1-index
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.tree[i] += x
i += i & -i
def prime_f(n):
k=2
z=defaultdict(int)
while n>=k**2:
if n%k==0:
z[k]+=1
n//=k
else:
k+=1
if n>1:
z[n]+=1
return z
def pr_fac(n):
counter = Counter()
p=2
while p**2<n:
while n % p == 0:
counter[p] += 1
n //= p
p+=1
if n != 1:
counter[n] += 1
s=[]
for key, value in counter.items():
for i in range(value):
s.append(key)
return s
def base_change(n,nb,ob=10):
n10=int(str(n),ob)
dig="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
q=[]
if n10==0:
return "0"
while n10>0:
q.append(dig[n10%nb])
n10//=nb
return "".join(q[::-1])
mod=998244353
inf=1<<60
lim=3*10**6
fact=[1,1]
inv=[0,1]
factinv=[1,1]
alp="abcdefghijklmnopqrstuvwxyz"
dalp={alp[i]:i for i in range(26)}
def factorial():
for i in range(2,lim):
fact.append((fact[-1]*i)%mod)
inv.append((-(mod//i)*inv[mod%i])%mod)
factinv.append((factinv[-1]*inv[-1])%mod)
return
def binom(a,b):
if 0<=b<=a:
return (fact[a]*factinv[b]*factinv[a-b])%mod
else:
return 0
def cumsum(l):
c=[0]
for li in l:
c.append(c[-1]+li)
return c
def flws(d): # Floyd-Warshall法で各頂点i,jについてiからjへの最短経路を求める。dには(i,j)成分が辺i->jの重み(ない場合はinf,i=jなら0)になっている行列を渡す。nを頂点数としてO(n^3)
n=len(d)
dwf=[d for __ in range(n+1)]
for i in range(1,n+1):
for j in range(n):
for k in range(n):
dwf[i][j][k]=min(dwf[i-1][j][k],dwf[i-1][j][i-1]+dwf[i-1][i-1][k])
return dwf[-1]
def dijk(n,e,start):# n:num of vertices, e:edges are one-way, dict-form of a:[(b_i,c_i)] c_i:cost of a->b_i, 0-index vertices
d=[inf]*n
d[start]=0
q=[(0,start)]
prev=[-1]*n
heapq.heapify(q)
while len(q)>0:
xt=heapq.heappop(q)
dx,x=xt
for yc in e[x]:
y,c=yc
if d[y]>d[x]+c:
d[y]=d[x]+c
prev[y]=x
heapq.heappush((d[y],y))
return d,prev
def long_mul(a,b): #a,bはstring
f=[int(a[max(0,len(a)-(i+1)*5):len(a)-i*5]) for i in range((len(a)-1)//5+1)]
g=[int(b[max(0,len(b)-(i+1)*5):len(b)-i*5]) for i in range((len(b)-1)//5+1)]
fft_len = 1
while 2 * fft_len < len(f) + len(g):
fft_len *= 2
fft_len *= 2
# フーリエ変換
Ff = np.fft.rfft(f, fft_len)
Fg = np.fft.rfft(g, fft_len)
# 各点積
Fh = Ff * Fg
# フーリエ逆変換
h = np.fft.irfft(Fh, fft_len)
# 小数になっているので、整数にまるめる
h = np.rint(h).astype(np.int64)
for i in range(len(h)-1):
h[i+1]+=h[i]//(10**5)
h[i]%=(10**5)
h=[str(hi).zfill(5) for hi in h]
return "".join(h[::-1]).lstrip("0")
def long_mod(a,m):
z=0
for i in range(len(a)):
z=(z*10+int(a[i]))%m
return z
# factorial()
#############
# inf=1<<30
def main(n,uv):
z=[[0]*n for _ in range(n)]
d=[set() for _ in range(n)]
for i in range(n-1):
d[uv[i][0]-1].add(uv[i][1]-1)
d[uv[i][1]-1].add(uv[i][0]-1)
l=[len(d[i]) for i in range(n)]
q=deque([i for i in range(n) if l[i]==1])
for i in range(n):
z[i][0]=1
last=-1
while len(q)>0:
x=q.popleft()
last=x
sx1=sum([z[x][i]*(i+1) for i in range(n)])
sx0=sum(z[x])
for y in d[x]:
l[y]-=1
if l[y]==1:
q.append(y)
for i in range(n-1)[::-1]:
z[y][i+1]=z[y][i]*sx1*(i+1)+z[y][i+1]*sx0
z[y][i+1]%=mod
z[y][0]*=sx0
z[y][0]%=mod
# print(z)
print(sum(z[last])%mod)
# print(z)
return
n,=map(int,input().split())
# x=list(map(int,input().split()))
# a=list(map(int,input().split()))
# b=list(map(int,input().split()))
# n,m,k=input().split()
# nxy=list(input().split())
# a=[input() for _ in range(n)]
# x=[int(input()) for _ in range(q)]
# s=input()
# t=input()
# cp=[input().split() for __ in range(q)]
uv=[list(map(int,input().split())) for __ in range(n-1)]
# c=list(map(int,input().split()))
# n=1000
# a=[str(random.randint(1,10**20)) for _ in range(n)]
main(n,uv)
# for _ in range(t):
# n,a,b=map(int,input().split())
# # a=list(map(int,input().split()))
# # b=list(map(int,input().split()))
# main(n,a,b)
|
ConDefects/ConDefects/Code/arc171_c/Python/50019081
|
condefects-python_data_2068
|
P = 998244353
p, g, ig = 998244353, 3, 332748118
W = [pow(g, (p - 1) >> i, p) for i in range(24)]
iW = [pow(ig, (p - 1) >> i, p) for i in range(24)]
def convolve(a, b):
def fft(f):
for l in range(k, 0, -1):
d = 1 << l - 1
U = [1]
for i in range(d):
U.append(U[-1] * W[l] % p)
for i in range(1 << k - l):
for j in range(d):
s = i * 2 * d + j
t = s + d
f[s], f[t] = (f[s] + f[t]) % p, U[j] * (f[s] - f[t]) % p
def ifft(f):
for l in range(1, k + 1):
d = 1 << l - 1
U = [1]
for i in range(d):
U.append(U[-1] * iW[l] % p)
for i in range(1 << k - l):
for j in range(d):
s = i * 2 * d + j
t = s + d
f[s], f[t] = (f[s] + f[t] * U[j]) % p, (f[s] - f[t] * U[j]) % p
n0 = len(a) + len(b) - 1
if len(a) < 50 or len(b) < 50:
ret = [0] * n0
if len(a) > len(b): a, b = b, a
for i, aa in enumerate(a):
for j, bb in enumerate(b):
ret[i+j] = (ret[i+j] + aa * bb) % P
return ret
k = (n0).bit_length()
n = 1 << k
a = a + [0] * (n - len(a))
b = b + [0] * (n - len(b))
fft(a), fft(b)
for i in range(n):
a[i] = a[i] * b[i] % p
ifft(a)
invn = pow(n, p - 2, p)
for i in range(n0):
a[i] = a[i] * invn % p
del a[n0:]
return a
def Tonelli_Shanks(n, p = P):
if pow(n, (p-1) // 2, p) == -1:
return -1
if p % 4 == 3:
a = pow(n, (p+1) // 4, p)
return min(a, p - a)
q = p - 1
s = 0
while q % 2 == 0:
q //= 2
s += 1
for z in range(1, p):
if pow(z, (p-1) // 2, p) != 1:
break
m = s
c = pow(z, q, p)
t = pow(n, q, p)
r = pow(n, (q+1) // 2, p)
while 1:
if t == 0:
return 0
if t == 1:
return min(r, p - r)
for i in range(1, m):
if pow(t, 1 << i, p) == 1:
break
if m - i <= 0:
return -1
b = pow(c, 1 << m-i-1, p)
m = i
c = b ** 2 % p
t = t * b ** 2 % p
r = r * b % p
class fps():
def __init__(self, a, m = 10**6):
if type(a) == int:
self.len = 1
self.f = [a]
elif a:
self.len = len(a)
self.f = a
else:
self.len = 1
self.f = [0]
def copy(self):
return fps(self.f[:])
def __neg__(self):
l = [0] * self.len
for i, a in enumerate(self.f):
l[i] = P - a if a else 0
return self.__class__(l)
def __add__(self, other):
if type(other) == int:
return self + self.__class__([other])
if self.len > other.len:
l = self.f[:]
for i, a in enumerate(other.f):
l[i] += a
if l[i] >= P:
l[i] -= P
else:
l = other.f[:]
for i, a in enumerate(self.f):
l[i] += a
if l[i] >= P:
l[i] -= P
return self.__class__(l)
def __radd__(self, other):
return self + other
def __sub__(self, other):
if type(other) == int:
return self - self.__class__([other])
l = self.f[:] + [0] * (other.len - self.len)
for i, a in enumerate(other.f):
l[i] -= a
if l[i] < 0:
l[i] += P
return self.__class__(l)
def __rsub__(self, other):
return self.__class__([other]) - self
def __mul__(self, other):
if type(other) == int:
l = self.f[:]
for i in range(self.len):
l[i] = l[i] * other % P
return self.__class__(l)
else:
return self.__class__(convolve(self.f, other.f))
def __rmul__(self, other):
l = self.f[:]
for i in range(self.len):
l[i] = l[i] * other % P
return self.__class__(l)
def inv(self, deg = -1):
f = self.f[:]
assert f[0]
n = self.len
if deg < 0: deg = n
ret = __class__([pow(self.f[0], P - 2, P)])
i = 1
while i < deg:
ret = (ret * (2 - ret * self[:i*2]))[:i*2]
i <<= 1
return ret[:deg]
def __floordiv__(self, other):
d1 = self.len
d2 = other.len
if d1 < d2:
return fps([0])
return self.__class__((self.__class__(self.f[::-1]) * self.__class__(other.f[::-1]).inv(d1)).f[:d1-d2+1][::-1])
def __mod__(self, other):
if self.len < other.len:
return self.copy()
return (self - other * (self // other))[:other.len-1]
def __truediv__(self, other, deg = -1):
if type(other) == int:
iv = pow(other, P - 2, P)
l = self.f[:]
for i in range(self.len):
l[i] = l[i] * iv % P
return self.__class__(l)
else:
if deg < 0: deg = max(self.len, other.len)
return (self * other.inv(deg))[:deg]
def __rtruediv__(self, other, deg = -1):
if type(other) == int:
return fps(other) / self
else:
if deg < 0: deg = max(self.len, other.len)
return (other * self.inv(deg))[:deg]
def sqrt(self):
if self.f[0] == 0:
for k, a in enumerate(self.f):
if a: break
else:
return self.__class__([0] * self.len)
if k & 1: return None
sq = self.__class__(self.f[k:] + [0] * (k//2)).sqrt()
if not sq: return None
return fps([0] * (k//2) + sq.f)
ts = Tonelli_Shanks(self.f[0])
if ts < 0: return None
deg = self.len
a = self.__class__([ts])
i = 1
while i < deg:
a += self[:i*2].__truediv__(a)
a /= 2
i <<= 1
return a
def f2e(self):
f = self.f[:]
for i, a in enumerate(f):
f[i] = a * fainv[i] % P
return self.__class__(f)
def e2f(self):
f = self.f[:]
for i, a in enumerate(f):
f[i] = a * fa[i] % P
return self.__class__(f)
def differentiate(self):
f = self.f[:]
for i, a in enumerate(f):
f[i] = a * i % P
f = f[1:] + [0]
return self.__class__(f)
def integrate(self):
f = self.f[:]
for i, a in enumerate(f):
f[i] = a * fainv[i+1] % P * fa[i] % P
f = [0] + f[:-1]
return self.__class__(f)
def log(self, deg = -1):
return (self.differentiate().__truediv__(self, deg)).integrate()
def exp(self, deg = -1):
assert self.f[0] == 0
if deg < 0: deg = self.len
a = self.__class__([1])
i = 1
while i < deg:
a = (a * (self[:i*2] + 1 - a.log(i * 2)))[:i*2]
i <<= 1
return a[:deg]
def __pow__(self, n, deg = -1):
if deg < 0: deg = self.len
if self.f[0] == 0:
assert n >= 0
for i, a in enumerate(self.f):
if a:
if i * n >= deg: return self.__class__([0] * deg)
return self.__class__([0] * (i * n) + pow(self.__class__(self.f[i:]), n, deg - i * n).f)
else:
return self.__class__([0] * deg)
if self.f[0] != 1:
a = self.f[0]
return pow(self / a, n, deg) * pow(a, n, P)
return (self.log(deg) * n).exp(deg)
def taylor_shift(self, c):
deg = self.len
L = []
a = 1
for i in range(deg):
L.append(a * fainv[i] % P)
a = a * c % P
L = L[::-1]
return (self.e2f() * self.__class__(L))[deg-1:].f2e()
def composite(self, other, deg = -1):
assert other.f[0] == 0
if other.len == 1: return self[:1]
if deg < 0: deg = (self.len - 1) * (other.len - 1) + 1
n = other.len
k = int((n / n.bit_length()) ** 0.5) + 1
p = other[:k]
q = other[k:]
def calc():
f = self.f + [0] * ((-self.len) % 4)
pp = p
while 1:
pp2 = (pp * pp)[:deg]
pp3 = (pp2 * pp)[:deg]
g = []
for i in range(0, len(f), 4):
g.append(f[i] + (f[i+1] * pp)[:deg] + (f[i+2] * pp2)[:deg] + (f[i+3] * pp3)[:deg])
if len(g) <= 1:
break
f = g + [0] * ((-len(g)) % 4)
pp = (pp3 * pp)[:deg]
return g[0]
if p.iszero():
ff = self[:]
re = ff[0]
qq = 1
for i in range(k, deg, k):
ff = ff.differentiate()
qq = (qq * q)[:deg-i]
re += (ff[0] * fainv[i//k] * qq).shift(i)
return re
fp = calc()
re = fp[:]
pd = p.differentiate()
z = pd.leadingzeroes()
pdi = pd[z:].inv(deg)
qq = 1
for i in range(k, deg, k):
fp = (pdi[:deg-i+z] * fp[:deg-i+1+z].differentiate())[:deg-i+z][z:]
qq = (qq * q)[:deg-i]
re += ((fp * qq)[:deg-i] * fainv[i//k]).shift(i)
return re
def at(self, v):
f = self.f
s = 0
for a in f[::-1]:
s = (s * v + a) % P
return s
def __lshift__(self, k):
return self.shift(k)
def __rshift__(self, k):
return self.__class__(self.f[k:])
def shift(self, k):
return self.__class__([0] * k + self.f)
def iszero(self):
return sum(self.f) == 0
def leadingzeroes(self):
for i, a in enumerate(self.f):
if a: return i
return self.len
def __getitem__(self, s):
return self.__class__(self.f[s])
def to_frac(self, a):
if 0 <= a <= 10000: return a
if -10000 <= a - P < 0: return a - P
for i in range(1, 10001):
if i and a * i % P <= 10000:
return str(a * i % P) + "/" + str(i)
if i and -a * i % P <= 10000:
return str(-(-a * i % P)) + "/" + str(i)
return a
def __str__(self):
l = []
for a in self.f:
l.append(str(self.to_frac(a)))
return "【" + ", ".join(l) + "】"
# return ", ".join(l)
def __len__(self):
return self.len
DEBUG = 0
from collections import deque
N = int(input())
X = [[] for i in range(N)]
for i in range(N-1):
x, y = map(int, input().split())
x, y = x-1, y-1
X[x].append(y)
X[y].append(x)
PP = [-1] * N
Q = deque([0])
R = []
while Q:
i = deque.popleft(Q)
R.append(i)
for a in X[i]:
if a != PP[i]:
PP[a] = i
X[a].remove(i)
deque.append(Q, a)
if DEBUG:
print("X =", X) # 子リスト
print("PP =", PP) # 親
print("R =", R) # トポロジカルソート
# N の 2 倍ぐらい必要になることがあるので注意
nn = 6060
fa = [1] * (nn+1)
fainv = [1] * (nn+1)
for i in range(nn):
fa[i+1] = fa[i] * (i+1) % P
fainv[-1] = pow(fa[-1], P-2, P)
for i in range(nn)[::-1]:
fainv[i] = fainv[i+1] * (i+1) % P
def calc(L):
# print("L =", L)
while len(L) > 1:
k = (len(L) - 1) // 2
L[k] *= L.pop()
# print("L =", L)
x = L[0].e2f()
f = x.f
y = fps([(i + 1) * a % P for i, a in enumerate(f)])
ret = fps([sum(x.f), sum(y.f)])
if DEBUG:
print("ret =", ret)
return ret
Y = [None for _ in range(N)]
for i in R[::-1]:
if DEBUG:
print("i, X =", i, X[i])
L = [fps([1])]
for j in X[i]:
L.append(Y[j])
Y[i] = calc(L)
print(Y[0].f[0])
if DEBUG:
print("Y =")
for y in Y:
print(y)
P = 998244353
p, g, ig = 998244353, 3, 332748118
W = [pow(g, (p - 1) >> i, p) for i in range(24)]
iW = [pow(ig, (p - 1) >> i, p) for i in range(24)]
def convolve(a, b):
def fft(f):
for l in range(k, 0, -1):
d = 1 << l - 1
U = [1]
for i in range(d):
U.append(U[-1] * W[l] % p)
for i in range(1 << k - l):
for j in range(d):
s = i * 2 * d + j
t = s + d
f[s], f[t] = (f[s] + f[t]) % p, U[j] * (f[s] - f[t]) % p
def ifft(f):
for l in range(1, k + 1):
d = 1 << l - 1
U = [1]
for i in range(d):
U.append(U[-1] * iW[l] % p)
for i in range(1 << k - l):
for j in range(d):
s = i * 2 * d + j
t = s + d
f[s], f[t] = (f[s] + f[t] * U[j]) % p, (f[s] - f[t] * U[j]) % p
n0 = len(a) + len(b) - 1
if len(a) < 50 or len(b) < 50:
ret = [0] * n0
if len(a) > len(b): a, b = b, a
for i, aa in enumerate(a):
for j, bb in enumerate(b):
ret[i+j] = (ret[i+j] + aa * bb) % P
return ret
k = (n0).bit_length()
n = 1 << k
a = a + [0] * (n - len(a))
b = b + [0] * (n - len(b))
fft(a), fft(b)
for i in range(n):
a[i] = a[i] * b[i] % p
ifft(a)
invn = pow(n, p - 2, p)
for i in range(n0):
a[i] = a[i] * invn % p
del a[n0:]
return a
def Tonelli_Shanks(n, p = P):
if pow(n, (p-1) // 2, p) == -1:
return -1
if p % 4 == 3:
a = pow(n, (p+1) // 4, p)
return min(a, p - a)
q = p - 1
s = 0
while q % 2 == 0:
q //= 2
s += 1
for z in range(1, p):
if pow(z, (p-1) // 2, p) != 1:
break
m = s
c = pow(z, q, p)
t = pow(n, q, p)
r = pow(n, (q+1) // 2, p)
while 1:
if t == 0:
return 0
if t == 1:
return min(r, p - r)
for i in range(1, m):
if pow(t, 1 << i, p) == 1:
break
if m - i <= 0:
return -1
b = pow(c, 1 << m-i-1, p)
m = i
c = b ** 2 % p
t = t * b ** 2 % p
r = r * b % p
class fps():
def __init__(self, a, m = 10**6):
if type(a) == int:
self.len = 1
self.f = [a]
elif a:
self.len = len(a)
self.f = a
else:
self.len = 1
self.f = [0]
def copy(self):
return fps(self.f[:])
def __neg__(self):
l = [0] * self.len
for i, a in enumerate(self.f):
l[i] = P - a if a else 0
return self.__class__(l)
def __add__(self, other):
if type(other) == int:
return self + self.__class__([other])
if self.len > other.len:
l = self.f[:]
for i, a in enumerate(other.f):
l[i] += a
if l[i] >= P:
l[i] -= P
else:
l = other.f[:]
for i, a in enumerate(self.f):
l[i] += a
if l[i] >= P:
l[i] -= P
return self.__class__(l)
def __radd__(self, other):
return self + other
def __sub__(self, other):
if type(other) == int:
return self - self.__class__([other])
l = self.f[:] + [0] * (other.len - self.len)
for i, a in enumerate(other.f):
l[i] -= a
if l[i] < 0:
l[i] += P
return self.__class__(l)
def __rsub__(self, other):
return self.__class__([other]) - self
def __mul__(self, other):
if type(other) == int:
l = self.f[:]
for i in range(self.len):
l[i] = l[i] * other % P
return self.__class__(l)
else:
return self.__class__(convolve(self.f, other.f))
def __rmul__(self, other):
l = self.f[:]
for i in range(self.len):
l[i] = l[i] * other % P
return self.__class__(l)
def inv(self, deg = -1):
f = self.f[:]
assert f[0]
n = self.len
if deg < 0: deg = n
ret = __class__([pow(self.f[0], P - 2, P)])
i = 1
while i < deg:
ret = (ret * (2 - ret * self[:i*2]))[:i*2]
i <<= 1
return ret[:deg]
def __floordiv__(self, other):
d1 = self.len
d2 = other.len
if d1 < d2:
return fps([0])
return self.__class__((self.__class__(self.f[::-1]) * self.__class__(other.f[::-1]).inv(d1)).f[:d1-d2+1][::-1])
def __mod__(self, other):
if self.len < other.len:
return self.copy()
return (self - other * (self // other))[:other.len-1]
def __truediv__(self, other, deg = -1):
if type(other) == int:
iv = pow(other, P - 2, P)
l = self.f[:]
for i in range(self.len):
l[i] = l[i] * iv % P
return self.__class__(l)
else:
if deg < 0: deg = max(self.len, other.len)
return (self * other.inv(deg))[:deg]
def __rtruediv__(self, other, deg = -1):
if type(other) == int:
return fps(other) / self
else:
if deg < 0: deg = max(self.len, other.len)
return (other * self.inv(deg))[:deg]
def sqrt(self):
if self.f[0] == 0:
for k, a in enumerate(self.f):
if a: break
else:
return self.__class__([0] * self.len)
if k & 1: return None
sq = self.__class__(self.f[k:] + [0] * (k//2)).sqrt()
if not sq: return None
return fps([0] * (k//2) + sq.f)
ts = Tonelli_Shanks(self.f[0])
if ts < 0: return None
deg = self.len
a = self.__class__([ts])
i = 1
while i < deg:
a += self[:i*2].__truediv__(a)
a /= 2
i <<= 1
return a
def f2e(self):
f = self.f[:]
for i, a in enumerate(f):
f[i] = a * fainv[i] % P
return self.__class__(f)
def e2f(self):
f = self.f[:]
for i, a in enumerate(f):
f[i] = a * fa[i] % P
return self.__class__(f)
def differentiate(self):
f = self.f[:]
for i, a in enumerate(f):
f[i] = a * i % P
f = f[1:] + [0]
return self.__class__(f)
def integrate(self):
f = self.f[:]
for i, a in enumerate(f):
f[i] = a * fainv[i+1] % P * fa[i] % P
f = [0] + f[:-1]
return self.__class__(f)
def log(self, deg = -1):
return (self.differentiate().__truediv__(self, deg)).integrate()
def exp(self, deg = -1):
assert self.f[0] == 0
if deg < 0: deg = self.len
a = self.__class__([1])
i = 1
while i < deg:
a = (a * (self[:i*2] + 1 - a.log(i * 2)))[:i*2]
i <<= 1
return a[:deg]
def __pow__(self, n, deg = -1):
if deg < 0: deg = self.len
if self.f[0] == 0:
assert n >= 0
for i, a in enumerate(self.f):
if a:
if i * n >= deg: return self.__class__([0] * deg)
return self.__class__([0] * (i * n) + pow(self.__class__(self.f[i:]), n, deg - i * n).f)
else:
return self.__class__([0] * deg)
if self.f[0] != 1:
a = self.f[0]
return pow(self / a, n, deg) * pow(a, n, P)
return (self.log(deg) * n).exp(deg)
def taylor_shift(self, c):
deg = self.len
L = []
a = 1
for i in range(deg):
L.append(a * fainv[i] % P)
a = a * c % P
L = L[::-1]
return (self.e2f() * self.__class__(L))[deg-1:].f2e()
def composite(self, other, deg = -1):
assert other.f[0] == 0
if other.len == 1: return self[:1]
if deg < 0: deg = (self.len - 1) * (other.len - 1) + 1
n = other.len
k = int((n / n.bit_length()) ** 0.5) + 1
p = other[:k]
q = other[k:]
def calc():
f = self.f + [0] * ((-self.len) % 4)
pp = p
while 1:
pp2 = (pp * pp)[:deg]
pp3 = (pp2 * pp)[:deg]
g = []
for i in range(0, len(f), 4):
g.append(f[i] + (f[i+1] * pp)[:deg] + (f[i+2] * pp2)[:deg] + (f[i+3] * pp3)[:deg])
if len(g) <= 1:
break
f = g + [0] * ((-len(g)) % 4)
pp = (pp3 * pp)[:deg]
return g[0]
if p.iszero():
ff = self[:]
re = ff[0]
qq = 1
for i in range(k, deg, k):
ff = ff.differentiate()
qq = (qq * q)[:deg-i]
re += (ff[0] * fainv[i//k] * qq).shift(i)
return re
fp = calc()
re = fp[:]
pd = p.differentiate()
z = pd.leadingzeroes()
pdi = pd[z:].inv(deg)
qq = 1
for i in range(k, deg, k):
fp = (pdi[:deg-i+z] * fp[:deg-i+1+z].differentiate())[:deg-i+z][z:]
qq = (qq * q)[:deg-i]
re += ((fp * qq)[:deg-i] * fainv[i//k]).shift(i)
return re
def at(self, v):
f = self.f
s = 0
for a in f[::-1]:
s = (s * v + a) % P
return s
def __lshift__(self, k):
return self.shift(k)
def __rshift__(self, k):
return self.__class__(self.f[k:])
def shift(self, k):
return self.__class__([0] * k + self.f)
def iszero(self):
return sum(self.f) == 0
def leadingzeroes(self):
for i, a in enumerate(self.f):
if a: return i
return self.len
def __getitem__(self, s):
return self.__class__(self.f[s])
def to_frac(self, a):
if 0 <= a <= 10000: return a
if -10000 <= a - P < 0: return a - P
for i in range(1, 10001):
if i and a * i % P <= 10000:
return str(a * i % P) + "/" + str(i)
if i and -a * i % P <= 10000:
return str(-(-a * i % P)) + "/" + str(i)
return a
def __str__(self):
l = []
for a in self.f:
l.append(str(self.to_frac(a)))
return "【" + ", ".join(l) + "】"
# return ", ".join(l)
def __len__(self):
return self.len
DEBUG = 0
from collections import deque
N = int(input())
X = [[] for i in range(N)]
for i in range(N-1):
x, y = map(int, input().split())
x, y = x-1, y-1
X[x].append(y)
X[y].append(x)
PP = [-1] * N
Q = deque([0])
R = []
while Q:
i = deque.popleft(Q)
R.append(i)
for a in X[i]:
if a != PP[i]:
PP[a] = i
X[a].remove(i)
deque.append(Q, a)
if DEBUG:
print("X =", X) # 子リスト
print("PP =", PP) # 親
print("R =", R) # トポロジカルソート
# N の 2 倍ぐらい必要になることがあるので注意
nn = 6060
fa = [1] * (nn+1)
fainv = [1] * (nn+1)
for i in range(nn):
fa[i+1] = fa[i] * (i+1) % P
fainv[-1] = pow(fa[-1], P-2, P)
for i in range(nn)[::-1]:
fainv[i] = fainv[i+1] * (i+1) % P
def calc(L):
# print("L =", L)
while len(L) > 1:
k = (len(L) - 1) // 2
L[k] *= L.pop()
# print("L =", L)
x = L[0].e2f()
f = x.f
y = fps([(i + 1) * a % P for i, a in enumerate(f)])
ret = fps([sum(x.f), sum(y.f)])
if DEBUG:
print("ret =", ret)
return ret
Y = [None for _ in range(N)]
for i in R[::-1]:
if DEBUG:
print("i, X =", i, X[i])
L = [fps([1])]
for j in X[i]:
L.append(Y[j])
Y[i] = calc(L)
print(Y[0].f[0] % P)
if DEBUG:
print("Y =")
for y in Y:
print(y)
|
ConDefects/ConDefects/Code/arc171_c/Python/50011378
|
condefects-python_data_2069
|
import itertools
import copy
N=int(input())
R=input()
C=input()
def solve5():
ite=set(itertools.permutations("ABC.."))
ite=tuple(ite)
fl=[]
for i in range(len(ite)):
for j in range(len(ite[i])):
if ite[i][j]!=".":
fl.append(ite[i][j])
break
leng=len(ite)
# ans=0
def isOkCol(board):
for i in range(5):
count=0
for j in range(5):
if board[j][i]==".":
count+=1
if count!=2:
return False
for i in range(5):
for j in range(5):
if board[j][i]!=".":
if board[j][i]!=C[i]: return False
break
for i in range(5):
set_=set()
for j in range(5):
set_.add(board[j][i])
if len(set_)!=4: return False
return True
for i in range(leng):
if fl[i]!=R[0]: continue
for j in range(leng):
if fl[j]!=R[1]: continue
for k in range(leng):
if fl[k]!=R[2]: continue
for l in range(leng):
if fl[l]!=R[3]: continue
for m in range(leng):
if fl[m]!=R[4]: continue
board = (ite[i], ite[j], ite[k], ite[l], ite[m])
if isOkCol(board):
print("Yes")
for elm in board:
print("".join(elm))
exit()
print("No")
def solve4():
ite=set(itertools.permutations("ABC."))
ite=tuple(ite)
fl=[]
for i in range(len(ite)):
for j in range(len(ite[i])):
if ite[i][j]!=".":
fl.append(ite[i][j])
break
leng=len(ite)
# ans=0
def isOkCol(board):
for i in range(4):
count=0
for j in range(4):
if board[j][i]==".":
count+=1
if count!=1:
return False
for i in range(4):
for j in range(4):
if board[j][i]!=".":
if board[j][i]!=C[i]: return False
break
for i in range(4):
set_=set()
for j in range(4):
set_.add(board[j][i])
if len(set_)!=4: return False
return True
for i in range(leng):
if fl[i]!=R[0]: continue
for j in range(leng):
if fl[j]!=R[1]: continue
for k in range(leng):
if fl[k]!=R[2]: continue
for l in range(leng):
if fl[l]!=R[3]: continue
board = (ite[i], ite[j], ite[k], ite[l])
if isOkCol(board):
print("Yes")
for elm in board:
print("".join(elm))
exit()
print("No")
def solve3():
def isOk(board):
if R!=board[0][0]+board[1][0]+board[2][0]: return False
if C!=board[0][0]+board[0][1]+board[0][2]: return False
for i in range(3):
set_=set()
for j in range(3):
set_.add(board[j][i])
if len(set_)!=3:
return False
return True
ite=tuple(itertools.permutations("ABC"))
for i in range(len(ite)):
for j in range(len(ite)):
for k in range(len(ite)):
board = (ite[i], ite[j], ite[k])
if isOk(board):
print("Yes")
for elm in board:
print("".join(elm))
exit()
print("No")
if N==5: solve5()
if N==4: solve4()
else: solve3()
import itertools
import copy
N=int(input())
R=input()
C=input()
def solve5():
ite=set(itertools.permutations("ABC.."))
ite=tuple(ite)
fl=[]
for i in range(len(ite)):
for j in range(len(ite[i])):
if ite[i][j]!=".":
fl.append(ite[i][j])
break
leng=len(ite)
# ans=0
def isOkCol(board):
for i in range(5):
count=0
for j in range(5):
if board[j][i]==".":
count+=1
if count!=2:
return False
for i in range(5):
for j in range(5):
if board[j][i]!=".":
if board[j][i]!=C[i]: return False
break
for i in range(5):
set_=set()
for j in range(5):
set_.add(board[j][i])
if len(set_)!=4: return False
return True
for i in range(leng):
if fl[i]!=R[0]: continue
for j in range(leng):
if fl[j]!=R[1]: continue
for k in range(leng):
if fl[k]!=R[2]: continue
for l in range(leng):
if fl[l]!=R[3]: continue
for m in range(leng):
if fl[m]!=R[4]: continue
board = (ite[i], ite[j], ite[k], ite[l], ite[m])
if isOkCol(board):
print("Yes")
for elm in board:
print("".join(elm))
exit()
print("No")
def solve4():
ite=set(itertools.permutations("ABC."))
ite=tuple(ite)
fl=[]
for i in range(len(ite)):
for j in range(len(ite[i])):
if ite[i][j]!=".":
fl.append(ite[i][j])
break
leng=len(ite)
# ans=0
def isOkCol(board):
for i in range(4):
count=0
for j in range(4):
if board[j][i]==".":
count+=1
if count!=1:
return False
for i in range(4):
for j in range(4):
if board[j][i]!=".":
if board[j][i]!=C[i]: return False
break
for i in range(4):
set_=set()
for j in range(4):
set_.add(board[j][i])
if len(set_)!=4: return False
return True
for i in range(leng):
if fl[i]!=R[0]: continue
for j in range(leng):
if fl[j]!=R[1]: continue
for k in range(leng):
if fl[k]!=R[2]: continue
for l in range(leng):
if fl[l]!=R[3]: continue
board = (ite[i], ite[j], ite[k], ite[l])
if isOkCol(board):
print("Yes")
for elm in board:
print("".join(elm))
exit()
print("No")
def solve3():
def isOk(board):
if R!=board[0][0]+board[1][0]+board[2][0]: return False
if C!=board[0][0]+board[0][1]+board[0][2]: return False
for i in range(3):
set_=set()
for j in range(3):
set_.add(board[j][i])
if len(set_)!=3:
return False
return True
ite=tuple(itertools.permutations("ABC"))
for i in range(len(ite)):
for j in range(len(ite)):
for k in range(len(ite)):
board = (ite[i], ite[j], ite[k])
if isOk(board):
print("Yes")
for elm in board:
print("".join(elm))
exit()
print("No")
if N==5: solve5()
if N==4: solve4()
if N==3: solve3()
|
ConDefects/ConDefects/Code/abc326_d/Python/52796362
|
condefects-python_data_2070
|
from itertools import product
from more_itertools import distinct_permutations
N = int(input())
R = list(input())
C = list(input())
di = {'A': [], 'B': [], 'C': []}
for p in distinct_permutations('ABC' + '.'*(N-3)):
for x in p:
if x != '.':
di[x].append(p)
break
ok_list = ['.'] * (N - 3) + ['A', 'B', 'C']
for vec in product(*[di[r] for r in R]):
vec = [list(row) for row in vec]
if any(sorted([vec[i][j] for i in range(N)]) != ok_list for j in range(N)):
continue
ng_flg = False
for i in range(N):
for j in range(N):
if vec[i][j] != '.':
if vec[i][j] != R[i]:
ng_flg = True
break
for j in range(N):
for i in range(N):
if vec[i][j] != '.':
if vec[i][j] != C[j]:
ng_flg = True
break
if ng_flg:
continue
else:
for row in vec:
print(''.join(row))
exit()
from itertools import product
from more_itertools import distinct_permutations
N = int(input())
R = list(input())
C = list(input())
di = {'A': [], 'B': [], 'C': []}
for p in distinct_permutations('ABC' + '.'*(N-3)):
for x in p:
if x != '.':
di[x].append(p)
break
ok_list = ['.'] * (N - 3) + ['A', 'B', 'C']
for vec in product(*[di[r] for r in R]):
vec = [list(row) for row in vec]
if any(sorted([vec[i][j] for i in range(N)]) != ok_list for j in range(N)):
continue
ng_flg = False
for i in range(N):
for j in range(N):
if vec[i][j] != '.':
if vec[i][j] != R[i]:
ng_flg = True
break
for j in range(N):
for i in range(N):
if vec[i][j] != '.':
if vec[i][j] != C[j]:
ng_flg = True
break
if ng_flg:
continue
else:
print('Yes')
for row in vec:
print(''.join(row))
exit()
print('No')
|
ConDefects/ConDefects/Code/abc326_d/Python/52271253
|
condefects-python_data_2071
|
N = int(input())
R,C = input(),input()
def dfs(y, x, a):
if(y == N):
print(a)
if(all("".join(sorted([ai[j] for ai in a])).strip('.').strip('.') == "ABC" and "".join([ai[j] for ai in a]).strip('.').strip('.')[0] == C[j] for j in range(N))):
print("Yes")
print("\n".join("".join(row) for row in a))
exit(0)
elif(x == N):
print(a)
if("".join(sorted(a[y])).strip('.').strip('.') == "ABC" and "".join(a[y]).strip('.').strip('.')[0] == R[y]):
dfs(y + 1, 0, a)
else:
dfs(y, x + 1, a)
row = list(filter(lambda c:c != '.',a[y]))
col = list(filter(lambda c:c != '.',[ai[x] for ai in a]))
for ch in "ABC":
if row == [] and ch != R[y] or ch in row:
continue
if col == [] and ch != C[x] or ch in col:
continue
a[y][x] = ch
dfs(y, x + 1, a)
a[y][x] = "."
dfs(0, 0, [["."] * N for _ in range(N)])
print("No")
N = int(input())
R,C = input(),input()
def dfs(y, x, a):
if(y == N):
if(all("".join(sorted([ai[j] for ai in a])).strip('.').strip('.') == "ABC" and "".join([ai[j] for ai in a]).strip('.').strip('.')[0] == C[j] for j in range(N))):
print("Yes")
print("\n".join("".join(row) for row in a))
exit(0)
elif(x == N):
if("".join(sorted(a[y])).strip('.').strip('.') == "ABC" and "".join(a[y]).strip('.').strip('.')[0] == R[y]):
dfs(y + 1, 0, a)
else:
dfs(y, x + 1, a)
row = list(filter(lambda c:c != '.',a[y]))
col = list(filter(lambda c:c != '.',[ai[x] for ai in a]))
for ch in "ABC":
if row == [] and ch != R[y] or ch in row:
continue
if col == [] and ch != C[x] or ch in col:
continue
a[y][x] = ch
dfs(y, x + 1, a)
a[y][x] = "."
dfs(0, 0, [["."] * N for _ in range(N)])
print("No")
|
ConDefects/ConDefects/Code/abc326_d/Python/54027090
|
condefects-python_data_2072
|
import itertools
def isok(n,c,a):
for j in range(n):
cnt=[0,0,0]
for i in range(n):
if a[i][j]!=".":
if cnt==0 and a[i][j]!=c[j]:
return False
cnt[ord(a[i][j])-ord('A')]+=1
if cnt!=[1,1,1]:
return False
return True
def make(n,s):#sは1番左の文字
res=[]
tmp=["A","B","C"]
tmp.remove(s)
for i in itertools.combinations(range(n),3):
g=["."]*n
g[i[0]]=s
g[i[1]]=tmp[0]
g[i[2]]=tmp[1]
res.append(g)
g=list(g)
g[i[1]]=tmp[1]
g[i[2]]=tmp[0]
res.append(g)
return res
n=int(input())
r=input()
c=input()
if n==3:
for i1 in make(n,r[0]):
for i2 in make(n,r[1]):
for i3 in make(n,r[2]):
if isok(n,c,[i1,i2,i3]):
print("Yes")
print(''.join(i1))
print(''.join(i2))
print(''.join(i3))
exit()
elif n==4:
for i1 in make(n,r[0]):
for i2 in make(n,r[1]):
for i3 in make(n,r[2]):
for i4 in make(n,r[3]):
if isok(n,c,[i1,i2,i3,i4]):
print("Yes")
print(''.join(i1))
print(''.join(i2))
print(''.join(i3))
print(''.join(i4))
exit()
else:
for i1 in make(n,r[0]):
for i2 in make(n,r[1]):
for i3 in make(n,r[2]):
for i4 in make(n,r[3]):
for i5 in make(n,r[4]):
if isok(n,c,[i1,i2,i3,i4,i5]):
print("Yes")
print(''.join(i1))
print(''.join(i2))
print(''.join(i3))
print(''.join(i4))
print(''.join(i5))
exit()
print("No")
import itertools
def isok(n,c,a):
for j in range(n):
cnt=[0,0,0]
for i in range(n):
if a[i][j]!=".":
if cnt==[0,0,0] and a[i][j]!=c[j]:
return False
cnt[ord(a[i][j])-ord('A')]+=1
if cnt!=[1,1,1]:
return False
return True
def make(n,s):#sは1番左の文字
res=[]
tmp=["A","B","C"]
tmp.remove(s)
for i in itertools.combinations(range(n),3):
g=["."]*n
g[i[0]]=s
g[i[1]]=tmp[0]
g[i[2]]=tmp[1]
res.append(g)
g=list(g)
g[i[1]]=tmp[1]
g[i[2]]=tmp[0]
res.append(g)
return res
n=int(input())
r=input()
c=input()
if n==3:
for i1 in make(n,r[0]):
for i2 in make(n,r[1]):
for i3 in make(n,r[2]):
if isok(n,c,[i1,i2,i3]):
print("Yes")
print(''.join(i1))
print(''.join(i2))
print(''.join(i3))
exit()
elif n==4:
for i1 in make(n,r[0]):
for i2 in make(n,r[1]):
for i3 in make(n,r[2]):
for i4 in make(n,r[3]):
if isok(n,c,[i1,i2,i3,i4]):
print("Yes")
print(''.join(i1))
print(''.join(i2))
print(''.join(i3))
print(''.join(i4))
exit()
else:
for i1 in make(n,r[0]):
for i2 in make(n,r[1]):
for i3 in make(n,r[2]):
for i4 in make(n,r[3]):
for i5 in make(n,r[4]):
if isok(n,c,[i1,i2,i3,i4,i5]):
print("Yes")
print(''.join(i1))
print(''.join(i2))
print(''.join(i3))
print(''.join(i4))
print(''.join(i5))
exit()
print("No")
|
ConDefects/ConDefects/Code/abc326_d/Python/52906322
|
condefects-python_data_2073
|
import sys
def ii():return int(sys.stdin.readline().rstrip("\r\n"))
def mi():return map(int, sys.stdin.readline().rstrip("\r\n").split())
def lmi():return list(map(int, sys.stdin.readline().rstrip("\r\n").split()))
def line_list(n): return [sys.stdin.readline().rstrip("\r\n") for _ in range(n)]
def ii_list(n): return [ii()for _ in range(n)]
def lmi_list(n): return [lmi()for _ in range(n)]
N = ii()
R = input().rstrip("\r\n")
C = input().rstrip("\r\n")
def check_line(first_c, line):
first_c_i = 0
while first_c_i < N and line[first_c_i] == "": first_c_i += 1
if first_c_i >= N - 2: return False
if line[first_c_i] != first_c: return False
A, B, C = False,False,False
for i in range(first_c_i, N):
c = line[i]
if c == "A":
if A: return False
A = True
if c == "B":
if B: return False
B = True
if c == "C":
if C: return False
C = True
return A and B and C
def check(m):
# for h in range(N):
# if not check_line(R[h], m[h]): return False
m = list(zip(*m))
for w in range(N):
if not check_line(C[w], m[w]): return False
return True
def create_line_iter(h):
first_c = R[h]
c_list = ["A", "B", "C"]
c_list = [c for c in c_list if c != first_c]
for i1 in range(0, N - 3 + 1):
for i2 in range(i1+1, N):
for i3 in range(i1+1, N):
if i2 == i3: continue
ret_list = [""] * N
ret_list[i1] = first_c
ret_list[i2] = c_list[0]
ret_list[i3] = c_list[1]
yield ret_list
def mywork():
from collections import deque
dq = deque()
dq.append((0, []))
while len(dq) > 0:
h, m = dq.pop()
if h == N:
if check(m):
print("Yes")
for line in m:
print("".join([" " if c == "" else c for c in line]))
exit()
else:
for line in create_line_iter(h):
dq.append((h+1, m + [line]))
mywork()
print("No")
import sys
def ii():return int(sys.stdin.readline().rstrip("\r\n"))
def mi():return map(int, sys.stdin.readline().rstrip("\r\n").split())
def lmi():return list(map(int, sys.stdin.readline().rstrip("\r\n").split()))
def line_list(n): return [sys.stdin.readline().rstrip("\r\n") for _ in range(n)]
def ii_list(n): return [ii()for _ in range(n)]
def lmi_list(n): return [lmi()for _ in range(n)]
N = ii()
R = input().rstrip("\r\n")
C = input().rstrip("\r\n")
def check_line(first_c, line):
first_c_i = 0
while first_c_i < N and line[first_c_i] == "": first_c_i += 1
if first_c_i >= N - 2: return False
if line[first_c_i] != first_c: return False
A, B, C = False,False,False
for i in range(first_c_i, N):
c = line[i]
if c == "A":
if A: return False
A = True
if c == "B":
if B: return False
B = True
if c == "C":
if C: return False
C = True
return A and B and C
def check(m):
# for h in range(N):
# if not check_line(R[h], m[h]): return False
m = list(zip(*m))
for w in range(N):
if not check_line(C[w], m[w]): return False
return True
def create_line_iter(h):
first_c = R[h]
c_list = ["A", "B", "C"]
c_list = [c for c in c_list if c != first_c]
for i1 in range(0, N - 3 + 1):
for i2 in range(i1+1, N):
for i3 in range(i1+1, N):
if i2 == i3: continue
ret_list = [""] * N
ret_list[i1] = first_c
ret_list[i2] = c_list[0]
ret_list[i3] = c_list[1]
yield ret_list
def mywork():
from collections import deque
dq = deque()
dq.append((0, []))
while len(dq) > 0:
h, m = dq.pop()
if h == N:
if check(m):
print("Yes")
for line in m:
print("".join(["." if c == "" else c for c in line]))
exit()
else:
for line in create_line_iter(h):
dq.append((h+1, m + [line]))
mywork()
print("No")
|
ConDefects/ConDefects/Code/abc326_d/Python/53923236
|
condefects-python_data_2074
|
n = int(input())
rowLeft, colUp = input(), input()
grid = [['.' for _ in range(n)] for _ in range(n)]
alphabet = ('A', 'B', 'C', '.')
rows = [{'A': False, 'B': False, 'C': False} for _ in range(n)]
cols = [{'A': False, 'B': False, 'C': False} for _ in range(n)]
rLeftPos = [n] * n
cUpPos = [n] * n
def valid(r: int, c: int, ch: chr) -> bool:
res = True
if ch != '.':
res = rows[r][ch] == False and cols[c][ch] == False
if c < rLeftPos[r]:
res = res & (rowLeft[r] == ch)
if r < cUpPos[c]:
res = res & (colUp[c] == ch)
if ch == '.':
res = n - r - 1 >= 3 - sum(cols[c].values()) and n - c - 1 >= 3 - sum(rows[r].values())
return res
def setChar(r: int, c: int, ch: chr):
grid[r][c] = ch
if ch != '.':
rows[r][ch] = True
cols[c][ch] = True
if r < cUpPos[c]:
cUpPos[c] = r
if c < rLeftPos[r]:
rLeftPos[r] = c
def removeChar(r: int, c:int) -> bool:
ch = grid[r][c]
if ch != '.':
rows[r][ch] = False
cols[c][ch] = False
if r == cUpPos[c]:
cUpPos[c] = n
if c == rLeftPos[r]:
rLeftPos[r] = n
grid[r][c] = '.'
def fillPuzzle(r: int, c: int) -> bool:
# print(sum(cols[r].values()))
if r >= n:
return True
if c >= n:
return fillPuzzle(r + 1, 0)
for ch in alphabet:
if valid(r, c, ch):
setChar(r, c, ch)
if fillPuzzle(r, c + 1):
return True
removeChar(r, c)
return False
if fillPuzzle(0, 0):
print('Yes')
for line in grid:
print(line)
else:
print('No')
# print(sum(rows[0].values()))
n = int(input())
rowLeft, colUp = input(), input()
grid = [['.' for _ in range(n)] for _ in range(n)]
alphabet = ('A', 'B', 'C', '.')
rows = [{'A': False, 'B': False, 'C': False} for _ in range(n)]
cols = [{'A': False, 'B': False, 'C': False} for _ in range(n)]
rLeftPos = [n] * n
cUpPos = [n] * n
def valid(r: int, c: int, ch: chr) -> bool:
res = True
if ch != '.':
res = rows[r][ch] == False and cols[c][ch] == False
if c < rLeftPos[r]:
res = res & (rowLeft[r] == ch)
if r < cUpPos[c]:
res = res & (colUp[c] == ch)
if ch == '.':
res = n - r - 1 >= 3 - sum(cols[c].values()) and n - c - 1 >= 3 - sum(rows[r].values())
return res
def setChar(r: int, c: int, ch: chr):
grid[r][c] = ch
if ch != '.':
rows[r][ch] = True
cols[c][ch] = True
if r < cUpPos[c]:
cUpPos[c] = r
if c < rLeftPos[r]:
rLeftPos[r] = c
def removeChar(r: int, c:int) -> bool:
ch = grid[r][c]
if ch != '.':
rows[r][ch] = False
cols[c][ch] = False
if r == cUpPos[c]:
cUpPos[c] = n
if c == rLeftPos[r]:
rLeftPos[r] = n
grid[r][c] = '.'
def fillPuzzle(r: int, c: int) -> bool:
# print(sum(cols[r].values()))
if r >= n:
return True
if c >= n:
return fillPuzzle(r + 1, 0)
for ch in alphabet:
if valid(r, c, ch):
setChar(r, c, ch)
if fillPuzzle(r, c + 1):
return True
removeChar(r, c)
return False
if fillPuzzle(0, 0):
print('Yes')
for line in grid:
print(''.join(line))
else:
print('No')
# print(sum(rows[0].values()))
|
ConDefects/ConDefects/Code/abc326_d/Python/54403865
|
condefects-python_data_2075
|
import sys
input = sys.stdin.readline
from itertools import *
def check(S):
ss = list(zip(*S))
for i, s in enumerate(ss):
if s.count('.') != 2: return False
if s.count('A') != 1: return False
if s.count('B') != 1: return False
if s.count('C') != 1: return False
for ns in s:
if ns != '.': break
if C[i] != ns: return False
return True
def dfs(i, P):
if i == N:
if check(S):
print('Yes')
for s in S:
print(*s, sep='')
exit()
return
for npi in range(lp):
if npi in seen: continue
for np in P[npi]:
if np != '.': break
if R[i] != np: continue
S[i] = P[npi]
seen.add(npi)
dfs(i + 1, P)
seen.discard(npi)
N = int(input())
R = input()
C = input()
T = 'ABC' + '.' * (N - 3)
P = set()
for p in permutations(T):
P.add(p)
# P = list(permutations(T))
lp = len(P)
P = list(P)
S = ['.' * N for _ in range(N)]
seen = set()
dfs(0, P)
print('No')
import sys
input = sys.stdin.readline
from itertools import *
def check(S):
ss = list(zip(*S))
for i, s in enumerate(ss):
if s.count('.') != N - 3: return False
if s.count('A') != 1: return False
if s.count('B') != 1: return False
if s.count('C') != 1: return False
for ns in s:
if ns != '.': break
if C[i] != ns: return False
return True
def dfs(i, P):
if i == N:
if check(S):
print('Yes')
for s in S:
print(*s, sep='')
exit()
return
for npi in range(lp):
if npi in seen: continue
for np in P[npi]:
if np != '.': break
if R[i] != np: continue
S[i] = P[npi]
seen.add(npi)
dfs(i + 1, P)
seen.discard(npi)
N = int(input())
R = input()
C = input()
T = 'ABC' + '.' * (N - 3)
P = set()
for p in permutations(T):
P.add(p)
# P = list(permutations(T))
lp = len(P)
P = list(P)
S = ['.' * N for _ in range(N)]
seen = set()
dfs(0, P)
print('No')
|
ConDefects/ConDefects/Code/abc326_d/Python/53955700
|
condefects-python_data_2076
|
N = int(input())
Q = int(input())
query = [list(map(int,input().split())) for _ in range(Q)]
box = [[] for _ in range(2*(10**5))]
i_in_box =[[] for _ in range(2*(10**5))]
for q in query:
#print(q)
if q[0] == 1:
box[q[2]-1].append(q[1])
i_in_box[q[1]-1].append(q[2])
elif q[0] == 2:
box[(q[1]-1)].sort()
print(*box[(q[1]-1)])
elif q[0] == 3:
i_in_box[(q[1]-1)].sort()
i_in_box[(q[1]-1)] = list(set(i_in_box[(q[1]-1)]))
print(*i_in_box[(q[1]-1)])
N = int(input())
Q = int(input())
query = [list(map(int,input().split())) for _ in range(Q)]
box = [[] for _ in range(2*(10**5))]
i_in_box =[[] for _ in range(2*(10**5))]
for q in query:
#print(q)
if q[0] == 1:
box[q[2]-1].append(q[1])
i_in_box[q[1]-1].append(q[2])
elif q[0] == 2:
box[(q[1]-1)].sort()
print(*box[(q[1]-1)])
elif q[0] == 3:
i_in_box[(q[1]-1)] = list(set(i_in_box[(q[1]-1)]))
i_in_box[(q[1]-1)].sort()
print(*i_in_box[(q[1]-1)])
|
ConDefects/ConDefects/Code/abc298_c/Python/45807883
|
condefects-python_data_2077
|
import sys
from collections import defaultdict
MOD = 998_244_353
INF = 10**18
N, Q = map(int, sys.stdin.readline().rstrip().split())
A = list(map(int, sys.stdin.readline().rstrip().split()))
D = defaultdict(list)
for i in range(N):
D[A[i]].append(i + 1)
print(D)
for q in range(Q):
x, k = list(map(int, sys.stdin.readline().rstrip().split()))
if len(D[x]) >= k:
print(D[x][k - 1])
else:
print(-1)
import sys
from collections import defaultdict
MOD = 998_244_353
INF = 10**18
N, Q = map(int, sys.stdin.readline().rstrip().split())
A = list(map(int, sys.stdin.readline().rstrip().split()))
D = defaultdict(list)
for i in range(N):
D[A[i]].append(i + 1)
# print(D)
for q in range(Q):
x, k = list(map(int, sys.stdin.readline().rstrip().split()))
if len(D[x]) >= k:
print(D[x][k - 1])
else:
print(-1)
|
ConDefects/ConDefects/Code/abc235_c/Python/46176667
|
condefects-python_data_2078
|
N = int(input())
A = list(map(int, input().split()))
# Aに0が入っている場合は、0の個数(n_0)*n - (n_0 + 1)*n_0/2
n_0 = A.count(0)
import math
import collections
# 素因数分解する
A = [a for a in A if a != 0] # 0を除外
B = [] # Aの各要素を平方数で割った残りを入れる
for i in range(len(A)):
a = A[i]
for j in range(2,int(math.sqrt(a))+1):
if a%(j**2) == 0:
a //= j**2
B.append(a)
ans = 0
# Aに0が入っている場合は、0の個数(n_0)*n - (n_0 + 1)*n_0/2
ans += (n_0)*N - (n_0 + 1)*n_0//2
# あとは、Bの中に何個同じものがあるか
for i in collections.Counter(B).values():
ans += i * (i-1)//2
print(ans)
N = int(input())
A = list(map(int, input().split()))
# Aに0が入っている場合は、0の個数(n_0)*n - (n_0 + 1)*n_0/2
n_0 = A.count(0)
import math
import collections
# 素因数分解する
A = [a for a in A if a != 0] # 0を除外
B = [] # Aの各要素を平方数で割った残りを入れる
for i in range(len(A)):
a = A[i]
for j in range(2,int(math.sqrt(a))+1):
while a%(j**2) == 0:
a //= j**2
B.append(a)
ans = 0
# Aに0が入っている場合は、0の個数(n_0)*n - (n_0 + 1)*n_0/2
ans += (n_0)*N - (n_0 + 1)*n_0//2
# あとは、Bの中に何個同じものがあるか
for i in collections.Counter(B).values():
ans += i * (i-1)//2
print(ans)
|
ConDefects/ConDefects/Code/abc342_d/Python/55039384
|
condefects-python_data_2079
|
#!/usr/bin/env python3
from collections import Counter
from math import comb
from sys import stdin
_tokens = (y for x in stdin for y in x.split())
def read(): return next(_tokens)
def iread(): return int(next(_tokens))
def prime_factorize(n):
if n == 0:
return [0]
a = []
while n % 2 == 0:
if a and a[-1] == 2:
a.pop()
else:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
if a and a[-1] == f:
a.pop()
else:
a.append(f)
n //= f
else:
f += 2
if n != 1:
if a and a[-1] == n:
a.pop()
else:
a.append(n)
return a
def f(p):
ret = 1
for x in p:
ret *= x
return ret
def main():
n = iread()
a = [iread() for _ in range(n)]
p = [prime_factorize(x) for x in a]
p = [f(x) for x in p]
c = Counter(p)
ans = 0
for k, v in c.items():
if k == 0:
u = n - v
ans += u + comb(v, 2)
else:
ans += comb(v, 2)
print(ans)
if __name__ == '__main__':
main()
#!/usr/bin/env python3
from collections import Counter
from math import comb
from sys import stdin
_tokens = (y for x in stdin for y in x.split())
def read(): return next(_tokens)
def iread(): return int(next(_tokens))
def prime_factorize(n):
if n == 0:
return [0]
a = []
while n % 2 == 0:
if a and a[-1] == 2:
a.pop()
else:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
if a and a[-1] == f:
a.pop()
else:
a.append(f)
n //= f
else:
f += 2
if n != 1:
if a and a[-1] == n:
a.pop()
else:
a.append(n)
return a
def f(p):
ret = 1
for x in p:
ret *= x
return ret
def main():
n = iread()
a = [iread() for _ in range(n)]
p = [prime_factorize(x) for x in a]
p = [f(x) for x in p]
c = Counter(p)
ans = 0
for k, v in c.items():
if k == 0:
u = n - v
ans += u * v + comb(v, 2)
else:
ans += comb(v, 2)
print(ans)
if __name__ == '__main__':
main()
|
ConDefects/ConDefects/Code/abc342_d/Python/54693725
|
condefects-python_data_2080
|
N,X = map(int,input().split())
A = list(map(int,input().split()))
# A.sort(reverse=True)
# if sum(A)-A[0] >= X*(N-1):
# print(0)
# else:
# del A[-1]
# print(X - sum(A) + A[0])
# print(X,sum(A),A[0])
# print(A)
def check():
for i in range(0,100):
A.append(i)
A.sort(reverse=True)
x = sum(A) - A[0] - A[-1]
if x >= X:
print(i)
return
A.remove(i)
print(-1)
check()
N,X = map(int,input().split())
A = list(map(int,input().split()))
# A.sort(reverse=True)
# if sum(A)-A[0] >= X*(N-1):
# print(0)
# else:
# del A[-1]
# print(X - sum(A) + A[0])
# print(X,sum(A),A[0])
# print(A)
def check():
for i in range(0,101):
A.append(i)
A.sort(reverse=True)
x = sum(A) - A[0] - A[-1]
if x >= X:
print(i)
return
A.remove(i)
print(-1)
check()
|
ConDefects/ConDefects/Code/abc321_b/Python/55168667
|
condefects-python_data_2081
|
n,x = map(int, input().split())
alist = list(map(int, input().split()))
s = sum(alist)
mx = max(alist)
mn = min(alist)
for i in range(100):
if s + i - min(mn, i) - max(mx, i) >= x:
print(i)
exit()
print(-1)
n,x = map(int, input().split())
alist = list(map(int, input().split()))
s = sum(alist)
mx = max(alist)
mn = min(alist)
for i in range(101):
if s + i - min(mn, i) - max(mx, i) >= x:
print(i)
exit()
print(-1)
|
ConDefects/ConDefects/Code/abc321_b/Python/54748415
|
condefects-python_data_2082
|
n, x = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
ans = float("inf")
for i in range(101):
A.append(i)
A.sort()
a = sum(A[1:-1])
if a == x:
ans = i
break
A.remove(i)
print(ans if ans!=float("inf") else -1)
n, x = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
ans = float("inf")
for i in range(101):
A.append(i)
A.sort()
a = sum(A[1:-1])
if x <= a:
ans = i
break
A.remove(i)
print(ans if ans!=float("inf") else -1)
|
ConDefects/ConDefects/Code/abc321_b/Python/54705590
|
condefects-python_data_2083
|
import math
x,y = map(int,input().split())
print(math.ceil((y-x)/10))
import math
x,y = map(int,input().split())
print(math.ceil(max((y-x),0)/10))
|
ConDefects/ConDefects/Code/abc233_a/Python/45939689
|
condefects-python_data_2084
|
X,Y = map(int, input().split())
if X >= Y:
print(0)
exit()
else:
print((Y-X)//10+1)
X,Y = map(int, input().split())
if X >= Y:
print(0)
exit()
elif((Y-X)%10==0):
print((Y-X)//10)
else:
print((Y-X)//10+1)
|
ConDefects/ConDefects/Code/abc233_a/Python/45723931
|
condefects-python_data_2085
|
A,B,D = map(int, input().split())
X=[]
while A<=B:
X.append(A)
A+=D
print(X)
A,B,D = map(int, input().split())
X=[]
while A<=B:
X.append(A)
A+=D
print(*X)
|
ConDefects/ConDefects/Code/abc340_a/Python/54645367
|
condefects-python_data_2086
|
A,B,D=map(int,input().split())
for i in range(A,B,2):
print(i,end=" ")
print(B)
A,B,D=map(int,input().split())
for i in range(A,B,D):
print(i,end=" ")
print(B)
|
ConDefects/ConDefects/Code/abc340_a/Python/54976696
|
condefects-python_data_2087
|
A,B,D=map(int,input().split())
ans=[A]
while A<=B:
ans.append(A+D)
A+=D
print(*ans)
A,B,D=map(int,input().split())
ans=[A]
while A+D<=B:
ans.append(A+D)
A+=D
print(*ans)
|
ConDefects/ConDefects/Code/abc340_a/Python/54522310
|
condefects-python_data_2088
|
#!/usr/bin/env python3
import sys
import math
import bisect
from heapq import heapify, heappop, heappush
from collections import deque, defaultdict, Counter
from functools import cache
from fractions import Fraction
from itertools import accumulate, combinations, permutations, product
from sortedcontainers import SortedSet, SortedList, SortedDict
mod = 998244353
N = int(input())
A = set(map(int, input().split()))
A = list(A)
print(A[-2])
#!/usr/bin/env python3
import sys
import math
import bisect
from heapq import heapify, heappop, heappush
from collections import deque, defaultdict, Counter
from functools import cache
from fractions import Fraction
from itertools import accumulate, combinations, permutations, product
from sortedcontainers import SortedSet, SortedList, SortedDict
mod = 998244353
N = int(input())
A = set(map(int, input().split()))
A = sorted(A)
print(A[-2])
|
ConDefects/ConDefects/Code/abc329_b/Python/54730859
|
condefects-python_data_2089
|
#頂点は1-index,下段は0-index
class LazySegTree:
#単位元と結合と作用をここで定義
Xunit = (0,1)
Aunit = 0
def Xf(self,x,y):
return (x[0] + y[0],x[1] + y[1])
#Xf = max
def Af(self,a,b):
return a + b
#AのXへの作用
def operate(self,x,a):
return (x[0] + a * x[1],x[1])
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 = (0,0)
vR = (0,0)
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,L,D = map(int,input().split())
seg = LazySegTree(N + 2)
seg.update(0,(1,1))
r = 1 / D
for i in range(L):
u,v = seg.fold(i,i + 1)
if i + D <= N:
seg.operate_range(i + 1,i + D + 1,u * r)
else:
seg.operate_range(i + 1,N + 1,u * r)
k = i + D - N
seg.operate_range(N + 1,N + 2,u * k * r)
dp = [0] * (N + 1)
dp[N] = 1 - seg.fold(N,N + 1)[0]
seg2 = LazySegTree(N + 1)
seg2.update(N,(dp[N],1))
e = seg.fold(N + 1,N + 2)[0]
"""
for i in range(N - 1,-1,-1):
if i > L:
u = seg.fold(L,i)[0] + e
t = 0
for k in range(L,i):
t += seg.fold(k,k + 1)[0]
print(i,L,u - e,t)
else:
u = e
if i + D <= N:
v = seg2.fold(i + 1,i + D + 1)[0] * r
else:
v = seg2.fold(i + 1,N + 1)[0] * r
seg2.update(i,(max(u,v),1))
print(seg2.fold(0,1)[0])
for i in range(N + 1):
print(seg.fold(i,i + 1)[0],seg2.fold(i,i + 1)[0])
seg.write()
"""
S = [0] * (N + 1)
for i in range(1,N + 1):
S[i] = seg.fold(i,i + 1)[0]
if i > 0:
S[i] += S[i - 1]
dp = [0] * (N + 2)
dp[N] = 1 - seg.fold(N,N + 1)[0]
for i in range(N - 1,-1,-1):
if i > L:
u = S[i] - S[L - 1] + e
else:
u = e
if i + D <= N:
v = dp[i + 1] - dp[i + D + 1]
v *= r
else:
v = dp[i + 1] * r
dp[i] = max(u,v)
dp[i] += dp[i + 1]
print(dp[0] - dp[1])
#頂点は1-index,下段は0-index
class LazySegTree:
#単位元と結合と作用をここで定義
Xunit = (0,1)
Aunit = 0
def Xf(self,x,y):
return (x[0] + y[0],x[1] + y[1])
#Xf = max
def Af(self,a,b):
return a + b
#AのXへの作用
def operate(self,x,a):
return (x[0] + a * x[1],x[1])
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 = (0,0)
vR = (0,0)
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,L,D = map(int,input().split())
seg = LazySegTree(N + 2)
seg.update(0,(1,1))
r = 1 / D
for i in range(L):
u,v = seg.fold(i,i + 1)
if i + D <= N:
seg.operate_range(i + 1,i + D + 1,u * r)
else:
seg.operate_range(i + 1,N + 1,u * r)
k = i + D - N
seg.operate_range(N + 1,N + 2,u * k * r)
dp = [0] * (N + 1)
dp[N] = 1 - seg.fold(N,N + 1)[0]
seg2 = LazySegTree(N + 1)
seg2.update(N,(dp[N],1))
e = seg.fold(N + 1,N + 2)[0]
"""
for i in range(N - 1,-1,-1):
if i > L:
u = seg.fold(L,i)[0] + e
t = 0
for k in range(L,i):
t += seg.fold(k,k + 1)[0]
print(i,L,u - e,t)
else:
u = e
if i + D <= N:
v = seg2.fold(i + 1,i + D + 1)[0] * r
else:
v = seg2.fold(i + 1,N + 1)[0] * r
seg2.update(i,(max(u,v),1))
print(seg2.fold(0,1)[0])
for i in range(N + 1):
print(seg.fold(i,i + 1)[0],seg2.fold(i,i + 1)[0])
seg.write()
"""
S = [0] * (N + 1)
for i in range(1,N + 1):
S[i] = seg.fold(i,i + 1)[0]
if i > 0:
S[i] += S[i - 1]
dp = [0] * (N + 2)
dp[N] = 1 - seg.fold(N,N + 1)[0]
for i in range(N - 1,-1,-1):
if i > L:
u = S[i-1] - S[L - 1] + e
else:
u = e
if i + D <= N:
v = dp[i + 1] - dp[i + D + 1]
v *= r
else:
v = dp[i + 1] * r
dp[i] = max(u,v)
dp[i] += dp[i + 1]
print(dp[0] - dp[1])
|
ConDefects/ConDefects/Code/abc342_f/Python/50665510
|
condefects-python_data_2090
|
N,L,D = map(int,input().split())
M = max(N+10,L+D+10)
#ディーラがiを通る確率 & 累積ver
dpd = [0]*(M)
dpdr = [0]*(M)
dpd[0] = 1
dpdr[0] = 1
for i in range(1,L+D):
l = max(0,i-D)
r = min(i-1,L-1)
if l != 0:
dpd[i] = (dpdr[r]-dpdr[l-1])/D
else:
dpd[i] = (dpdr[r])/D
dpdr[i] = dpdr[i-1]+dpd[i]
#ディーラが最終的にiにいる確率
dpdlast = dpd[:]
for i in range(L):
dpdlast[i] = 0
d_bast = 0
for i in range(N,M):
d_bast += dpd[i]
#ディーらがi未満で終わる確率
dpdmiman = [0]*M
for i in range(1,M):
dpdmiman[i] = dpdmiman[i-1]+dpdlast[i-1]
#そのマスに自分がいて、最適戦略を取った時の勝率
dpwin = [0]*(M)
dprwin = [0]*(M)
for i in range(M-1,-1,-1):
if i==M-1:
if i>N:
dpwin[i] = 0
dprwin[i] = 0
else:
dpwin[i] = 1
continue
if i>N:
dpwin[i] = 0
dprwin[i] = dprwin[i+1]
continue
r = min(i+D,M-2)
l = i+1
#サイコロを振った時の勝ち確率
dice_win = (dprwin[l]-dprwin[r+1])/D
#サイコロ降らない時の勝ち確率
stay_win = dpdmiman[i]+d_bast
win = max(dice_win,stay_win)
dpwin[i] = win
dprwin[i] = win + dprwin[i+1]
print(dpwin[0])
N,L,D = map(int,input().split())
M = max(N+10,L+D+10)
#ディーラがiを通る確率 & 累積ver
dpd = [0]*(M)
dpdr = [0]*(M)
dpd[0] = 1
dpdr[0] = 1
for i in range(1,L+D):
l = max(0,i-D)
r = min(i-1,L-1)
if l != 0:
dpd[i] = (dpdr[r]-dpdr[l-1])/D
else:
dpd[i] = (dpdr[r])/D
dpdr[i] = dpdr[i-1]+dpd[i]
#ディーラが最終的にiにいる確率
dpdlast = dpd[:]
for i in range(L):
dpdlast[i] = 0
d_bast = 0
for i in range(N+1,M):
d_bast += dpd[i]
#ディーらがi未満で終わる確率
dpdmiman = [0]*M
for i in range(1,M):
dpdmiman[i] = dpdmiman[i-1]+dpdlast[i-1]
#そのマスに自分がいて、最適戦略を取った時の勝率
dpwin = [0]*(M)
dprwin = [0]*(M)
for i in range(M-1,-1,-1):
if i==M-1:
if i>N:
dpwin[i] = 0
dprwin[i] = 0
else:
dpwin[i] = 1
continue
if i>N:
dpwin[i] = 0
dprwin[i] = dprwin[i+1]
continue
r = min(i+D,M-2)
l = i+1
#サイコロを振った時の勝ち確率
dice_win = (dprwin[l]-dprwin[r+1])/D
#サイコロ降らない時の勝ち確率
stay_win = dpdmiman[i]+d_bast
win = max(dice_win,stay_win)
dpwin[i] = win
dprwin[i] = win + dprwin[i+1]
print(dpwin[0])
|
ConDefects/ConDefects/Code/abc342_f/Python/50697688
|
condefects-python_data_2091
|
class Dual_Fenwick_Tree:
def __init__(self, n):
self._n = n + 1
self.data = [0] * (n + 1)
def _add(self, p, x):
assert 0 <= p < self._n
p += 1
while p <= self._n:
self.data[p - 1] += x
p += p & -p
def sum(self, l, r):
assert 0 <= l <= r <= self._n
return self._sum(r) - self._sum(l)
def _sum(self, r):
s = 0
while r > 0:
s += self.data[r - 1]
r -= r & -r
return s
# A[l:r]にvを足す
def add(self, l, r, v):
self._add(l, v)
self._add(r, -v)
# A[x]を返す
def get(self, x):
return self.sum(0, x + 1)
def __str__(self):
temp = []
for i in range(self._n):
temp.append(str(self.sum(0, i + 1)))
return ' '.join(temp)
N, L, D = map(int, input().split())
M = 2 * N + 5
T = Dual_Fenwick_Tree(M)
T.add(0, 1, 1)
for i in range(L):
v = T.get(i)/D
T.add(i + 1, i + D + 1, v)
p = [0] * M
q = [0] * M
r = [0] * M
for i in range(M):
if i >= L:
p[i] = T.get(i)
Ac = [0] * (M + 1)
for i in range(M):
Ac[i + 1] = Ac[i] + p[i]
for i in range(M):
q[i] = Ac[i] + (Ac[-1] - Ac[N + 1])
from collections import *
Q = deque()
v = 0
for i in range(N, -1, -1):
r[i] = max(q[i], v)
Q.append(r[i]/D)
v += r[i]/D
if len(Q) > L:
v -= Q.popleft()
print(r[0])
class Dual_Fenwick_Tree:
def __init__(self, n):
self._n = n + 1
self.data = [0] * (n + 1)
def _add(self, p, x):
assert 0 <= p < self._n
p += 1
while p <= self._n:
self.data[p - 1] += x
p += p & -p
def sum(self, l, r):
assert 0 <= l <= r <= self._n
return self._sum(r) - self._sum(l)
def _sum(self, r):
s = 0
while r > 0:
s += self.data[r - 1]
r -= r & -r
return s
# A[l:r]にvを足す
def add(self, l, r, v):
self._add(l, v)
self._add(r, -v)
# A[x]を返す
def get(self, x):
return self.sum(0, x + 1)
def __str__(self):
temp = []
for i in range(self._n):
temp.append(str(self.sum(0, i + 1)))
return ' '.join(temp)
N, L, D = map(int, input().split())
M = 2 * N + 5
T = Dual_Fenwick_Tree(M)
T.add(0, 1, 1)
for i in range(L):
v = T.get(i)/D
T.add(i + 1, i + D + 1, v)
p = [0] * M
q = [0] * M
r = [0] * M
for i in range(M):
if i >= L:
p[i] = T.get(i)
Ac = [0] * (M + 1)
for i in range(M):
Ac[i + 1] = Ac[i] + p[i]
for i in range(M):
q[i] = Ac[i] + (Ac[-1] - Ac[N + 1])
from collections import *
Q = deque()
v = 0
for i in range(N, -1, -1):
r[i] = max(q[i], v)
Q.append(r[i]/D)
v += r[i]/D
if len(Q) > D:
v -= Q.popleft()
print(r[0])
|
ConDefects/ConDefects/Code/abc342_f/Python/54509689
|
condefects-python_data_2092
|
# -*- coding: utf-8 -*-
H, W = [int(s) for s in input().split(' ')]
A = []
ans = []
alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
for i in range(H):
A = [int(s) for s in input().split(' ')]
preAns = []
for a in A:
if 0 == a:
preAns.append('.')
else:
preAns.append(alphabet[a-1])
ans.append(preAns)
for s in ans:
print(*s)
# -*- coding: utf-8 -*-
H, W = [int(s) for s in input().split(' ')]
A = []
ans = []
alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
for i in range(H):
A = [int(s) for s in input().split(' ')]
preAns = []
for a in A:
if 0 == a:
preAns.append('.')
else:
preAns.append(alphabet[a-1])
ans.append(preAns)
for s in ans:
print(''.join(s))
|
ConDefects/ConDefects/Code/abc294_b/Python/46049020
|
condefects-python_data_2093
|
H,W = map(int,input().split())
A = [[int(i) for i in input().split()]for j in range(H)]
ans = [["." for h in range(W)] for w in range(H)]
for i in range(H):
for j in range(W):
if A[i][j] == 0:
continue
ans[i][j] = chr(64 + A[i][j])
for i in range(H):
for j in range(W):
if W - 1 == j:
print(ans[i][j])
else:
print(ans[i][j],end=" ")
H,W = map(int,input().split())
A = [[int(i) for i in input().split()]for j in range(H)]
ans = [["." for h in range(W)] for w in range(H)]
for i in range(H):
for j in range(W):
if A[i][j] == 0:
continue
ans[i][j] = chr(64 + A[i][j])
for i in range(H):
for j in range(W):
if W - 1 == j:
print(ans[i][j])
else:
print(ans[i][j],end="")
|
ConDefects/ConDefects/Code/abc294_b/Python/46002739
|
condefects-python_data_2094
|
H, W = map(int, input().split())
A = []
for _ in range(H):
A.append(list(map(int, input().split())))
strings = []
for i in range(H):
s = ""
for j in range(W):
if A[i][j] == 0:
s += "."
else:
s += chr(ord('A') + A[i][j] + 1)
strings.append(s)
for s in strings:
print(s)
H, W = map(int, input().split())
A = []
for _ in range(H):
A.append(list(map(int, input().split())))
strings = []
for i in range(H):
s = ""
for j in range(W):
if A[i][j] == 0:
s += "."
else:
s += chr(ord('A') + A[i][j] - 1)
strings.append(s)
for s in strings:
print(s)
|
ConDefects/ConDefects/Code/abc294_b/Python/46001863
|
condefects-python_data_2095
|
import sys
readline=sys.stdin.readline
def SCC(N,edges):
start = [0] * (N + 1)
elist = [0] * len(edges)
for e in edges:
start[e[0] + 1] += 1
for i in range(1, N + 1):
start[i] += start[i - 1]
counter = start[:]
for e in edges:
elist[counter[e[0]]] = e[1]
counter[e[0]] += 1
N = N
now_ord = group_num = 0
visited = []
low = [0] * N
order = [-1] * N
ids = [0] * N
parent = [-1] * N
stack = []
for i in range(N):
if order[i] == -1:
stack.append(i)
stack.append(i)
while stack:
v = stack.pop()
if order[v] == -1:
low[v] = order[v] = now_ord
now_ord += 1
visited.append(v)
for i in range(start[v], start[v + 1]):
to = elist[i]
if order[to] == -1:
stack.append(to)
stack.append(to)
parent[to] = v
else:
low[v] = min(low[v], order[to])
else:
if low[v] == order[v]:
while True:
u = visited.pop()
order[u] = N
ids[u] = group_num
if u == v:
break
group_num += 1
if parent[v] != -1:
low[parent[v]] = min(low[parent[v]], low[v])
for i, x in enumerate(ids):
ids[i] = group_num - 1 - x
groups = [[] for _ in range(group_num)]
for i, x in enumerate(ids):
groups[x].append(i)
return groups
class TwoSAT:
def __init__(self,N=None):
self.N=N
self.edges=[]
def Add_Clause(self,i,f,j,g):
if self.N!=None:
assert 0<=i<self.N
assert 0<=j<self.N
self.edges.append((2*i+(0 if f else 1),2*j+(1 if g else 0)))
self.edges.append((2*j+(0 if g else 1),2*i+(1 if f else 0)))
def Satisfiable(self):
N=self.N if self.N!=None else max(max(i,j) for i,j in self.edges)//2+1
scc=SCC(N*2,self.edges)
idx=[None]*N*2
for i,lst in enumerate(scc):
for x in lst:
idx[x]=i
retu=[None]*N
for i in range(N):
if idx[2*i]==idx[2*i+1]:
return None
retu[i]=idx[2*i]<idx[2*i+1]
return retu
N,M,Q=map(int,readline().split())
TSAT=TwoSAT(N*(M+2))
for n in range(N):
for m in range(M+1):
TSAT.Add_Clause(n*(M+2)+m,1,n*(M+2)+m+1,0)
TSAT.Add_Clause(n*(M+2),1,n*(M+2),1)
TSAT.Add_Clause(n*(M+2)+M,0,n*(M+2)+M,0)
for q in range(Q):
A,B,L,R=map(int,readline().split())
A-=1;B-=1
for m in range(M+2):
if 0<=L+1-m<=M+1:
TSAT.Add_Clause(A*(M+2)+m,1,B*(M+2)+L+1-m,1)
if 0<=R+1-m<=M+1:
TSAT.Add_Clause(A*(M+2)+m,0,B*(M+2)+R+1-m,0)
lst=TSAT.Satisfiable()
if lst==None:
print(-1)
else:
ans_lst=[sum(lst[n*(M+2):(n+1)*(M+2)])-1 for n in range(N)]
assert all(0<=ans<=M for ans in ans_lst)
print(*ans_lst)
import sys
readline=sys.stdin.readline
def SCC(N,edges):
start = [0] * (N + 1)
elist = [0] * len(edges)
for e in edges:
start[e[0] + 1] += 1
for i in range(1, N + 1):
start[i] += start[i - 1]
counter = start[:]
for e in edges:
elist[counter[e[0]]] = e[1]
counter[e[0]] += 1
N = N
now_ord = group_num = 0
visited = []
low = [0] * N
order = [-1] * N
ids = [0] * N
parent = [-1] * N
stack = []
for i in range(N):
if order[i] == -1:
stack.append(i)
stack.append(i)
while stack:
v = stack.pop()
if order[v] == -1:
low[v] = order[v] = now_ord
now_ord += 1
visited.append(v)
for i in range(start[v], start[v + 1]):
to = elist[i]
if order[to] == -1:
stack.append(to)
stack.append(to)
parent[to] = v
else:
low[v] = min(low[v], order[to])
else:
if low[v] == order[v]:
while True:
u = visited.pop()
order[u] = N
ids[u] = group_num
if u == v:
break
group_num += 1
if parent[v] != -1:
low[parent[v]] = min(low[parent[v]], low[v])
for i, x in enumerate(ids):
ids[i] = group_num - 1 - x
groups = [[] for _ in range(group_num)]
for i, x in enumerate(ids):
groups[x].append(i)
return groups
class TwoSAT:
def __init__(self,N=None):
self.N=N
self.edges=[]
def Add_Clause(self,i,f,j,g):
if self.N!=None:
assert 0<=i<self.N
assert 0<=j<self.N
self.edges.append((2*i+(0 if f else 1),2*j+(1 if g else 0)))
self.edges.append((2*j+(0 if g else 1),2*i+(1 if f else 0)))
def Satisfiable(self):
N=self.N if self.N!=None else max(max(i,j) for i,j in self.edges)//2+1
scc=SCC(N*2,self.edges)
idx=[None]*N*2
for i,lst in enumerate(scc):
for x in lst:
idx[x]=i
retu=[None]*N
for i in range(N):
if idx[2*i]==idx[2*i+1]:
return None
retu[i]=idx[2*i]<idx[2*i+1]
return retu
N,M,Q=map(int,readline().split())
TSAT=TwoSAT(N*(M+2))
for n in range(N):
for m in range(M+1):
TSAT.Add_Clause(n*(M+2)+m,1,n*(M+2)+m+1,0)
TSAT.Add_Clause(n*(M+2),1,n*(M+2),1)
TSAT.Add_Clause(n*(M+2)+M+1,0,n*(M+2)+M+1,0)
for q in range(Q):
A,B,L,R=map(int,readline().split())
A-=1;B-=1
for m in range(M+2):
if 0<=L+1-m<=M+1:
TSAT.Add_Clause(A*(M+2)+m,1,B*(M+2)+L+1-m,1)
if 0<=R+1-m<=M+1:
TSAT.Add_Clause(A*(M+2)+m,0,B*(M+2)+R+1-m,0)
lst=TSAT.Satisfiable()
if lst==None:
print(-1)
else:
ans_lst=[sum(lst[n*(M+2):(n+1)*(M+2)])-1 for n in range(N)]
assert all(0<=ans<=M for ans in ans_lst)
print(*ans_lst)
|
ConDefects/ConDefects/Code/abc277_h/Python/41713007
|
condefects-python_data_2096
|
from random import randint, shuffle
from math import gcd, log2, log, sqrt, hypot, pi, degrees
from fractions import Fraction
from bisect import bisect_left, bisect_right
from itertools import accumulate, permutations, combinations, product, chain, groupby
from sortedcontainers import SortedList
from collections import Counter, deque, defaultdict as ddict
from heapq import heappush as push, heappop as pop
from functools import reduce, lru_cache
import sys
input = sys.stdin.readline
inf = 10**18
def read(dtype=int):
return list(map(dtype, input().split()))
s, = read(str)
cnt = Counter(s)
pnt = Counter(cnt.values())
if min(pnt.values()) == max(pnt.values()):
print("Yes")
else:
print("No")
from random import randint, shuffle
from math import gcd, log2, log, sqrt, hypot, pi, degrees
from fractions import Fraction
from bisect import bisect_left, bisect_right
from itertools import accumulate, permutations, combinations, product, chain, groupby
from sortedcontainers import SortedList
from collections import Counter, deque, defaultdict as ddict
from heapq import heappush as push, heappop as pop
from functools import reduce, lru_cache
import sys
input = sys.stdin.readline
inf = 10**18
def read(dtype=int):
return list(map(dtype, input().split()))
s, = read(str)
cnt = Counter(s)
pnt = Counter(cnt.values())
if min(pnt.values()) == max(pnt.values()) == 2:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc349_b/Python/54749110
|
condefects-python_data_2097
|
S = input()
cnt = []
for s in set(S):
cnt.append(S.count(s))
ans = "Yes"
for i in range(1,max(cnt)+1):
if cnt.count(i) != 2:
ans = "No"
break
print(ans)
S = input()
cnt = []
for s in set(S):
cnt.append(S.count(s))
ans = "Yes"
for i in range(1,max(cnt)+1):
if (cnt.count(i) != 2) and (cnt.count(i) != 0) :
ans = "No"
break
print(ans)
|
ConDefects/ConDefects/Code/abc349_b/Python/54719195
|
condefects-python_data_2098
|
import string
s = input()
alphabets = {i: 0 for i in string.ascii_lowercase}
for i in s:
if i in alphabets:
alphabets[i] += 1
f = True
c = 0
for i in range(1,len(s)):
for j in alphabets.values():
if i == j:
c += 1
if not(c == 0 or c == 2):
print("No")
exit()
c = 0
print("Yes")
import string
s = input()
alphabets = {i: 0 for i in string.ascii_lowercase}
for i in s:
if i in alphabets:
alphabets[i] += 1
f = True
c = 0
for i in range(1,101):
for j in alphabets.values():
if i == j:
c += 1
if not(c == 0 or c == 2):
print("No")
exit()
c = 0
print("Yes")
|
ConDefects/ConDefects/Code/abc349_b/Python/54938253
|
condefects-python_data_2099
|
S=input()
ans="Yes"
word_list=[0]*26
for s in S:
word_list[ord(s)-ord("a")]+=1
# wordlistの1とか2とかを数えるリストを考える
word_count_list=[0]*101
for i in range(1,len(word_list)+1):
word_count_list[i]=word_list.count(i)
for i in range(1,len(word_count_list)):
if word_count_list[i] == 0 or word_count_list[i]== 2:
continue
else:
ans="No"
print(ans)
S=input()
ans="Yes"
word_list=[0]*26
for s in S:
word_list[ord(s)-ord("a")]+=1
# wordlistの1とか2とかを数えるリストを考える
word_count_list=[0]*101
for i in range(len(word_count_list)):
word_count_list[i]=word_list.count(i)
for i in range(1,len(word_count_list)):
if word_count_list[i] == 0 or word_count_list[i]== 2:
continue
else:
ans="No"
print(ans)
|
ConDefects/ConDefects/Code/abc349_b/Python/54895344
|
condefects-python_data_2100
|
S = input()
strgs = list(set(S))
strgs_count = []
results = []
for strg in strgs:
strgs_count.append(S.count(strg))
for unique in list(set(strgs_count)):
if strgs_count.count(unique) % 2 == 0:
result = True
results.append(result)
else:
result = False
results.append(result)
if False in results:
print('No')
else:
print('Yes')
S = input()
strgs = list(set(S))
strgs_count = []
results = []
for strg in strgs:
strgs_count.append(S.count(strg))
for unique in list(set(strgs_count)):
if strgs_count.count(unique) / 2 == 1:
result = True
results.append(result)
else:
result = False
results.append(result)
if False in results:
print('No')
else:
print('Yes')
|
ConDefects/ConDefects/Code/abc349_b/Python/54765901
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.