id
stringlengths 24
27
| content
stringlengths 37
384k
| max_stars_repo_path
stringlengths 51
51
|
|---|---|---|
condefects-python_data_1901
|
#!/usr/bin/env python3
# from typing import *
from math import sqrt
# def solve(N: int) -> int:
def solve(N):
# 片方を決め打てばよさそう？
ans = 10**20
if N == 0:
return 0
for n in range(400000):
m = (-20 * n**3 + 3 * sqrt(3) * sqrt(16 * n**6 - 40 * n**3 * N + 27 * N**2) + 27 * N)**(1/3)/(3 * 2**(1/3)) - (2 * 2**(1/3) * n**2)/(3 * (-20 * n**3 + 3 * sqrt(3) * sqrt(16* n**6 - 40* n**3 *N + 27 *N**2) + 27* N)**(1/3)) - n/3
for m1 in range(int(m)+10,int(m)-10,-1):
if m1 < 0:
break
if n**3+n*m1**2+n**2 *m1 + m1**3 >= N:
ans = min(ans, n**3+n*m1**2+n**2 *m1 + m1**3)
return ans
# generated by oj-template v4.8.1 (https://github.com/online-judge-tools/template-generator)
def main():
N = int(input())
a = solve(N)
print(a)
if __name__ == '__main__':
main()
#!/usr/bin/env python3
# from typing import *
from math import sqrt
# def solve(N: int) -> int:
def solve(N):
# 片方を決め打てばよさそう？
ans = 10**20
if N == 0:
return 0
for n in range(600000):
m = (-20 * n**3 + 3 * sqrt(3) * sqrt(16 * n**6 - 40 * n**3 * N + 27 * N**2) + 27 * N)**(1/3)/(3 * 2**(1/3)) - (2 * 2**(1/3) * n**2)/(3 * (-20 * n**3 + 3 * sqrt(3) * sqrt(16* n**6 - 40* n**3 *N + 27 *N**2) + 27* N)**(1/3)) - n/3
for m1 in range(int(m)+10,int(m)-10,-1):
if m1 < 0:
break
if n**3+n*m1**2+n**2 *m1 + m1**3 >= N:
ans = min(ans, n**3+n*m1**2+n**2 *m1 + m1**3)
return ans
# generated by oj-template v4.8.1 (https://github.com/online-judge-tools/template-generator)
def main():
N = int(input())
a = solve(N)
print(a)
if __name__ == '__main__':
main()
|
ConDefects/ConDefects/Code/abc246_d/Python/45780372
|
condefects-python_data_1902
|
import bisect
from itertools import accumulate, permutations, combinations
from collections import deque, Counter, defaultdict
import heapq
from string import ascii_lowercase # 'abcdefghijklmnopqrstuvwxyz'
from string import ascii_uppercase # 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
import sys
sys.setrecursionlimit(10 ** 6)
# ========================================================================
INF = pow(10, 16)
input = lambda: sys.stdin.readline().rstrip()
NI = lambda: int(input()) # N = int(input())
NMI = lambda: map(int, input().split()) # A, B, C = map(int, input().split())
NLI = lambda: list(map(int, input().split())) # A = list(map(int, input().split()))
SI = lambda: input()
SMI = lambda: input().split()
SLI = lambda: list(input().split())
EI = lambda _n: [list(map(int, input().split())) for _ in range(_n)]
TI = lambda _n: list(zip(*[map(int, input().split()) for _ in range(_n)]))
# ========================================================================
MOD = 10**8
if __name__ == '__main__':
N = NI()
A = NLI()
A.sort()
count = 0
SA = [0] + list(accumulate(A)) # 0, A1, A1+A2,
for i in range(N-1):
left_index = bisect.bisect_left(range(i+1, N), 10**8, key=lambda x:A[i] + A[x])
count += SA[left_index+i+1] + left_index*A[i] - SA[i+1] # MODしない項
count += (A[i]*(N-left_index-1-i) + SA[N]- SA[left_index+1+i])%MOD # MODする項
print(count)
import bisect
from itertools import accumulate, permutations, combinations
from collections import deque, Counter, defaultdict
import heapq
from string import ascii_lowercase # 'abcdefghijklmnopqrstuvwxyz'
from string import ascii_uppercase # 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
import sys
sys.setrecursionlimit(10 ** 6)
# ========================================================================
INF = pow(10, 16)
input = lambda: sys.stdin.readline().rstrip()
NI = lambda: int(input()) # N = int(input())
NMI = lambda: map(int, input().split()) # A, B, C = map(int, input().split())
NLI = lambda: list(map(int, input().split())) # A = list(map(int, input().split()))
SI = lambda: input()
SMI = lambda: input().split()
SLI = lambda: list(input().split())
EI = lambda _n: [list(map(int, input().split())) for _ in range(_n)]
TI = lambda _n: list(zip(*[map(int, input().split()) for _ in range(_n)]))
# ========================================================================
MOD = 10**8
if __name__ == '__main__':
N = NI()
A = NLI()
A.sort()
count = 0
SA = [0] + list(accumulate(A)) # 0, A1, A1+A2,
for i in range(N-1):
left_index = bisect.bisect_left(range(i+1, N), 10**8, key=lambda x:A[i] + A[x])
count += SA[left_index+i+1] + left_index*A[i] - SA[i+1] # MODしない項
count += (A[i]*(N-left_index-1-i) + SA[N]- SA[left_index+1+i]) - MOD*(N-left_index-1-i) # MODする項
print(count)
|
ConDefects/ConDefects/Code/abc353_c/Python/55158545
|
condefects-python_data_1903
|
N = int(input())
print('N'*N)
N = int(input())
print((10**N-1)//9*N)
|
ConDefects/ConDefects/Code/abc333_a/Python/54873390
|
condefects-python_data_1904
|
N, K = map(int,input().split())
ct = list(map(int,input().split()))
import sys
S = sum(ct)
to_go = sum(ct)
ans = [-1]*to_go
block_idx = -(-to_go // K)
#print(block_idx, to_go)
dead = 0
while to_go > 0:
steps = to_go % K
if steps == 0:
steps = K
criticals = set()
for n in range(N):
if ct[n] > block_idx:
print(-1)
sys.exit()
if ct[n] == block_idx:
criticals.add(n)
ans_idx = - (block_idx - 1) * K - steps
#print(block_idx, steps)
# 不可能
if len(criticals) > steps - dead:
print(-1)
sys.exit()
#print(block_idx, criticals, steps, dead, ans_idx)
for j in range(steps - dead):
if len(criticals) == steps - dead - j: # 制限に達した時
criticals = list(criticals)
criticals.sort()
while ans_idx < 0: # 最後まで埋めなければならない
for i in range(ans_idx, ans_idx + len(criticals)):
ans[i] = criticals[i - ans_idx]
ans_idx += K
dead += len(criticals)
for c in criticals:
ct[c] = 0
break # このブロックの処理を終える
used = set(ans[max(-S, ans_idx - K): ans_idx])
#print(used, max(-S, ans_idx - K), ans_idx)
for num_now in range(N):
if ct[num_now] and (num_now not in used): # num_nowは残っている数のうち最小のものとしたい
#print(ans_idx)
ans[ans_idx] = num_now
ct[num_now] -= 1
if num_now in criticals: criticals.remove(num_now)
break
ans_idx += 1
to_go -= steps
block_idx -= 1
#print(ans)
ans = [a + 1 for a in ans]
print(*ans)
N, K = map(int,input().split())
ct = list(map(int,input().split()))
import sys
S = sum(ct)
to_go = sum(ct)
ans = [-1]*to_go
block_idx = -(-to_go // K)
#print(block_idx, to_go)
dead = 0
while to_go > 0:
steps = to_go % K
if steps == 0:
steps = K
criticals = set()
for n in range(N):
if ct[n] > block_idx:
print(-1)
sys.exit()
if ct[n] == block_idx:
criticals.add(n)
ans_idx = - (block_idx - 1) * K - steps
#print(block_idx, steps)
# 不可能
if len(criticals) > steps - dead:
print(-1)
sys.exit()
#print(block_idx, criticals, steps, dead, ans_idx)
for j in range(steps - dead):
if len(criticals) == steps - dead - j: # 制限に達した時
criticals = list(criticals)
criticals.sort()
while ans_idx < 0: # 最後まで埋めなければならない
for i in range(ans_idx, ans_idx + len(criticals)):
ans[i] = criticals[i - ans_idx]
ans_idx += K
dead += len(criticals)
for c in criticals:
ct[c] = 0
break # このブロックの処理を終える
used = set(ans[max(-S, ans_idx - K + 1): ans_idx])
#print(used, max(-S, ans_idx - K), ans_idx)
for num_now in range(N):
if ct[num_now] and (num_now not in used): # num_nowは残っている数のうち最小のものとしたい
#print(ans_idx)
ans[ans_idx] = num_now
ct[num_now] -= 1
if num_now in criticals: criticals.remove(num_now)
break
ans_idx += 1
to_go -= steps
block_idx -= 1
#print(ans)
ans = [a + 1 for a in ans]
print(*ans)
|
ConDefects/ConDefects/Code/arc128_e/Python/27510550
|
condefects-python_data_1905
|
import sys
sys.setrecursionlimit(10**6)
def f(x):
if x // 2 not in dp:
dp[x // 2] = f(x // 2)
if x // 3 not in dp:
dp[x // 3] = f(x // 3)
return dp[x // 2] + dp[x // 3]
N = int(input())
dp = {0: 1}
print(f(N))
import sys
sys.setrecursionlimit(10**6)
def f(x):
if x in dp:
return dp[x]
if x // 2 not in dp:
dp[x // 2] = f(x // 2)
if x // 3 not in dp:
dp[x // 3] = f(x // 3)
return dp[x // 2] + dp[x // 3]
N = int(input())
dp = {0: 1}
print(f(N))
|
ConDefects/ConDefects/Code/abc275_d/Python/45982640
|
condefects-python_data_1906
|
# 275d
import math
def rec(n, memo={}):
if math.floor(n) == 0:
return 1
if n in memo:
return memo[n]
memo[n] = rec(n/2, memo) + rec(n/3, memo)
return memo[n]
n = int(input())
rec(n)
# 275d
import math
def rec(n, memo={}):
if math.floor(n) == 0:
return 1
if n in memo:
return memo[n]
memo[n] = rec(n/2, memo) + rec(n/3, memo)
return memo[n]
n = int(input())
print(rec(n))
|
ConDefects/ConDefects/Code/abc275_d/Python/45717410
|
condefects-python_data_1907
|
n,m=list(map(int,input().split()))
l=[int(x) for x in input().split()]
d=dict()
for i in l:
if i in d:
d[i]+=1
else :
d[i]=1
yes=True
nl=[int(x) for x in input().split()]
for i in nl:
if i not in d or d[i]==0:
yes=False
break
print("Yes"if yes else "No")
n,m=list(map(int,input().split()))
l=[int(x) for x in input().split()]
d=dict()
for i in l:
if i in d:
d[i]+=1
else :
d[i]=1
yes=True
nl=[int(x) for x in input().split()]
for i in nl:
if i not in d or d[i]==0:
yes=False
break
else:
d[i]-=1
print("Yes"if yes else "No")
|
ConDefects/ConDefects/Code/abc241_b/Python/45708346
|
condefects-python_data_1908
|
class Lazy_Evaluation_Tree():
def __init__(self, L, op, unit, act, comp, id):
""" op を演算, act を作用とするリスト L の Segment Tree を作成
op: 演算
unit: Monoid op の単位元 ( xe=ex=x を満たす e )
act: 作用素
comp: 作用素の合成
id: 恒等写像
[条件] M: Monoid, F={f: F x M→ M: 作用素} に対して, 以下が成立する.
F は恒等写像 id を含む.つまり, 任意の x in M に対して id(x)=x
F は写像の合成に閉じている. つまり, 任意の f,g in F に対して, comp(f,g) in F
任意の f in F, x,y in M に対して, f(xy)=f(x) f(y) である.
[注記]
作用素は左から掛ける. 更新も左から.
"""
self.op=op
self.unit=unit
self.act=act
self.comp=comp
self.id=id
N=len(L)
d=max(1,(N-1).bit_length())
k=1<<d
self.data=data=[unit]*k+L+[unit]*(k-len(L))
self.lazy=[id]*(2*k)
self.N=k
self.depth=d
for i in range(k-1,0,-1):
data[i]=op(data[i<<1], data[i<<1|1])
def _eval_at(self, m):
if self.lazy[m]==self.id:
return self.data[m]
return self.act(self.lazy[m],self.data[m])
#配列の第m要素を下に伝搬
def _propagate_at(self, m):
self.data[m]=self._eval_at(m)
lazy=self.lazy; comp=self.comp
if m<self.N and self.lazy[m]!=self.id:
lazy[m<<1]=comp(lazy[m], lazy[m<<1])
lazy[m<<1|1]=comp(lazy[m], lazy[m<<1|1])
lazy[m]=self.id
#配列の第m要素より上を全て伝搬
def _propagate_above(self, m):
H=m.bit_length()
for h in range(H-1, 0, -1):
self._propagate_at(m>>h)
#配列の第m要素より上を全て再計算
def _recalc_above(self, m):
data=self.data; op=self.op
eval_at=self._eval_at
while m>1:
m>>=1
data[m]=op(eval_at(m<<1),eval_at(m<<1|1))
def get(self,k):
m=k+self.N
self._propagate_above(m)
self.data[m]=self._eval_at(m)
self.lazy[m]=self.id
return self.data[m]
#作用
def action(self, l, r, alpha, left_closed=True, right_closed=True):
""" 第 l 要素から第 r 要素全てに alpha を作用させる.
"""
L=l+self.N+(not left_closed)
R=r+self.N+(right_closed)
L0=R0=-1
X,Y=L,R-1
while X<Y:
if X&1:
L0=max(L0,X)
X+=1
if Y&1==0:
R0=max(R0,Y)
Y-=1
X>>=1
Y>>=1
L0=max(L0,X)
R0=max(R0,Y)
self._propagate_above(L0)
self._propagate_above(R0)
lazy=self.lazy; comp=self.comp
while L<R:
if L&1:
lazy[L]=comp(alpha, lazy[L])
L+=1
if R&1:
R-=1
lazy[R]=comp(alpha, lazy[R])
L>>=1
R>>=1
self._recalc_above(L0)
self._recalc_above(R0)
def update(self, k, x):
""" 第 k 要素を x に変更する.
"""
m=k+self.N
self._propagate_above(m)
self.data[m]=x
self.lazy[m]=self.id
self._recalc_above(m)
def product(self, l, r, left_closed=True, right_closed=True):
""" 第 l 要素から第 r 要素までの総積を求める.
"""
L=l+self.N+(not left_closed)
R=r+self.N+(right_closed)
L0=R0=-1
X,Y=L,R-1
while X<Y:
if X&1:
L0=max(L0,X)
X+=1
if Y&1==0:
R0=max(R0,Y)
Y-=1
X>>=1
Y>>=1
L0=max(L0,X)
R0=max(R0,Y)
self._propagate_above(L0)
self._propagate_above(R0)
vL=vR=self.unit
op=self.op; eval_at=self._eval_at
while L<R:
if L&1:
vL=op(vL, eval_at(L))
L+=1
if R&1:
R-=1
vR=op(eval_at(R), vR)
L>>=1
R>>=1
return self.op(vL,vR)
def all_product(self):
return self.product(0,self.N-1)
#リフレッシュ
def refresh(self):
lazy=self.lazy; comp=self.comp
for m in range(1,2*self.N):
self.data[m]=self._eval_at(m)
if m<self.N and self.lazy[m]!=self.id:
lazy[m<<1]=comp(lazy[m], lazy[m<<1])
lazy[m<<1|1]=comp(lazy[m], lazy[m<<1|1])
lazy[m]=self.id
def __getitem__(self,k):
return self.get(k)
def __setitem__(self,k,x):
self.update(k,x)
#==================================================
def solve():
N = int(input())
A = list(map(int, input().split()))
histories = [[0] for _ in range(N + 1)]
for i, a in enumerate(A, 1):
histories[a].append(i)
queries = [[[], []] for _ in range(N + 2)]
for a in range(N + 1):
histories[a].append(N + 1)
for l, c, r in zip(histories[a], histories[a][1:], histories[a][2:]):
queries[l + 1][0].append((c, r - 1))
queries[c][1].append((c, r - 1))
def op(x, y):
xk, xv = x
yk, yv = y
if xk < yk:
return x
elif xk > yk:
return y
else:
return (xk, xv + yv)
def act(a, x):
return (a + x[0], x[1])
def comp(a, b):
return a + b
S = Lazy_Evaluation_Tree([(0, 1)] * (N + 2), op, (N + 1, 0), act, comp, 0)
S.update(0, (N + 1, 1))
S.update(N + 1, (N + 1, 1))
ans = 0
for i in range(1, N + 1):
for l, r in queries[i][0]:
S.action(l, r, 1)
k, v = S.product(1, N)
if k == 0:
ans += N - v
for l, r in queries[i][1]:
S.action(l, r, -1)
return ans
#==================================================
print(solve())
class Lazy_Evaluation_Tree():
def __init__(self, L, op, unit, act, comp, id):
""" op を演算, act を作用とするリスト L の Segment Tree を作成
op: 演算
unit: Monoid op の単位元 ( xe=ex=x を満たす e )
act: 作用素
comp: 作用素の合成
id: 恒等写像
[条件] M: Monoid, F={f: F x M→ M: 作用素} に対して, 以下が成立する.
F は恒等写像 id を含む.つまり, 任意の x in M に対して id(x)=x
F は写像の合成に閉じている. つまり, 任意の f,g in F に対して, comp(f,g) in F
任意の f in F, x,y in M に対して, f(xy)=f(x) f(y) である.
[注記]
作用素は左から掛ける. 更新も左から.
"""
self.op=op
self.unit=unit
self.act=act
self.comp=comp
self.id=id
N=len(L)
d=max(1,(N-1).bit_length())
k=1<<d
self.data=data=[unit]*k+L+[unit]*(k-len(L))
self.lazy=[id]*(2*k)
self.N=k
self.depth=d
for i in range(k-1,0,-1):
data[i]=op(data[i<<1], data[i<<1|1])
def _eval_at(self, m):
if self.lazy[m]==self.id:
return self.data[m]
return self.act(self.lazy[m],self.data[m])
#配列の第m要素を下に伝搬
def _propagate_at(self, m):
self.data[m]=self._eval_at(m)
lazy=self.lazy; comp=self.comp
if m<self.N and self.lazy[m]!=self.id:
lazy[m<<1]=comp(lazy[m], lazy[m<<1])
lazy[m<<1|1]=comp(lazy[m], lazy[m<<1|1])
lazy[m]=self.id
#配列の第m要素より上を全て伝搬
def _propagate_above(self, m):
H=m.bit_length()
for h in range(H-1, 0, -1):
self._propagate_at(m>>h)
#配列の第m要素より上を全て再計算
def _recalc_above(self, m):
data=self.data; op=self.op
eval_at=self._eval_at
while m>1:
m>>=1
data[m]=op(eval_at(m<<1),eval_at(m<<1|1))
def get(self,k):
m=k+self.N
self._propagate_above(m)
self.data[m]=self._eval_at(m)
self.lazy[m]=self.id
return self.data[m]
#作用
def action(self, l, r, alpha, left_closed=True, right_closed=True):
""" 第 l 要素から第 r 要素全てに alpha を作用させる.
"""
L=l+self.N+(not left_closed)
R=r+self.N+(right_closed)
L0=R0=-1
X,Y=L,R-1
while X<Y:
if X&1:
L0=max(L0,X)
X+=1
if Y&1==0:
R0=max(R0,Y)
Y-=1
X>>=1
Y>>=1
L0=max(L0,X)
R0=max(R0,Y)
self._propagate_above(L0)
self._propagate_above(R0)
lazy=self.lazy; comp=self.comp
while L<R:
if L&1:
lazy[L]=comp(alpha, lazy[L])
L+=1
if R&1:
R-=1
lazy[R]=comp(alpha, lazy[R])
L>>=1
R>>=1
self._recalc_above(L0)
self._recalc_above(R0)
def update(self, k, x):
""" 第 k 要素を x に変更する.
"""
m=k+self.N
self._propagate_above(m)
self.data[m]=x
self.lazy[m]=self.id
self._recalc_above(m)
def product(self, l, r, left_closed=True, right_closed=True):
""" 第 l 要素から第 r 要素までの総積を求める.
"""
L=l+self.N+(not left_closed)
R=r+self.N+(right_closed)
L0=R0=-1
X,Y=L,R-1
while X<Y:
if X&1:
L0=max(L0,X)
X+=1
if Y&1==0:
R0=max(R0,Y)
Y-=1
X>>=1
Y>>=1
L0=max(L0,X)
R0=max(R0,Y)
self._propagate_above(L0)
self._propagate_above(R0)
vL=vR=self.unit
op=self.op; eval_at=self._eval_at
while L<R:
if L&1:
vL=op(vL, eval_at(L))
L+=1
if R&1:
R-=1
vR=op(eval_at(R), vR)
L>>=1
R>>=1
return self.op(vL,vR)
def all_product(self):
return self.product(0,self.N-1)
#リフレッシュ
def refresh(self):
lazy=self.lazy; comp=self.comp
for m in range(1,2*self.N):
self.data[m]=self._eval_at(m)
if m<self.N and self.lazy[m]!=self.id:
lazy[m<<1]=comp(lazy[m], lazy[m<<1])
lazy[m<<1|1]=comp(lazy[m], lazy[m<<1|1])
lazy[m]=self.id
def __getitem__(self,k):
return self.get(k)
def __setitem__(self,k,x):
self.update(k,x)
#==================================================
def solve():
N = int(input())
A = list(map(int, input().split()))
histories = [[0] for _ in range(N + 1)]
for i, a in enumerate(A, 1):
histories[a].append(i)
queries = [[[], []] for _ in range(N + 2)]
for a in range(N + 1):
histories[a].append(N + 1)
for l, c, r in zip(histories[a], histories[a][1:], histories[a][2:]):
queries[l + 1][0].append((c, r - 1))
queries[c][1].append((c, r - 1))
def op(x, y):
xk, xv = x
yk, yv = y
if xk < yk:
return x
elif xk > yk:
return y
else:
return (xk, xv + yv)
def act(a, x):
return (a + x[0], x[1])
def comp(a, b):
return a + b
S = Lazy_Evaluation_Tree([(0, 1)] * (N + 2), op, (N + 1, 0), act, comp, 0)
S.update(0, (N + 1, 1))
S.update(N + 1, (N + 1, 1))
ans = 0
for i in range(1, N + 1):
for l, r in queries[i][0]:
S.action(l, r, 1)
k, v = S.product(1, N)
if k == 0:
ans += N - v
else:
ans += N
for l, r in queries[i][1]:
S.action(l, r, -1)
return ans
#==================================================
print(solve())
|
ConDefects/ConDefects/Code/abc346_g/Python/51628683
|
condefects-python_data_1909
|
import sys
input = sys.stdin.readline
N=int(input())
A=list(map(int,input().split()))
LIST=[[] for i in range(N+100)]
for i in range(N):
LIST[A[i]].append(i)
# 非再帰遅延伝搬セグ木
# 高々N点を更新
seg_el=1<<(N.bit_length()) # Segment treeの台の要素数
SEG=[[0,1] for i in range(2*seg_el)] # 1-indexedなので、要素数2*seg_el.Segment treeの初期値で初期化
# 最小値、最小値の個数
seg_height=1+N.bit_length() # Segment treeのたかさ
for i in range(2*seg_el):
SEG[i][1]=1<<(seg_height-i.bit_length())
LAZY=[0]*(2*seg_el) # 1-indexedなので、要素数2*seg_el.Segment treeの初期値で初期化
def indexes(L,R): # 遅延伝搬すべきノードのリストを下から上の順に返す. （つまり, updateやgetvaluesで見るノードより上にあるノードたち）
INDLIST=[]
R-=1
L>>=1
R>>=1
while L!=R:
if L>R:
INDLIST.append(L)
L>>=1
else:
INDLIST.append(R)
R>>=1
while L!=0:
INDLIST.append(L)
L>>=1
return INDLIST
def updates(l,r,x): # 区間[l,r)を x 加算
L=l+seg_el
R=r+seg_el
L//=(L & (-L))
R//=(R & (-R))
UPIND=indexes(L,R)
for ind in UPIND[::-1]: # 遅延伝搬. 上から更新していく.
if LAZY[ind]!=0:
plus_lazy=LAZY[ind]
SEG[ind<<1][0]=plus_lazy+SEG[ind<<1][0]
SEG[1+(ind<<1)][0]=plus_lazy+SEG[1+(ind<<1)][0]
LAZY[ind<<1]+=plus_lazy
LAZY[1+(ind<<1)]+=plus_lazy
LAZY[ind]=0
while L!=R:
if L > R:
SEG[L][0]=SEG[L][0]+x
LAZY[L]+=x
L+=1
L//=(L & (-L))
else:
R-=1
SEG[R][0]=SEG[R][0]+x
LAZY[R]+=x
R//=(R & (-R))
for ind in UPIND:
if SEG[ind<<1][0]==SEG[1+(ind<<1)][0]:
SEG[ind][0]=SEG[ind<<1][0]
SEG[ind][1]=SEG[ind<<1][1]+SEG[1+(ind<<1)][1]
elif SEG[ind<<1][0]<SEG[1+(ind<<1)][0]:
SEG[ind][0]=SEG[ind<<1][0]
SEG[ind][1]=SEG[ind<<1][1]
else:
SEG[ind][0]=SEG[1+(ind<<1)][0]
SEG[ind][1]=SEG[1+(ind<<1)][1]
def getvalues(l,r):
L=l+seg_el
R=r+seg_el
L//=(L & (-L))
R//=(R & (-R))
UPIND=indexes(L,R)
for ind in UPIND[::-1]: # 遅延伝搬. 上から更新していく.
if LAZY[ind]!=0:
plus_lazy=LAZY[ind]
SEG[ind<<1][0]=plus_lazy+SEG[ind<<1][0]
SEG[1+(ind<<1)][0]=plus_lazy+SEG[1+(ind<<1)][0]
LAZY[ind<<1]+=plus_lazy
LAZY[1+(ind<<1)]+=plus_lazy
LAZY[ind]=0
ANS=1<<60
ko=0
while L!=R:
if L > R:
if ANS>SEG[L][0]:
ANS=SEG[L][0]
ko=SEG[L][1]
elif ANS==SEG[L][0]:
ko+=SEG[L][1]
L+=1
L//=(L & (-L))
else:
R-=1
if ANS>SEG[R][0]:
ANS=SEG[R][0]
ko=SEG[R][1]
elif ANS==SEG[R][0]:
ko+=SEG[R][1]
R//=(R & (-R))
return ANS,ko
LIST2=[]
for i in range(len(LIST)):
for j in range(len(LIST[i])):
if j>=1:
x=LIST[i][j-1]+1
else:
x=0
if j+1<len(LIST[i]):
y=LIST[i][j+1]-1
else:
y=N-1
LIST2.append((x,LIST[i][j],LIST[i][j],y))
PLUS=[[] for i in range(N+5)]
MINUS=[[] for i in range(N+5)]
for x,y,z,w in LIST2:
PLUS[x].append((z,w))
MINUS[y+1].append((z,w))
ANS=0
for i in range(N):
for z,w in PLUS[i]:
updates(z,w+1,1)
for z,w in MINUS[i]:
updates(z,w+1,-1)
c,ko=getvalues(0,N)
if c==0:
ANS+=N-ko
print(ANS)
import sys
input = sys.stdin.readline
N=int(input())
A=list(map(int,input().split()))
LIST=[[] for i in range(N+100)]
for i in range(N):
LIST[A[i]].append(i)
# 非再帰遅延伝搬セグ木
# 高々N点を更新
seg_el=1<<(N.bit_length()) # Segment treeの台の要素数
SEG=[[0,1] for i in range(2*seg_el)] # 1-indexedなので、要素数2*seg_el.Segment treeの初期値で初期化
# 最小値、最小値の個数
seg_height=1+N.bit_length() # Segment treeのたかさ
for i in range(2*seg_el):
SEG[i][1]=1<<(seg_height-i.bit_length())
LAZY=[0]*(2*seg_el) # 1-indexedなので、要素数2*seg_el.Segment treeの初期値で初期化
def indexes(L,R): # 遅延伝搬すべきノードのリストを下から上の順に返す. （つまり, updateやgetvaluesで見るノードより上にあるノードたち）
INDLIST=[]
R-=1
L>>=1
R>>=1
while L!=R:
if L>R:
INDLIST.append(L)
L>>=1
else:
INDLIST.append(R)
R>>=1
while L!=0:
INDLIST.append(L)
L>>=1
return INDLIST
def updates(l,r,x): # 区間[l,r)を x 加算
L=l+seg_el
R=r+seg_el
L//=(L & (-L))
R//=(R & (-R))
UPIND=indexes(L,R)
for ind in UPIND[::-1]: # 遅延伝搬. 上から更新していく.
if LAZY[ind]!=0:
plus_lazy=LAZY[ind]
SEG[ind<<1][0]=plus_lazy+SEG[ind<<1][0]
SEG[1+(ind<<1)][0]=plus_lazy+SEG[1+(ind<<1)][0]
LAZY[ind<<1]+=plus_lazy
LAZY[1+(ind<<1)]+=plus_lazy
LAZY[ind]=0
while L!=R:
if L > R:
SEG[L][0]=SEG[L][0]+x
LAZY[L]+=x
L+=1
L//=(L & (-L))
else:
R-=1
SEG[R][0]=SEG[R][0]+x
LAZY[R]+=x
R//=(R & (-R))
for ind in UPIND:
if SEG[ind<<1][0]==SEG[1+(ind<<1)][0]:
SEG[ind][0]=SEG[ind<<1][0]
SEG[ind][1]=SEG[ind<<1][1]+SEG[1+(ind<<1)][1]
elif SEG[ind<<1][0]<SEG[1+(ind<<1)][0]:
SEG[ind][0]=SEG[ind<<1][0]
SEG[ind][1]=SEG[ind<<1][1]
else:
SEG[ind][0]=SEG[1+(ind<<1)][0]
SEG[ind][1]=SEG[1+(ind<<1)][1]
def getvalues(l,r):
L=l+seg_el
R=r+seg_el
L//=(L & (-L))
R//=(R & (-R))
UPIND=indexes(L,R)
for ind in UPIND[::-1]: # 遅延伝搬. 上から更新していく.
if LAZY[ind]!=0:
plus_lazy=LAZY[ind]
SEG[ind<<1][0]=plus_lazy+SEG[ind<<1][0]
SEG[1+(ind<<1)][0]=plus_lazy+SEG[1+(ind<<1)][0]
LAZY[ind<<1]+=plus_lazy
LAZY[1+(ind<<1)]+=plus_lazy
LAZY[ind]=0
ANS=1<<60
ko=0
while L!=R:
if L > R:
if ANS>SEG[L][0]:
ANS=SEG[L][0]
ko=SEG[L][1]
elif ANS==SEG[L][0]:
ko+=SEG[L][1]
L+=1
L//=(L & (-L))
else:
R-=1
if ANS>SEG[R][0]:
ANS=SEG[R][0]
ko=SEG[R][1]
elif ANS==SEG[R][0]:
ko+=SEG[R][1]
R//=(R & (-R))
return ANS,ko
LIST2=[]
for i in range(len(LIST)):
for j in range(len(LIST[i])):
if j>=1:
x=LIST[i][j-1]+1
else:
x=0
if j+1<len(LIST[i]):
y=LIST[i][j+1]-1
else:
y=N-1
LIST2.append((x,LIST[i][j],LIST[i][j],y))
PLUS=[[] for i in range(N+5)]
MINUS=[[] for i in range(N+5)]
for x,y,z,w in LIST2:
PLUS[x].append((z,w))
MINUS[y+1].append((z,w))
ANS=0
for i in range(N):
for z,w in PLUS[i]:
updates(z,w+1,1)
for z,w in MINUS[i]:
updates(z,w+1,-1)
c,ko=getvalues(0,N)
if c==0:
ANS+=N-ko
else:
ANS+=N
print(ANS)
|
ConDefects/ConDefects/Code/abc346_g/Python/51994914
|
condefects-python_data_1910
|
def job():
s = input()
a_set = set()
stack_kakko = []
stack_i = []
for i in range(len(s)):
stack_i.append(i)
c = s[i]
if c == '(':
stack_kakko.append(i)
elif c == ')':
peak = stack_kakko[-1]
while stack_i[-1] > peak:
idx = stack_i.pop()
a_set.discard(s[idx])
else:
if c in a_set:
exit(print('No'))
else:
a_set.add(c)
print('Yes')
job()
def job():
s = input()
a_set = set()
stack_kakko = []
stack_i = []
for i in range(len(s)):
stack_i.append(i)
c = s[i]
if c == '(':
stack_kakko.append(i)
elif c == ')':
peak = stack_kakko.pop()
while stack_i[-1] > peak:
idx = stack_i.pop()
a_set.discard(s[idx])
else:
if c in a_set:
exit(print('No'))
else:
a_set.add(c)
print('Yes')
job()
|
ConDefects/ConDefects/Code/abc283_d/Python/45517172
|
condefects-python_data_1911
|
S = input()
level = 0
LV = [set()]*len(S)
ST = set()
for ss in S:
if ss == ")":
ST = ST - LV[level]
LV[level] =set()
level -= 1
elif ss == "(":
level += 1
else:
if ss in ST:
print("No")
exit()
else:
ST.add(ss)
LV[level].add(ss)
print("Yes")
S = input()
level = 0
LV = [set() for _ in range(len(S))]
ST = set()
for ss in S:
if ss == ")":
ST = ST - LV[level]
LV[level] =set()
level -= 1
elif ss == "(":
level += 1
else:
if ss in ST:
print("No")
exit()
else:
ST.add(ss)
LV[level].add(ss)
print("Yes")
|
ConDefects/ConDefects/Code/abc283_d/Python/44825137
|
condefects-python_data_1912
|
S = input()
t = set([])
a=[[]]
for i in S:
if i.isalpha() == True:
if i in t:
print("No")
exit()
else:
t.add(i)
a[-1].append(i)
elif i==")":
# print(a)
for j in a[-1]:
print(t)
t.remove(j)
a.pop(-1)
elif i=="(":
a.append([])
# print(t)
# print(a)
print("Yes")
S = input()
t = set([])
a=[[]]
for i in S:
if i.isalpha() == True:
if i in t:
print("No")
exit()
else:
t.add(i)
a[-1].append(i)
elif i==")":
# print(a)
for j in a[-1]:
# print(t)
t.remove(j)
a.pop(-1)
elif i=="(":
a.append([])
# print(t)
# print(a)
print("Yes")
|
ConDefects/ConDefects/Code/abc283_d/Python/45462979
|
condefects-python_data_1913
|
import bisect
H,W,rs,cs=map(int,input().split())
N=int(input())
r_dic={}
c_dic={}
for _ in range(N):
r,c=map(int,input().split())
if r not in r_dic:
r_dic[r]=set()
r_dic[r].add(c)
else:
r_dic[r].add(c)
if c not in c_dic:
c_dic[c]=set()
c_dic[c].add(r)
else:
c_dic[c].add(r)
for r in r_dic:
r_dic[r]=[0]+sorted(list(r_dic[r]))+[W+1]
for c in c_dic:
c_dic[c]=[0]+sorted(list(c_dic[c]))+[H+1]
Q=int(input())
def upper_bound(array,x):
index=bisect.bisect_right(array,x-1)
return array[index]
def lower_bound(array,x):
index=bisect.bisect_right(array,x)-1
return array[index]
x=rs
y=cs
for _ in range(Q):
d,l=input().split()
l=int(l)
if d=='L':
if x in r_dic:
y=max(lower_bound(r_dic[x],y)+1,y-l)
else:
y=max(1,y-l)
elif d=='R':
if x in r_dic:
y=min(upper_bound(r_dic[x],y)-1,y+l)
else:
y=min(W,y+l)
elif d=='U':
if y in c_dic:
x=max(lower_bound(c_dic[y],x)+1,x-l)
else:
x=max(1,x-l)
else:
if y in c_dic:
x=min(upper_bound(c_dic[y],x)-1,x+l)
else:
x=min(H,y+l)
print(x,y)
import bisect
H,W,rs,cs=map(int,input().split())
N=int(input())
r_dic={}
c_dic={}
for _ in range(N):
r,c=map(int,input().split())
if r not in r_dic:
r_dic[r]=set()
r_dic[r].add(c)
else:
r_dic[r].add(c)
if c not in c_dic:
c_dic[c]=set()
c_dic[c].add(r)
else:
c_dic[c].add(r)
for r in r_dic:
r_dic[r]=[0]+sorted(list(r_dic[r]))+[W+1]
for c in c_dic:
c_dic[c]=[0]+sorted(list(c_dic[c]))+[H+1]
Q=int(input())
def upper_bound(array,x):
index=bisect.bisect_right(array,x-1)
return array[index]
def lower_bound(array,x):
index=bisect.bisect_right(array,x)-1
return array[index]
x=rs
y=cs
for _ in range(Q):
d,l=input().split()
l=int(l)
if d=='L':
if x in r_dic:
y=max(lower_bound(r_dic[x],y)+1,y-l)
else:
y=max(1,y-l)
elif d=='R':
if x in r_dic:
y=min(upper_bound(r_dic[x],y)-1,y+l)
else:
y=min(W,y+l)
elif d=='U':
if y in c_dic:
x=max(lower_bound(c_dic[y],x)+1,x-l)
else:
x=max(1,x-l)
else:
if y in c_dic:
x=min(upper_bound(c_dic[y],x)-1,x+l)
else:
x=min(H,x+l)
print(x,y)
|
ConDefects/ConDefects/Code/abc273_d/Python/45461646
|
condefects-python_data_1914
|
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
from collections import deque, defaultdict
from decimal import Decimal
from bisect import bisect_left, bisect_right
from heapq import heapify, heappush, heappop
from itertools import permutations, combinations
from random import randrange, choices
from string import ascii_lowercase, ascii_uppercase
from os import environ
from copy import deepcopy
import math
import sys
sys.setrecursionlimit(10000000)
class UnionFind():
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())
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
T = TypeVar('T')
class SortedSet(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None:
a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size: size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] < a[i + 1] for i in range(len(a) - 1)):
a = sorted(set(a))
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i:
yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i):
yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedSet" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1: len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]:
break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0:
return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def add(self, x: T) -> bool:
"Add an element and return True if added. / O(√N)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return True
a, i = self._position(x)
if i != len(a) and a[i] == x:
return False
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
return True
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a:
self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(√N)"
if self.size == 0:
return False
a, i = self._position(x)
if i == len(a) or a[i] != x:
return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0:
return a[i]
else:
for a in self.a:
if i < len(a):
return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0:
return self._pop(a, i)
else:
for a in self.a:
if i < len(a):
return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
class SortedMultiset(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None:
a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size: size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
a = sorted(a)
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i:
yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i):
yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedMultiset" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1: len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]:
break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0:
return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def count(self, x: T) -> int:
"Count the number of x."
return self.index_right(x) - self.index(x)
def add(self, x: T) -> None:
"Add an element. / O(√N)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return
a, i = self._position(x)
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a:
self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(√N)"
if self.size == 0:
return False
a, i = self._position(x)
if i == len(a) or a[i] != x:
return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0:
return a[i]
else:
for a in self.a:
if i < len(a):
return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0:
return self._pop(a, i)
else:
for a in self.a:
if i < len(a):
return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
h, w, x, y = map(int, input().split())
n = int(input())
dx = {}
dy = {}
for _ in range(n):
r, c = map(int, input().split())
if r in dx:
dx[r].append(c)
else:
dx[r] = [c]
if c in dy:
dy[c].append(r)
else:
dy[c] = [r]
for v in dx.values():
v.sort()
for v in dy.values():
v.sort()
print(f'dx: {dx}, dy: {dy}')
q = int(input())
ans = [None] * q
for j in range(q):
d, l = input().split()
l = int(l)
if d == 'L' or d == 'R':
if x not in dx:
if d == 'L':
y -= l
else:
y += l
else:
i = bisect_left(dx[x], y)
if d == 'L':
if i == 0:
y -= l
else:
y = max(y - l, dx[x][i - 1] + 1)
elif i == len(dx[x]):
y += l
else:
y = min(y + l, dx[x][i] - 1)
else:
if y not in dy:
if d == 'U':
x -= l
else:
x += l
else:
i = bisect_left(dy[y], x)
if d == 'U':
if i == 0:
x -= l
else:
x = max(x - l, dy[y][i - 1] + 1)
elif i == len(dy[y]):
x += l
else:
x = min(x + l, dy[y][i] - 1)
x = min(max(x, 1), h)
y = min(max(y, 1), w)
ans[j] = (x, y)
for x, y in ans:
print(x, y)
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
from collections import deque, defaultdict
from decimal import Decimal
from bisect import bisect_left, bisect_right
from heapq import heapify, heappush, heappop
from itertools import permutations, combinations
from random import randrange, choices
from string import ascii_lowercase, ascii_uppercase
from os import environ
from copy import deepcopy
import math
import sys
sys.setrecursionlimit(10000000)
class UnionFind():
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())
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
T = TypeVar('T')
class SortedSet(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None:
a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size: size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] < a[i + 1] for i in range(len(a) - 1)):
a = sorted(set(a))
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i:
yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i):
yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedSet" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1: len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]:
break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0:
return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def add(self, x: T) -> bool:
"Add an element and return True if added. / O(√N)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return True
a, i = self._position(x)
if i != len(a) and a[i] == x:
return False
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
return True
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a:
self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(√N)"
if self.size == 0:
return False
a, i = self._position(x)
if i == len(a) or a[i] != x:
return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0:
return a[i]
else:
for a in self.a:
if i < len(a):
return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0:
return self._pop(a, i)
else:
for a in self.a:
if i < len(a):
return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
class SortedMultiset(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None:
a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size: size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
a = sorted(a)
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i:
yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i):
yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedMultiset" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1: len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]:
break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0:
return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def count(self, x: T) -> int:
"Count the number of x."
return self.index_right(x) - self.index(x)
def add(self, x: T) -> None:
"Add an element. / O(√N)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return
a, i = self._position(x)
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a:
self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(√N)"
if self.size == 0:
return False
a, i = self._position(x)
if i == len(a) or a[i] != x:
return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0:
return a[i]
else:
for a in self.a:
if i < len(a):
return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0:
return self._pop(a, i)
else:
for a in self.a:
if i < len(a):
return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
h, w, x, y = map(int, input().split())
n = int(input())
dx = {}
dy = {}
for _ in range(n):
r, c = map(int, input().split())
if r in dx:
dx[r].append(c)
else:
dx[r] = [c]
if c in dy:
dy[c].append(r)
else:
dy[c] = [r]
for v in dx.values():
v.sort()
for v in dy.values():
v.sort()
# print(f'dx: {dx}, dy: {dy}')
q = int(input())
ans = [None] * q
for j in range(q):
d, l = input().split()
l = int(l)
if d == 'L' or d == 'R':
if x not in dx:
if d == 'L':
y -= l
else:
y += l
else:
i = bisect_left(dx[x], y)
if d == 'L':
if i == 0:
y -= l
else:
y = max(y - l, dx[x][i - 1] + 1)
elif i == len(dx[x]):
y += l
else:
y = min(y + l, dx[x][i] - 1)
else:
if y not in dy:
if d == 'U':
x -= l
else:
x += l
else:
i = bisect_left(dy[y], x)
if d == 'U':
if i == 0:
x -= l
else:
x = max(x - l, dy[y][i - 1] + 1)
elif i == len(dy[y]):
x += l
else:
x = min(x + l, dy[y][i] - 1)
x = min(max(x, 1), h)
y = min(max(y, 1), w)
ans[j] = (x, y)
for x, y in ans:
print(x, y)
|
ConDefects/ConDefects/Code/abc273_d/Python/45053294
|
condefects-python_data_1915
|
import re
import functools
import copy
import bisect
import math
from collections import deque
from collections import defaultdict
from collections import Counter
from heapq import heapify, heappush, heappop, heappushpop, heapreplace
al = "abcdefghijklmnopqrstuvwxyz"
au = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
def ii():
return int(input())
def gl():
return list(map(int, input().split()))
def gs():
return list(input().split())
class UnionFind():
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 glm(h,w):
a = []
for i in range(h):
a.append(gl())
return a
def gsm(h,w):
a = []
for i in range(h):
a.append(input())
return a
def kiriage(n, r):
if n % r == 0:
return n // r
else:
return (n // r) + 1
def next_perm(a):
l = copy.copy(a)
l = list(l)
i = len(l) - 2
while 0 <= i and l[i] >= l[i+1]:
i -= 1
if i == 1:
return False
j = len(l) - 1
while not (l[i] < l[j]):
j -= 1
l[i], l[j] = l[j], l[i]
return l[:i+1] + rev(l[i+1:])
def yaku(n):
ans = []
for i in range(1, int(math.sqrt(n)) + 1):
if n % i == 0:
ans.append(i)
ans.append(n // i)
return ans
def ketawa(n):
ans = 0
s = str(n)
for i in s:
ans += int(i)
return ans
def rev(a):
a = a[:]
return list(reversed(a))
def lcm2(x, y):
return (x * y) // math.gcd(x, y)
def lcm3(*ints):
return functools.reduce(lcm2, ints)
def gcd3(*ints):
return functools.reduce(math.gcd, ints)
def cntsep(a, b, k):
r = a % k
m = a - r
ans = (b - m) // (k+1)
if r > 0:
ans -= 1
return ans
def putedges(g, idx = 0):
n = len(g)
e = []
cnt2 = 0
for i in range(n):
for j in g[i]:
cnt2 += 1
e.append((i, j))
m = len(g)
print(n, cnt2)
for i in e:
if idx == 0:
print(*[i[0], i[1]])
else:
print(*[i[0] + 1, i[1] + 1])
def drev(d):
newd = {}
for k in rev(list(d.keys())):
newd[k] = d[k]
return newd
def dvsort(d):
return dict(sorted(d.items(), key = lambda x: x[1]))
def dksort(d):
return dict(sorted(d.items()))
def rmwh(a):
while not '#' in a[0]:
a = a[1:]
while not '#' in a[-1]:
a = a[:-1]
ok = True
while True:
for y in range(len(a)):
if a[y][0] == '#':
ok = False
if ok:
for y in range(len(a)):
a[y] = a[y][1:]
else:
break
ok = True
while True:
for y in range(len(a)):
if a[y][-1] == '#':
ok = False
if ok:
for y in range(len(a)):
a[y] = a[y][:-1]
else:
break
return a
def comb_cnt(n, k):
return math.factorial(n) // (math.factorial(n - k) * math.factorial(k))
def sinhen(n, l):
if n < l:
return [n]
else:
return sinhen(n // l, l) + [n % l]
def cnt_com(l1, r1, l2, r2):
if l1 > l2:
l1, l2, r1, r2 = l2, l1, r2, r1
if l1 <= l2 and l2 <= r2 and r2 <= r1:
return r2 - l2
elif l1 <= l2 and l2 <= r1 and r1 <= r2:
return r1 - l2
elif r1 <= l2:
return 0
def cut_yoko(a, y):
a_copy = copy.deepcopy(a)
res = []
for x in range(len(a[0])):
res.append(a_copy[y][x])
return res
def cut_tate(a, x):
a_copy = copy.deepcopy(a)
res = []
for y in range(len(a)):
res.append(a_copy[y][x])
return res
def mbs(a, key):
ng = -1
ok = len(a)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if a[mid] >= key:
ok = mid
else:
ng = mid
return ok
def satlow(f, lower = 0, upper = 10**9):
ng = lower
ok = upper
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if f(mid):
ok = mid
else:
ng = mid
return ok
def listsatlow(a, f):
ng = -1
ok = len(a)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if f(a[mid]):
ok = mid
else:
ng = mid
return ok
inf = float('inf')
ans = inf
cnt=0
ay="Yes"
an="No"
#main
'''
def mss(a, key):
ng = len(a)
ok = -1
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if a[mid] <= key:
ok = mid
else:
ng = mid
return ok
'''
h, w, nowy, nowx = gl()
n = ii()
dy = {}
sdy = set()
dx = {}
sdx = set()
for i in range(n):
y, x = gl()
y -= 1
x -= 1
if not y in dy.keys():
dy[y] = [-1, w]
sdy.add(y)
dy[y].append(x)
if not x in dx.keys():
dx[x] = [-1, h]
sdx.add(x)
dx[x].append(y)
q = ii()
x = nowx - 1
y = nowy - 1
for i in range(q):
d, l = gs()
l = int(l)
if d == 'L':
if not y in dy.keys():
x = max(x - l, 0)
else:
if y in sdy:
dy[y] = list(sorted(dy[y]))
sdy.remove(y)
le = mbs(dy[y], x)
x = max(max(x - l, dy[y][max(le - 1, 0)] + 1), 0)
elif d == 'R':
if not y in dy.keys():
x = min(x + l, w-1)
else:
if y in sdy:
dy[y] = list(sorted(dy[y]))
sdy.remove(y)
rrd = mbs(dy[y], x + 1)
x = min(min(x + l, dy[y][rrd] - 1), w - 1)
elif d == 'U':
if not x in dx.keys():
y = max(y - l, 0)
else:
# print(dx[x])
if x in sdx:
dx[x] = list(sorted(dx[x]))
sdx.remove(x)
ue = mbs(dx[x], y -1)
y = max(max(y - l, dx[x][max(ue - 1, 0)] + 1), 0)
elif d == 'D':
if not x in dx.keys():
y = min(h-1, y + l)
else:
if x in sdx:
dx[x] = list(sorted(dx[x]))
sdx.remove(x)
dd = mbs(dx[x], y + 1)
y = min(min(y + l, dx[x][dd] - 1), h - 1)
assert 0 <= y
assert y < h
assert 0 <= x
assert x < w
print(y+1, x+1)
import re
import functools
import copy
import bisect
import math
from collections import deque
from collections import defaultdict
from collections import Counter
from heapq import heapify, heappush, heappop, heappushpop, heapreplace
al = "abcdefghijklmnopqrstuvwxyz"
au = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
def ii():
return int(input())
def gl():
return list(map(int, input().split()))
def gs():
return list(input().split())
class UnionFind():
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 glm(h,w):
a = []
for i in range(h):
a.append(gl())
return a
def gsm(h,w):
a = []
for i in range(h):
a.append(input())
return a
def kiriage(n, r):
if n % r == 0:
return n // r
else:
return (n // r) + 1
def next_perm(a):
l = copy.copy(a)
l = list(l)
i = len(l) - 2
while 0 <= i and l[i] >= l[i+1]:
i -= 1
if i == 1:
return False
j = len(l) - 1
while not (l[i] < l[j]):
j -= 1
l[i], l[j] = l[j], l[i]
return l[:i+1] + rev(l[i+1:])
def yaku(n):
ans = []
for i in range(1, int(math.sqrt(n)) + 1):
if n % i == 0:
ans.append(i)
ans.append(n // i)
return ans
def ketawa(n):
ans = 0
s = str(n)
for i in s:
ans += int(i)
return ans
def rev(a):
a = a[:]
return list(reversed(a))
def lcm2(x, y):
return (x * y) // math.gcd(x, y)
def lcm3(*ints):
return functools.reduce(lcm2, ints)
def gcd3(*ints):
return functools.reduce(math.gcd, ints)
def cntsep(a, b, k):
r = a % k
m = a - r
ans = (b - m) // (k+1)
if r > 0:
ans -= 1
return ans
def putedges(g, idx = 0):
n = len(g)
e = []
cnt2 = 0
for i in range(n):
for j in g[i]:
cnt2 += 1
e.append((i, j))
m = len(g)
print(n, cnt2)
for i in e:
if idx == 0:
print(*[i[0], i[1]])
else:
print(*[i[0] + 1, i[1] + 1])
def drev(d):
newd = {}
for k in rev(list(d.keys())):
newd[k] = d[k]
return newd
def dvsort(d):
return dict(sorted(d.items(), key = lambda x: x[1]))
def dksort(d):
return dict(sorted(d.items()))
def rmwh(a):
while not '#' in a[0]:
a = a[1:]
while not '#' in a[-1]:
a = a[:-1]
ok = True
while True:
for y in range(len(a)):
if a[y][0] == '#':
ok = False
if ok:
for y in range(len(a)):
a[y] = a[y][1:]
else:
break
ok = True
while True:
for y in range(len(a)):
if a[y][-1] == '#':
ok = False
if ok:
for y in range(len(a)):
a[y] = a[y][:-1]
else:
break
return a
def comb_cnt(n, k):
return math.factorial(n) // (math.factorial(n - k) * math.factorial(k))
def sinhen(n, l):
if n < l:
return [n]
else:
return sinhen(n // l, l) + [n % l]
def cnt_com(l1, r1, l2, r2):
if l1 > l2:
l1, l2, r1, r2 = l2, l1, r2, r1
if l1 <= l2 and l2 <= r2 and r2 <= r1:
return r2 - l2
elif l1 <= l2 and l2 <= r1 and r1 <= r2:
return r1 - l2
elif r1 <= l2:
return 0
def cut_yoko(a, y):
a_copy = copy.deepcopy(a)
res = []
for x in range(len(a[0])):
res.append(a_copy[y][x])
return res
def cut_tate(a, x):
a_copy = copy.deepcopy(a)
res = []
for y in range(len(a)):
res.append(a_copy[y][x])
return res
def mbs(a, key):
ng = -1
ok = len(a)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if a[mid] >= key:
ok = mid
else:
ng = mid
return ok
def satlow(f, lower = 0, upper = 10**9):
ng = lower
ok = upper
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if f(mid):
ok = mid
else:
ng = mid
return ok
def listsatlow(a, f):
ng = -1
ok = len(a)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if f(a[mid]):
ok = mid
else:
ng = mid
return ok
inf = float('inf')
ans = inf
cnt=0
ay="Yes"
an="No"
#main
'''
def mss(a, key):
ng = len(a)
ok = -1
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if a[mid] <= key:
ok = mid
else:
ng = mid
return ok
'''
h, w, nowy, nowx = gl()
n = ii()
dy = {}
sdy = set()
dx = {}
sdx = set()
for i in range(n):
y, x = gl()
y -= 1
x -= 1
if not y in dy.keys():
dy[y] = [-1, w]
sdy.add(y)
dy[y].append(x)
if not x in dx.keys():
dx[x] = [-1, h]
sdx.add(x)
dx[x].append(y)
q = ii()
x = nowx - 1
y = nowy - 1
for i in range(q):
d, l = gs()
l = int(l)
if d == 'L':
if not y in dy.keys():
x = max(x - l, 0)
else:
if y in sdy:
dy[y] = list(sorted(dy[y]))
sdy.remove(y)
le = mbs(dy[y], x)
x = max(max(x - l, dy[y][max(le - 1, 0)] + 1), 0)
elif d == 'R':
if not y in dy.keys():
x = min(x + l, w-1)
else:
if y in sdy:
dy[y] = list(sorted(dy[y]))
sdy.remove(y)
rrd = mbs(dy[y], x + 1)
x = min(min(x + l, dy[y][rrd] - 1), w - 1)
elif d == 'U':
if not x in dx.keys():
y = max(y - l, 0)
else:
# print(dx[x])
if x in sdx:
dx[x] = list(sorted(dx[x]))
sdx.remove(x)
ue = mbs(dx[x], y)
y = max(max(y - l, dx[x][max(ue - 1, 0)] + 1), 0)
elif d == 'D':
if not x in dx.keys():
y = min(h-1, y + l)
else:
if x in sdx:
dx[x] = list(sorted(dx[x]))
sdx.remove(x)
dd = mbs(dx[x], y + 1)
y = min(min(y + l, dx[x][dd] - 1), h - 1)
assert 0 <= y
assert y < h
assert 0 <= x
assert x < w
print(y+1, x+1)
|
ConDefects/ConDefects/Code/abc273_d/Python/44934690
|
condefects-python_data_1916
|
n=int(input())
ans=format(n,'x').zfill(2) #zfillで2桁となるよう0埋め
print(ans)
n=int(input())
ans=f'{n:02X}'
print(ans)
|
ConDefects/ConDefects/Code/abc271_a/Python/45782471
|
condefects-python_data_1917
|
n = int(input())
num = 'abcdef'
a = str(hex(n))
#print(a)
a = a[2:]
#print(a)
if len(a) < 2:
if a in num:
a = a.upper()
a = '0'+a
print(a)
exit()
else:
print(a)
exit()
else:
b = []
for i in range(len(a)):
if a[i] in num:
c = a[i].upper()
b.append(c)
#print(c)
else:
b.append(str(a[i]))
print(''.join(b))
n = int(input())
num = 'abcdef'
a = str(hex(n))
#print(a)
a = a[2:]
#print(a)
if len(a) < 2:
if a in num:
a = a.upper()
a = '0'+a
print(a)
exit()
else:
print('0'+a)
exit()
else:
b = []
for i in range(len(a)):
if a[i] in num:
c = a[i].upper()
b.append(c)
#print(c)
else:
b.append(str(a[i]))
print(''.join(b))
|
ConDefects/ConDefects/Code/abc271_a/Python/45793366
|
condefects-python_data_1918
|
N = int(input())
print(hex(N)[2:].upper())
N = int(input())
print(hex(N)[2:].upper().zfill(2))
|
ConDefects/ConDefects/Code/abc271_a/Python/45555284
|
condefects-python_data_1919
|
a = int(input())
b = format(a,"x")
b = str(b)
if a < 16:
b = "0"+ b
print(b)
a = int(input())
b = format(a,"x")
b = str(b)
if a < 16:
b = "0"+ b
print(b.upper())
|
ConDefects/ConDefects/Code/abc271_a/Python/46000119
|
condefects-python_data_1920
|
n = int(input())
print(hex(n)[2:].upper())
n = int(input())
print(hex(n)[2:].upper().zfill(2))
|
ConDefects/ConDefects/Code/abc271_a/Python/44974304
|
condefects-python_data_1921
|
n,a,b,c,d = map(int, input().split())
print("No" if abs(b - c) > 1 or (b == c == 0 and (a != 0 and b != 0)) else "Yes")
n,a,b,c,d = map(int, input().split())
print("No" if abs(b - c) > 1 or (b == c == 0 and (a != 0 and d != 0)) else "Yes")
|
ConDefects/ConDefects/Code/arc157_a/Python/42091625
|
condefects-python_data_1922
|
N, A, B, C, D = map(int, input().split())
if abs(B - C) > 1:
print("No")
exit()
elif B == C:
if B == 0:
if A > 0 and D == 0:
if N == A + 1:
print("Yes")
else:
print("No")
elif A == 0 and D > 0:
if N == D + 1:
print("Yes")
else:
print("No")
elif A == 0 and D == 0:
if N == 0:
print("Yes")
else:
print("No")
else:
print("No")
else:
if B * 2 + 1 + A + D == N:
print("Yes")
else:
print("No")
else:
if max(B, C) * 2 + A + D == N:
print("Yes")
else:
print("No")
N, A, B, C, D = map(int, input().split())
if abs(B - C) > 1:
print("No")
exit()
elif B == C:
if B == 0:
if A > 0 and D == 0:
if N == A + 1:
print("Yes")
else:
print("No")
elif A == 0 and D > 0:
if N == D + 1:
print("Yes")
else:
print("No")
elif A == 0 and D == 0:
if N <= 1:
print("Yes")
else:
print("No")
else:
print("No")
else:
if B * 2 + 1 + A + D == N:
print("Yes")
else:
print("No")
else:
if max(B, C) * 2 + A + D == N:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/arc157_a/Python/45521757
|
condefects-python_data_1923
|
import sys
readline = sys.stdin.readline
#n = int(readline())
#*a, = map(int,readline().split())
# b = [list(map(int,readline().split())) for _ in range()]
n,a,b,c,d = map(int,readline().split())
def check(a,b,c,d):
#XY
if b-c==1: return 1
#YY,XX
if b == c:
if b==0:
if a==0 or d==0: return 1
else:
return 1
print("Yes" if check(a,b,c,d) else "No")
import sys
readline = sys.stdin.readline
#n = int(readline())
#*a, = map(int,readline().split())
# b = [list(map(int,readline().split())) for _ in range()]
n,a,b,c,d = map(int,readline().split())
def check(a,b,c,d):
#XY
if abs(b-c)==1: return 1
#YY,XX
if b == c:
if b==0:
if a==0 or d==0: return 1
else:
return 1
print("Yes" if check(a,b,c,d) else "No")
|
ConDefects/ConDefects/Code/arc157_a/Python/42827862
|
condefects-python_data_1924
|
from collections import defaultdict
class UnionFind():
#「uf = UnionFind(頂点の数)」で初期化
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x): #uf.find(x)
#要素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): #uf.union(x, y)
#要素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): #uf.size(x)
#要素xが属するグループのサイズ(要素数)を返す
return -self.parents[self.find(x)]
def same(self, x, y): #uf.same(x,y)
#要素x,yが同じグループに属するかどうかを返す
return self.find(x) == self.find(y)
def members(self, x): #uf.members(x)
#要素xが属するグループに属する要素をリストで返す
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self): #uf.roots()
#根となっている要素すべてをリストで返す
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self): #uf.group_count()
#グループの数を返す
return len(self.roots())
def all_group_members(self): #uf.all_group_members()
#{ルート要素 : [そのグループに含まれる要素のリスト], ...}のdefaultdictを返す
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 si(): return input()
#---1つの文字列の受け取り
def ii(): return int(input())
#---1つの整数の受け取り
def mii(): return map(int, input().split())
#---スペースで区切られた複数の整数の受け取り
def miin(n): return map(lambda x: int(x)+n, input().split())
#---スペースで区切られた複数の整数をそれぞれ+nして受け取り
def lmii(): return list(map(int, input().split()))
#---スペースで区切られた複数の整数をリストで受け取り
def lmiin(n): list(map(lambda x: int(x)+n, input().split()))
#---スペースで区切られた複数の整数をそれぞれ+nしてリストで受け取り
def msi(): return map(str, input())
#---スペースなしの連続した文字列を1文字ずつ受け取り
def msis(): return map(str, input().split())
#---スペースで区切られた複数の文字列の受け取り
def lmsi(): return list(map(str, input()))
#---スペースなしの連続した文字列を1文字ずつリストで受け取り
def yn(): return print("Yes" if ok else "No")
#---変数"ok"がTrueなら「Yes」、Falseなら「No」を出力
import string
Upper = list(string.ascii_uppercase) #大文字アルファベットのリスト(["A", "B", "C", ....])
Lower = list(string.ascii_lowercase) #小文字アルファベットのリスト(["a", "b", "c", ....])
Numbers = list(string.digits) #1桁の数字のリスト(["0","1","2", ....])(各要素はstr)
#座標の移動 [0:4]で上下左右4方向、[0:8]で斜めを加えた8方向
dir_x = [0,1,0,-1,1,1,-1,-1]
dir_y = [1,0,-1,0,1,-1,-1,1]
def bin_place(n): #10進数nを2進数に直したときに1になる位のリスト
k = []
r = 60
while n > 2:
s = 2**r
if n >= s:
n -= s
k.append(r)
r -= 1
return k
def divisor(x): #整数nの約数をすべて入れたリスト
List_div = []
for i in range(1, int(x ** (1 / 2)) + 1):
if x % i == 0:
List_div.append(x // i)
List_div.append(i)
return sorted(set(List_div))
def digit(num): #整数nの桁数
digits = 1
while num >= 10:
num //= 10
digits += 1
return digits
def pow_x(x,n): #xの0乗～n乗までのリスト
List_pow = [1]
for _ in range(n):
List_pow.append(x * List_pow[-1])
return List_pow
#-------------------------------
#-------------------------------
n,a,b,c,d = mii()
if b == c == 0:
if a*d != 0:
print("Yes")
else:
print("No")
exit()
print("Yes" if abs(b-c) <= 1 else "No")
from collections import defaultdict
class UnionFind():
#「uf = UnionFind(頂点の数)」で初期化
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x): #uf.find(x)
#要素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): #uf.union(x, y)
#要素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): #uf.size(x)
#要素xが属するグループのサイズ(要素数)を返す
return -self.parents[self.find(x)]
def same(self, x, y): #uf.same(x,y)
#要素x,yが同じグループに属するかどうかを返す
return self.find(x) == self.find(y)
def members(self, x): #uf.members(x)
#要素xが属するグループに属する要素をリストで返す
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self): #uf.roots()
#根となっている要素すべてをリストで返す
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self): #uf.group_count()
#グループの数を返す
return len(self.roots())
def all_group_members(self): #uf.all_group_members()
#{ルート要素 : [そのグループに含まれる要素のリスト], ...}のdefaultdictを返す
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 si(): return input()
#---1つの文字列の受け取り
def ii(): return int(input())
#---1つの整数の受け取り
def mii(): return map(int, input().split())
#---スペースで区切られた複数の整数の受け取り
def miin(n): return map(lambda x: int(x)+n, input().split())
#---スペースで区切られた複数の整数をそれぞれ+nして受け取り
def lmii(): return list(map(int, input().split()))
#---スペースで区切られた複数の整数をリストで受け取り
def lmiin(n): list(map(lambda x: int(x)+n, input().split()))
#---スペースで区切られた複数の整数をそれぞれ+nしてリストで受け取り
def msi(): return map(str, input())
#---スペースなしの連続した文字列を1文字ずつ受け取り
def msis(): return map(str, input().split())
#---スペースで区切られた複数の文字列の受け取り
def lmsi(): return list(map(str, input()))
#---スペースなしの連続した文字列を1文字ずつリストで受け取り
def yn(): return print("Yes" if ok else "No")
#---変数"ok"がTrueなら「Yes」、Falseなら「No」を出力
import string
Upper = list(string.ascii_uppercase) #大文字アルファベットのリスト(["A", "B", "C", ....])
Lower = list(string.ascii_lowercase) #小文字アルファベットのリスト(["a", "b", "c", ....])
Numbers = list(string.digits) #1桁の数字のリスト(["0","1","2", ....])(各要素はstr)
#座標の移動 [0:4]で上下左右4方向、[0:8]で斜めを加えた8方向
dir_x = [0,1,0,-1,1,1,-1,-1]
dir_y = [1,0,-1,0,1,-1,-1,1]
def bin_place(n): #10進数nを2進数に直したときに1になる位のリスト
k = []
r = 60
while n > 2:
s = 2**r
if n >= s:
n -= s
k.append(r)
r -= 1
return k
def divisor(x): #整数nの約数をすべて入れたリスト
List_div = []
for i in range(1, int(x ** (1 / 2)) + 1):
if x % i == 0:
List_div.append(x // i)
List_div.append(i)
return sorted(set(List_div))
def digit(num): #整数nの桁数
digits = 1
while num >= 10:
num //= 10
digits += 1
return digits
def pow_x(x,n): #xの0乗～n乗までのリスト
List_pow = [1]
for _ in range(n):
List_pow.append(x * List_pow[-1])
return List_pow
#-------------------------------
#-------------------------------
n,a,b,c,d = mii()
if b == c == 0:
if a*d == 0:
print("Yes")
else:
print("No")
exit()
print("Yes" if abs(b-c) <= 1 else "No")
|
ConDefects/ConDefects/Code/arc157_a/Python/43019650
|
condefects-python_data_1925
|
'''
・XX, XY, YX, YYは必ず 重なる
①XY, YXについて 数の差が2以上になると実現不可能
XY1 YX2 = YXYX に、もうひとつ「YX」をつけようとすると
・後ろにつけようとする YXYXYX → XYが発生
・前につけようとする YXYXYX → XYが発生
②XX, YYどちらもあって、YX, XYどちらもないは実現不可能
・XXYY → XYが発生
・YYXX → YXが発生
'''
n, xx, xy, yx, yy = map(int, input().split())
flg = 1
if abs(xy - yx) >= 2:
flg = 0
if xx > 0 and xx > 0 and yx == 0 and xy == 0:
flg = 0
print('Yes' if flg else 'No')
'''
・XX, XY, YX, YYは必ず 重なる
①XY, YXについて 数の差が2以上になると実現不可能
XY1 YX2 = YXYX に、もうひとつ「YX」をつけようとすると
・後ろにつけようとする YXYXYX → XYが発生
・前につけようとする YXYXYX → XYが発生
②XX, YYどちらもあって、YX, XYどちらもないは実現不可能
・XXYY → XYが発生
・YYXX → YXが発生
'''
n, xx, xy, yx, yy = map(int, input().split())
flg = 1
if abs(xy - yx) >= 2:
flg = 0
if xx > 0 and yy > 0 and yx == 0 and xy == 0:
flg = 0
print('Yes' if flg else 'No')
|
ConDefects/ConDefects/Code/arc157_a/Python/43792391
|
condefects-python_data_1926
|
N, A, B, C, D = map(int, input().split())
# XX, XYは(start)X, XX, YXの後にのみ続く
# YX, YYは(start)Y, XY, YYの後にのみ続く
# A, Bの個数はA, Cの個数とほぼ同じ -> Bの個数はCの個数とほぼ同じ
# C, Dの個数はB, Dの個数とほぼ同じ -> Cの個数はBの個数とほぼ同じ
if abs(B-C) == 1:
print("Yes")
elif B==C and B!=0:
print("Yes")
elif A==0 or D==0: # B=C=0
print("Yes")
else:
print("No")
N, A, B, C, D = map(int, input().split())
# XX, XYは(start)X, XX, YXの後にのみ続く
# YX, YYは(start)Y, XY, YYの後にのみ続く
# A, Bの個数はA, Cの個数とほぼ同じ -> Bの個数はCの個数とほぼ同じ
# C, Dの個数はB, Dの個数とほぼ同じ -> Cの個数はBの個数とほぼ同じ
if abs(B-C) == 1:
print("Yes")
elif B==C and B!=0:
print("Yes")
elif B==C and (A==0 or D==0): # B=C=0
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/arc157_a/Python/43268490
|
condefects-python_data_1927
|
n,a,b,c,d=map(int,input().split())
if abs(b-c)<=1:
if b==c==0 and (a<n-1 or d<n-1):
print("No")
else:
print("Yes")
else:
print("No")
n,a,b,c,d=map(int,input().split())
if abs(b-c)<=1:
if b==c==0 and a<n-1 and d<n-1:
print("No")
else:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/arc157_a/Python/44812026
|
condefects-python_data_1928
|
N, A, B, C, D = map(int, input().split())
if abs(B - C) > 1:
print("No")
else:
print("Yes")
N, A, B, C, D = map(int, input().split())
if abs(B - C) > 1:
print("No")
elif B == 0 and C == 0 and A > 0 and D > 0:
print("No")
else:
print("Yes")
|
ConDefects/ConDefects/Code/arc157_a/Python/44691106
|
condefects-python_data_1929
|
import math
N,A,B,C,D=(int(x) for x in input().split())
n=math.floor(N/2)
if abs(B-C)<=1 and B<=n and C<=n and B+C>0:
print("Yes")
else:
print("No")
import math
N,A,B,C,D=(int(x) for x in input().split())
n=math.floor(N/2)
if (abs(B-C)<=1 and B<=n and C<=n and B+C!=0) or A==N-1 or D==N-1:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/arc157_a/Python/44416887
|
condefects-python_data_1930
|
n, a, b, c, d = map(int, input().split())
if abs(b-c) >= 2:
print("No")
elif b + c == 0 and a*b != 0:
print("No")
else:
print("Yes")
n, a, b, c, d = map(int, input().split())
if abs(b-c) >= 2:
print("No")
elif b + c == 0 and a*d != 0:
print("No")
else:
print("Yes")
|
ConDefects/ConDefects/Code/arc157_a/Python/42873423
|
condefects-python_data_1931
|
from collections import deque
import sys
import math
import heapq
import random
import itertools
from functools import cmp_to_key
from fractions import Fraction
def gs():
return sys.stdin.readline().split()[0]
def gd():
return float(sys.stdin.readline())
def gi():
return int(sys.stdin.readline())
def gia():
return list(map(int,sys.stdin.readline().split()))
def gsa():
return sys.stdin.readline().split()
def readGraph(N,M, idx=0, hasDirect=False, hasCost=False):
G=[]
if(hasCost):
G=Graph(N)
else:
for i in range(N):
G.append([])
for i in range(M):
E=gia()
if(not hasCost):
u=E[0]-(1-idx)
v=E[1]-(1-idx)
G[u].append(v)
if(not hasDirect):
G[v].append(u)
else:
u=E[0]-(1-idx)
v=E[1]-(1-idx)
c=E[2]
G.addEdge(u,v,c)
if(not hasDirect):
G.addEdge(v,u,c)
return G
def ceil_pow2(n):
x=0
while((1<<x)<n):
x+=1
return x
def uclid(m, n):
if(n==0):
return m
else:
return uclid(n, m%n)
#拡張ユークリッドの互除法
def invGcd(a, b):
a%=b
if a==0: return b,0
s, t=b, a
m0, m1=0,1
while(t):
u=s//t
s-=t*u
m0-=m1*u
s,t=t,s
m0,m1=m1,m0
if m0<0: m0+=b//s
return s,m0
# 逆元を求める。存在しないときは-1を返す
def invMod(x, m):
z=invGcd(x,m)
if(z[0]!=1):return -1
return z[1]
#約数取得
def yakusu(n):
l=[]
for i in range(1, n+1):
if(i*i>n):
break;
if(n%i==0):
l.append(i)
if(n/i!=i):
l.append(n//i)
return l
def insuB(n):
l=[]
i=2
while(i*i<=n):
if(n%i==0):
l.append(i)
n=n//i
else:
i+=1
if(n!=1):
l.append(n)
return l
def insuBm(n):
m=dict()
for i in range(2, n):
if(i*i>n):break
while(n%i==0):
if(not(i in m)):
m[i]=1
else:
m[i]+=1
n=n//i
if(n!=1):
if(not(n in m)):
m[n]=1
else:
m[n]+=1
return m
KAIJO_DP=[0]*4000000
def kaijo(n, mod):
if(n<=1):
return 1
if(KAIJO_DP[n]!=0):
return KAIJO_DP[n]
ans=n*kaijo(n-1, mod)
ans%=mod
KAIJO_DP[n]=ans
return ans
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
def beforeCmb(num,mod):
for i in range( 2, num + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
def isP(n):
if(n==1):
return False
for i in range(2, math.floor(math.sqrt(n))+1):
if(n%i==0):
return False
return True
def nextCombination(sub):
x=sub & (-sub)
y=sub+x
return (((sub & ~y) // x) >> 1) | y
class FenwickTree:
def __init__(self, n):
self.N = n
self.data = [0] * n
def add(self, p, x):
if(p<0 or p >= self.N):
return None
p+=1
while(p<=self.N):
self.data[p-1]+=x
p+=p&-p;
def get(self, l, r):
if(l<0 or l>r or r>self.N):
return -(1<<64)
return self._innerSum(r) - self._innerSum(l)
def _innerSum(self, r):
s=0
while(r>0):
s+=self.data[r-1]
r-=r&-r
return s
class FenwickTreeImos:
def __init__(self, n):
self.fw = FenwickTree(n+1)
def add(self, s, t, x):
self.fw.add(s, x)
self.fw.add(t, -x)
def get(self, i):
return self[i]
def __getitem__(self, key):
return self.fw.get(0, key+1)
class Edge:
def __init__(self, f, t, c):
self._from=f
self._to=t
self._cost=c
def getStart(self):
return self._from
def getEnd(self):
return self._to
def getDistance(self):
return self._cost
def setDistance(self, c):
self._cost =c
class Graph:
def __init__(self, n):
self.gla=[]
self.prev=[-1]*n
for i in range(n):
self.gla.append([])
def addEdge(self, u, v, l):
e=Edge(u, v, l)
self.gla[u].append(e)
def removeEdge(self, u, v):
l=self.gla[u]
for edge in l:
if(edge.getStart() == u and edge.getEnd()==v):
l.remove(edge)
def changeLength(self, u, v, d):
l=self.gla[u]
for edge in l:
if(edge.getStart() == u and edge.getEnd()==v):
edge.setDistance(d)
break
def getVertexNum(self):
return len(self.gla)
def getEdgeLength(self, u, v):
l=self.gla[u]
for edge in l:
if(edge.getStart() == u and edge.getEnd()==v):
return edge.getDistance()
return 1<<64
def dijkstra(self, start):
d=[1<<64] * self.getVertexNum()
d[start]=0
q=[]
heapq.heappush(q, (0, start))
self.prev[start]=-1
while(len(q)!=0):
p=heapq.heappop(q)
if(p[0]>d[p[1]]):
continue
el=self.gla[p[1]]
for edge in el:
to=edge.getEnd()
fr=edge.getStart()
cost=edge.getDistance()
if(d[to]>d[fr]+cost):
d[to]=d[fr]+cost
self.prev[to]=fr
heapq.heappush(q, (d[to], to))
return d
def getPath(self, v):
path=[]
while(v!=-1):
path.append(v)
v=self.prev[v]
path.reverse()
return path
class SegTree:
def __init__(self, v, op, e):
self.n=len(v)
self.log=ceil_pow2(self.n)
self.size=1<<self.log
self.op=op
self.e=e
self.d=[e]*(2*self.size)
for i in range(self.n):
self.d[self.size+i]=v[i]
for i in range(self.size-1, 0, -1):
self._update(i)
def setVal(self, p, x):
p+=self.size
self.d[p]=x
for i in range(1, self.log+1):
self._update(p>>i)
def getVal(self, p):
return self.d[p+self.size]
def prod(self, l, r):
sml=self.e
smr=self.e
l+=self.size
r+=self.size
while(l<r):
if(l&1 != 0):
sml=self.op(sml, self.d[l])
l+=1
if(r&1 != 0):
r-=1
smr=self.op(self.d[r], smr)
l>>=1
r>>=1
return self.op(sml,smr)
def allProd(self):
return self.d[1]
def maxRight(self, l, f):
if(l==self.n):return self.n
l+=self.size
sm=self.e
while True:
while(l%2==0):
l>>=1
if(not f(self.op(sm,self.d[l]))):
while(l<self.size):
l=2*l
if(f(self.op(sm, self.d[l]))):
sm=self.op(sm, self.d[l])
l+=1
return l-self.size
sm=self.op(sm, self.d[l])
l+=1
if((l & -l) == l):break
return self.n
def minLeft(self, r, f):
if(r==0):return 0
r+=self.size
sm=self.e
while(True):
r-=1
while(r>1 and r%2==1):
r>>=1
if(not f(self.op(self.d[r], sm))):
while(r<self.size):
r=2*r+1
if(f(self.op(self.d[r],sm))):
sm=self.op(self.d[r],sm)
r-=1
return r+1-self.size
sm=self.op(self.d[r], sm)
if((r&-r)==r):break
return 0
def _update(self, k):
self.d[k]=self.op(self.d[2*k], self.d[2*k+1])
def main_():
N,A,B,C,D=gia()
sa=abs(B-C)
ans="Yes"
if(sa>=2):
ans="No"
if(B==0 and C==0 and A>0 and B>0):
ans="No"
print(ans)
main_()
from collections import deque
import sys
import math
import heapq
import random
import itertools
from functools import cmp_to_key
from fractions import Fraction
def gs():
return sys.stdin.readline().split()[0]
def gd():
return float(sys.stdin.readline())
def gi():
return int(sys.stdin.readline())
def gia():
return list(map(int,sys.stdin.readline().split()))
def gsa():
return sys.stdin.readline().split()
def readGraph(N,M, idx=0, hasDirect=False, hasCost=False):
G=[]
if(hasCost):
G=Graph(N)
else:
for i in range(N):
G.append([])
for i in range(M):
E=gia()
if(not hasCost):
u=E[0]-(1-idx)
v=E[1]-(1-idx)
G[u].append(v)
if(not hasDirect):
G[v].append(u)
else:
u=E[0]-(1-idx)
v=E[1]-(1-idx)
c=E[2]
G.addEdge(u,v,c)
if(not hasDirect):
G.addEdge(v,u,c)
return G
def ceil_pow2(n):
x=0
while((1<<x)<n):
x+=1
return x
def uclid(m, n):
if(n==0):
return m
else:
return uclid(n, m%n)
#拡張ユークリッドの互除法
def invGcd(a, b):
a%=b
if a==0: return b,0
s, t=b, a
m0, m1=0,1
while(t):
u=s//t
s-=t*u
m0-=m1*u
s,t=t,s
m0,m1=m1,m0
if m0<0: m0+=b//s
return s,m0
# 逆元を求める。存在しないときは-1を返す
def invMod(x, m):
z=invGcd(x,m)
if(z[0]!=1):return -1
return z[1]
#約数取得
def yakusu(n):
l=[]
for i in range(1, n+1):
if(i*i>n):
break;
if(n%i==0):
l.append(i)
if(n/i!=i):
l.append(n//i)
return l
def insuB(n):
l=[]
i=2
while(i*i<=n):
if(n%i==0):
l.append(i)
n=n//i
else:
i+=1
if(n!=1):
l.append(n)
return l
def insuBm(n):
m=dict()
for i in range(2, n):
if(i*i>n):break
while(n%i==0):
if(not(i in m)):
m[i]=1
else:
m[i]+=1
n=n//i
if(n!=1):
if(not(n in m)):
m[n]=1
else:
m[n]+=1
return m
KAIJO_DP=[0]*4000000
def kaijo(n, mod):
if(n<=1):
return 1
if(KAIJO_DP[n]!=0):
return KAIJO_DP[n]
ans=n*kaijo(n-1, mod)
ans%=mod
KAIJO_DP[n]=ans
return ans
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
def beforeCmb(num,mod):
for i in range( 2, num + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
def isP(n):
if(n==1):
return False
for i in range(2, math.floor(math.sqrt(n))+1):
if(n%i==0):
return False
return True
def nextCombination(sub):
x=sub & (-sub)
y=sub+x
return (((sub & ~y) // x) >> 1) | y
class FenwickTree:
def __init__(self, n):
self.N = n
self.data = [0] * n
def add(self, p, x):
if(p<0 or p >= self.N):
return None
p+=1
while(p<=self.N):
self.data[p-1]+=x
p+=p&-p;
def get(self, l, r):
if(l<0 or l>r or r>self.N):
return -(1<<64)
return self._innerSum(r) - self._innerSum(l)
def _innerSum(self, r):
s=0
while(r>0):
s+=self.data[r-1]
r-=r&-r
return s
class FenwickTreeImos:
def __init__(self, n):
self.fw = FenwickTree(n+1)
def add(self, s, t, x):
self.fw.add(s, x)
self.fw.add(t, -x)
def get(self, i):
return self[i]
def __getitem__(self, key):
return self.fw.get(0, key+1)
class Edge:
def __init__(self, f, t, c):
self._from=f
self._to=t
self._cost=c
def getStart(self):
return self._from
def getEnd(self):
return self._to
def getDistance(self):
return self._cost
def setDistance(self, c):
self._cost =c
class Graph:
def __init__(self, n):
self.gla=[]
self.prev=[-1]*n
for i in range(n):
self.gla.append([])
def addEdge(self, u, v, l):
e=Edge(u, v, l)
self.gla[u].append(e)
def removeEdge(self, u, v):
l=self.gla[u]
for edge in l:
if(edge.getStart() == u and edge.getEnd()==v):
l.remove(edge)
def changeLength(self, u, v, d):
l=self.gla[u]
for edge in l:
if(edge.getStart() == u and edge.getEnd()==v):
edge.setDistance(d)
break
def getVertexNum(self):
return len(self.gla)
def getEdgeLength(self, u, v):
l=self.gla[u]
for edge in l:
if(edge.getStart() == u and edge.getEnd()==v):
return edge.getDistance()
return 1<<64
def dijkstra(self, start):
d=[1<<64] * self.getVertexNum()
d[start]=0
q=[]
heapq.heappush(q, (0, start))
self.prev[start]=-1
while(len(q)!=0):
p=heapq.heappop(q)
if(p[0]>d[p[1]]):
continue
el=self.gla[p[1]]
for edge in el:
to=edge.getEnd()
fr=edge.getStart()
cost=edge.getDistance()
if(d[to]>d[fr]+cost):
d[to]=d[fr]+cost
self.prev[to]=fr
heapq.heappush(q, (d[to], to))
return d
def getPath(self, v):
path=[]
while(v!=-1):
path.append(v)
v=self.prev[v]
path.reverse()
return path
class SegTree:
def __init__(self, v, op, e):
self.n=len(v)
self.log=ceil_pow2(self.n)
self.size=1<<self.log
self.op=op
self.e=e
self.d=[e]*(2*self.size)
for i in range(self.n):
self.d[self.size+i]=v[i]
for i in range(self.size-1, 0, -1):
self._update(i)
def setVal(self, p, x):
p+=self.size
self.d[p]=x
for i in range(1, self.log+1):
self._update(p>>i)
def getVal(self, p):
return self.d[p+self.size]
def prod(self, l, r):
sml=self.e
smr=self.e
l+=self.size
r+=self.size
while(l<r):
if(l&1 != 0):
sml=self.op(sml, self.d[l])
l+=1
if(r&1 != 0):
r-=1
smr=self.op(self.d[r], smr)
l>>=1
r>>=1
return self.op(sml,smr)
def allProd(self):
return self.d[1]
def maxRight(self, l, f):
if(l==self.n):return self.n
l+=self.size
sm=self.e
while True:
while(l%2==0):
l>>=1
if(not f(self.op(sm,self.d[l]))):
while(l<self.size):
l=2*l
if(f(self.op(sm, self.d[l]))):
sm=self.op(sm, self.d[l])
l+=1
return l-self.size
sm=self.op(sm, self.d[l])
l+=1
if((l & -l) == l):break
return self.n
def minLeft(self, r, f):
if(r==0):return 0
r+=self.size
sm=self.e
while(True):
r-=1
while(r>1 and r%2==1):
r>>=1
if(not f(self.op(self.d[r], sm))):
while(r<self.size):
r=2*r+1
if(f(self.op(self.d[r],sm))):
sm=self.op(self.d[r],sm)
r-=1
return r+1-self.size
sm=self.op(self.d[r], sm)
if((r&-r)==r):break
return 0
def _update(self, k):
self.d[k]=self.op(self.d[2*k], self.d[2*k+1])
def main_():
N,A,B,C,D=gia()
sa=abs(B-C)
ans="Yes"
if(sa>=2):
ans="No"
if(B==0 and C==0 and A>0 and D>0):
ans="No"
print(ans)
main_()
|
ConDefects/ConDefects/Code/arc157_a/Python/42886459
|
condefects-python_data_1932
|
INF = 1 << 64
mod = 10**9 + 7
dir = [(1, 0), (0, 1), (-1, 0), (0, -1)]
import sys
from collections import defaultdict, deque
#from functools import lru_cache
#@lru_cache
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
def ni(): return int(input())
def na(): return map(int, input().split())
def nl(): return list(map(int, input().split()))
def ns(): return input().strip()
def nsl(): return list(input().strip())
mod = 998244353
N, M = na()
for i in range(61):
if not M >> i:
bit = i
break
exit()
nums = [0] * bit
for i in range(1, bit+1):
if i != bit:
nums[i-1] = (1 << i) - (1 << (i-1))
else:
nums[i-1] = M - (1 << (i-1)) + 1
nums[i-1] %= mod
dp = [[0] * (bit+1) for _ in range(min(bit+1, N+1))]
dp[0][0] = 1
for i in range(1, min(bit+1, N+1)):
for j in range(bit+1):
for k in range(j):
dp[i][j] += dp[i-1][k] * nums[j-1]
dp[i][j] %= mod
if N > bit:
print(0)
else:
print(sum(dp[N])%mod)
INF = 1 << 64
mod = 10**9 + 7
dir = [(1, 0), (0, 1), (-1, 0), (0, -1)]
import sys
from collections import defaultdict, deque
#from functools import lru_cache
#@lru_cache
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
def ni(): return int(input())
def na(): return map(int, input().split())
def nl(): return list(map(int, input().split()))
def ns(): return input().strip()
def nsl(): return list(input().strip())
mod = 998244353
N, M = na()
for i in range(61):
if not M >> i:
bit = i
break
if bit == 0: exit()
nums = [0] * bit
for i in range(1, bit+1):
if i != bit:
nums[i-1] = (1 << i) - (1 << (i-1))
else:
nums[i-1] = M - (1 << (i-1)) + 1
nums[i-1] %= mod
dp = [[0] * (bit+1) for _ in range(min(bit+1, N+1))]
dp[0][0] = 1
for i in range(1, min(bit+1, N+1)):
for j in range(bit+1):
for k in range(j):
dp[i][j] += dp[i-1][k] * nums[j-1]
dp[i][j] %= mod
if N > bit:
print(0)
else:
print(sum(dp[N])%mod)
|
ConDefects/ConDefects/Code/arc141_b/Python/36162097
|
condefects-python_data_1933
|
n,m=map(int,input().split())
binm=bin(m)[2:]
if n>len(binm):
print(0)
exit()
num=[0]*len(binm)
num[-1]=m-(1<<(len(binm)-1))+1
for i in range(len(binm)-1):
num[i]=1<<i
dp=[[0]*len(binm) for i in range(n)]
dp[0]=num
for i in range(n-1):
for j in range(len(binm)):
for k in range(j+1,len(binm)):
dp[i+1][k]+=dp[i][j]*num[k]
dp[i+1][k]%=998244353
print(sum(dp[-1])%988244353)
n,m=map(int,input().split())
binm=bin(m)[2:]
if n>len(binm):
print(0)
exit()
num=[0]*len(binm)
num[-1]=m-(1<<(len(binm)-1))+1
for i in range(len(binm)-1):
num[i]=1<<i
dp=[[0]*len(binm) for i in range(n)]
dp[0]=num
for i in range(n-1):
for j in range(len(binm)):
for k in range(j+1,len(binm)):
dp[i+1][k]+=dp[i][j]*num[k]
dp[i+1][k]%=998244353
print(sum(dp[-1])%998244353)
|
ConDefects/ConDefects/Code/arc141_b/Python/40574832
|
condefects-python_data_1934
|
import math
N,M=map(int,input().split())
mod=998244353
l=(int(math.log2(M))+1)
if N<l or N==1:
dp=[[0]*l for _ in range(N)]
X=[]
for i in range(l):
if 2**(i+1)-1<M:
X.append((2**i)%mod)
dp[0][i]=X[-1]
else:
X.append((M-2**i+1)%mod)
dp[0][i]=X[-1]
if i>0:
dp[0][i]+=dp[0][i-1]
dp[0][i]%=mod
for i in range(1,N):
for j in range(i,l):
dp[i][j]=(dp[i][j-1]+dp[i-1][j-1]*X[j])%mod
print(dp[-1][-1])
else:
print(0)
import math
N,M=map(int,input().split())
mod=998244353
l=(int(math.log2(M))+1)
if N<=l:
dp=[[0]*l for _ in range(N)]
X=[]
for i in range(l):
if 2**(i+1)-1<M:
X.append((2**i)%mod)
dp[0][i]=X[-1]
else:
X.append((M-2**i+1)%mod)
dp[0][i]=X[-1]
if i>0:
dp[0][i]+=dp[0][i-1]
dp[0][i]%=mod
for i in range(1,N):
for j in range(i,l):
dp[i][j]=(dp[i][j-1]+dp[i-1][j-1]*X[j])%mod
print(dp[-1][-1])
else:
print(0)
|
ConDefects/ConDefects/Code/arc141_b/Python/39358112
|
condefects-python_data_1935
|
import math
N, M = map(int, input().split())
Mod = 998244353
if math.floor(math.log2(M)) < N:
print(0)
exit()
#dp[i] = 最上位ビットがiになる場合の数
a = [0] * 70
for i in range(70):
if 2 * 2 ** i <= M:
a[i] = 2 ** i
else:
a[i] = max(0, M - 2 ** i + 1)
a = [0] + a
dp = a[:]
for i in range(N - 1):
_dp = [0] * 70
sumdp = [0] * 70
for j in range(70):
sumdp[j] = sumdp[j - 1] + dp[j]
for k in range(i, 70):
_dp[k] = (sumdp[k - 1] * a[k]) % Mod
dp = _dp
print(sum(dp) % Mod)
import math
N, M = map(int, input().split())
Mod = 998244353
if math.floor(math.log2(M)) + 1 < N:
print(0)
exit()
#dp[i] = 最上位ビットがiになる場合の数
a = [0] * 70
for i in range(70):
if 2 * 2 ** i <= M:
a[i] = 2 ** i
else:
a[i] = max(0, M - 2 ** i + 1)
a = [0] + a
dp = a[:]
for i in range(N - 1):
_dp = [0] * 70
sumdp = [0] * 70
for j in range(70):
sumdp[j] = sumdp[j - 1] + dp[j]
for k in range(i, 70):
_dp[k] = (sumdp[k - 1] * a[k]) % Mod
dp = _dp
print(sum(dp) % Mod)
|
ConDefects/ConDefects/Code/arc141_b/Python/38039113
|
condefects-python_data_1936
|
p = 998244353
N, M = map(int, input().split())
K = 60
if N > 60:
print(0)
exit()
dp = [[0] * (K + 1) for _ in range(N + 1)]
dp[0][0] = 1
for i in range(N):
for j in range(K + 1):
for jj in range(1, K + 1):
jn = j + jj
if jn > K:
continue
"jn桁となるのは 1 << (jn - 1) <= x < 1 << jn"
if 1 << (jn - 1) <= M < 1 << jn:
dp[i + 1][jn] += dp[i][j] * (M - (1 << (jn - 1)) + 1)
dp[i + 1][jn] %= p
elif M > 1 << jn:
dp[i + 1][jn] += dp[i][j] * pow(2, jn - 1, p)
dp[i + 1][jn] %= p
ans = 0
for j in range(K + 1):
ans += dp[N][j]
ans %= p
print(ans)
# for i in range(N + 1):
# print(dp[i])
p = 998244353
N, M = map(int, input().split())
K = 60
if N > 60:
print(0)
exit()
dp = [[0] * (K + 1) for _ in range(N + 1)]
dp[0][0] = 1
for i in range(N):
for j in range(K + 1):
for jj in range(1, K + 1):
jn = j + jj
if jn > K:
continue
"jn桁となるのは 1 << (jn - 1) <= x < 1 << jn"
if 1 << (jn - 1) <= M < 1 << jn:
dp[i + 1][jn] += dp[i][j] * (M - (1 << (jn - 1)) + 1)
dp[i + 1][jn] %= p
elif M >= 1 << jn:
dp[i + 1][jn] += dp[i][j] * pow(2, jn - 1, p)
dp[i + 1][jn] %= p
ans = 0
for j in range(K + 1):
ans += dp[N][j]
ans %= p
print(ans)
# for i in range(N + 1):
# print(dp[i])
|
ConDefects/ConDefects/Code/arc141_b/Python/44178563
|
condefects-python_data_1937
|
N, A, B = map(int, input().split())
S = list(input())
ans = 0
sa = [0 for _ in range(2 * N)]
wa = [0 for _ in range(2 * N + 1)]
for s in range(2 * N):
if S[s] == ")":
sa[s] = -1
else:
sa[s] = 1
W = sum(sa)
if W != 0:
i = 0
while W != 0:
if W < 0:
if S[i] == ")":
S[i] = "("
sa[i] = 1
W += 2
ans += B
else:
if S[2 * N - i - 1] == "(":
S[2 * N - i - 1] = ")"
sa[i] = -1
W -= 2
ans += B
i += 1
for i in range(2 * N):
wa[i + 1] = wa[i] + sa[i]
m = 999999999
mnum = 0
for w in wa:
if m > w:
m = w
if m < 0:
if A > 2 * B:
ans += (abs(m) + 1) // 2 * 2 * B
else:
ans += (abs(m) + 1) // 2 * A
print(ans)
N, A, B = map(int, input().split())
S = list(input())
ans = 0
sa = [0 for _ in range(2 * N)]
wa = [0 for _ in range(2 * N + 1)]
for s in range(2 * N):
if S[s] == ")":
sa[s] = -1
else:
sa[s] = 1
W = sum(sa)
if W != 0:
i = 0
while W != 0:
if W < 0:
if S[i] == ")":
S[i] = "("
sa[i] = 1
W += 2
ans += B
else:
if S[2 * N - i - 1] == "(":
S[2 * N - i - 1] = ")"
sa[2 * N - i - 1] = -1
W -= 2
ans += B
i += 1
for i in range(2 * N):
wa[i + 1] = wa[i] + sa[i]
m = 999999999
mnum = 0
for w in wa:
if m > w:
m = w
if m < 0:
if A > 2 * B:
ans += (abs(m) + 1) // 2 * 2 * B
else:
ans += (abs(m) + 1) // 2 * A
print(ans)
|
ConDefects/ConDefects/Code/arc175_b/Python/52710253
|
condefects-python_data_1938
|
DEBUG = False
testcase = r"""
1
2 3
test
"""[1:]
from typing import *
from collections import Counter, deque, defaultdict
import bisect
import heapq
import copy
import itertools
from pprint import pprint
import math
import sys
_input = input
input = lambda: sys.stdin.readline().rstrip()
mi = lambda: map(int, input().split())
li = lambda: list(mi())
dbp = lambda *args, **kwargs: print("[dbp]", *args, **kwargs)
dbp = lambda *args, **kwargs: None
def asf(): assert False
def main() -> None:
N, A, B = mi()
S = list(input())
# imosで足りてるかを把握する
# 最終的な値が正: (がおおい
# 負: )が多い
# 0: ちょうど
# 途中の値が0以上: 問題なし
# : 問題あり．)が多い
imos = [1 if c == '(' else -1 for c in S]
for i in range(1, 2*N): imos[i] += imos[i-1]
dbp(imos)
A_cost = min(A, 2*B) # B二回やる方が安いならそうする
if imos[-1] < 0: # ')'が多すぎる場合
# 左から多すぎる')'を'('に変換する
assert imos[-1] % 2 == 0, "一回の操作で最終スコアを2動かすことができるはず．そのため，偶数でなければ0にならない"
shortage = -imos[-1] // 2 # 回数分. ) -> (の操作でスコアは2改善される
worst_point = -min(imos) - shortage # -worst_pointが，) -> ( をした後の一番悪い部分のスコア
ans = shortage * B
improve = (worst_point+1) // 2 # 一番悪い部分より左側の)をそれより右側の(で置き換えるといい
ans += improve * A_cost
print(ans)
else:
# 右から多すぎる'('を')'に変換する
assert imos[-1] % 2 == 0
shortage = imos[-1] // 2
worst_point = -min(imos)
ans = shortage * B
improve = (worst_point+1) // 2
ans += improve*A_cost
print(ans)
# infinity
INF = int(1e20)
# recursion setting
sys.setrecursionlimit(10**8)
T = TypeVar('T')
# rotate 2dim list
def rot_2dim_list(l: list[list[T]]) -> list[list[T]]:
return [list(e) for e in zip(*l)][::-1]
# find the minimum subgrid which includes all interests in the grid
# return the subgrid parameter [ymin, xmin, ymax, xmax] as half-open interval [ymin, ymax), [xmin, xmax)
def extract_roi(grid: list[list[T]], interests: set[str]) -> tuple[int, int, int, int]:
ymin = xmin = INF
ymax = xmax = -1
for i in range(len(grid)):
for j in range(len(grid[i])):
if grid[i][j] in interests:
ymin = min(ymin, i)
xmin = min(xmin, j)
ymax = max(ymax, i+1)
xmax = max(xmax, j+1)
return ymin, xmin, ymax, xmax
# enumerate all 26 alphabets
def get_all_alphabets(lower=False) -> list[str]:
offset = 32 if lower else 0
return [chr(ord("A")+i+offset) for i in range(26)]
# express fraction using modulo
def modulo_expr(numer: int, denom: int, mod=998244353) -> int:
"""returns (numer / denom) using modulo"""
modulo_inv = pow(denom, -1, mod)
return numer * modulo_inv % mod
# make primes
def make_primes(n: int) -> list[int]:
""" make primes lesser equal than n """
is_prime = [True] * (n + 1)
is_prime[0], is_prime[1] = False, False
for i in range(2, int(math.sqrt(n)) + 1):
if is_prime[i]:
for j in range(2 * i, n + 1, i):
is_prime[j] = False
prime_list = [i for i in range(n + 1) if is_prime[i]]
return prime_list
# calc number of digits for given integer
def get_digit(n: int) -> int:
assert n >= 1, "n must be greater than or equal to 1"
return int(math.log10(n)) + 1
# binary search
# This is Memorandum-like function. So it supports ascending order only. Write by yourself.
def ref_binary_search(ok: int, ng: int, is_ok: Callable) -> int:
while ok + 1 != ng:
mid = (ok + ng) // 2
if is_ok(mid):
ok = mid
else:
ng = mid
return mid
# convert given number into list of bits
# when num_bit is 3, number: 1 -> [0, 0, 1], number: 2 -> [0, 1, 0], number: 3 -> [0, 1, 1]
def num_to_bits(number: int, num_bit: int) -> list[int]:
return list(map(int, format(number, f"0{num_bit}b"))) # num_bit is shortest length of bits. the length of bits may be longer than num_bit.
# convert given bits to number
# [0, 1] -> 1, [1, 0, 1] -> 5, [1, 0, 1, 0] -> 6
def bits_to_num(bits: list[int]) -> int:
num = bits[0]
for i in range(1, len(bits)):
num *= 2
num += bits[i]
return num
# for bit exhaustive search
# if "num_bit" == 2, returns [[0, 0], [0, 1], [1, 0], [1, 1]]
def bit_exhaustive_enumerate(num_bit: int) -> Iterable[list[int]]:
for i in range(2 ** num_bit):
yield list(map(int, format(i, f"0{num_bit}b")))
# for exhaustive permutation
# if "num_elem" == 3, returns [(0, 1, 2), (0, 2, 1), (1, 0, 2), (1, 2, 0), (2, 0, 1), (2, 1, 0)]
def exhaustive_permutation(num_elem: int) -> Iterable[tuple[int, ...]]:
numbers = list(range(num_elem))
for p in itertools.permutations(numbers):
yield p
#######################################################
# debug configuration
#######################################################
def debug_warn():
if DEBUG:
print("DEBUGGING!!! Please rewite variable DEBUG before submission!!!")
# by this operation, input() returns testcase
if DEBUG:
import sys, io
sys.stdin = io.StringIO(testcase)
debug_warn()
#######################################################
if __name__ == "__main__":
main()
debug_warn()
DEBUG = False
testcase = r"""
1
2 3
test
"""[1:]
from typing import *
from collections import Counter, deque, defaultdict
import bisect
import heapq
import copy
import itertools
from pprint import pprint
import math
import sys
_input = input
input = lambda: sys.stdin.readline().rstrip()
mi = lambda: map(int, input().split())
li = lambda: list(mi())
dbp = lambda *args, **kwargs: print("[dbp]", *args, **kwargs)
dbp = lambda *args, **kwargs: None
def asf(): assert False
def main() -> None:
N, A, B = mi()
S = list(input())
# imosで足りてるかを把握する
# 最終的な値が正: (がおおい
# 負: )が多い
# 0: ちょうど
# 途中の値が0以上: 問題なし
# : 問題あり．)が多い
imos = [1 if c == '(' else -1 for c in S]
for i in range(1, 2*N): imos[i] += imos[i-1]
dbp(imos)
A_cost = min(A, 2*B) # B二回やる方が安いならそうする
if imos[-1] < 0: # ')'が多すぎる場合
# 左から多すぎる')'を'('に変換する
assert imos[-1] % 2 == 0, "一回の操作で最終スコアを2動かすことができるはず．そのため，偶数でなければ0にならない"
shortage = -imos[-1] // 2 # 回数分. ) -> (の操作でスコアは2改善される
worst_point = -min(imos) - shortage*2 # -worst_pointが，) -> ( をした後の一番悪い部分のスコア
ans = shortage * B
improve = (worst_point+1) // 2 # 一番悪い部分より左側の)をそれより右側の(で置き換えるといい
ans += improve * A_cost
print(ans)
else:
# 右から多すぎる'('を')'に変換する
assert imos[-1] % 2 == 0
shortage = imos[-1] // 2
worst_point = -min(imos)
ans = shortage * B
improve = (worst_point+1) // 2
ans += improve*A_cost
print(ans)
# infinity
INF = int(1e20)
# recursion setting
sys.setrecursionlimit(10**8)
T = TypeVar('T')
# rotate 2dim list
def rot_2dim_list(l: list[list[T]]) -> list[list[T]]:
return [list(e) for e in zip(*l)][::-1]
# find the minimum subgrid which includes all interests in the grid
# return the subgrid parameter [ymin, xmin, ymax, xmax] as half-open interval [ymin, ymax), [xmin, xmax)
def extract_roi(grid: list[list[T]], interests: set[str]) -> tuple[int, int, int, int]:
ymin = xmin = INF
ymax = xmax = -1
for i in range(len(grid)):
for j in range(len(grid[i])):
if grid[i][j] in interests:
ymin = min(ymin, i)
xmin = min(xmin, j)
ymax = max(ymax, i+1)
xmax = max(xmax, j+1)
return ymin, xmin, ymax, xmax
# enumerate all 26 alphabets
def get_all_alphabets(lower=False) -> list[str]:
offset = 32 if lower else 0
return [chr(ord("A")+i+offset) for i in range(26)]
# express fraction using modulo
def modulo_expr(numer: int, denom: int, mod=998244353) -> int:
"""returns (numer / denom) using modulo"""
modulo_inv = pow(denom, -1, mod)
return numer * modulo_inv % mod
# make primes
def make_primes(n: int) -> list[int]:
""" make primes lesser equal than n """
is_prime = [True] * (n + 1)
is_prime[0], is_prime[1] = False, False
for i in range(2, int(math.sqrt(n)) + 1):
if is_prime[i]:
for j in range(2 * i, n + 1, i):
is_prime[j] = False
prime_list = [i for i in range(n + 1) if is_prime[i]]
return prime_list
# calc number of digits for given integer
def get_digit(n: int) -> int:
assert n >= 1, "n must be greater than or equal to 1"
return int(math.log10(n)) + 1
# binary search
# This is Memorandum-like function. So it supports ascending order only. Write by yourself.
def ref_binary_search(ok: int, ng: int, is_ok: Callable) -> int:
while ok + 1 != ng:
mid = (ok + ng) // 2
if is_ok(mid):
ok = mid
else:
ng = mid
return mid
# convert given number into list of bits
# when num_bit is 3, number: 1 -> [0, 0, 1], number: 2 -> [0, 1, 0], number: 3 -> [0, 1, 1]
def num_to_bits(number: int, num_bit: int) -> list[int]:
return list(map(int, format(number, f"0{num_bit}b"))) # num_bit is shortest length of bits. the length of bits may be longer than num_bit.
# convert given bits to number
# [0, 1] -> 1, [1, 0, 1] -> 5, [1, 0, 1, 0] -> 6
def bits_to_num(bits: list[int]) -> int:
num = bits[0]
for i in range(1, len(bits)):
num *= 2
num += bits[i]
return num
# for bit exhaustive search
# if "num_bit" == 2, returns [[0, 0], [0, 1], [1, 0], [1, 1]]
def bit_exhaustive_enumerate(num_bit: int) -> Iterable[list[int]]:
for i in range(2 ** num_bit):
yield list(map(int, format(i, f"0{num_bit}b")))
# for exhaustive permutation
# if "num_elem" == 3, returns [(0, 1, 2), (0, 2, 1), (1, 0, 2), (1, 2, 0), (2, 0, 1), (2, 1, 0)]
def exhaustive_permutation(num_elem: int) -> Iterable[tuple[int, ...]]:
numbers = list(range(num_elem))
for p in itertools.permutations(numbers):
yield p
#######################################################
# debug configuration
#######################################################
def debug_warn():
if DEBUG:
print("DEBUGGING!!! Please rewite variable DEBUG before submission!!!")
# by this operation, input() returns testcase
if DEBUG:
import sys, io
sys.stdin = io.StringIO(testcase)
debug_warn()
#######################################################
if __name__ == "__main__":
main()
debug_warn()
|
ConDefects/ConDefects/Code/arc175_b/Python/51933297
|
condefects-python_data_1939
|
def job():
n, a, b = map(int, input().split())
s = input()
a_sum = 0
a_min = 0
a = min(a, 2 * b)
left = s.count(')')
right = s.count('(')
s = list(s)
ans = 0
diff = abs(right - left)
cnt = diff // 2
ans += b * cnt
tot = 0
if left > right:
for i in range(2 * n):
if tot == cnt:
break
c = s[i]
if c == ')':
s[i] = '('
tot += 1
else:
for i in reversed(range(2 * n)):
if tot == cnt:
break
c = s[i]
if c == '(':
s[i] = ')'
tot += 1
for c in s:
if c == '(':
a_sum += 1
else:
a_sum -= 1
a_min = min(a_sum, a_min)
swap_count = abs(a_min // 2)
if abs(a_min) % 2 == 1:
swap_count += 1
ans += a * swap_count
print(ans)
job()
def job():
n, a, b = map(int, input().split())
s = input()
a_sum = 0
a_min = 0
a = min(a, 2 * b)
left = s.count(')')
right = s.count('(')
s = list(s)
ans = 0
diff = abs(right - left)
cnt = diff // 2
ans += b * cnt
tot = 0
if left > right:
for i in range(2 * n):
if tot == cnt:
break
c = s[i]
if c == ')':
s[i] = '('
tot += 1
else:
for i in reversed(range(2 * n)):
if tot == cnt:
break
c = s[i]
if c == '(':
s[i] = ')'
tot += 1
for c in s:
if c == '(':
a_sum += 1
else:
a_sum -= 1
a_min = min(a_sum, a_min)
swap_count = abs(a_min) // 2
if abs(a_min) % 2 == 1:
swap_count += 1
ans += a * swap_count
print(ans)
job()
|
ConDefects/ConDefects/Code/arc175_b/Python/51749871
|
condefects-python_data_1940
|
N, A, B = map(int, input().split())
S = list(input())
res = 0
right = S.count('(') - S.count(')')
# print(right)
left = 0
for i in range(2*N):
# print(i, 'L', left)
if S[i] == '(':
if left + 1 > 2 * N - i - 1:
left -= 1
res += 1
else:
left += 1
else:
if left == 0:
left += 1
res += 1
else:
left -= 1
tmp = 0
if right > 0:
tmp += B * (right//2)
res -= right//2
if A < 2 * B:
print(A * (res//2) + B * (res % 2) + tmp)
else:
print(B*res + tmp)
N, A, B = map(int, input().split())
S = list(input())
res = 0
right = abs(S.count('(') - S.count(')'))
# print(right)
left = 0
for i in range(2*N):
# print(i, 'L', left)
if S[i] == '(':
if left + 1 > 2 * N - i - 1:
left -= 1
res += 1
else:
left += 1
else:
if left == 0:
left += 1
res += 1
else:
left -= 1
tmp = 0
if right > 0:
tmp += B * (right//2)
res -= right//2
if A < 2 * B:
print(A * (res//2) + B * (res % 2) + tmp)
else:
print(B*res + tmp)
|
ConDefects/ConDefects/Code/arc175_b/Python/52484583
|
condefects-python_data_1941
|
n, a, b = map(int, input().split())
s=list(input())
stnum=s.count("(")
ans=0
pos=0
while stnum < n:
while s[pos]=="(":
pos=pos+1
s[pos]="("
stnum+=1
ans+=b
pos=n*2-1
while stnum > n:
while s[pos]==")":
pos=pos-1
s[pos]=")"
stnum-=1
ans+=b
cnts=0
for i in range(2*n):
if s[i]=="(":
cnts+=1
elif s[i]==")" and cnts > 0:
cnts-=1
amari=0
if cnts%2==1:
amari=1
ans=ans+min(cnts*2*b,(cnts//2+amari)*a)
print(ans)
n, a, b = map(int, input().split())
s=list(input())
stnum=s.count("(")
ans=0
pos=0
while stnum < n:
while s[pos]=="(":
pos=pos+1
s[pos]="("
stnum+=1
ans+=b
pos=n*2-1
while stnum > n:
while s[pos]==")":
pos=pos-1
s[pos]=")"
stnum-=1
ans+=b
cnts=0
for i in range(2*n):
if s[i]=="(":
cnts+=1
elif s[i]==")" and cnts > 0:
cnts-=1
amari=0
if cnts%2==1:
amari=1
ans=ans+min((cnts//2+amari)*2*b,(cnts//2+amari)*a)
print(ans)
|
ConDefects/ConDefects/Code/arc175_b/Python/53758611
|
condefects-python_data_1942
|
def main():
N, A, B = map(int, input().split())
str = list(input())
open_cnt = str.count('(')
closed_cnt = str.count(')')
# Calculate lower bound of minimum cost
result = B * (abs(open_cnt - closed_cnt)) // 2
tmp = 0
if closed_cnt > open_cnt:
for i in range(len(str)):
if (str[i] == ')'):
tmp += 1
str[i] = '('
if tmp == (closed_cnt - open_cnt)//2:
break
elif open_cnt > closed_cnt:
for i in range(len(str) - 1, -1, -1):
if (str[i] == '('):
tmp += 1
str[i] = ')'
if tmp == (open_cnt - closed_cnt)//2:
break
cum_num = 0
min_operator = 0
for i in range(len(str)):
if str[i] == '(':
cum_num += 1
elif str[i] == ')':
cum_num -= 1
min_operator = min(min_operator, cum_num)
min_operator = min_operator * (-1)
if min_operator % 2 == 0:
tmp = min(B*(min_operator), A * (min_operator) // 2)
else:
tmp = min(B*(min_operator+2), A * ((min_operator) // 2 + 1))
print(result+tmp)
if __name__ == '__main__':
main()
def main():
N, A, B = map(int, input().split())
str = list(input())
open_cnt = str.count('(')
closed_cnt = str.count(')')
# Calculate lower bound of minimum cost
result = B * (abs(open_cnt - closed_cnt)) // 2
tmp = 0
if closed_cnt > open_cnt:
for i in range(len(str)):
if (str[i] == ')'):
tmp += 1
str[i] = '('
if tmp == (closed_cnt - open_cnt)//2:
break
elif open_cnt > closed_cnt:
for i in range(len(str) - 1, -1, -1):
if (str[i] == '('):
tmp += 1
str[i] = ')'
if tmp == (open_cnt - closed_cnt)//2:
break
cum_num = 0
min_operator = 0
for i in range(len(str)):
if str[i] == '(':
cum_num += 1
elif str[i] == ')':
cum_num -= 1
min_operator = min(min_operator, cum_num)
min_operator = min_operator * (-1)
if min_operator % 2 == 0:
tmp = min(B*(min_operator), A * (min_operator) // 2)
else:
tmp = min(B*(min_operator), A * (min_operator // 2)) + min(2*B, A)
print(result+tmp)
if __name__ == '__main__':
main()
|
ConDefects/ConDefects/Code/arc175_b/Python/51713549
|
condefects-python_data_1943
|
# -*- coding: utf-8 -*-
N,A,B=map(int,input().split())
S=input()
ans=0
X=[0]*(N*2+1)
for i in range(N*2):
if S[i]=="(":
X[i+1]=1
if S[i]==")":
X[i+1]=-1
K=sum(X)
#print(X)
#print(K)
ans+=B*abs(K)//2
if K>0:
for i in range(N*2):
if X[N*2-i]==1:
X[N*2-i]=-1
K-=2
if K==0: break
if K<0:
for i in range(N*2):
if X[i+1]==-1:
X[i+1]=1
K-=2
if K==0: break
#print(X)
for i in range(N*2):
X[i+1]+=X[i]
#print(X)
M=abs(min(X))
M+=M%2
#print(M)
ans+=min(A*M//2,2*B*M//2)
print(ans)
# -*- coding: utf-8 -*-
N,A,B=map(int,input().split())
S=input()
ans=0
X=[0]*(N*2+1)
for i in range(N*2):
if S[i]=="(":
X[i+1]=1
if S[i]==")":
X[i+1]=-1
K=sum(X)
#print(X)
#print(K)
ans+=B*abs(K)//2
if K>0:
for i in range(N*2):
if X[N*2-i]==1:
X[N*2-i]=-1
K-=2
if K==0: break
if K<0:
for i in range(N*2):
if X[i+1]==-1:
X[i+1]=1
K+=2
if K==0: break
#print(X)
for i in range(N*2):
X[i+1]+=X[i]
#print(X)
M=abs(min(X))
M+=M%2
#print(M)
ans+=min(A*M//2,2*B*M//2)
print(ans)
|
ConDefects/ConDefects/Code/arc175_b/Python/51792735
|
condefects-python_data_1944
|
import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
return (g1[n] * g2[r] % mod) * g2[n-r] % mod
mod = 10**9 + 7
N = 2*10**5
g1 = [1]*(N+1)
g2 = [1]*(N+1)
inverse = [1]*(N+1)
for i in range( 2, N + 1 ):
g1[i]=( ( g1[i-1] * i ) % mod )
inverse[i]=( ( -inverse[mod % i] * (mod//i) ) % mod )
g2[i]=( (g2[i-1] * inverse[i]) % mod )
inverse[0]=0
N = int(input())
P = li()
K = P.count(-1)
edge = [[] for v in range(N)]
for i in range(N):
if P[i]!=-1:
edge[i].append(P[i]-1)
edge[P[i]-1].append(i)
minus = 0
visit = [False] * (N)
dp = [0] * (N+1)
dp[0] = 1
for root in range(N):
if visit[root]:
continue
yet = 0
visit[root] = True
stack = [root]
n = 0
while stack:
v = stack.pop()
if P[v]==-1:
yet += 1
n += 1
for nv in edge[v]:
if not visit[nv]:
visit[nv] = True
stack.append(nv)
if not yet:
minus += pow(N,K,mod)
minus %= mod
else:
#minus += n * pow(N,K-1,mod)
#minus %= mod
ndp = [0] * (N+1)
for i in range(N+1):
if not dp[i]:
continue
ndp[i+1] += dp[i] * n
ndp[i+1] %= mod
ndp[i] += dp[i]
ndp[i] %= mod
dp = ndp
for i in range(1,K+1):
minus += dp[i] * g1[i-1] * pow(N,K-i,mod) % mod
minus %= mod
res = minus
print(res % mod)
import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
return (g1[n] * g2[r] % mod) * g2[n-r] % mod
mod = 998244353
N = 2*10**5
g1 = [1]*(N+1)
g2 = [1]*(N+1)
inverse = [1]*(N+1)
for i in range( 2, N + 1 ):
g1[i]=( ( g1[i-1] * i ) % mod )
inverse[i]=( ( -inverse[mod % i] * (mod//i) ) % mod )
g2[i]=( (g2[i-1] * inverse[i]) % mod )
inverse[0]=0
N = int(input())
P = li()
K = P.count(-1)
edge = [[] for v in range(N)]
for i in range(N):
if P[i]!=-1:
edge[i].append(P[i]-1)
edge[P[i]-1].append(i)
minus = 0
visit = [False] * (N)
dp = [0] * (N+1)
dp[0] = 1
for root in range(N):
if visit[root]:
continue
yet = 0
visit[root] = True
stack = [root]
n = 0
while stack:
v = stack.pop()
if P[v]==-1:
yet += 1
n += 1
for nv in edge[v]:
if not visit[nv]:
visit[nv] = True
stack.append(nv)
if not yet:
minus += pow(N,K,mod)
minus %= mod
else:
#minus += n * pow(N,K-1,mod)
#minus %= mod
ndp = [0] * (N+1)
for i in range(N+1):
if not dp[i]:
continue
ndp[i+1] += dp[i] * n
ndp[i+1] %= mod
ndp[i] += dp[i]
ndp[i] %= mod
dp = ndp
for i in range(1,K+1):
minus += dp[i] * g1[i-1] * pow(N,K-i,mod) % mod
minus %= mod
res = minus
print(res % mod)
|
ConDefects/ConDefects/Code/arc140_d/Python/31726462
|
condefects-python_data_1945
|
n=int(input())
a=[0]+list(map(int,input().split()))
#################################################
import sys
sys.setrecursionlimit(10 ** 9) # 再帰の上限をあげる
#########
uni_num=n+1
#########
union_root = [-1 for i in range(uni_num + 1)] # 自分が親ならグループの人数のマイナス倍を、そうでないなら（元）親の番号を示す
union_depth = [0] * (uni_num + 1)
def find(x): # 親は誰？
if union_root[x] < 0:
return x
else:
union_root[x] = find(union_root[x])
return union_root[x]
def unite(x, y):
x = find(x)
y = find(y)
if x == y:
return
if union_depth[x] < union_depth[y]:
x, y = y, x
if union_depth[x] == union_depth[y]:
union_depth[x] += 1
union_root[x] += union_root[y]
union_root[y] = x
################################
mod=998244353
for i in range(1,n+1):
if a[i]!=-1:unite(i,a[i])
miti=[0]*(n+2)
for i in range(1,n+1):
if a[i]==-1:miti[find(i)]+=1
#############################
#############
cnb_max=10**5
#############
kai=[1]*(cnb_max+1)
rkai=[1]*(cnb_max+1)
for i in range(cnb_max):
kai[i+1]=kai[i]*(i+1)%mod
rkai[cnb_max]=pow(kai[cnb_max],mod-2,mod)
for i in range(cnb_max):
rkai[cnb_max-1-i]=rkai[cnb_max-i]*(cnb_max-i)%mod
def cnb(x,y):
if y>x:
return 0
if x<0:return 0
if y<0:return 0
return (kai[x]*rkai[y]%mod)*rkai[x-y]%mod
def inv(n):
return kai[n-1]*rkai[n]%mod
##################################
x=[]
cnt=0
for i in range(1,n+1):
if i!=find(i):continue
if miti[i]==1:x.append(-union_root[i])
else:cnt+=1
m=len(x)
x=[0]+x
ans=cnt*pow(n,m,mod)%mod
dp=[[0]*(m+3) for i in range(m+3)]
dp[0][0]=1
for i in range(1,m+1):
for j in range(i+1):
dp[i][j]=dp[i-1][j]+dp[i-1][j-1]*x[i]%mod
dp[i][j]%=mod
for j in range(1,m+1):
ans+=(kai[j-1]*dp[m][j]%mod)*pow(n,m-j,mod)%mod
print(ans)
n=int(input())
a=[0]+list(map(int,input().split()))
#################################################
import sys
sys.setrecursionlimit(10 ** 9) # 再帰の上限をあげる
#########
uni_num=n+1
#########
union_root = [-1 for i in range(uni_num + 1)] # 自分が親ならグループの人数のマイナス倍を、そうでないなら（元）親の番号を示す
union_depth = [0] * (uni_num + 1)
def find(x): # 親は誰？
if union_root[x] < 0:
return x
else:
union_root[x] = find(union_root[x])
return union_root[x]
def unite(x, y):
x = find(x)
y = find(y)
if x == y:
return
if union_depth[x] < union_depth[y]:
x, y = y, x
if union_depth[x] == union_depth[y]:
union_depth[x] += 1
union_root[x] += union_root[y]
union_root[y] = x
################################
mod=998244353
for i in range(1,n+1):
if a[i]!=-1:unite(i,a[i])
miti=[0]*(n+2)
for i in range(1,n+1):
if a[i]==-1:miti[find(i)]+=1
#############################
#############
cnb_max=10**5
#############
kai=[1]*(cnb_max+1)
rkai=[1]*(cnb_max+1)
for i in range(cnb_max):
kai[i+1]=kai[i]*(i+1)%mod
rkai[cnb_max]=pow(kai[cnb_max],mod-2,mod)
for i in range(cnb_max):
rkai[cnb_max-1-i]=rkai[cnb_max-i]*(cnb_max-i)%mod
def cnb(x,y):
if y>x:
return 0
if x<0:return 0
if y<0:return 0
return (kai[x]*rkai[y]%mod)*rkai[x-y]%mod
def inv(n):
return kai[n-1]*rkai[n]%mod
##################################
x=[]
cnt=0
for i in range(1,n+1):
if i!=find(i):continue
if miti[i]==1:x.append(-union_root[i])
else:cnt+=1
m=len(x)
x=[0]+x
ans=cnt*pow(n,m,mod)%mod
dp=[[0]*(m+3) for i in range(m+3)]
dp[0][0]=1
for i in range(1,m+1):
for j in range(i+1):
dp[i][j]=dp[i-1][j]+dp[i-1][j-1]*x[i]%mod
dp[i][j]%=mod
for j in range(1,m+1):
ans+=(kai[j-1]*dp[m][j]%mod)*pow(n,m-j,mod)%mod
print(ans%mod)
|
ConDefects/ConDefects/Code/arc140_d/Python/31731857
|
condefects-python_data_1946
|
mod = 998244353
from collections import defaultdict
class UnionFind():
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())
N = int(input())
a = list(map(int,input().split()))
uf = UnionFind(N)
for i in range(N):
if a[i] > 0:
a[i] -= 1
uf.union(i,a[i])
d = uf.all_group_members()
p = []
q = 0
ans = 0
n = 0
#print(d)
for x in d.keys():
flag = False
for y in d[x]:
if a[y] == -1:
flag = True
if flag:
n += 1
p.append(len(d[x]))
else:
ans += 1
q += len(d[x])
inv = pow(N,mod-2,mod)
#print(inv)
#print(n,p,q,ans)
fct = [1]
for i in range(1,n+1):
fct.append((fct[-1]*i)%mod)
#print(fct)
for i in range(n):
ans *= N
ans %= mod
p[i] *= inv
p[i] %= mod
#print(ans)
dp = [[0]*(n+1) for i in range(n+1)]
dp[0][0] = 1
for i in range(1,n+1):
dp[i][0] = 1
for k in range(1,i+1):
dp[i][k] += dp[i-1][k]
dp[i][k] %= mod
dp[i][k] += (dp[i-1][k-1]*p[i-1])%mod
dp[i][k] %= mod
#print(dp[i])
for k in range(1,n+1):
ans += (dp[-1][k]*fct[k-1])%mod
ans %= mod
for _ in range(n):
ans *= N
ans %= mod
print(ans)
mod = 998244353
from collections import defaultdict
class UnionFind():
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())
N = int(input())
a = list(map(int,input().split()))
uf = UnionFind(N)
for i in range(N):
if a[i] > 0:
a[i] -= 1
uf.union(i,a[i])
d = uf.all_group_members()
p = []
q = 0
ans = 0
n = 0
#print(d)
for x in d.keys():
flag = False
for y in d[x]:
if a[y] == -1:
flag = True
if flag:
n += 1
p.append(len(d[x]))
else:
ans += 1
q += len(d[x])
inv = pow(N,mod-2,mod)
#print(inv)
#print(n,p,q,ans)
fct = [1]
for i in range(1,n+1):
fct.append((fct[-1]*i)%mod)
#print(fct)
for i in range(n):
p[i] *= inv
p[i] %= mod
#print(ans)
dp = [[0]*(n+1) for i in range(n+1)]
dp[0][0] = 1
for i in range(1,n+1):
dp[i][0] = 1
for k in range(1,i+1):
dp[i][k] += dp[i-1][k]
dp[i][k] %= mod
dp[i][k] += (dp[i-1][k-1]*p[i-1])%mod
dp[i][k] %= mod
#print(dp[i])
for k in range(1,n+1):
ans += (dp[-1][k]*fct[k-1])%mod
ans %= mod
for _ in range(n):
ans *= N
ans %= mod
print(ans)
|
ConDefects/ConDefects/Code/arc140_d/Python/31743854
|
condefects-python_data_1947
|
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, cos, radians, pi, sin
from operator import mul
from functools import reduce
from operator import mul
from functools import lru_cache
mod = 10 ** 9 + 7
sys.setrecursionlimit(2147483647)
INF = 10 ** 13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
@lru_cache(maxsize=None)
def factorial(n):
if n == 0:
return 1
else:
return (n*factorial(n-1)) % mod
class UnionFind:
def __init__(self, n):
# 負 : 根であることを示す。絶対値はランクを示す
# 非負: 根でないことを示す。値は親を示す
self.table = [-1] * n
self.size = [1] * n
self.group_num = n
def root(self, x):
if self.table[x] < 0:
return x
else:
self.table[x] = self.root(self.table[x])
return self.table[x]
def get_size(self, x):
r = self.root(x)
return self.size[r]
def is_same(self, x, y):
return self.root(x) == self.root(y)
def union(self, x, y):
r1 = self.root(x)
r2 = self.root(y)
if r1 == r2:
return
# ランクの取得
d1 = self.table[r1]
d2 = self.table[r2]
if d1 <= d2:
self.table[r2] = r1
self.size[r1] += self.size[r2]
if d1 == d2:
self.table[r1] -= 1
else:
self.table[r1] = r2
self.size[r2] += self.size[r1]
self.group_num -= 1
n = I()
P = LI()
fac = [1] * (n + 1)
inv = [1] * (n + 1)
for j in range(1, n + 1):
fac[j] = fac[j-1] * j % mod
inv[n] = pow(fac[n], mod-2, mod)
for j in range(n-1, -1, -1):
inv[j] = inv[j+1] * (j+1) % mod
def comb(n, r):
if r > n or n < 0 or r < 0:
return 0
return fac[n] * inv[n - r] * inv[r] % mod
U = UnionFind(n)
for i in range(n):
if P[i] != -1:
U.union(P[i] - 1, i)
k = 0
L = []
for j in range(n):
if P[j] == -1:
L += [U.get_size(j)]
k += 1
dp = [0]*(k+1)
dp[0] = 1
dp_new = dp[:]
for i in range(1, k+1):
for j in range(i):
dp_new[j+1] += dp[j]*L[i-1]
dp = dp_new[:]
if k:
dp[1] = sum(L) - len(L)
cycle_count = 0
for i in range(1, k + 1):
# i個のグループからなるサイクルがひとつできる
buf = dp[i] * factorial(i - 1)
buf %= mod
buf *= pow(n, k - i, mod)
buf %= mod
cycle_count += buf
# すでに固定サイクルがあれば数える
cycle_count += (U.group_num - k) * pow(n, k, mod)
ans = n * pow(n, k, mod)
ans %= mod
ans = ans - cycle_count
ans %= mod
print((cycle_count+pow(n,k-1,mod)*k)%mod)
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, cos, radians, pi, sin
from operator import mul
from functools import reduce
from operator import mul
from functools import lru_cache
mod = 998244353
sys.setrecursionlimit(2147483647)
INF = 10 ** 13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
@lru_cache(maxsize=None)
def factorial(n):
if n == 0:
return 1
else:
return (n*factorial(n-1)) % mod
class UnionFind:
def __init__(self, n):
# 負 : 根であることを示す。絶対値はランクを示す
# 非負: 根でないことを示す。値は親を示す
self.table = [-1] * n
self.size = [1] * n
self.group_num = n
def root(self, x):
if self.table[x] < 0:
return x
else:
self.table[x] = self.root(self.table[x])
return self.table[x]
def get_size(self, x):
r = self.root(x)
return self.size[r]
def is_same(self, x, y):
return self.root(x) == self.root(y)
def union(self, x, y):
r1 = self.root(x)
r2 = self.root(y)
if r1 == r2:
return
# ランクの取得
d1 = self.table[r1]
d2 = self.table[r2]
if d1 <= d2:
self.table[r2] = r1
self.size[r1] += self.size[r2]
if d1 == d2:
self.table[r1] -= 1
else:
self.table[r1] = r2
self.size[r2] += self.size[r1]
self.group_num -= 1
n = I()
P = LI()
fac = [1] * (n + 1)
inv = [1] * (n + 1)
for j in range(1, n + 1):
fac[j] = fac[j-1] * j % mod
inv[n] = pow(fac[n], mod-2, mod)
for j in range(n-1, -1, -1):
inv[j] = inv[j+1] * (j+1) % mod
def comb(n, r):
if r > n or n < 0 or r < 0:
return 0
return fac[n] * inv[n - r] * inv[r] % mod
U = UnionFind(n)
for i in range(n):
if P[i] != -1:
U.union(P[i] - 1, i)
k = 0
L = []
for j in range(n):
if P[j] == -1:
L += [U.get_size(j)]
k += 1
dp = [0]*(k+1)
dp[0] = 1
dp_new = dp[:]
for i in range(1, k+1):
for j in range(i):
dp_new[j+1] += dp[j]*L[i-1]
dp = dp_new[:]
if k:
dp[1] = sum(L) - len(L)
cycle_count = 0
for i in range(1, k + 1):
# i個のグループからなるサイクルがひとつできる
buf = dp[i] * factorial(i - 1)
buf %= mod
buf *= pow(n, k - i, mod)
buf %= mod
cycle_count += buf
# すでに固定サイクルがあれば数える
cycle_count += (U.group_num - k) * pow(n, k, mod)
ans = n * pow(n, k, mod)
ans %= mod
ans = ans - cycle_count
ans %= mod
print((cycle_count+pow(n,k-1,mod)*k)%mod)
|
ConDefects/ConDefects/Code/arc140_d/Python/31727307
|
condefects-python_data_1948
|
import sys
input = sys.stdin.readline
for _ in range(int(input())):
N = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
sa = set(a)
sb = set(b)
if sa | sb != sa:
print("No")
continue
la = [a[0]]
lb = [b[0]]
for i in range(1, N):
if la[-1] != a[i]: la.append(a[i])
if lb[-1] != b[i]: lb.append(b[i])
if sa == sb and len(sa) == N:
if a == b:
print("Yes")
else:
print("No")
continue
if len(la) == N and len(lb) == N and la[0] != la[-1]:
if a == b:
print("Yes")
else:
print("No")
continue
for l in range(N):
la = [a[l]]
for i in range(1, N):
if la[-1] != a[(i + l) % N]: la.append(a[(i + l) % N])
i = 0
#print(la, lb)
for j in range(len(lb)):
if i > len(la): break
f = 0
while i <= len(la):
if la[i % len(la)] == lb[j]:
i += 1
f = 1
break
i += 1
#print(i, j, f)
if f == 0: break
else:
print("Yes")
break
else:
print("No")
import sys
input = sys.stdin.readline
for _ in range(int(input())):
N = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
sa = set(a)
sb = set(b)
if sa | sb != sa:
print("No")
continue
la = [a[0]]
lb = [b[0]]
for i in range(1, N):
if la[-1] != a[i]: la.append(a[i])
if lb[-1] != b[i]: lb.append(b[i])
if sa == sb and len(sa) == N:
if a == b:
print("Yes")
else:
print("No")
continue
if len(la) == N and len(lb) == N and la[0] != la[-1] and lb[0] != lb[-1]:
if a == b:
print("Yes")
else:
print("No")
continue
for l in range(N):
la = [a[l]]
for i in range(1, N):
if la[-1] != a[(i + l) % N]: la.append(a[(i + l) % N])
i = 0
#print(la, lb)
for j in range(len(lb)):
if i > len(la): break
f = 0
while i <= len(la):
if la[i % len(la)] == lb[j]:
i += 1
f = 1
break
i += 1
#print(i, j, f)
if f == 0: break
else:
print("Yes")
break
else:
print("No")
|
ConDefects/ConDefects/Code/arc154_c/Python/38909905
|
condefects-python_data_1949
|
import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
INF = 2**63-1
mod = 998244353
def solve():
n = ii()
a = li()
b = li()
if a == b:
return 'Yes'
c = []
for i in range(n):
if not c or c[-1] != b[i]:
c.append(b[i])
if len(c) == n:
return 'No'
if len(set(b)) == 1 and b[0] in a:
return 'Yes'
for i in range(n):
c = []
for i in range(len(a)):
if not c or c[-1] != a[i]:
c.append(a[i])
d = []
for i in range(len(b)):
if not d or d[-1] != b[i]:
d.append(b[i])
cnt = 0
f = True
n = len(d)
m = len(c)
for j in range(len(d)):
if not f:
break
while d[j] != c[cnt]:
cnt += 1
if cnt >= len(c):
f = False
break
if f:
return 'Yes'
b = b[1:] + [b[0]]
return 'No'
for _ in range(ii()):
print(solve())
import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
INF = 2**63-1
mod = 998244353
def solve():
n = ii()
a = li()
b = li()
if a == b:
return 'Yes'
c = []
for i in range(n):
if not c or c[-1] != b[i]:
c.append(b[i])
if len(c) == n and c[-1] != c[0]:
return 'No'
if len(set(b)) == 1 and b[0] in a:
return 'Yes'
for i in range(n):
c = []
for i in range(len(a)):
if not c or c[-1] != a[i]:
c.append(a[i])
d = []
for i in range(len(b)):
if not d or d[-1] != b[i]:
d.append(b[i])
cnt = 0
f = True
n = len(d)
m = len(c)
for j in range(len(d)):
if not f:
break
while d[j] != c[cnt]:
cnt += 1
if cnt >= len(c):
f = False
break
if f:
return 'Yes'
b = b[1:] + [b[0]]
return 'No'
for _ in range(ii()):
print(solve())
|
ConDefects/ConDefects/Code/arc154_c/Python/39123866
|
condefects-python_data_1950
|
import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
heap.append(item)
heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
if heap and item < heap[0]:
item, heap[0] = heap[0], item
heapq._siftup_max(heap, 0)
return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
def Compress(lst):
decomp=sorted(list(set(lst)))
comp={x:i for i,x in enumerate(decomp)}
return comp,decomp
class Dual_Segment_Tree:
def __init__(self,N,f_act,e_act,operate,lst):
self.N=N
self.f_act=f_act
self.e_act=e_act
self.operate=operate
self.lst=[None]*self.N
for i,x in enumerate(lst):
self.lst[i]=x
self.segment_tree_act=[self.e_act]*(self.N+self.N)
def __getitem__(self,i):
if type(i) is int:
if -self.N<=i<0:
i+=self.N*2
elif 0<=i<self.N:
i+=self.N
else:
raise IndexError("list index out of range")
self.Propagate_Above(i)
return self.Operate_At(i)
else:
a,b,c=i.start,i.stop,i.step
if a==None or a<-self.N:
a=0
elif self.N<=a:
a=self.N
elif a<0:
a+=self.N
if b==None or self.N<=b:
b=self.N
elif b<-self.N:
b=0
elif b<0:
b+=self.N
return self.lst[slice(a,b,c)]
def Operate_At(self,i):
return self.operate(self.lst[i-self.N],self.segment_tree_act[i])
def Propagate_At(self,i):
self.segment_tree_act[i<<1]=self.f_act(self.segment_tree_act[i<<1],self.segment_tree_act[i])
self.segment_tree_act[i<<1|1]=self.f_act(self.segment_tree_act[i<<1|1],self.segment_tree_act[i])
self.segment_tree_act[i]=self.e_act
def Propagate_Above(self,i):
H=i.bit_length()-1
for h in range(H,0,-1):
self.Propagate_At(i>>h)
def Operate_Range(self,a,L=None,R=None):
if L==None:
L=self.N
else:
L+=self.N
if R==None:
R=self.N*2
else:
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.segment_tree_act[L]=self.f_act(self.segment_tree_act[L],a)
L+=1
if R&1:
R-=1
self.segment_tree_act[R]=self.f_act(self.segment_tree_act[R],a)
L>>=1
R>>=1
def Update(self):
for i in range(1,self.N):
self.Propagate_At(i)
self.segment_tree_act[i]=self.e_act
def __str__(self):
import copy
segment_tree_act=copy.deepcopy(self.segment_tree_act)
for i in range(1,self.N):
segment_tree_act[i<<1]=self.f_act(segment_tree_act[i<<1],segment_tree_act[i])
segment_tree_act[i<<1|1]=self.f_act(segment_tree_act[i<<1|1],segment_tree_act[i])
segment_tree_act[i]=self.e_act
segment_tree_act[i]=self.e_act
return "["+", ".join(map(str,[self.operate(x,a) for x,a in zip(self.lst,segment_tree_act[self.N:])]))+"]"
N=int(readline())
A,B=[],[]
for _ in range(N):
a,b=map(int,readline().split())
A.append(a)
B.append(b)
comp,decomp=Compress(A+B)
for i in range(N):
A[i]=comp[A[i]]
B[i]=comp[B[i]]
sorted_A=sorted(A)
sorted_B=sorted(B)
for a,b in zip(sorted_A,sorted_B):
if a<b:
print(-1)
exit()
le=len(comp)
imos=[0]*le
ans=N
for a,b in zip(A,B):
if a<b:
imos[a]-=1
imos[b]+=1
ans-=1
for i in range(1,le):
imos[i]+=imos[i-1]
AB=[[] for a in range(le)]
for a,b in zip(A,B):
if a>b:
AB[b].append(a)
queue=[]
DST=Dual_Segment_Tree(le,lambda x,y:x+y,0,lambda x,a:x+a,imos)
for a in range(le-1):
for b in AB[a]:
_heappush_max(queue,b)
while DST[a]<0:
b=heappop(queue)
DST.Operate_Range(1,a,b)
ans-=1
print(ans)
import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
heap.append(item)
heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
if heap and item < heap[0]:
item, heap[0] = heap[0], item
heapq._siftup_max(heap, 0)
return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
def Compress(lst):
decomp=sorted(list(set(lst)))
comp={x:i for i,x in enumerate(decomp)}
return comp,decomp
class Dual_Segment_Tree:
def __init__(self,N,f_act,e_act,operate,lst):
self.N=N
self.f_act=f_act
self.e_act=e_act
self.operate=operate
self.lst=[None]*self.N
for i,x in enumerate(lst):
self.lst[i]=x
self.segment_tree_act=[self.e_act]*(self.N+self.N)
def __getitem__(self,i):
if type(i) is int:
if -self.N<=i<0:
i+=self.N*2
elif 0<=i<self.N:
i+=self.N
else:
raise IndexError("list index out of range")
self.Propagate_Above(i)
return self.Operate_At(i)
else:
a,b,c=i.start,i.stop,i.step
if a==None or a<-self.N:
a=0
elif self.N<=a:
a=self.N
elif a<0:
a+=self.N
if b==None or self.N<=b:
b=self.N
elif b<-self.N:
b=0
elif b<0:
b+=self.N
return self.lst[slice(a,b,c)]
def Operate_At(self,i):
return self.operate(self.lst[i-self.N],self.segment_tree_act[i])
def Propagate_At(self,i):
self.segment_tree_act[i<<1]=self.f_act(self.segment_tree_act[i<<1],self.segment_tree_act[i])
self.segment_tree_act[i<<1|1]=self.f_act(self.segment_tree_act[i<<1|1],self.segment_tree_act[i])
self.segment_tree_act[i]=self.e_act
def Propagate_Above(self,i):
H=i.bit_length()-1
for h in range(H,0,-1):
self.Propagate_At(i>>h)
def Operate_Range(self,a,L=None,R=None):
if L==None:
L=self.N
else:
L+=self.N
if R==None:
R=self.N*2
else:
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.segment_tree_act[L]=self.f_act(self.segment_tree_act[L],a)
L+=1
if R&1:
R-=1
self.segment_tree_act[R]=self.f_act(self.segment_tree_act[R],a)
L>>=1
R>>=1
def Update(self):
for i in range(1,self.N):
self.Propagate_At(i)
self.segment_tree_act[i]=self.e_act
def __str__(self):
import copy
segment_tree_act=copy.deepcopy(self.segment_tree_act)
for i in range(1,self.N):
segment_tree_act[i<<1]=self.f_act(segment_tree_act[i<<1],segment_tree_act[i])
segment_tree_act[i<<1|1]=self.f_act(segment_tree_act[i<<1|1],segment_tree_act[i])
segment_tree_act[i]=self.e_act
segment_tree_act[i]=self.e_act
return "["+", ".join(map(str,[self.operate(x,a) for x,a in zip(self.lst,segment_tree_act[self.N:])]))+"]"
N=int(readline())
A,B=[],[]
for _ in range(N):
a,b=map(int,readline().split())
A.append(a)
B.append(b)
comp,decomp=Compress(A+B)
for i in range(N):
A[i]=comp[A[i]]
B[i]=comp[B[i]]
sorted_A=sorted(A)
sorted_B=sorted(B)
for a,b in zip(sorted_A,sorted_B):
if a<b:
print(-1)
exit()
le=len(comp)
imos=[0]*le
ans=N
for a,b in zip(A,B):
if a<b:
imos[a]-=1
imos[b]+=1
ans-=1
for i in range(1,le):
imos[i]+=imos[i-1]
AB=[[] for a in range(le)]
for a,b in zip(A,B):
if a>b:
AB[b].append(a)
queue=[]
DST=Dual_Segment_Tree(le,lambda x,y:x+y,0,lambda x,a:x+a,imos)
for a in range(le-1):
for b in AB[a]:
_heappush_max(queue,b)
while DST[a]<0:
b=_heappop_max(queue)
DST.Operate_Range(1,a,b)
ans-=1
print(ans)
|
ConDefects/ConDefects/Code/arc147_e/Python/34616740
|
condefects-python_data_1951
|
import heapq
import collections
N = int(input())
AB = [list(map(int, input().split())) for _ in range(N)]
OK = []
NG = []
for a,b in AB:
if a>=b:
OK.append([a,b])
else:
NG.append([a,b])
OK = sorted(OK, reverse=True, key=lambda x: x[0])
OK_D = collections.deque(OK)
NG_A = []
NG_B = []
for a,b in NG:
NG_A.append(a)
NG_B.append(b)
NG_A.sort(reverse=True)
NG_A = collections.deque(NG_A)
H_NG_B = []
for b in NG_B:
heapq.heappush(H_NG_B,-b)
H_OK_B = []
ans = len(OK)
while NG_A:
while len(OK_D) and OK_D[0][0]>=-H_NG_B[0]:
a,b = OK_D.popleft()
heapq.heappush(H_OK_B,b)
if len(H_NG_B) and -H_NG_B[0]<=NG_A[0]:
NG_A.popleft()
heapq.heappop(H_NG_B)
elif len(H_OK_B) and H_OK_B[0]<=NG_A[0]:
ans-=1
b = heapq.heappop(H_OK_B)
heapq.heappush(H_NG_B,-b)
heapq.heappop(H_NG_B)
else:
print(-1)
exit()
print(ans)
import heapq
import collections
N = int(input())
AB = [list(map(int, input().split())) for _ in range(N)]
OK = []
NG = []
for a,b in AB:
if a>=b:
OK.append([a,b])
else:
NG.append([a,b])
OK = sorted(OK, reverse=True, key=lambda x: x[0])
OK_D = collections.deque(OK)
NG_A = []
NG_B = []
for a,b in NG:
NG_A.append(a)
NG_B.append(b)
NG_A.sort(reverse=True)
NG_A = collections.deque(NG_A)
H_NG_B = []
for b in NG_B:
heapq.heappush(H_NG_B,-b)
H_OK_B = []
ans = len(OK)
while NG_A:
while len(OK_D) and OK_D[0][0]>=-H_NG_B[0]:
a,b = OK_D.popleft()
heapq.heappush(H_OK_B,b)
if len(H_NG_B) and -H_NG_B[0]<=NG_A[0]:
NG_A.popleft()
heapq.heappop(H_NG_B)
elif len(H_OK_B):
ans-=1
b = heapq.heappop(H_OK_B)
heapq.heappush(H_NG_B,-b)
heapq.heappop(H_NG_B)
else:
print(-1)
exit()
print(ans)
|
ConDefects/ConDefects/Code/arc147_e/Python/40546012
|
condefects-python_data_1952
|
import sys
input = sys.stdin.readline
def scc_decomposition(G):
n = len(G)
G_rev = [[] for _ in range(n)]
for u in range(n):
for v in G[u]:
G_rev[v].append(u)
# dfs
vs = []
visited = [False] * n
used = [False] * n
for u in range(n):
if visited[u]:
continue
stack = [u]
while stack:
v = stack.pop()
if used[v]:
continue
if not visited[v]:
visited[v] = True
else:
vs.append(v)
used[v] = True
continue
stack.append(v)
for c in G[v]:
if not visited[c]:
stack.append(c)
# reverse dfs
visited = [False] * n
component = [-1] * n
k = 0
for u in vs[::-1]:
if visited[u]:
continue
stack = [u]
while stack:
v = stack.pop()
visited[v] = True
component[v] = k
for c in G_rev[v]:
if not visited[c]:
stack.append(c)
k += 1
return component
class UnionFind:
def __init__(self, N):
self.par = [-1] * N
def find(self, x):
r = x
while self.par[r] >= 0:
r = self.par[r]
while x != r:
tmp = self.par[x]
self.par[x] = r
x = tmp
return r
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.par[x] > self.par[y]:
x, y = y, x
self.par[x] += self.par[y]
self.par[y] = x
def same(self, x, y):
return self.find(x) == self.find(y)
def size(self, x):
return -self.par[self.find(x)]
N, M = map(int, input().split())
constraints = [tuple(map(lambda x: int(x)-1, input().split()))
for _ in range(M)]
new_constraints = []
for a, b, c, d in constraints:
if a == c:
if b >= d:
print("No")
exit()
else:
new_constraints.append((a, b, c, d))
constraints = new_constraints
uf = UnionFind(N)
while constraints:
G = [[] for _ in range(N)]
for a, b, c, d in constraints:
G[c].append(a)
comp = scc_decomposition(G)
groups = [[] for _ in range(N)]
for i in range(N):
groups[comp[i]].append(i)
for k in range(N):
for j in range(len(groups[k])-1):
uf.unite(groups[k][j], groups[k][j+1])
new_constraints = []
upd = False
for a, b, c, d in constraints:
ok = False
if uf.same(a, c):
upd = True
while uf.same(a, c):
if c == d:
print("No")
exit()
if a == b:
ok = True
break
a += 1
c += 1
if not ok:
new_constraints.append((a, b, c, d))
constraints = new_constraints
if not upd:
break
print("Yes")
import sys
input = sys.stdin.readline
def scc_decomposition(G):
n = len(G)
G_rev = [[] for _ in range(n)]
for u in range(n):
for v in G[u]:
G_rev[v].append(u)
# dfs
vs = []
visited = [False] * n
used = [False] * n
for u in range(n):
if visited[u]:
continue
stack = [u]
while stack:
v = stack.pop()
if used[v]:
continue
if not visited[v]:
visited[v] = True
else:
vs.append(v)
used[v] = True
continue
stack.append(v)
for c in G[v]:
if not visited[c]:
stack.append(c)
# reverse dfs
visited = [False] * n
component = [-1] * n
k = 0
for u in vs[::-1]:
if visited[u]:
continue
stack = [u]
while stack:
v = stack.pop()
visited[v] = True
component[v] = k
for c in G_rev[v]:
if not visited[c]:
stack.append(c)
k += 1
return component
class UnionFind:
def __init__(self, N):
self.par = [-1] * N
def find(self, x):
r = x
while self.par[r] >= 0:
r = self.par[r]
while x != r:
tmp = self.par[x]
self.par[x] = r
x = tmp
return r
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.par[x] > self.par[y]:
x, y = y, x
self.par[x] += self.par[y]
self.par[y] = x
def same(self, x, y):
return self.find(x) == self.find(y)
def size(self, x):
return -self.par[self.find(x)]
N, M = map(int, input().split())
constraints = [tuple(map(lambda x: int(x)-1, input().split()))
for _ in range(M)]
new_constraints = []
for a, b, c, d in constraints:
if a == c:
if b >= d:
print("No")
exit()
else:
new_constraints.append((a, b, c, d))
constraints = new_constraints
uf = UnionFind(N)
while constraints:
G = [[] for _ in range(N)]
for a, b, c, d in constraints:
G[uf.find(c)].append(uf.find(a))
comp = scc_decomposition(G)
groups = [[] for _ in range(N)]
for i in range(N):
groups[comp[i]].append(i)
for k in range(N):
for j in range(len(groups[k])-1):
uf.unite(groups[k][j], groups[k][j+1])
new_constraints = []
upd = False
for a, b, c, d in constraints:
ok = False
if uf.same(a, c):
upd = True
while uf.same(a, c):
if c == d:
print("No")
exit()
if a == b:
ok = True
break
a += 1
c += 1
if not ok:
new_constraints.append((a, b, c, d))
constraints = new_constraints
if not upd:
break
print("Yes")
|
ConDefects/ConDefects/Code/arc165_d/Python/45683063
|
condefects-python_data_1953
|
import sys
input = sys.stdin.readline
class SCC:
def __init__(self,n):
self.n = n
self.edges = []
def csr(self):
self.start = [0]*(self.n+1)
self.elist = [0]*len(self.edges)
for e in self.edges:
self.start[e[0]+1] += 1
for i in range(1,self.n+1):
self.start[i] += self.start[i-1]
counter = self.start[:]
for e in self.edges:
self.elist[counter[e[0]]] = e[1]
counter[e[0]] += 1
def add_edge(self,u,v):
self.edges.append((u,v))
def scc_ids(self):
self.csr()
n = self.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(self.start[v],self.start[v+1]):
to = self.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
return group_num,ids
def scc(self):
group_num,ids = self.scc_ids()
groups = [[] for i in range(group_num)]
for i,x in enumerate(ids):
groups[x].append(i)
return groups
class Unionfind:
def __init__(self,n):
self.uf = [-1]*n
def find(self,x):
if self.uf[x] < 0:
return x
else:
self.uf[x] = self.find(self.uf[x])
return self.uf[x]
def same(self,x,y):
return self.find(x) == self.find(y)
def union(self,x,y):
x = self.find(x)
y = self.find(y)
if x == y:
return False
if self.uf[x] > self.uf[y]:
x,y = y,x
self.uf[x] += self.uf[y]
self.uf[y] = x
return True
def size(self,x):
x = self.find(x)
return -self.uf[x]
n,m = map(int,input().split())
ABCD = [[int(x)-1 for x in input().split()] for i in range(m)]
uf = Unionfind(n)
pos = [0]*m
while True:
scc = SCC(n)
upd = 0
for i,(a,b,c,d) in enumerate(ABCD):
si = min(b-a,d-c)+1
if pos[i] >= si:
continue
ok = 0
while pos[i] < si:
if uf.same(a+pos[i],c+pos[i]):
pos[i] += 1
upd = 1
else:
scc.add_edge(a+pos[i],c+pos[i])
ok = 1
break
if ok == 0 and b-a >= d-c:
print("No")
exit()
grs = scc.scc()
ok = 1
for g in grs:
if len(g) == 1:
continue
for x,nx in zip(g,g[1:]):
uf.union(x,nx)
ok = 0
upd = 1
if ok:
print("Yes")
exit()
if upd == 0:
break
print("No")
import sys
input = sys.stdin.readline
class SCC:
def __init__(self,n):
self.n = n
self.edges = []
def csr(self):
self.start = [0]*(self.n+1)
self.elist = [0]*len(self.edges)
for e in self.edges:
self.start[e[0]+1] += 1
for i in range(1,self.n+1):
self.start[i] += self.start[i-1]
counter = self.start[:]
for e in self.edges:
self.elist[counter[e[0]]] = e[1]
counter[e[0]] += 1
def add_edge(self,u,v):
self.edges.append((u,v))
def scc_ids(self):
self.csr()
n = self.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(self.start[v],self.start[v+1]):
to = self.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
return group_num,ids
def scc(self):
group_num,ids = self.scc_ids()
groups = [[] for i in range(group_num)]
for i,x in enumerate(ids):
groups[x].append(i)
return groups
class Unionfind:
def __init__(self,n):
self.uf = [-1]*n
def find(self,x):
if self.uf[x] < 0:
return x
else:
self.uf[x] = self.find(self.uf[x])
return self.uf[x]
def same(self,x,y):
return self.find(x) == self.find(y)
def union(self,x,y):
x = self.find(x)
y = self.find(y)
if x == y:
return False
if self.uf[x] > self.uf[y]:
x,y = y,x
self.uf[x] += self.uf[y]
self.uf[y] = x
return True
def size(self,x):
x = self.find(x)
return -self.uf[x]
n,m = map(int,input().split())
ABCD = [[int(x)-1 for x in input().split()] for i in range(m)]
uf = Unionfind(n)
pos = [0]*m
while True:
scc = SCC(n)
upd = 0
for i,(a,b,c,d) in enumerate(ABCD):
si = min(b-a,d-c)+1
if pos[i] >= si:
continue
ok = 0
while pos[i] < si:
if uf.same(a+pos[i],c+pos[i]):
pos[i] += 1
upd = 1
else:
scc.add_edge(uf.find(a+pos[i]),uf.find(c+pos[i]))
ok = 1
break
if ok == 0 and b-a >= d-c:
print("No")
exit()
grs = scc.scc()
ok = 1
for g in grs:
if len(g) == 1:
continue
for x,nx in zip(g,g[1:]):
uf.union(x,nx)
ok = 0
upd = 1
if ok:
print("Yes")
exit()
if upd == 0:
break
print("No")
|
ConDefects/ConDefects/Code/arc165_d/Python/45791883
|
condefects-python_data_1954
|
class UnionFind:
def __init__(self, n):
self.n = n
self.par = [-1] * n
self.group_ = n
def find(self, x):
if self.par[x] < 0:
return x
lst = []
while self.par[x] >= 0:
lst.append(x)
x = self.par[x]
for y in lst:
self.par[y] = x
return x
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return False
if self.par[x] > self.par[y]:
x, y = y, x
self.par[x] += self.par[y]
self.par[y] = x
self.group_ -= 1
return True
def size(self, x):
return -self.par[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
@property
def group(self):
return self.group_
class SCC:
def __init__(self, n, edges=None):
self.n = n
if edges is None:
self.edges = []
else:
self.edges = edges
def add_edge(self, u, v):
self.edges.append((u, v))
def read_edges(self, m, indexed=1):
for _ in range(m):
u, v = map(int, input().split())
u -= indexed
v -= indexed
self.add_edge(u, v)
def build(self):
start = [0] * (self.n + 1)
elist = [0] * len(self.edges)
for u, _ in self.edges:
start[u + 1] += 1
for i in range(1, self.n + 1):
start[i] += start[i - 1]
counter = start[:]
for u, v in self.edges:
elist[counter[u]] = v
counter[u] += 1
now_ord = 0
group_num = 0
visited = []
low = [0] * self.n
ord = [-1] * self.n
ids = [0] * self.n
bpos = [-1] * self.n
def dfs(v):
nonlocal now_ord, group_num
visited.append(v)
stack = [~v, v]
while stack:
pos = stack.pop()
if pos >= 0:
if ord[pos] == -1:
low[pos] = ord[pos] = now_ord
now_ord += 1
visited.append(pos)
for i in range(start[pos], start[pos + 1]):
to = elist[i]
if ord[to] == -1:
stack.append(~to)
stack.append(to)
bpos[to] = pos
else:
low[pos] = min(low[pos], ord[to])
else:
pos = ~pos
if low[pos] == ord[pos]:
while 1:
u = visited.pop()
ord[u] = self.n
ids[u] = group_num
if u == pos:
break
group_num += 1
if bpos[pos] != -1:
low[bpos[pos]] = min(low[bpos[pos]], low[pos])
for i in range(self.n):
if ord[i] == -1:
dfs(i)
for i in range(self.n):
ids[i] = group_num - 1 - ids[i]
return group_num, ids
n, m = map(int, input().split())
A = [0] * m
B = [0] * m
C = [0] * m
D = [0] * m
for i in range(m):
A[i], B[i], C[i], D[i] = map(int, input().split())
A[i] -= 1
B[i] -= 1
C[i] -= 1
D[i] -= 1
nex = [0] * m
flg = True
UF = UnionFind(n)
while flg:
flg = False
G = SCC(n)
for i in range(m):
while UF.same(A[i] + nex[i], C[i] + nex[i]):
if C[i] + nex[i] == D[i]:
print("No")
exit()
elif A[i] + nex[i] == B[i]:
break
nex[i] += 1
if not UF.same(A[i] + nex[i], C[i] + nex[i]):
G.add_edge(A[i] + nex[i], C[i] + nex[i])
_, res = G.build()
ind = [-1] * (max(res) + 1)
for i, r in enumerate(res):
if ind[r] == -1:
ind[r] = i
else:
flg = True
UF.unite(ind[r], i)
print("Yes")
class UnionFind:
def __init__(self, n):
self.n = n
self.par = [-1] * n
self.group_ = n
def find(self, x):
if self.par[x] < 0:
return x
lst = []
while self.par[x] >= 0:
lst.append(x)
x = self.par[x]
for y in lst:
self.par[y] = x
return x
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return False
if self.par[x] > self.par[y]:
x, y = y, x
self.par[x] += self.par[y]
self.par[y] = x
self.group_ -= 1
return True
def size(self, x):
return -self.par[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
@property
def group(self):
return self.group_
class SCC:
def __init__(self, n, edges=None):
self.n = n
if edges is None:
self.edges = []
else:
self.edges = edges
def add_edge(self, u, v):
self.edges.append((u, v))
def read_edges(self, m, indexed=1):
for _ in range(m):
u, v = map(int, input().split())
u -= indexed
v -= indexed
self.add_edge(u, v)
def build(self):
start = [0] * (self.n + 1)
elist = [0] * len(self.edges)
for u, _ in self.edges:
start[u + 1] += 1
for i in range(1, self.n + 1):
start[i] += start[i - 1]
counter = start[:]
for u, v in self.edges:
elist[counter[u]] = v
counter[u] += 1
now_ord = 0
group_num = 0
visited = []
low = [0] * self.n
ord = [-1] * self.n
ids = [0] * self.n
bpos = [-1] * self.n
def dfs(v):
nonlocal now_ord, group_num
visited.append(v)
stack = [~v, v]
while stack:
pos = stack.pop()
if pos >= 0:
if ord[pos] == -1:
low[pos] = ord[pos] = now_ord
now_ord += 1
visited.append(pos)
for i in range(start[pos], start[pos + 1]):
to = elist[i]
if ord[to] == -1:
stack.append(~to)
stack.append(to)
bpos[to] = pos
else:
low[pos] = min(low[pos], ord[to])
else:
pos = ~pos
if low[pos] == ord[pos]:
while 1:
u = visited.pop()
ord[u] = self.n
ids[u] = group_num
if u == pos:
break
group_num += 1
if bpos[pos] != -1:
low[bpos[pos]] = min(low[bpos[pos]], low[pos])
for i in range(self.n):
if ord[i] == -1:
dfs(i)
for i in range(self.n):
ids[i] = group_num - 1 - ids[i]
return group_num, ids
n, m = map(int, input().split())
A = [0] * m
B = [0] * m
C = [0] * m
D = [0] * m
for i in range(m):
A[i], B[i], C[i], D[i] = map(int, input().split())
A[i] -= 1
B[i] -= 1
C[i] -= 1
D[i] -= 1
nex = [0] * m
flg = True
UF = UnionFind(n)
while flg:
flg = False
G = SCC(n)
for i in range(m):
while UF.same(A[i] + nex[i], C[i] + nex[i]):
if C[i] + nex[i] == D[i]:
print("No")
exit()
elif A[i] + nex[i] == B[i]:
break
nex[i] += 1
if not UF.same(A[i] + nex[i], C[i] + nex[i]):
G.add_edge(UF.find(A[i] + nex[i]), UF.find(C[i] + nex[i]))
_, res = G.build()
ind = [-1] * (max(res) + 1)
for i, r in enumerate(res):
if ind[r] == -1:
ind[r] = i
else:
flg = True
UF.unite(ind[r], i)
print("Yes")
|
ConDefects/ConDefects/Code/arc165_d/Python/45675161
|
condefects-python_data_1955
|
n=int(input())
from collections import defaultdict as df
d=df(list)
exist=set()
num=[[] for i in range(n)]
for i in range(n):
m=int(input())
for __ in range(m):
a,b=map(int,input().split())
num[i].append([a,b])
d[a].append([i,b])
if a not in exist:
exist.add(a)
for k in exist:
d[k].sort(key=lambda p:p[1])
ans=1
for i in range(n):
for k in num[i]:
if d[k[0]][-1][1]==k[1] and len(d[k[0]])>1 and d[k[0]][-2][1]<k[1]:
ans+=1
break
if ans>n:
ans-=1
print(ans)
n=int(input())
from collections import defaultdict as df
d=df(list)
exist=set()
num=[[] for i in range(n)]
for i in range(n):
m=int(input())
for __ in range(m):
a,b=map(int,input().split())
num[i].append([a,b])
d[a].append([i,b])
if a not in exist:
exist.add(a)
for k in exist:
d[k].sort(key=lambda p:p[1])
ans=1
for i in range(n):
for k in num[i]:
if d[k[0]][-1][1]==k[1] and ((len(d[k[0]])>1 and d[k[0]][-2][1]<k[1]) or len(d[k[0]])==1):
ans+=1
break
if ans>n:
ans-=1
print(ans)
|
ConDefects/ConDefects/Code/abc259_e/Python/45515452
|
condefects-python_data_1956
|
N=int(input())
A=list(map(int,input().split()))
v=[0]*30
for i in range(N):
x=A[i]
for k in range(30):
if (x>>k)&1:
v[k]+=1
result=sum(A)
y=result
for i in range(N):
w=0
x=A[i]
for k in range(k):
if (x>>k)&1:
w-=v[k]*2**k
w+=(N-v[k])*2**k
result=max(result,y+w)
print(result)
N=int(input())
A=list(map(int,input().split()))
v=[0]*30
for i in range(N):
x=A[i]
for k in range(30):
if (x>>k)&1:
v[k]+=1
result=sum(A)
y=result
for i in range(N):
w=0
x=A[i]
for k in range(30):
if (x>>k)&1:
w-=v[k]*2**k
w+=(N-v[k])*2**k
result=max(result,y+w)
print(result)
|
ConDefects/ConDefects/Code/arc135_c/Python/41836593
|
condefects-python_data_1957
|
import heapq
import sys
from collections import defaultdict, deque
from math import inf
sys.setrecursionlimit(10**6)
MOD = 10**9 + 7
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
# count the ones in every position
# work out the gain by flipping bit in each position
# calculate the gain per number
n = ni()
A = na()
initial = sum(A)
bits = [0] * 32
for i in range(32):
for a in A:
bits[i] += a >> i & 1
value = [0] * n
best = -inf
best_idx = -1
for i in range(n):
a = A[i]
for b in range(32):
if a >> b & 1:
value[i] += 2**b * (n - bits[b] - bits[b])
if value[i] > best:
best = value[i]
best_idx = i
print(bits)
print(value)
ans = sum(a ^ A[best_idx] for a in A)
print(max(ans,initial))
import heapq
import sys
from collections import defaultdict, deque
from math import inf
sys.setrecursionlimit(10**6)
MOD = 10**9 + 7
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
# count the ones in every position
# work out the gain by flipping bit in each position
# calculate the gain per number
n = ni()
A = na()
initial = sum(A)
bits = [0] * 32
for i in range(32):
for a in A:
bits[i] += a >> i & 1
value = [0] * n
best = -inf
best_idx = -1
for i in range(n):
a = A[i]
for b in range(32):
if a >> b & 1:
value[i] += 2**b * (n - bits[b] - bits[b])
if value[i] > best:
best = value[i]
best_idx = i
ans = sum(a ^ A[best_idx] for a in A)
print(max(ans,initial))
|
ConDefects/ConDefects/Code/arc135_c/Python/33027382
|
condefects-python_data_1958
|
s = float(input())
print(round(s))
s = float(input())
print(round(s+0.0005))
|
ConDefects/ConDefects/Code/abc226_a/Python/45900046
|
condefects-python_data_1959
|
X = float(input())
print(round(X))
X = float(input())
print(round(X + 0.00005))
|
ConDefects/ConDefects/Code/abc226_a/Python/46153240
|
condefects-python_data_1960
|
x = float(input())
print(int(round(x, 0)))
x = float(input())
print(int(round(x+0.0005, 0)))
|
ConDefects/ConDefects/Code/abc226_a/Python/44824039
|
condefects-python_data_1961
|
X = input()
print(int(float(X)+1))
X = input()
print(int(float(X)+0.5))
|
ConDefects/ConDefects/Code/abc226_a/Python/45214057
|
condefects-python_data_1962
|
n, l, r = map(int, input().split())
a = list(map(int, input().split()))
base = []
for i in a:
for j in base:
i = min(i, i ^ j)
if i:
base.append(i)
base.sort()
for i in range(len(base) - 1, -1, -1):
for j in range(i - 1, -1, -1):
base[i] = min(base[i], base[i] ^ base[j])
for i in base:
print(format(i, "08b"))
ans = []
l -= 1
while l != r:
sm = 0
for i in range(len(base)):
if (1 << i) & l:
sm ^= base[i]
l += 1
ans.append(sm)
print(*ans)
n, l, r = map(int, input().split())
a = list(map(int, input().split()))
base = []
for i in a:
for j in base:
i = min(i, i ^ j)
if i:
base.append(i)
base.sort()
for i in range(len(base) - 1, -1, -1):
for j in range(i - 1, -1, -1):
base[i] = min(base[i], base[i] ^ base[j])
ans = []
l -= 1
while l != r:
sm = 0
for i in range(len(base)):
if (1 << i) & l:
sm ^= base[i]
l += 1
ans.append(sm)
print(*ans)
|
ConDefects/ConDefects/Code/abc283_g/Python/42794591
|
condefects-python_data_1963
|
N,L,R = map(int,input().split())
L -= 1
R -= 1
A = list(map(int,input().split()))
A.sort()
base = []
for i in range(N):
a = A[i]
for e in base:
a = min(a,a^e)
for i in range(len(base)):
base[i] = min(base[i],a ^ base[i])
if a > 0:
base.append(a)
base.sort()
ans = []
for x in range(L,R+1):
res = 1
for j in range(60):
if (x >> j) & 1:
res ^= base[j]
ans.append(res)
print(*ans)
N,L,R = map(int,input().split())
L -= 1
R -= 1
A = list(map(int,input().split()))
A.sort()
base = []
for i in range(N):
a = A[i]
for e in base:
a = min(a,a^e)
for i in range(len(base)):
base[i] = min(base[i],a ^ base[i])
if a > 0:
base.append(a)
base.sort()
ans = []
for x in range(L,R+1):
res = 0
for j in range(60):
if (x >> j) & 1:
res ^= base[j]
ans.append(res)
print(*ans)
|
ConDefects/ConDefects/Code/abc283_g/Python/50031003
|
condefects-python_data_1964
|
from collections import defaultdict
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
way=[]
while True:
if self.parents[x] < 0:
break
else:
way.append(x)
x=self.parents[x]
for w in way:
self.parents[w]=x
return 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 noshi_base(A):
base=[]
for v in A:
for e in base:
v=min(v,v^e)
print(base)
'''
vの最上位bitを見る。
base 1
減る。baseの最上位bitは違うので変更して良い。
てか変更しなきゃダメ。
base 0
増える。
'''
for i in range(len(base)):
if (v^base[i])<base[i]:
base[i]^=v
print(v)
if v>0:
base.append(v)
return base
N,L,R=map(int,input().split())
A=list(map(int,input().split()))
base=noshi_base(A)
base.sort()
ans=[0 for _ in range(R-L+1)]
L-=1
R-=1
for i in range(L,R+1):
left=1
for j in range(len(base)):
if i&left:
ans[i-L]^=base[j]
left*=2
print(*ans)
from collections import defaultdict
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
way=[]
while True:
if self.parents[x] < 0:
break
else:
way.append(x)
x=self.parents[x]
for w in way:
self.parents[w]=x
return 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 noshi_base(A):
base=[]
for v in A:
for e in base:
v=min(v,v^e)
'''
vの最上位bitを見る。
base 1
減る。baseの最上位bitは違うので変更して良い。
てか変更しなきゃダメ。
base 0
増える。
'''
for i in range(len(base)):
if (v^base[i])<base[i]:
base[i]^=v
if v>0:
base.append(v)
return base
N,L,R=map(int,input().split())
A=list(map(int,input().split()))
base=noshi_base(A)
base.sort()
ans=[0 for _ in range(R-L+1)]
L-=1
R-=1
for i in range(L,R+1):
left=1
for j in range(len(base)):
if i&left:
ans[i-L]^=base[j]
left*=2
print(*ans)
|
ConDefects/ConDefects/Code/abc283_g/Python/51990912
|
condefects-python_data_1965
|
n,l,r = map(int,input().split())
a = list(map(int,input().split()))
v = []
for i in range(n):
w = a[i]
for e in v:
w = min(w, e^w)
if w > 0:
for j in range(len(v)):
v[j] = min(v[j], v[j] ^ w)
v.append(w)
v.sort()
#print(v)
ans = []
l-=1
r-=1
for i in range(l, r+1):
tmp = 0
for j in range(30):
if (i >> j & 1):
tmp ^= v[j]
ans.append(tmp)
print(*ans)
n,l,r = map(int,input().split())
a = list(map(int,input().split()))
v = []
for i in range(n):
w = a[i]
for e in v:
w = min(w, e^w)
if w > 0:
for j in range(len(v)):
v[j] = min(v[j], v[j] ^ w)
v.append(w)
v.sort()
#print(v)
ans = []
l-=1
r-=1
for i in range(l, r+1):
tmp = 0
for j in range(60):
if (i >> j & 1):
tmp ^= v[j]
ans.append(tmp)
print(*ans)
|
ConDefects/ConDefects/Code/abc283_g/Python/38648014
|
condefects-python_data_1966
|
n,l,r=map(int,input().split())
a=list(map(int,input().split()))
e=[]
for i in a:
now=i
for j in e:
now=min(now,now^j)
if now:
e.append(now)
e.sort(reverse=True)
for i in range(len(e)):
now=1<<(e[i].bit_length()-1)
for j in range(len(e)):
if i==j:
continue
if e[j]&now:
e[j]^=now
e.sort(reverse=True)
e.sort()
def f(x):
ans=0
for i in range(len(e)):
if x&1:
ans^=e[i]
x//=2
return ans
print(*[f(i) for i in range(l-1,r)])
n,l,r=map(int,input().split())
a=list(map(int,input().split()))
e=[]
for i in a:
now=i
for j in e:
now=min(now,now^j)
if now:
e.append(now)
e.sort(reverse=True)
for i in range(len(e)):
now=1<<(e[i].bit_length()-1)
for j in range(len(e)):
if i==j:
continue
if e[j]&now:
e[j]^=e[i]
e.sort(reverse=True)
e.sort()
def f(x):
ans=0
for i in range(len(e)):
if x&1:
ans^=e[i]
x//=2
return ans
print(*[f(i) for i in range(l-1,r)])
|
ConDefects/ConDefects/Code/abc283_g/Python/54268895
|
condefects-python_data_1967
|
string = input()
point_list = []
for x in string:
point_list.append(ord(x))
code_point = point_list[0]
for x in point_list:
if x == code_point:
continue
elif x-1 == code_point and x == code_point + 1:
code_point = x
else:
print('No')
exit()
print('Yes')
string = input()
point_list = []
for x in string:
point_list.append(ord(x))
code_point = point_list[0]
for x in point_list:
if x == code_point:
continue
elif x == code_point + 1 or x == code_point + 2:
code_point = x
else:
print('No')
exit()
print('Yes')
|
ConDefects/ConDefects/Code/abc337_b/Python/54960837
|
condefects-python_data_1968
|
S = input()
state = 0
for i in S:
if state == 0 and i == 'B':
state += 1
elif state == 1 and i == 'C':
state += 1
if state == 0 and i != 'A':
print("No")
exit()
elif state == 1 and i != 'B':
print("No")
exit()
elif state == 2 and i != 'C':
print("No")
exit()
print("Yes")
S = input()
state = 0
for i in S:
if state == 0 and i == 'B':
state += 1
elif state == 0 and i == 'C':
state += 2
elif state == 1 and i == 'C':
state += 1
if state == 0 and i != 'A':
print("No")
exit()
elif state == 1 and i != 'B':
print("No")
exit()
elif state == 2 and i != 'C':
print("No")
exit()
print("Yes")
|
ConDefects/ConDefects/Code/abc337_b/Python/54984614
|
condefects-python_data_1969
|
s = list(input())
ex_list = [s[0]]
for i in range(len(s)-1):
if s[i] != s[i+1]:
ex_list.append(s[i+1])
word = ''.join(ex_list)
if word in ['ABC', 'A', 'B', 'C', 'AC', 'BC']:
print('Yes')
else:
print('No')
s = list(input())
ex_list = [s[0]]
for i in range(len(s)-1):
if s[i] != s[i+1]:
ex_list.append(s[i+1])
word = ''.join(ex_list)
if word in ['ABC', 'A', 'B', 'C','AB', 'AC', 'BC']:
print('Yes')
else:
print('No')
|
ConDefects/ConDefects/Code/abc337_b/Python/54959734
|
condefects-python_data_1970
|
# ref: https://qiita.com/Kota-Y/items/396ab3c57830dad65cfb
import sys
import re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement, permutations
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
def input(): return sys.stdin.readline().strip()
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input() for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
def rotate90(S): return list(zip(*S[::-1]))
def rotate180(S): return list(zip(*list(zip(*S[::-1]))[::-1]))
def rotate270(S): return list(zip(*S))[::-1]
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
DIRECTION = [
(1, 0),
(1, 1),
(0, 1),
(-1, 1),
(-1, 0),
(-1, -1),
(0, -1),
(1, -1),
]
def main():
N, K = i_map()
A = i_list()
A.sort()
# rest = N
# takahashi = 0
# aoki = 0
# i = 0
# while True:
# idx = bisect_right(A, rest)
# if idx == 0:
# n = A[0]
# else:
# n = A[idx-1]
# if rest < n:
# break
# if i % 2 == 0:
# takahashi += n
# else:
# aoki += n
# rest -= n
# # print(f"n: {n}, takahashi: {takahashi}, aoki: {aoki}, rest: {rest}")
# i += 1
# print(takahashi)
dp = [0 for _ in range(N+1)]
for i in range(1, N+1):
for a in A:
if i - a >= 0:
dp[i] = a + (i - a) - dp[i-a]
# print(dp)
print(dp[-1])
if __name__ == '__main__':
main()
# ref: https://qiita.com/Kota-Y/items/396ab3c57830dad65cfb
import sys
import re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement, permutations
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
def input(): return sys.stdin.readline().strip()
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input() for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
def rotate90(S): return list(zip(*S[::-1]))
def rotate180(S): return list(zip(*list(zip(*S[::-1]))[::-1]))
def rotate270(S): return list(zip(*S))[::-1]
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
DIRECTION = [
(1, 0),
(1, 1),
(0, 1),
(-1, 1),
(-1, 0),
(-1, -1),
(0, -1),
(1, -1),
]
def main():
N, K = i_map()
A = i_list()
A.sort()
# rest = N
# takahashi = 0
# aoki = 0
# i = 0
# while True:
# idx = bisect_right(A, rest)
# if idx == 0:
# n = A[0]
# else:
# n = A[idx-1]
# if rest < n:
# break
# if i % 2 == 0:
# takahashi += n
# else:
# aoki += n
# rest -= n
# # print(f"n: {n}, takahashi: {takahashi}, aoki: {aoki}, rest: {rest}")
# i += 1
# print(takahashi)
dp = [0 for _ in range(N+1)]
for i in range(1, N+1):
for a in A:
if i - a >= 0:
dp[i] = max(dp[i], a + (i - a) - dp[i-a])
# print(dp)
print(dp[-1])
if __name__ == '__main__':
main()
|
ConDefects/ConDefects/Code/abc270_d/Python/45974029
|
condefects-python_data_1971
|
# import sys
# sys.setrecursionlimit(10**6)
import re
import copy
import bisect
import math
import itertools
from collections import deque
from collections import defaultdict
from collections import Counter
from heapq import heapify, heappush, heappop, heappushpop, heapreplace
from functools import cmp_to_key as cmpk
import functools
al = "abcdefghijklmnopqrstuvwxyz"
au = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
def ii():
return int(input())
def gl():
return list(map(int, input().split()))
def gs():
return list(input().split())
def gr(l):
res = itertools.groupby(l)
return list([(key, len(list(v))) for key, v in res])
class UnionFind():
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 glm(h,w):
a = []
for i in range(h):
a.append(gl())
return a
def gsm(h,w):
a = []
for i in range(h):
a.append(input())
return a
def kiriage(n, r):
if n % r == 0:
return n // r
else:
return (n // r) + 1
def next_perm(a):
l = copy.copy(a)
l = list(l)
i = len(l) - 2
while 0 <= i and l[i] >= l[i+1]:
i -= 1
if i == 1:
return False
j = len(l) - 1
while not (l[i] < l[j]):
j -= 1
l[i], l[j] = l[j], l[i]
return l[:i+1] + rev(l[i+1:])
def yaku(n):
ans = []
for i in range(1, int(math.sqrt(n)) + 1):
if n % i == 0:
ans.append(i)
ans.append(n // i)
return ans
def ketawa(n):
ans = 0
s = str(n)
for i in s:
ans += int(i)
return ans
def rev(a):
a = a[:]
return list(reversed(a))
def lcm2(x, y):
return (x * y) // math.gcd(x, y)
def lcm3(*ints):
return functools.reduce(lcm2, ints)
def gcd3(*ints):
return functools.reduce(math.gcd, ints)
def cntsep(a, b, k):
r = a % k
m = a - r
ans = (b - m) // (k+1)
if r > 0:
ans -= 1
return ans
def putedges(g, idx = 0):
n = len(g)
e = []
cnt2 = 0
for i in range(n):
for j in g[i]:
cnt2 += 1
e.append((i, j))
m = len(g)
print(n, cnt2)
for i in e:
if idx == 0:
print(*[i[0], i[1]])
else:
print(*[i[0] + 1, i[1] + 1])
def drev(d):
newd = {}
for k in rev(list(d.keys())):
newd[k] = d[k]
return newd
def dvsort(d):
return dict(sorted(d.items(), key = lambda x: x[1]))
def dksort(d):
return dict(sorted(d.items()))
def rmwh(a):
while not '#' in a[0]:
a = a[1:]
while not '#' in a[-1]:
a = a[:-1]
ok = True
while True:
for y in range(len(a)):
if a[y][0] == '#':
ok = False
if ok:
for y in range(len(a)):
a[y] = a[y][1:]
else:
break
ok = True
while True:
for y in range(len(a)):
if a[y][-1] == '#':
ok = False
if ok:
for y in range(len(a)):
a[y] = a[y][:-1]
else:
break
return a
def comb_cnt(n, k):
return math.factorial(n) // (math.factorial(n - k) * math.factorial(k))
def sinhen(n, l):
if n < l:
return [n]
else:
return sinhen(n // l, l) + [n % l]
# from decimal import *
# def myround(x, k):
# if k < 0:
# return float(Decimal(str(x)).quantize(Decimal('1E' + str(k+1)), rounding = ROUND_HALF_UP))
# else:
# return int(Decimal(str(x)).quantize(Decimal('1E' + str(k+1)), rounding = ROUND_HALF_UP))
def cnt_com(l1, r1, l2, r2):
if l1 > l2:
l1, l2, r1, r2 = l2, l1, r2, r1
if l1 <= l2 and l2 <= r2 and r2 <= r1:
return r2 - l2
elif l1 <= l2 and l2 <= r1 and r1 <= r2:
return r1 - l2
elif r1 <= l2:
return 0
def cut_yoko(a, y):
a_copy = copy.deepcopy(a)
res = []
for x in range(len(a[0])):
res.append(a_copy[y][x])
return res
def cut_tate(a, x):
a_copy = copy.deepcopy(a)
res = []
for y in range(len(a)):
res.append(a_copy[y][x])
return res
def zalg(s):
n = len(s)
a = [0] * n
i = 1
j = 0
a[0] = len(s)
l = len(s)
while i < l:
while i + j < l and s[j] == s[i+j]:
j += 1
if not j:
i += 1
continue
a[i] = j
k = 1
while l-i > k < j - a[k]:
a[i+k] = a[k]
k += 1
i += k
j -= k
return a
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedSet(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] < a[i + 1] for i in range(len(a) - 1)):
a = sorted(set(a))
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedSet" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]: break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def add(self, x: T) -> bool:
"Add an element and return True if added. / O(竏哢)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return True
a, i = self._position(x)
if i != len(a) and a[i] == x: return False
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
return True
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(竏哢)"
if self.size == 0: return False
a, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return self._pop(a, i)
else:
for a in self.a:
if i < len(a): return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedMultiset(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
a = sorted(a)
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedMultiset" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]: break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def count(self, x: T) -> int:
"Count the number of x."
return self.index_right(x) - self.index(x)
def add(self, x: T) -> None:
"Add an element. / O(竏哢)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return
a, i = self._position(x)
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(竏哢)"
if self.size == 0: return False
a, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return self._pop(a, i)
else:
for a in self.a:
if i < len(a): return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
def dijkstra(g, st):
vi = set()
res = [inf for i in range(len(g))]
res[st] = 0
s = SortedSet([])
s.add((0, st))
while len(s) != 0:
dis, now = s.pop(0)
vi.add(now)
# print(s, res, now, dis)
for to in g[now].keys():
if to in vi:
continue
w = g[now][to]
if dis + w <= res[to]:
if res[to] == inf:
s.add((dis + w, to))
res[to] = dis + w
else:
r = s.discard((res[to], to))
if r == False:
print('discard error')
print(s)
print(res[to], to)
s.add((dis + w, to))
res[to] = dis + w
return res
def mbs(a, key):
ng = -1
ok = len(a)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if a[mid] >= key:
ok = mid
else:
ng = mid
return ok
def satlow(f, lower = 0, upper = 10**9):
ng = lower
ok = upper
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if f(mid):
ok = mid
else:
ng = mid
return ok
def listsatlow(a, f):
ng = -1
ok = len(a)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if f(a[mid]):
ok = mid
else:
ng = mid
return ok
inf = float('inf')
ans = inf
cnt=0
ay="Yes"
an="No"
#main
n, k = gl()
a = gl()
dp = [0 for i in range(n+1)]
dp[1] = 1
for i in range(2, n+1):
cnt = 0
for j in range(k):
if a[j] > i:
break
get = a[j] + dp[i - a[j] - dp[i - a[j]]]
dp[i] = max(dp[i], get)
print(dp[n])
# import sys
# sys.setrecursionlimit(10**6)
import re
import copy
import bisect
import math
import itertools
from collections import deque
from collections import defaultdict
from collections import Counter
from heapq import heapify, heappush, heappop, heappushpop, heapreplace
from functools import cmp_to_key as cmpk
import functools
al = "abcdefghijklmnopqrstuvwxyz"
au = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
def ii():
return int(input())
def gl():
return list(map(int, input().split()))
def gs():
return list(input().split())
def gr(l):
res = itertools.groupby(l)
return list([(key, len(list(v))) for key, v in res])
class UnionFind():
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 glm(h,w):
a = []
for i in range(h):
a.append(gl())
return a
def gsm(h,w):
a = []
for i in range(h):
a.append(input())
return a
def kiriage(n, r):
if n % r == 0:
return n // r
else:
return (n // r) + 1
def next_perm(a):
l = copy.copy(a)
l = list(l)
i = len(l) - 2
while 0 <= i and l[i] >= l[i+1]:
i -= 1
if i == 1:
return False
j = len(l) - 1
while not (l[i] < l[j]):
j -= 1
l[i], l[j] = l[j], l[i]
return l[:i+1] + rev(l[i+1:])
def yaku(n):
ans = []
for i in range(1, int(math.sqrt(n)) + 1):
if n % i == 0:
ans.append(i)
ans.append(n // i)
return ans
def ketawa(n):
ans = 0
s = str(n)
for i in s:
ans += int(i)
return ans
def rev(a):
a = a[:]
return list(reversed(a))
def lcm2(x, y):
return (x * y) // math.gcd(x, y)
def lcm3(*ints):
return functools.reduce(lcm2, ints)
def gcd3(*ints):
return functools.reduce(math.gcd, ints)
def cntsep(a, b, k):
r = a % k
m = a - r
ans = (b - m) // (k+1)
if r > 0:
ans -= 1
return ans
def putedges(g, idx = 0):
n = len(g)
e = []
cnt2 = 0
for i in range(n):
for j in g[i]:
cnt2 += 1
e.append((i, j))
m = len(g)
print(n, cnt2)
for i in e:
if idx == 0:
print(*[i[0], i[1]])
else:
print(*[i[0] + 1, i[1] + 1])
def drev(d):
newd = {}
for k in rev(list(d.keys())):
newd[k] = d[k]
return newd
def dvsort(d):
return dict(sorted(d.items(), key = lambda x: x[1]))
def dksort(d):
return dict(sorted(d.items()))
def rmwh(a):
while not '#' in a[0]:
a = a[1:]
while not '#' in a[-1]:
a = a[:-1]
ok = True
while True:
for y in range(len(a)):
if a[y][0] == '#':
ok = False
if ok:
for y in range(len(a)):
a[y] = a[y][1:]
else:
break
ok = True
while True:
for y in range(len(a)):
if a[y][-1] == '#':
ok = False
if ok:
for y in range(len(a)):
a[y] = a[y][:-1]
else:
break
return a
def comb_cnt(n, k):
return math.factorial(n) // (math.factorial(n - k) * math.factorial(k))
def sinhen(n, l):
if n < l:
return [n]
else:
return sinhen(n // l, l) + [n % l]
# from decimal import *
# def myround(x, k):
# if k < 0:
# return float(Decimal(str(x)).quantize(Decimal('1E' + str(k+1)), rounding = ROUND_HALF_UP))
# else:
# return int(Decimal(str(x)).quantize(Decimal('1E' + str(k+1)), rounding = ROUND_HALF_UP))
def cnt_com(l1, r1, l2, r2):
if l1 > l2:
l1, l2, r1, r2 = l2, l1, r2, r1
if l1 <= l2 and l2 <= r2 and r2 <= r1:
return r2 - l2
elif l1 <= l2 and l2 <= r1 and r1 <= r2:
return r1 - l2
elif r1 <= l2:
return 0
def cut_yoko(a, y):
a_copy = copy.deepcopy(a)
res = []
for x in range(len(a[0])):
res.append(a_copy[y][x])
return res
def cut_tate(a, x):
a_copy = copy.deepcopy(a)
res = []
for y in range(len(a)):
res.append(a_copy[y][x])
return res
def zalg(s):
n = len(s)
a = [0] * n
i = 1
j = 0
a[0] = len(s)
l = len(s)
while i < l:
while i + j < l and s[j] == s[i+j]:
j += 1
if not j:
i += 1
continue
a[i] = j
k = 1
while l-i > k < j - a[k]:
a[i+k] = a[k]
k += 1
i += k
j -= k
return a
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedSet(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] < a[i + 1] for i in range(len(a) - 1)):
a = sorted(set(a))
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedSet" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]: break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def add(self, x: T) -> bool:
"Add an element and return True if added. / O(竏哢)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return True
a, i = self._position(x)
if i != len(a) and a[i] == x: return False
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
return True
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(竏哢)"
if self.size == 0: return False
a, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return self._pop(a, i)
else:
for a in self.a:
if i < len(a): return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedMultiset(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
a = sorted(a)
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedMultiset" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]: break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def count(self, x: T) -> int:
"Count the number of x."
return self.index_right(x) - self.index(x)
def add(self, x: T) -> None:
"Add an element. / O(竏哢)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return
a, i = self._position(x)
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(竏哢)"
if self.size == 0: return False
a, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return self._pop(a, i)
else:
for a in self.a:
if i < len(a): return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
def dijkstra(g, st):
vi = set()
res = [inf for i in range(len(g))]
res[st] = 0
s = SortedSet([])
s.add((0, st))
while len(s) != 0:
dis, now = s.pop(0)
vi.add(now)
# print(s, res, now, dis)
for to in g[now].keys():
if to in vi:
continue
w = g[now][to]
if dis + w <= res[to]:
if res[to] == inf:
s.add((dis + w, to))
res[to] = dis + w
else:
r = s.discard((res[to], to))
if r == False:
print('discard error')
print(s)
print(res[to], to)
s.add((dis + w, to))
res[to] = dis + w
return res
def mbs(a, key):
ng = -1
ok = len(a)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if a[mid] >= key:
ok = mid
else:
ng = mid
return ok
def satlow(f, lower = 0, upper = 10**9):
ng = lower
ok = upper
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if f(mid):
ok = mid
else:
ng = mid
return ok
def listsatlow(a, f):
ng = -1
ok = len(a)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if f(a[mid]):
ok = mid
else:
ng = mid
return ok
inf = float('inf')
ans = inf
cnt=0
ay="Yes"
an="No"
#main
n, k = gl()
a = gl()
dp = [0 for i in range(n+1)]
dp[1] = 1
for i in range(2, n+1):
cnt = 0
for j in range(k):
if a[j] > i:
break
get = a[j] +i - a[j] - dp[i - a[j]]
dp[i] = max(dp[i], get)
print(dp[n])
|
ConDefects/ConDefects/Code/abc270_d/Python/45126109
|
condefects-python_data_1972
|
N,Q=map(int,input().split())
S=input()
#Segment Tree
def operator(x,y): #行う計算
return x+y
identity=0 #単位元
def stcreate(N:int): #セグメント木の生成,N=要素数
nl=(N-1).bit_length()
ST=[identity]*(2**(nl+1))
return ST
def stupdate(ST:list,i:int,x): #値の更新
ci=(len(ST)>>1)+i
ST[ci]=x
ci>>=1
while ci>0:
ST[ci]=operator(ST[ci*2],ST[ci*2+1])
ci>>=1
def stget(ST:list,l:int,r:int): #区間値の取得
d=(len(ST)>>1)
cl=d+l
cr=d+r
s=identity
while cl<=cr:
if cl%2==1:
s=operator(s,ST[cl])
cl+=1
if cr%2==0:
s=operator(s,ST[cr])
cr-=1
cl>>=1
cr>>=1
return s
ST=stcreate(N-1)
for i in range(N-1):
if S[i]!=S[i+1]:
stupdate(ST,i,1)
for i in range(Q):
l,r=map(int,input().split())
if l==r:
print(0)
else:
s=stget(ST,l-1,r-2)
print((s+1)//2)
N,Q=map(int,input().split())
S=input()
#Segment Tree
def operator(x,y): #行う計算
return x+y
identity=0 #単位元
def stcreate(N:int): #セグメント木の生成,N=要素数
nl=(N-1).bit_length()
ST=[identity]*(2**(nl+1))
return ST
def stupdate(ST:list,i:int,x): #値の更新
ci=(len(ST)>>1)+i
ST[ci]=x
ci>>=1
while ci>0:
ST[ci]=operator(ST[ci*2],ST[ci*2+1])
ci>>=1
def stget(ST:list,l:int,r:int): #区間値の取得
d=(len(ST)>>1)
cl=d+l
cr=d+r
s=identity
while cl<=cr:
if cl%2==1:
s=operator(s,ST[cl])
cl+=1
if cr%2==0:
s=operator(s,ST[cr])
cr-=1
cl>>=1
cr>>=1
return s
ST=stcreate(N-1)
for i in range(N-1):
if S[i]!=S[i+1]:
stupdate(ST,i,1)
for i in range(Q):
l,r=map(int,input().split())
if l==r:
print(0)
else:
s=stget(ST,l-1,r-2)
if S[l-1]!=S[r-1]:
s+=1
print((s+1)//2)
|
ConDefects/ConDefects/Code/agc059_a/Python/38137266
|
condefects-python_data_1973
|
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, Q = mapint()
S = list(input())
LR = [mapint() for _ in range(Q)]
last = "-"
diffs = [0]*N
for i in range(N):
s = S[i]
if s!=last:
diffs[i] = 1
last = s
from itertools import accumulate
diff_cum = [0]+list(accumulate(diffs))
for l, r in LR:
ans = diff_cum[r] - diff_cum[l-1]
if diffs[l-1]==1:
ans -= 1
ans = -(-ans//2)
print(ans)
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, Q = mapint()
S = list(input())
LR = [mapint() for _ in range(Q)]
last = "-"
diffs = [0]*N
for i in range(N):
s = S[i]
if s!=last:
diffs[i] = 1
last = s
from itertools import accumulate
diff_cum = [0]+list(accumulate(diffs))
for l, r in LR:
ans = diff_cum[r] - diff_cum[l-1]
if diffs[l-1]==1:
ans -= 1
if S[l-1]!=S[r-1]:
ans += 1
ans = -(-ans//2)
print(ans)
|
ConDefects/ConDefects/Code/agc059_a/Python/37052492
|
condefects-python_data_1974
|
import sys,os
from math import gcd,log
from bisect import bisect as bi
from collections import defaultdict,Counter
input=sys.stdin.readline
I = lambda : list(map(int,input().split()))
from heapq import heappush,heappop
import random as rd
tree = [0]*(10**6)
def merge(xx,yy):
if xx[0]=="":
return yy
if yy[0]=='':
return xx
x,k,lt,rt = xx
x1,k1,lt1,rt1 = yy
if lt>lt1:
x,k,lt,rt = yy
x1,k1,lt1,rt1 = xx
k+=k1
if x[-1]!=x1[0]:
k+=1
return [x[0]+x1[-1],k,lt,rt1]
from math import ceil, log2
class segment_tree:
# merge(left, right): function used to merge the two halves
# basef(value): function applied on individual values
# basev: identity for merge function, merger(value, basev) = value
# update(node_value, old, new): function to update the nodes
def __init__(self, array, merge=lambda x,y:x+y, basef=lambda x:x, basev = 0):
self.merge = merge
self.basef = basef
self.basev = basev
self.n = len(array)
self.array = array
self.tree = [0] * ( 2**ceil(log2(len(array))+1) - 1 )
self.build(array)
def __str__(self):
return ' '.join([str(x) for x in self.tree])
def _build_util(self, l, r, i, a):
if(l==r):
self.tree[i] = self.basef(l)
return self.tree[i]
mid = (l+r)//2
self.tree[i] = self.merge(self._build_util(l,mid, 2*i+1, a), self._build_util(mid+1, r, 2*i+2, a))
return self.tree[i]
def build(self, a):
self._build_util(0, len(a)-1, 0, a)
def _query_util(self, i, ln, rn, l, r):
if ln>=l and rn<=r:
return self.tree[i]
if ln>r or rn<l:
return self.basev
return self.merge( self._query_util( 2*i+1, ln, (ln+rn)//2, l, r ), self._query_util( 2*i+2, (ln+rn)//2+1, rn, l, r ) )
def query(self, l, r):
return self._query_util( 0, 0, self.n-1, l, r )
def _update_util(self, i, ln, rn, x, v):
if x>=ln and x<=rn:
if ln != rn:
self._update_util( 2*i+1, ln, (ln+rn)//2, x, v )
self._update_util( 2*i+2, (ln+rn)//2 + 1, rn, x, v )
self.tree[i] = self.merge(self.tree[2*i+1], self.tree[2*i+2])
else:
self.tree[i] = self.basef(ln)
def update(self, x, v):
self._update_util( 0, 0, self.n-1, x, v )
self.array[x] =v
# def buildTree(a,n):
# for i in range(n):
# tree[n + i] = [s[i],int(a[i]=='A'),int(a[i]=='B'),int(a[i]=='C'),i,i]
# for i in range(n - 1, 0, -1):
# tree[i] = merge(tree[2*i],tree[2*i+1])
# #function to find sum on different range
# def queryTree(l, r):
# su = ["",0,0,0,0,0]
# l += n
# r += n
# while l < r:
# if ((l & 1)>0):
# su = merge(su,tree[l])
# l += 1
# print(su)
# if ((r & 1)>0):
# r -= 1
# su = merge(su,tree[r])
# print(su)
# l =l//2
# r =r//2
# x,a,b,c,i,j = su
# return a+b+c - max(a,b,c)
n,q = I()
s = input().strip()
st = segment_tree(s,merge = merge,basef = lambda i: [s[i],0,i,i] ,basev = ["",0,0,0])
#buildTree(s,n)
#print(tree[:40])
for i in range(q):
l,r = I()
val,k,_,_ = st.query(l-1,r-1)
print((k+1)//2)
import sys,os
from math import gcd,log
from bisect import bisect as bi
from collections import defaultdict,Counter
input=sys.stdin.readline
I = lambda : list(map(int,input().split()))
from heapq import heappush,heappop
import random as rd
tree = [0]*(10**6)
def merge(xx,yy):
if xx[0]=="":
return yy
if yy[0]=='':
return xx
x,k,lt,rt = xx
x1,k1,lt1,rt1 = yy
if lt>lt1:
x,k,lt,rt = yy
x1,k1,lt1,rt1 = xx
k+=k1
if x[-1]!=x1[0]:
k+=1
return [x[0]+x1[-1],k,lt,rt1]
from math import ceil, log2
class segment_tree:
# merge(left, right): function used to merge the two halves
# basef(value): function applied on individual values
# basev: identity for merge function, merger(value, basev) = value
# update(node_value, old, new): function to update the nodes
def __init__(self, array, merge=lambda x,y:x+y, basef=lambda x:x, basev = 0):
self.merge = merge
self.basef = basef
self.basev = basev
self.n = len(array)
self.array = array
self.tree = [0] * ( 2**ceil(log2(len(array))+1) - 1 )
self.build(array)
def __str__(self):
return ' '.join([str(x) for x in self.tree])
def _build_util(self, l, r, i, a):
if(l==r):
self.tree[i] = self.basef(l)
return self.tree[i]
mid = (l+r)//2
self.tree[i] = self.merge(self._build_util(l,mid, 2*i+1, a), self._build_util(mid+1, r, 2*i+2, a))
return self.tree[i]
def build(self, a):
self._build_util(0, len(a)-1, 0, a)
def _query_util(self, i, ln, rn, l, r):
if ln>=l and rn<=r:
return self.tree[i]
if ln>r or rn<l:
return self.basev
return self.merge( self._query_util( 2*i+1, ln, (ln+rn)//2, l, r ), self._query_util( 2*i+2, (ln+rn)//2+1, rn, l, r ) )
def query(self, l, r):
return self._query_util( 0, 0, self.n-1, l, r )
def _update_util(self, i, ln, rn, x, v):
if x>=ln and x<=rn:
if ln != rn:
self._update_util( 2*i+1, ln, (ln+rn)//2, x, v )
self._update_util( 2*i+2, (ln+rn)//2 + 1, rn, x, v )
self.tree[i] = self.merge(self.tree[2*i+1], self.tree[2*i+2])
else:
self.tree[i] = self.basef(ln)
def update(self, x, v):
self._update_util( 0, 0, self.n-1, x, v )
self.array[x] =v
# def buildTree(a,n):
# for i in range(n):
# tree[n + i] = [s[i],int(a[i]=='A'),int(a[i]=='B'),int(a[i]=='C'),i,i]
# for i in range(n - 1, 0, -1):
# tree[i] = merge(tree[2*i],tree[2*i+1])
# #function to find sum on different range
# def queryTree(l, r):
# su = ["",0,0,0,0,0]
# l += n
# r += n
# while l < r:
# if ((l & 1)>0):
# su = merge(su,tree[l])
# l += 1
# print(su)
# if ((r & 1)>0):
# r -= 1
# su = merge(su,tree[r])
# print(su)
# l =l//2
# r =r//2
# x,a,b,c,i,j = su
# return a+b+c - max(a,b,c)
n,q = I()
s = input().strip()
st = segment_tree(s,merge = merge,basef = lambda i: [s[i],0,i,i] ,basev = ["",0,0,0])
#buildTree(s,n)
#print(tree[:40])
for i in range(q):
l,r = I()
val,k,_,_ = st.query(l-1,r-1)
if s[l-1]!=s[r-1]:
k+=1
print((k+1)//2)
|
ConDefects/ConDefects/Code/agc059_a/Python/37117986
|
condefects-python_data_1975
|
def solve(k):
if k <= 2:
return k
if k % 2 == 0:
return (k - 2) // 2 + 2
return (k - 1) // 2 + 1
class LazySegTree:
"X × G --> X"
"Fill in the brackets."
X_e = 0
G_e = X_e
@classmethod
def X_op(cls, x, y):
return x + y
@classmethod
def G_op(cls, a, b):
return cls.X_op(a, b)
@classmethod
def action(cls, x, a):
return cls.X_op(x, a)
"Up to here."
def __init__(self, A):
self.N = len(A)
self.X = [self.X_e] * (2 * self.N)
self.G = [self.G_e] * (2 * self.N)
for i, x in enumerate(A, self.N):
self.X[i] = x
for i in range(self.N - 1, 0, -1):
self.X[i] = self.X_op(self.X[i << 1], self.X[i << 1 | 1])
def _eval_at(self, i):
return self.action(self.X[i], self.G[i])
def _propagate_at(self, i):
self.X[i] = self._eval_at(i)
self.G[i << 1] = self.G_op(self.G[i << 1], self.G[i])
self.G[i << 1 | 1] = self.G_op(self.G[i << 1 | 1], self.G[i])
self.G[i] = self.G_e
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.X_op(self._eval_at(i << 1), self._eval_at(i << 1 | 1))
def __iter__(self):
for i in range(self.N):
yield self.X[self.N + i]
def __getitem__(self, i):
i %= self.N
return self.X[self.N + i]
def __setitem__(self, i, x):
i %= self.N
i += self.N
self._propagate_above(i)
self.X[i] = x
self.G[i] = self.G_e
self._recalc_above(i)
def prod(self, L, R):
L += self.N
R += self.N
self._propagate_above(L // (L & -L))
self._propagate_above(R // (R & -R) - 1)
vL = self.X_e
vR = self.X_e
while L < R:
if L & 1:
vL = self.X_op(vL, self._eval_at(L))
L += 1
if R & 1:
R -= 1
vR = self.X_op(self._eval_at(R), vR)
L >>= 1
R >>= 1
return self.X_op(vL, vR)
def ranged_act(self, L, R, a):
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.G[L] = self.G_op(self.G[L], a)
L += 1
if R & 1:
R -= 1
self.G[R] = self.G_op(self.G[R], a)
L >>= 1
R >>= 1
self._recalc_above(L0)
self._recalc_above(R0)
def __repr__(self):
for i in range(self.N, 2 * self.N):
self._propagate_above(i)
self.X[i] = self._eval_at(i)
return str(self.X[self.N:])
N, Q = map(int, input().split())
S = input()
seg = LazySegTree([0] * N)
for i in range(N - 1):
s, t = S[i], S[i + 1]
if s != t:
seg[i + 1] = 1
print(seg)
for _ in range(Q):
L, R = map(int, input().split())
s, t = S[L - 1], S[R - 1]
k = seg.prod(L, R - 1 + 1)
if s == t:
k = max(k - 1, 0)
print(solve(k))
def solve(k):
if k <= 2:
return k
if k % 2 == 0:
return (k - 2) // 2 + 2
return (k - 1) // 2 + 1
class LazySegTree:
"X × G --> X"
"Fill in the brackets."
X_e = 0
G_e = X_e
@classmethod
def X_op(cls, x, y):
return x + y
@classmethod
def G_op(cls, a, b):
return cls.X_op(a, b)
@classmethod
def action(cls, x, a):
return cls.X_op(x, a)
"Up to here."
def __init__(self, A):
self.N = len(A)
self.X = [self.X_e] * (2 * self.N)
self.G = [self.G_e] * (2 * self.N)
for i, x in enumerate(A, self.N):
self.X[i] = x
for i in range(self.N - 1, 0, -1):
self.X[i] = self.X_op(self.X[i << 1], self.X[i << 1 | 1])
def _eval_at(self, i):
return self.action(self.X[i], self.G[i])
def _propagate_at(self, i):
self.X[i] = self._eval_at(i)
self.G[i << 1] = self.G_op(self.G[i << 1], self.G[i])
self.G[i << 1 | 1] = self.G_op(self.G[i << 1 | 1], self.G[i])
self.G[i] = self.G_e
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.X_op(self._eval_at(i << 1), self._eval_at(i << 1 | 1))
def __iter__(self):
for i in range(self.N):
yield self.X[self.N + i]
def __getitem__(self, i):
i %= self.N
return self.X[self.N + i]
def __setitem__(self, i, x):
i %= self.N
i += self.N
self._propagate_above(i)
self.X[i] = x
self.G[i] = self.G_e
self._recalc_above(i)
def prod(self, L, R):
L += self.N
R += self.N
self._propagate_above(L // (L & -L))
self._propagate_above(R // (R & -R) - 1)
vL = self.X_e
vR = self.X_e
while L < R:
if L & 1:
vL = self.X_op(vL, self._eval_at(L))
L += 1
if R & 1:
R -= 1
vR = self.X_op(self._eval_at(R), vR)
L >>= 1
R >>= 1
return self.X_op(vL, vR)
def ranged_act(self, L, R, a):
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.G[L] = self.G_op(self.G[L], a)
L += 1
if R & 1:
R -= 1
self.G[R] = self.G_op(self.G[R], a)
L >>= 1
R >>= 1
self._recalc_above(L0)
self._recalc_above(R0)
def __repr__(self):
for i in range(self.N, 2 * self.N):
self._propagate_above(i)
self.X[i] = self._eval_at(i)
return str(self.X[self.N:])
N, Q = map(int, input().split())
S = input()
seg = LazySegTree([0] * N)
for i in range(N - 1):
s, t = S[i], S[i + 1]
if s != t:
seg[i + 1] = 1
# print(seg)
for _ in range(Q):
L, R = map(int, input().split())
s, t = S[L - 1], S[R - 1]
k = seg.prod(L, R - 1 + 1)
if s == t:
k = max(k - 1, 0)
print(solve(k))
|
ConDefects/ConDefects/Code/agc059_a/Python/37116120
|
condefects-python_data_1976
|
n, q = map(int, input().split())
s = input()
pre = [0] * n
for i in range(1, n):
pre[i] = pre[i-1] + (s[i] != s[i-1])
for i in range(q):
l, r = map(int, input().split())
l -= 1
r -= 1
ans = pre[r] - pre[l]
ans += s[r] != s[l]
print(ans)
n, q = map(int, input().split())
s = input()
pre = [0] * n
for i in range(1, n):
pre[i] = pre[i-1] + (s[i] != s[i-1])
for i in range(q):
l, r = map(int, input().split())
l -= 1
r -= 1
ans = pre[r] - pre[l]
ans += s[r] != s[l]
print((ans + 1) // 2)
|
ConDefects/ConDefects/Code/agc059_a/Python/37644565
|
condefects-python_data_1977
|
from itertools import accumulate
N, Q = map(int, input().split())
S = input()
A = [0]*N
for i in range(N-1):
if S[i] != S[i+1]:
A[i+1] = 1
B = list(accumulate(A))
for _ in range(Q):
l, r = map(int, input().split())
l -= 1
r -= 1
x = B[r]-B[l]
print(-(-x//2))
from itertools import accumulate
N, Q = map(int, input().split())
S = input()
A = [0]*N
for i in range(N-1):
if S[i] != S[i+1]:
A[i+1] = 1
B = list(accumulate(A))
for _ in range(Q):
l, r = map(int, input().split())
l -= 1
r -= 1
x = B[r]-B[l]
if S[l] != S[r]:
x += 1
print(-(-x//2))
|
ConDefects/ConDefects/Code/agc059_a/Python/38508739
|
condefects-python_data_1978
|
from collections import defaultdict
T = int(input())
def solve2(x: str, y:str) -> bool:
cnt_x: defaultdict[str, int] = defaultdict(int)
cnt_y: defaultdict[str, int] = defaultdict(int)
for c in x:
cnt_x[c] += 1
for c in y:
cnt_y[c] += 1
if (cnt_x["A"] > cnt_y["A"] or cnt_x["B"] > cnt_y["B"]):
return False
n = cnt_y["A"] - cnt_x["A"]
l = list(x)
for i in range(len(l)):
if l[i] == "C":
if n > 0:
l[i] = "A"
n -= 1
else:
l[i] = "B"
x = "".join(l)
print(x, y)
cy, cx = 0, 0
for xx, yy in zip(x, y):
cx += 1 if xx == "B" else 0
cy += 1 if yy == "B" else 0
if cx > cy:
return False
return True
def solve(x: str, y: str) -> bool:
y_s = y.split("C")
i = 0
x_s: list[str] = []
for j, s in enumerate(y_s):
idx = i + len(s)
if (j+1 != len(y_s) and x[idx] != "C"):
return False
else:
x_s.append(x[i:idx])
i = idx + 1
return all([solve2(x, y) for x, y in zip(x_s, y_s)])
for _ in range(T):
n, x, y = input().split()
if solve(x, y):
print("Yes")
else:
print("No")
from collections import defaultdict
T = int(input())
def solve2(x: str, y:str) -> bool:
cnt_x: defaultdict[str, int] = defaultdict(int)
cnt_y: defaultdict[str, int] = defaultdict(int)
for c in x:
cnt_x[c] += 1
for c in y:
cnt_y[c] += 1
if (cnt_x["A"] > cnt_y["A"] or cnt_x["B"] > cnt_y["B"]):
return False
n = cnt_y["A"] - cnt_x["A"]
l = list(x)
for i in range(len(l)):
if l[i] == "C":
if n > 0:
l[i] = "A"
n -= 1
else:
l[i] = "B"
x = "".join(l)
# print(x, y)
cy, cx = 0, 0
for xx, yy in zip(x, y):
cx += 1 if xx == "B" else 0
cy += 1 if yy == "B" else 0
if cx > cy:
return False
return True
def solve(x: str, y: str) -> bool:
y_s = y.split("C")
i = 0
x_s: list[str] = []
for j, s in enumerate(y_s):
idx = i + len(s)
if (j+1 != len(y_s) and x[idx] != "C"):
return False
else:
x_s.append(x[i:idx])
i = idx + 1
return all([solve2(x, y) for x, y in zip(x_s, y_s)])
for _ in range(T):
n, x, y = input().split()
if solve(x, y):
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/arc166_a/Python/50268055
|
condefects-python_data_1979
|
T=int(input())
for i in range(T):
N,X,Y=map(str,input().split())
flag = True
for j in range(int(N)):
if Y[j]=="C" and X[j]!="C":
flag = False
sx=""
sy=""
for j in range(int(N)):
if Y[j]!="C":
sx+=X[j]
sy+=Y[j]
else:
ya =0
yb =0
xa =0
xb =0
for t in range(len(sx)):
if sx[t] == "A":
xa+=1
elif sx[t] =="B":
xb+=1
if sy[t]=="A":
ya+=1
elif sy[t]=="B":
yb+=1
if xa > ya or xb > yb:
flag =False
nsx=""
for t in range(len(sx)):
if sx[t]=="C" and xa < ya:
xa+=1
nsx+="A"
elif sx[t]=="C":
nsx+="B"
else:
nsx+=sx[t]
nsx_l=[]
sy_l=[]
for t in range(len(nsx)):
if nsx[t]=="A":
nsx_l.append(t)
if sx[t]=="A":
sy_l.append(t)
if len(nsx_l) == len(sy_l):
for t in range(len(nsx_l)):
if nsx_l[t]>sy_l[t]:
flag=False
sx=""
sy=""
ya =0
yb =0
xa =0
xb =0
for t in range(len(sx)):
if sx[t] == "A":
xa+=1
elif sx[t] =="B":
xb+=1
if sy[t]=="A":
ya+=1
elif sy[t]=="B":
yb+=1
if xa > ya or xb > yb:
flag =False
nsx=""
for t in range(len(sx)):
if sx[t]=="C" and xa < ya:
xa+=1
nsx+="A"
elif sx[t]=="C":
nsx+="B"
else:
nsx+=sx[t]
nsx_l=[]
sy_l=[]
for t in range(len(nsx)):
if nsx[t]=="A":
nsx_l.append(t)
if sy[t]=="A":
sy_l.append(t)
if len(nsx_l) == len(sy_l):
for t in range(len(nsx_l)):
if nsx_l[t]>sy_l[t]:
flag=False
if flag == False:
print("No")
else:
print("Yes")
T=int(input())
for i in range(T):
N,X,Y=map(str,input().split())
flag = True
for j in range(int(N)):
if Y[j]=="C" and X[j]!="C":
flag = False
sx=""
sy=""
for j in range(int(N)):
if Y[j]!="C":
sx+=X[j]
sy+=Y[j]
else:
ya =0
yb =0
xa =0
xb =0
for t in range(len(sx)):
if sx[t] == "A":
xa+=1
elif sx[t] =="B":
xb+=1
if sy[t]=="A":
ya+=1
elif sy[t]=="B":
yb+=1
if xa > ya or xb > yb:
flag =False
nsx=""
for t in range(len(sx)):
if sx[t]=="C" and xa < ya:
xa+=1
nsx+="A"
elif sx[t]=="C":
nsx+="B"
else:
nsx+=sx[t]
nsx_l=[]
sy_l=[]
for t in range(len(nsx)):
if nsx[t]=="A":
nsx_l.append(t)
if sy[t]=="A":
sy_l.append(t)
if len(nsx_l) == len(sy_l):
for t in range(len(nsx_l)):
if nsx_l[t]>sy_l[t]:
flag=False
sx=""
sy=""
ya =0
yb =0
xa =0
xb =0
for t in range(len(sx)):
if sx[t] == "A":
xa+=1
elif sx[t] =="B":
xb+=1
if sy[t]=="A":
ya+=1
elif sy[t]=="B":
yb+=1
if xa > ya or xb > yb:
flag =False
nsx=""
for t in range(len(sx)):
if sx[t]=="C" and xa < ya:
xa+=1
nsx+="A"
elif sx[t]=="C":
nsx+="B"
else:
nsx+=sx[t]
nsx_l=[]
sy_l=[]
for t in range(len(nsx)):
if nsx[t]=="A":
nsx_l.append(t)
if sy[t]=="A":
sy_l.append(t)
if len(nsx_l) == len(sy_l):
for t in range(len(nsx_l)):
if nsx_l[t]>sy_l[t]:
flag=False
if flag == False:
print("No")
else:
print("Yes")
|
ConDefects/ConDefects/Code/arc166_a/Python/48970771
|
condefects-python_data_1980
|
S = input()
ans = [0] * len(S)
for i in range(len(S)):
ans[i] = S[i]
print(ans)
S = input()
ans = [0] * len(S)
for i in range(len(S)):
ans[i] = S[i]
print(*ans)
|
ConDefects/ConDefects/Code/abc329_a/Python/55135985
|
condefects-python_data_1981
|
A=list(input())
print("".join(A))
A=list(input())
print(*A)
|
ConDefects/ConDefects/Code/abc329_a/Python/54463372
|
condefects-python_data_1982
|
A = list(input())
print(A)
A = list(input())
print(*A)
|
ConDefects/ConDefects/Code/abc329_a/Python/54918661
|
condefects-python_data_1983
|
print([*input()])
print(*[*input()])
|
ConDefects/ConDefects/Code/abc329_a/Python/54889625
|
condefects-python_data_1984
|
from numpy import*
P=9998244353
A=array([[216256883,0,410860701,0,415332064,0,11143596,0,841696407,0,0,0],[422024809,216256883,526844238,410860701,940403245,415332064,910241205,11143596,955071971,841696407,0,0],[341556236,0,774017054,0,242578546,0,446580657,0,42392189,0,0,0],[246691192,341556236,837742309,774017054,582695413,242578546,510125032,446580657,479962992,42392189,0,0],[142025488,0,500254911,0,7142655,0,473948500,0,478419863,0,0,0],[721924867,142025488,323869083,500254911,805185053,7142655,550138157,473948500,963697164,478419863,0,0],[69354209,0,155381605,0,513611028,0,946071846,0,142431311,0,0,0],[126143468,69354209,52601182,155381605,652789751,513611028,245596515,946071846,350415944,142431311,0,0],[125352301,0,194706510,0,336731998,0,678288234,0,894545117,0,0,0],[390136439,125352301,516279907,194706510,239960421,336731998,486651613,678288234,908676422,894545117,0,0],[166374059,0,332748118,0,499122177,0,665496236,0,831870295,0,1,0],[43580038,166374059,519723394,332748118,219061681,499122177,637633669,665496236,124660162,831870295,0,1]])
z=166374059
B=array([[0,0,1,0,0,0,0,0,0,0,0,0],[0,0,0,1,0,0,0,0,0,0,0,0],[0,0,0,0,1,0,0,0,0,0,0,0],[0,0,0,0,0,1,0,0,0,0,0,0],[0,0,0,0,0,0,1,0,0,0,0,0],[0,0,0,0,0,0,0,1,0,0,0,0],[0,0,0,0,0,0,0,0,1,0,0,0],[0,0,0,0,0,0,0,0,0,1,0,0],[0,0,0,0,0,0,0,0,0,0,1,0],[0,0,0,0,0,0,0,0,0,0,0,1],[z,0,z,0,z,0,z,0,z,0,z,0],[z,z,z,z,z,z,z,z,z,z,z,z]])
x=int(input())
while x:
if x&1:A=A@B%P
B=B@B%P
x>>=1
print(A[11][10])
from numpy import*
P=998244353
A=array([[216256883,0,410860701,0,415332064,0,11143596,0,841696407,0,0,0],[422024809,216256883,526844238,410860701,940403245,415332064,910241205,11143596,955071971,841696407,0,0],[341556236,0,774017054,0,242578546,0,446580657,0,42392189,0,0,0],[246691192,341556236,837742309,774017054,582695413,242578546,510125032,446580657,479962992,42392189,0,0],[142025488,0,500254911,0,7142655,0,473948500,0,478419863,0,0,0],[721924867,142025488,323869083,500254911,805185053,7142655,550138157,473948500,963697164,478419863,0,0],[69354209,0,155381605,0,513611028,0,946071846,0,142431311,0,0,0],[126143468,69354209,52601182,155381605,652789751,513611028,245596515,946071846,350415944,142431311,0,0],[125352301,0,194706510,0,336731998,0,678288234,0,894545117,0,0,0],[390136439,125352301,516279907,194706510,239960421,336731998,486651613,678288234,908676422,894545117,0,0],[166374059,0,332748118,0,499122177,0,665496236,0,831870295,0,1,0],[43580038,166374059,519723394,332748118,219061681,499122177,637633669,665496236,124660162,831870295,0,1]])
z=166374059
B=array([[0,0,1,0,0,0,0,0,0,0,0,0],[0,0,0,1,0,0,0,0,0,0,0,0],[0,0,0,0,1,0,0,0,0,0,0,0],[0,0,0,0,0,1,0,0,0,0,0,0],[0,0,0,0,0,0,1,0,0,0,0,0],[0,0,0,0,0,0,0,1,0,0,0,0],[0,0,0,0,0,0,0,0,1,0,0,0],[0,0,0,0,0,0,0,0,0,1,0,0],[0,0,0,0,0,0,0,0,0,0,1,0],[0,0,0,0,0,0,0,0,0,0,0,1],[z,0,z,0,z,0,z,0,z,0,z,0],[z,z,z,z,z,z,z,z,z,z,z,z]])
x=int(input())
while x:
if x&1:A=A@B%P
B=B@B%P
x>>=1
print(A[11][10])
|
ConDefects/ConDefects/Code/abc299_h/Python/40885357
|
condefects-python_data_1985
|
T = int(input())
a, s = zip(*[map(int, input().split(' ')) for _ in range(T)])
for i in range(T):
A = bin(a[i])[2:]
S = bin(s[i])[2:]
n = len(A)
m = len(S)
x = a[i]
y = a[i]
if s[i] < 2*x:
print("No")
continue
elif s[i] == 2*x:
print("Yes")
continue
flg = True
for j in range(m):
if j <= m-n or A[j-m+n] == "0":
tmp = 2**(m-j-1)
if x + y + tmp == s[i]:
flg = False
print("Yes")
break
elif x + y + tmp < s[i]:
y += tmp
if flg:
print("No")
T = int(input())
a, s = zip(*[map(int, input().split(' ')) for _ in range(T)])
for i in range(T):
A = bin(a[i])[2:]
S = bin(s[i])[2:]
n = len(A)
m = len(S)
x = a[i]
y = a[i]
if s[i] < 2*x:
print("No")
continue
elif s[i] == 2*x:
print("Yes")
continue
flg = True
for j in range(m):
if j < m-n or A[j-m+n] == "0":
tmp = 2**(m-j-1)
if x + y + tmp == s[i]:
flg = False
print("Yes")
break
elif x + y + tmp < s[i]:
y += tmp
if flg:
print("No")
|
ConDefects/ConDefects/Code/abc238_d/Python/45717530
|
condefects-python_data_1986
|
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd,sin,cos,tan,asin,acos,atan2,exp,log,log10
from collections import deque, Counter, defaultdict
from itertools import product, accumulate
from functools import reduce,lru_cache
from bisect import bisect
from heapq import heapify, heappop, heappush
sys.setrecursionlimit(5 * 10 ** 5)
try:
from pypyjit import set_param
set_param('max_unroll_recursion=-1')
except ModuleNotFoundError:
pass
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
tokens = (i for line in iter(input, "") for i in line.split())
YES = "Yes"
NO = "No"
def get_ans(a,s):
ss = s - a*2
return ss > 0 and a & ss == 0
def solve(T,q_list):
for [a,s] in q_list:
if get_ans(a,s):
print(YES)
else:
print(NO)
def main():
T = int(next(tokens)) # type: int
q_list = [li() for _ in range(T)]
solve(T,q_list)
return
main()
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd,sin,cos,tan,asin,acos,atan2,exp,log,log10
from collections import deque, Counter, defaultdict
from itertools import product, accumulate
from functools import reduce,lru_cache
from bisect import bisect
from heapq import heapify, heappop, heappush
sys.setrecursionlimit(5 * 10 ** 5)
try:
from pypyjit import set_param
set_param('max_unroll_recursion=-1')
except ModuleNotFoundError:
pass
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 63 - 1
tokens = (i for line in iter(input, "") for i in line.split())
YES = "Yes"
NO = "No"
def get_ans(a,s):
ss = s - a*2
return ss >= 0 and a & ss == 0
def solve(T,q_list):
for [a,s] in q_list:
if get_ans(a,s):
print(YES)
else:
print(NO)
def main():
T = int(next(tokens)) # type: int
q_list = [li() for _ in range(T)]
solve(T,q_list)
return
main()
|
ConDefects/ConDefects/Code/abc238_d/Python/45053944
|
condefects-python_data_1987
|
from collections import *
import heapq
import bisect
INF = float("inf")
MOD = 998244353
mod = 998244353
T = int(input())
for _ in range(T):
a, s = map(int, input().split())
if 2 * a <= s:
print("Yes")
else:
print("No")
from collections import *
import heapq
import bisect
INF = float("inf")
MOD = 998244353
mod = 998244353
T = int(input())
for _ in range(T):
a, s = map(int, input().split())
if s - 2 * a >= 0 and (s - 2 * a) & a == 0:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc238_d/Python/45261628
|
condefects-python_data_1988
|
T=int(input())
for _ in range(T):
a,s=map(int,input().split())
b=s-2*a
if b>0 and a&b==0:
print('Yes')
else:
print('No')
T=int(input())
for _ in range(T):
a,s=map(int,input().split())
b=s-2*a
if b>=0 and a&b==0:
print('Yes')
else:
print('No')
|
ConDefects/ConDefects/Code/abc238_d/Python/45321864
|
condefects-python_data_1989
|
inf = 10**12
def calc_1(x,y):
if y == 0 and x >= 0:
return x
return inf
def calc_2(x,y):
if x == y and x >= 0:
return x
return inf
def calc_12(x,y):
if y >= 0 and x >= y:
return x
return inf
def calc_13(x,y):
if x >= 0 and y >= 0:
return x+y
return inf
def calc_14(x,y):
if y >= 0 and x >= -y:
return y + (x + y)
return inf
def calc_24(x,y):
if y >= 0 and -y <= x <= y and (y-x) % 2 == 0:
return y
return inf
def calc_124(x,y):
res = min(calc_12(x,y), calc_14(x,y), calc_24(x,y),
1 + calc_24(x-1,y))
return res
def calc_136(x,y):
res = min(calc_13(x,y), calc_14(x,-y), calc_14(y,-x))
return res
def calc_146(x,y):
res = min(calc_14(x,y), calc_14(x,-y), calc_24(y,-x),
1 + calc_24(y,-(x-1)))
return res
def calc_zzz(x,y,s):
res = inf
if s[0] == '1':
res = min(res, calc_1(x,y))
if s[1] == '1':
res = min(res, calc_12(x,y))
if s[3] == '1':
res = min(res, calc_124(x,y))
if s[2] == '1':
res = min(res, calc_13(x,y))
if s[5] == '1':
res = min(res, calc_136(x,y))
if s[3] == '1':
res = min(res, calc_14(x,y))
if s[5] == '1':
res = min(res, calc_146(x,y))
if s[1] == '1':
res = min(res, calc_2(x,y))
if s[3] == '1':
res = min(res, calc_24(x,y))
return res
def rev_s(s):
res = [s]
res.append( s[0] + s[7] + s[6] + s[5] + s[4] + s[3] + s[2] + s[1])
res.append( s[4] + s[3] + s[2] + s[1] + s[0] + s[7] + s[6] + s[5])
res.append( s[4] + s[5] + s[6] + s[7] + s[0] + s[1] + s[2] + s[3])
return res
def calc(x,y,s):
res = inf
for _ in range(4):
for mul_x,mul_y,si in zip([1,1,-1,-1], [1,-1,1,-1], rev_s(s)):
res = min(res, calc_zzz(x*mul_x, y*mul_y, si))
x,y = y, -x
s = s[2:] + s[:2]
if res == inf:
res = -1
return res
t = int(input())
ans = []
for _ in range(t):
x,y,s = input().split()
x = int(x)
y = int(y)
ans.append(calc(x,y,s))
print(*ans, sep='\n')
inf = 10**12
def calc_1(x,y):
if y == 0 and x >= 0:
return x
return inf
def calc_2(x,y):
if x == y and x >= 0:
return x
return inf
def calc_12(x,y):
if y >= 0 and x >= y:
return x
return inf
def calc_13(x,y):
if x >= 0 and y >= 0:
return x+y
return inf
def calc_14(x,y):
if y >= 0 and x >= -y:
return y + (x + y)
return inf
def calc_24(x,y):
if y >= 0 and -y <= x <= y and (y-x) % 2 == 0:
return y
return inf
def calc_124(x,y):
res = min(calc_12(x,y), calc_14(x,y), calc_24(x,y),
1 + calc_24(x-1,y))
return res
def calc_136(x,y):
res = min(calc_13(x,y), calc_14(x,-y), calc_14(y,-x))
return res
def calc_146(x,y):
res = min(calc_14(x,y), calc_14(x,-y), calc_24(y,-x),
1 + calc_24(y,-(x-1)))
return res
def calc_zzz(x,y,s):
res = inf
if s[0] == '1':
res = min(res, calc_1(x,y))
if s[1] == '1':
res = min(res, calc_12(x,y))
if s[3] == '1':
res = min(res, calc_124(x,y))
if s[2] == '1':
res = min(res, calc_13(x,y))
if s[5] == '1':
res = min(res, calc_136(x,y))
if s[3] == '1':
res = min(res, calc_14(x,y))
if s[5] == '1':
res = min(res, calc_146(x,y))
if s[1] == '1':
res = min(res, calc_2(x,y))
if s[3] == '1':
res = min(res, calc_24(x,y))
return res
def rev_s(s):
res = [s]
res.append( s[0] + s[7] + s[6] + s[5] + s[4] + s[3] + s[2] + s[1])
res.append( s[4] + s[3] + s[2] + s[1] + s[0] + s[7] + s[6] + s[5])
res.append( s[4] + s[5] + s[6] + s[7] + s[0] + s[1] + s[2] + s[3])
return res
def calc(x,y,s):
if x == 0 and y == 0:
return 0
res = inf
for _ in range(4):
for mul_x,mul_y,si in zip([1,1,-1,-1], [1,-1,1,-1], rev_s(s)):
res = min(res, calc_zzz(x*mul_x, y*mul_y, si))
x,y = y, -x
s = s[2:] + s[:2]
if res == inf:
res = -1
return res
t = int(input())
ans = []
for _ in range(t):
x,y,s = input().split()
x = int(x)
y = int(y)
ans.append(calc(x,y,s))
print(*ans, sep='\n')
|
ConDefects/ConDefects/Code/abc271_h/Python/35401620
|
condefects-python_data_1990
|
T=int(input())
for t in range(T):
A,B,S=input().split()
A=int(A)
B=int(B)
S=list(map(int,S))
inf=1<<60
dx=[1,1,0,-1,-1,-1,0,1]
dy=[0,1,1,1,0,-1,-1,-1]
def solve(A,B,S):
S=S[:]
if A<0:
A=-A
S=[S[4],S[3],S[2],S[1],S[0],S[7],S[6],S[5]]
if B<0:
B=-B
S=[S[0],S[7],S[6],S[5],S[4],S[3],S[2],S[1]]
if A<B:
A,B=B,A
S=[S[2],S[1],S[0],S[7],S[6],S[5],S[4],S[3]]
ans=inf
if S[0] and B==0:
ans=min(ans,A)
if S[1] and A==B:
ans=min(ans,A)
if S[0] and S[1]:
ans=min(ans,A)
if S[0] and S[2]:
ans=min(ans,A+B)
if S[0] and S[3]:
ans=min(ans,A+2*B)
if S[1] and S[6]:
ans=min(ans,2*A-B)
if S[1] and S[7] and A%2==B%2:
ans=min(ans,A)
if S[7] and S[2]:
ans=min(ans,2*A+B)
return ans
ans=solve(A,B,S)
for i in range(8):
if S[i]:
ans=min(ans,solve(A-dx[i],B-dy[i],S)+1)
if ans==inf:
ans=-1
print(ans)
T=int(input())
for t in range(T):
A,B,S=input().split()
A=int(A)
B=int(B)
S=list(map(int,S))
inf=1<<60
dx=[1,1,0,-1,-1,-1,0,1]
dy=[0,1,1,1,0,-1,-1,-1]
def solve(A,B,S):
if (A,B)==(0,0):
return 0
S=S[:]
if A<0:
A=-A
S=[S[4],S[3],S[2],S[1],S[0],S[7],S[6],S[5]]
if B<0:
B=-B
S=[S[0],S[7],S[6],S[5],S[4],S[3],S[2],S[1]]
if A<B:
A,B=B,A
S=[S[2],S[1],S[0],S[7],S[6],S[5],S[4],S[3]]
ans=inf
if S[0] and B==0:
ans=min(ans,A)
if S[1] and A==B:
ans=min(ans,A)
if S[0] and S[1]:
ans=min(ans,A)
if S[0] and S[2]:
ans=min(ans,A+B)
if S[0] and S[3]:
ans=min(ans,A+2*B)
if S[1] and S[6]:
ans=min(ans,2*A-B)
if S[1] and S[7] and A%2==B%2:
ans=min(ans,A)
if S[7] and S[2]:
ans=min(ans,2*A+B)
return ans
ans=solve(A,B,S)
for i in range(8):
if S[i]:
ans=min(ans,solve(A-dx[i],B-dy[i],S)+1)
if ans==inf:
ans=-1
print(ans)
|
ConDefects/ConDefects/Code/abc271_h/Python/54716396
|
condefects-python_data_1991
|
n = int(input())
ans = 0
for i in range(1, int(n**0.5)+1):
ans += n//i
ans = ans*2 - n
print(ans)
n = int(input())
ans = 0
for i in range(1, int(n**0.5)+1):
ans += n//i
ans = ans*2 - (int(n**0.5))**2
print(ans)
|
ConDefects/ConDefects/Code/abc230_e/Python/45074707
|
condefects-python_data_1992
|
n = int(input())
li = list(map(int,input().split()))
cnt = 0
per = n-2
for i in range(n-1):
li[i] -= 1
while(True):
if(li[per] == 0):
cnt += 1
print(cnt)
break
else:
cnt += 1
per = li[per-1]
n = int(input())
li = list(map(int,input().split()))
cnt = 0
per = n-2
for i in range(n-1):
li[i] -= 1
while(True):
if(li[per] == 0):
cnt += 1
print(cnt)
break
else:
cnt += 1
per = li[per]-1
|
ConDefects/ConDefects/Code/abc263_b/Python/45056655
|
condefects-python_data_1993
|
n=int(input())
p=list(map(int, input().split()))
h=p[-1]
ans=0
while h!=1:
h=p[h-2]
ans+=1
if p[-1]==1:
print(1)
else:
print(ans)
n=int(input())
p=list(map(int, input().split()))
h=p[-1]
ans=0
while h!=1:
h=p[h-2]
ans+=1
if p[-1]==1:
print(1)
else:
print(ans+1)
|
ConDefects/ConDefects/Code/abc263_b/Python/44792447
|
condefects-python_data_1994
|
N, M = map(int, input().split())
G = [[0]*N for _ in range(N)]
for _ in range(M):
A, B, C = map(int, input().split())
G[A-1][B-1] = C
G[B-1][A-1] = C
from itertools import permutations
T = [i for i in range(N)]
ans = 0
for t in permutations(T):
total = 0
for i in range(len(t)-1):
if G[t[i]][t[i+1]] != 0:
total += G[t[i]][t[i+1]]
ans = max(ans, total)
print(ans)
N, M = map(int, input().split())
G = [[0]*N for _ in range(N)]
for _ in range(M):
A, B, C = map(int, input().split())
G[A-1][B-1] = C
G[B-1][A-1] = C
from itertools import permutations
T = [i for i in range(N)]
ans = 0
for t in permutations(T):
total = 0
for i in range(len(t)-1):
if G[t[i]][t[i+1]] != 0:
total += G[t[i]][t[i+1]]
else:
break
ans = max(ans, total)
print(ans)
|
ConDefects/ConDefects/Code/abc317_c/Python/54762197
|
condefects-python_data_1995
|
from itertools import permutations
n, m = map(int, input().split())
graph = [[0]*(n+1) for i in range(n+1)]
for i in range(m):
a,b,c = map(int, input().split())
graph[a][b] = c
graph[b][a] = c
# for i in range(1,n+1):
# print(*graph[i])
P = permutations(range(1,n+1))
ans = 0
for p in P:
s = 0
for j in range(n):
c = graph[p[j-1]][p[j]]
if c == 0:
break
s += c
# print(p, s)
ans = max(ans, s)
print(ans)
from itertools import permutations
n, m = map(int, input().split())
graph = [[0]*(n+1) for i in range(n+1)]
for i in range(m):
a,b,c = map(int, input().split())
graph[a][b] = c
graph[b][a] = c
# for i in range(1,n+1):
# print(*graph[i])
P = permutations(range(1,n+1))
ans = 0
for p in P:
s = 0
for j in range(1,n):
c = graph[p[j-1]][p[j]]
if c == 0:
break
s += c
# print(p, s)
ans = max(ans, s)
print(ans)
|
ConDefects/ConDefects/Code/abc317_c/Python/54776081
|
condefects-python_data_1996
|
N, M = map(int, input().split())
G = [[0]*N for _ in range(N)]
for _ in range(M):
A, B, C = map(int, input().split())
G[A-1][B-1] = C
G[B-1][A-1] = C
dist = 0
visited = [-1]*N
def rec(v, cost):
visited[v] = 0
global dist
if cost > dist:
dist = cost
for v2 in range(N):
if visited[v2] == -1:
rec(v2, cost+G[v][v2])
visited[v] = -1
for i in range(N):
rec(i, 0)
print(dist)
N, M = map(int, input().split())
G = [[0]*N for _ in range(N)]
for _ in range(M):
A, B, C = map(int, input().split())
G[A-1][B-1] = C
G[B-1][A-1] = C
dist = 0
visited = [-1]*N
def rec(v, cost):
visited[v] = 0
global dist
if cost > dist:
dist = cost
for v2 in range(N):
if visited[v2] == -1 and G[v][v2] != 0:
rec(v2, cost+G[v][v2])
visited[v] = -1
for i in range(N):
rec(i, 0)
print(dist)
|
ConDefects/ConDefects/Code/abc317_c/Python/54762079
|
condefects-python_data_1997
|
from collections import deque
import heapq
m=int(input())
v=[tuple(map(int,input().split())) for i in range(m)]
p=list(map(int,input().split()))
p=list(set(p)^set(range(1,10)))+p
p=[i-1 for i in p]
p=tuple([p.index(i) for i in range(9)])
g={i:[] for i in range(9)}
for i in range(m):
a,b=v[i]
g[a-1]+=[b-1]
g[b-1]+=[a-1]
start=p
visited=set()
visited.add(p)
dist={}
dist[p]=0
que=deque([start])
while len(que):
v=que.popleft()
nvs=[]
ind=v.index(0)
for i in g[ind]:
temp=list(v)
temp[i],temp[ind]=temp[ind],temp[i]
nvs+=[tuple(temp)]
for nv in nvs:
if nv in visited:
continue
visited.add(nv)
que.append(nv)
dist[nv]=dist[v]+1
if (1,2,3,4,5,6,7,8,0) in dist:
print(dist[(1,2,3,4,5,6,7,8,0)])
else:
print(0)
from collections import deque
import heapq
m=int(input())
v=[tuple(map(int,input().split())) for i in range(m)]
p=list(map(int,input().split()))
p=list(set(p)^set(range(1,10)))+p
p=[i-1 for i in p]
p=tuple([p.index(i) for i in range(9)])
g={i:[] for i in range(9)}
for i in range(m):
a,b=v[i]
g[a-1]+=[b-1]
g[b-1]+=[a-1]
start=p
visited=set()
visited.add(p)
dist={}
dist[p]=0
que=deque([start])
while len(que):
v=que.popleft()
nvs=[]
ind=v.index(0)
for i in g[ind]:
temp=list(v)
temp[i],temp[ind]=temp[ind],temp[i]
nvs+=[tuple(temp)]
for nv in nvs:
if nv in visited:
continue
visited.add(nv)
que.append(nv)
dist[nv]=dist[v]+1
if (1,2,3,4,5,6,7,8,0) in dist:
print(dist[(1,2,3,4,5,6,7,8,0)])
else:
print(-1)
|
ConDefects/ConDefects/Code/abc224_d/Python/44885115
|
condefects-python_data_1998
|
import sys, random
input = lambda : sys.stdin.readline().rstrip()
write = lambda x: sys.stdout.write(x+"\n"); writef = lambda x: print("{:.12f}".format(x))
debug = lambda x: sys.stderr.write(x+"\n")
YES="Yes"; NO="No"; pans = lambda v: print(YES if v else NO); INF=10**18
LI = lambda : list(map(int, input().split())); II=lambda : int(input()); SI=lambda : [ord(c)-ord("a") for c in input()]
def debug(_l_):
for s in _l_.split():
print(f"{s}={eval(s)}", end=" ")
print()
def dlist(*l, fill=0):
if len(l)==1:
return [fill]*l[0]
ll = l[1:]
return [dlist(*ll, fill=fill) for _ in range(l[0])]
# 標準出力による質問 interactive
TEST = 0
import sys
def _q(i,j,k):
print("?", i+1, j+1, k+1)
sys.stdout.flush()
return input()=="Yes"
def answer(v):
print(f"! {v}")
sys.stdout.flush()
n = int(input())
if TEST:
import random
_a = list(range(1,n+1))
random.shuffle(_a)
def _q(i,j,k):
return _a[i]+_a[j]>_a[k]
ind = 0
for i in range(1,n):
res = _q(ind,ind,i)
if res:
ind = i
if TEST:
assert _a[ind]==1
def sub(index):
# index に含まれるインデックスの値をソートして返す
if len(index)<=1:
return index
m = len(index)//2
l = sub(index[:m])
r = sub(index[m:])
assert len(l)+len(r)==len(index)
li = ri = 0
ans = []
for _ in range(len(index)):
if li<len(l) and ri<len(r):
res = _q(l[li], ind, r[ri])
if res:
ans.append(r[ri])
ri += 1
else:
ans.append(l[li])
li += 1
else:
break
ans.extend(l[li:])
ans.extend(r[ri:])
assert len(ans)==len(index)
return ans
index = list(range(n))
index.remove(ind)
res = sub(index)
ans = [0]*n
ans[ind] = 1
for i in range(n-1):
ans[res[i]] = i+2
write(" ".join(map(str, ans)))
sys.stdout.flush()
if TEST:
assert _a==ans
import sys, random
input = lambda : sys.stdin.readline().rstrip()
write = lambda x: sys.stdout.write(x+"\n"); writef = lambda x: print("{:.12f}".format(x))
debug = lambda x: sys.stderr.write(x+"\n")
YES="Yes"; NO="No"; pans = lambda v: print(YES if v else NO); INF=10**18
LI = lambda : list(map(int, input().split())); II=lambda : int(input()); SI=lambda : [ord(c)-ord("a") for c in input()]
def debug(_l_):
for s in _l_.split():
print(f"{s}={eval(s)}", end=" ")
print()
def dlist(*l, fill=0):
if len(l)==1:
return [fill]*l[0]
ll = l[1:]
return [dlist(*ll, fill=fill) for _ in range(l[0])]
# 標準出力による質問 interactive
TEST = 0
import sys
def _q(i,j,k):
print("?", i+1, j+1, k+1)
sys.stdout.flush()
return input()=="Yes"
def answer(v):
print(f"! {v}")
sys.stdout.flush()
n = int(input())
if TEST:
import random
_a = list(range(1,n+1))
random.shuffle(_a)
def _q(i,j,k):
return _a[i]+_a[j]>_a[k]
ind = 0
for i in range(1,n):
res = _q(ind,ind,i)
if res:
ind = i
if TEST:
assert _a[ind]==1
def sub(index):
# index に含まれるインデックスの値をソートして返す
if len(index)<=1:
return index
m = len(index)//2
l = sub(index[:m])
r = sub(index[m:])
assert len(l)+len(r)==len(index)
li = ri = 0
ans = []
for _ in range(len(index)):
if li<len(l) and ri<len(r):
res = _q(l[li], ind, r[ri])
if res:
ans.append(r[ri])
ri += 1
else:
ans.append(l[li])
li += 1
else:
break
ans.extend(l[li:])
ans.extend(r[ri:])
assert len(ans)==len(index)
return ans
index = list(range(n))
index.remove(ind)
res = sub(index)
ans = [0]*n
ans[ind] = 1
for i in range(n-1):
ans[res[i]] = i+2
write("! " + " ".join(map(str, ans)))
sys.stdout.flush()
if TEST:
assert _a==ans
|
ConDefects/ConDefects/Code/arc154_d/Python/38323187
|
condefects-python_data_1999
|
def out(a, b, c):
print('?', a, b, c, flush=True)
def inp():
return S.index(input())
N = int(input())
S = ['No', 'Yes']
pos1 = 1
for i in range(2, N+1):
out(i, i, pos1)
if not inp():
pos1 = i
P = [[i] for i in range(1, N+1)]
while len(P) > 1:
nP = []
for i in range(0, len(P), 2):
if i == len(P)-1:
nP.append(P[i])
continue
A = P[i]
B = P[i+1]
alen = len(A)
blen = len(B)
aind = bind = 0
res = []
while aind < alen or bind < blen:
if aind == alen:
res.append(B[bind])
bind += 1
elif bind == blen:
res.append(A[aind])
aind += 1
else:
out(B[bind], pos1, A[aind])
if inp():
res.append(A[aind])
aind += 1
else:
res.append(B[bind])
bind += 1
nP.append(res)
P = nP
ans = [0]*(N+1)
for i, p in enumerate(P[0]):
ans[p] = i+1
print('!', *P[1:], flush=True)
def out(a, b, c):
print('?', a, b, c, flush=True)
def inp():
return S.index(input())
N = int(input())
S = ['No', 'Yes']
pos1 = 1
for i in range(2, N+1):
out(i, i, pos1)
if not inp():
pos1 = i
P = [[i] for i in range(1, N+1)]
while len(P) > 1:
nP = []
for i in range(0, len(P), 2):
if i == len(P)-1:
nP.append(P[i])
continue
A = P[i]
B = P[i+1]
alen = len(A)
blen = len(B)
aind = bind = 0
res = []
while aind < alen or bind < blen:
if aind == alen:
res.append(B[bind])
bind += 1
elif bind == blen:
res.append(A[aind])
aind += 1
else:
out(B[bind], pos1, A[aind])
if inp():
res.append(A[aind])
aind += 1
else:
res.append(B[bind])
bind += 1
nP.append(res)
P = nP
ans = [0]*(N+1)
for i, p in enumerate(P[0]):
ans[p] = i+1
print('!', *ans[1:], flush=True)
|
ConDefects/ConDefects/Code/arc154_d/Python/38323705
|
condefects-python_data_2000
|
from sys import stdin
input=lambda :stdin.readline()[:-1]
def ask(i,j,k):
print('?',i+1,j+1,k+1,flush=True)
res=input()
return res=='Yes'
n=int(input())
if n==1:
print('!',1)
exit()
one=0
for i in range(1,n):
if ask(i,i,one):
one=i
now=[one]
for i in range(n):
if i==one:
continue
ng,ok=-1,len(now)
while abs(ng-ok)>1:
mid=(ok+ng)//2
if ask(i,one,now[mid]):
ok=mid
else:
ng=mid
now=now[:ok]+[i]+now[ok:]
P=[0]*n
for i in range(n):
P[now[i]]=n-i
print('!',*P,flush=True)
from sys import stdin
input=lambda :stdin.readline()[:-1]
def ask(i,j,k):
print('?',i+1,j+1,k+1,flush=True)
res=input()
return res=='Yes'
n=int(input())
if n==1:
print('!',1)
exit()
one=0
for i in range(1,n):
if not ask(i,i,one):
one=i
now=[one]
for i in range(n):
if i==one:
continue
ng,ok=-1,len(now)
while abs(ng-ok)>1:
mid=(ok+ng)//2
if ask(i,one,now[mid]):
ok=mid
else:
ng=mid
now=now[:ok]+[i]+now[ok:]
P=[0]*n
for i in range(n):
P[now[i]]=n-i
print('!',*P,flush=True)
|
ConDefects/ConDefects/Code/arc154_d/Python/38267983
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.