id
stringlengths 24
27
| content
stringlengths 37
384k
| max_stars_repo_path
stringlengths 51
51
|
|---|---|---|
condefects-python_data_2401
|
n,q=map(int,input().split())
X=list(map(int,input().split()))
ans=[0]*(n+1)
acc=[0]*(q+1)
add=[0]*(n+1)
se=set()
for i,x in enumerate(X):
if x not in se:
se.add(x)
add[x]=i
else:
se.discard(x)
ans[x]+=acc[i]-acc[add[x]]
add[x]=-1
acc[i+1]=acc[i]+len(se)
for i in range(1,n+1):
ans[i]+=acc[-1]-acc[add[i]]
print(*ans[1:])
n,q=map(int,input().split())
X=list(map(int,input().split()))
ans=[0]*(n+1)
acc=[0]*(q+1)
add=[-1]*(n+1)
se=set()
for i,x in enumerate(X):
if x not in se:
se.add(x)
add[x]=i
else:
se.discard(x)
ans[x]+=acc[i]-acc[add[x]]
add[x]=-1
acc[i+1]=acc[i]+len(se)
for i in range(1,n+1):
ans[i]+=acc[-1]-acc[add[i]]
print(*ans[1:])
|
ConDefects/ConDefects/Code/abc347_e/Python/52950646
|
condefects-python_data_2402
|
#############################################################
import sys
sys.setrecursionlimit(10**7)
from heapq import heappop,heappush
from collections import deque,defaultdict,Counter
from bisect import bisect_left, bisect_right
from itertools import product,combinations,permutations
ipt = sys.stdin.readline
def iin():
return int(ipt())
def lmin():
return list(map(int,ipt().split()))
MOD = 998244353
#############################################################
N = iin()
A = lmin()
G = [[] for _ in range(N)]
for _ in range(N-1):
u,v = lmin()
u,v = u-1,v-1
G[u].append(v)
G[v].append(u)
val = [1]*(N+1)
pval = [1]*(N+1)
cum_val = [1]*(N+1)
par = [-1]*N
memo_cum_val = [0]*N
memo_val = [0]*N
memo_pval = [0]*N
init_pval = [0]*N
cnt = 0
st = [(0,0)]
ans = 0
while st:
t,cur = st.pop()
a = A[cur]
if t == 0:
st.append((2,cur))
ans += val[a]*pval[a]%MOD
ans %= MOD
memo_val[cur] = val[a]
memo_pval[cur] = pval[a]
memo_cum_val[cur] = cum_val[a]
pval[a] = (val[a]*pval[a]+1)%MOD
val[a] = 1
cum_val[a] = 1
for nxt in reversed(G[cur]):
if nxt == par[cur]:
continue
par[nxt] = cur
st.append((1,cur))
st.append((0,nxt))
elif t == 1:
cum_val[a] = cum_val[a] * val[a] % MOD
pval[a] = (memo_pval[cur] * memo_val[cur] %MOD * (cum_val[a] + 1)) % MOD
val[a] = 1
elif t == 2:
val[a] = (memo_val[cur]*(cum_val[a]+1))%MOD
pval[a] = memo_pval[cur]
cum_val[a] = memo_cum_val[cur]
print(ans)
#############################################################
import sys
sys.setrecursionlimit(10**7)
from heapq import heappop,heappush
from collections import deque,defaultdict,Counter
from bisect import bisect_left, bisect_right
from itertools import product,combinations,permutations
ipt = sys.stdin.readline
def iin():
return int(ipt())
def lmin():
return list(map(int,ipt().split()))
MOD = 998244353
#############################################################
N = iin()
A = lmin()
G = [[] for _ in range(N)]
for _ in range(N-1):
u,v = lmin()
u,v = u-1,v-1
G[u].append(v)
G[v].append(u)
val = [1]*(N+1)
pval = [1]*(N+1)
cum_val = [1]*(N+1)
par = [-1]*N
memo_cum_val = [0]*N
memo_val = [0]*N
memo_pval = [0]*N
init_pval = [0]*N
cnt = 0
st = [(0,0)]
ans = 0
while st:
t,cur = st.pop()
a = A[cur]
if t == 0:
st.append((2,cur))
ans += val[a]*pval[a]%MOD
ans %= MOD
memo_val[cur] = val[a]
memo_pval[cur] = pval[a]
memo_cum_val[cur] = cum_val[a]
pval[a] = (val[a]*pval[a]+1)%MOD
val[a] = 1
cum_val[a] = 1
for nxt in reversed(G[cur]):
if nxt == par[cur]:
continue
par[nxt] = cur
st.append((1,cur))
st.append((0,nxt))
elif t == 1:
cum_val[a] = cum_val[a] * val[a] % MOD
pval[a] = (memo_pval[cur] * memo_val[cur] % MOD * cum_val[a] %MOD + 1) % MOD
val[a] = 1
elif t == 2:
val[a] = (memo_val[cur]*(cum_val[a]+1))%MOD
pval[a] = memo_pval[cur]
cum_val[a] = memo_cum_val[cur]
print(ans)
|
ConDefects/ConDefects/Code/abc340_g/Python/50192467
|
condefects-python_data_2403
|
import sys
from functools import lru_cache
sys.setrecursionlimit(50000)
def input_general():
return sys.stdin.readline().rstrip('\r\n')
def input_num():
return int(sys.stdin.readline().rstrip("\r\n"))
def input_multi(x=int):
return map(x, sys.stdin.readline().rstrip("\r\n").split())
def input_list(x=int):
return list(input_multi(x))
def main():
n = input_num()
arr = input_list()
P = 998244353
arr = [x - 1 for x in arr]
rev = [-1] * n
for i, x in enumerate(arr):
rev[x] = i
def get_bound(arr):
right = list(range(n))
stack = []
for i, x in enumerate(arr):
while stack and stack[-1][1] < x:
j, y = stack.pop()
right[j] = i - 1
stack.append((i, x))
for i, x in stack:
right[i] = n - 1
return right
right = get_bound(arr)
left = get_bound(arr[::-1])[::-1]
left = [n - 1 - x for x in left]
dp = [0] + [1] * (n + 1)
# print([], dp)
for i, x in enumerate(arr):
l, r = left[i], right[i]
addon = [0] + [0] * n # When we are actually adding some x into the list
for idx in range(l, r + 1):
addon[idx + 1] = dp[idx + 1] - dp[l]
psum = [0]
for x in addon:
psum.append(psum[-1] + x)
dp = [(x + y) % P for x, y in zip(dp, psum)]
# print(addon, dp)
print(dp[-1] - dp[-2])
if __name__ == "__main__":
main()
import sys
from functools import lru_cache
sys.setrecursionlimit(50000)
def input_general():
return sys.stdin.readline().rstrip('\r\n')
def input_num():
return int(sys.stdin.readline().rstrip("\r\n"))
def input_multi(x=int):
return map(x, sys.stdin.readline().rstrip("\r\n").split())
def input_list(x=int):
return list(input_multi(x))
def main():
n = input_num()
arr = input_list()
P = 998244353
arr = [x - 1 for x in arr]
rev = [-1] * n
for i, x in enumerate(arr):
rev[x] = i
def get_bound(arr):
right = list(range(n))
stack = []
for i, x in enumerate(arr):
while stack and stack[-1][1] < x:
j, y = stack.pop()
right[j] = i - 1
stack.append((i, x))
for i, x in stack:
right[i] = n - 1
return right
right = get_bound(arr)
left = get_bound(arr[::-1])[::-1]
left = [n - 1 - x for x in left]
dp = [0] + [1] * (n + 1)
# print([], dp)
for i, x in enumerate(arr):
l, r = left[i], right[i]
addon = [0] + [0] * n # When we are actually adding some x into the list
for idx in range(l, r + 1):
addon[idx + 1] = dp[idx + 1] - dp[l]
psum = [0]
for x in addon:
psum.append(psum[-1] + x)
dp = [(x + y) % P for x, y in zip(dp, psum)]
# print(addon, dp)
print((dp[-1] - dp[-2]) % P)
if __name__ == "__main__":
main()
|
ConDefects/ConDefects/Code/agc058_b/Python/34054427
|
condefects-python_data_2404
|
MOD = 10**9+7
n = int(input())
arr = list(map(lambda x:n-int(x), input().split()))
dp = [[0]*n for i in range(n)]
dp[0][arr[0]] = 1
dp1 = [0]*n
dp1[0] = 1
for i in range(1, n):
a = arr[i]
j = i-1
while j >= 0 and arr[j] > a:
j -= 1
j += 1
if j == 0:
dp[0][a] = 1
dp1[0] += 1
j += 1
for k in range(j, i):
dp[k][a] = dp1[k-1]
dp1[k] += dp1[k-1]
dp1[k] %= MOD
dp[i][a] = dp1[i-1]
if a:
dp[i][0] = c = dp[i-1][0]
for k in range(1, a):
if dp[i-1][k]:
c = (c+dp[i-1][k]) % MOD
dp[i][k] = c
dp1[i] = sum(dp[i])%MOD
print(dp1[-1])
MOD = 998244353
n = int(input())
arr = list(map(lambda x:n-int(x), input().split()))
dp = [[0]*n for i in range(n)]
dp[0][arr[0]] = 1
dp1 = [0]*n
dp1[0] = 1
for i in range(1, n):
a = arr[i]
j = i-1
while j >= 0 and arr[j] > a:
j -= 1
j += 1
if j == 0:
dp[0][a] = 1
dp1[0] += 1
j += 1
for k in range(j, i):
dp[k][a] = dp1[k-1]
dp1[k] += dp1[k-1]
dp1[k] %= MOD
dp[i][a] = dp1[i-1]
if a:
dp[i][0] = c = dp[i-1][0]
for k in range(1, a):
if dp[i-1][k]:
c = (c+dp[i-1][k]) % MOD
dp[i][k] = c
dp1[i] = sum(dp[i])%MOD
print(dp1[-1])
|
ConDefects/ConDefects/Code/agc058_b/Python/34050152
|
condefects-python_data_2405
|
mod=998244353
N=int(input())
P=list(map(int,input().split()))
L=[i for i in range(N)]
R=[i for i in range(N)]
for i in range(N):
j=i
while j>=0:
if P[i]>=P[j]:
j-=1
else:
break
L[i]=j+1
j=i
while j<N:
if P[i]>=P[j]:
j+=1
else:
break
R[i]=j
print(L)
print(R)
DP=[0]*(N+1)
DP[0]=1
for i in range(N):
for j in range(L[i],R[i]):
DP[j+1]+=DP[j]
if DP[j+1]>=mod:
DP[j+1]-=mod
print(DP[N])
mod=998244353
N=int(input())
P=list(map(int,input().split()))
L=[i for i in range(N)]
R=[i for i in range(N)]
for i in range(N):
j=i
while j>=0:
if P[i]>=P[j]:
j-=1
else:
break
L[i]=j+1
j=i
while j<N:
if P[i]>=P[j]:
j+=1
else:
break
R[i]=j
DP=[0]*(N+1)
DP[0]=1
for i in range(N):
for j in range(L[i],R[i]):
DP[j+1]+=DP[j]
if DP[j+1]>=mod:
DP[j+1]-=mod
print(DP[N])
|
ConDefects/ConDefects/Code/agc058_b/Python/34045717
|
condefects-python_data_2406
|
from collections import Counter, defaultdict
# from sortedcontainers import SortedSet, SortedList
n = int(input())
arr = list(map(int, input().split()))
dp = [0] * (n+1)
dp[0] = 1
for i in range(n):
l, r = i, i+1
while l > 0 and arr[l-1] < arr[i]:
l -= 1
while r < n and arr[r] < arr[i]:
r += 1
for k in range(l, r):
dp[k+1] += dp[k]
print(dp[n])
from collections import Counter, defaultdict
# from sortedcontainers import SortedSet, SortedList
MOD = 998244353
n = int(input())
arr = list(map(int, input().split()))
dp = [0] * (n+1)
dp[0] = 1
for i in range(n):
l, r = i, i+1
while l > 0 and arr[l-1] < arr[i]:
l -= 1
while r < n and arr[r] < arr[i]:
r += 1
for k in range(l, r):
dp[k+1] += dp[k]
dp[k+1] %= MOD
print(dp[n])
|
ConDefects/ConDefects/Code/agc058_b/Python/34059476
|
condefects-python_data_2407
|
import sys
def _bsf(n):
"n > 0"
return ((n & -n) - 1).bit_length()
def _bsr(n):
"n > 0"
return n.bit_length() - 1
class FastSet:
"""C++ like set (ordered set) whose elements are limited to integers less than about 10 ** 10.
The number `n` is supposed to be less than about 10 ** 10,
and the elements added to the set must be less than `n`.
Reference: https://www.dropbox.com/s/1zxohqaxrb87uft/Gifted_Infants_The_University_of_Tokyo___erated_files-job_14.pdf?dl=0
"""
B = sys.int_info.bits_per_digit
def __init__(self, n: int) -> None:
"""It creates an ordered set of 0 elements.
All the elements added to the set must be integers in [0, n).
Constraints
-----------
> n < 10 ** 10
Complexity
----------
> O(n / B), where `B = sys.int_info.bits_per_digit`.
"""
self.n = n
self.seg = []
while True:
self.seg.append([0] * ((n + self.B - 1) // self.B))
n = (n + self.B - 1) // self.B
if n <= 1:
break
self.lg = len(self.seg)
self.size = 0
def contains(self, i: int) -> bool:
"""It returns whether or not `i` is in the set.
Complexity
----------
> O(1)
"""
if not 0 <= i < self.n:
return False
return bool((self.seg[0][i // self.B] >> (i % self.B)) & 1)
__contains__ = contains
def add(self, i: int) -> None:
"""It adds `i` to the set.
Constraints
-----------
> 0 <= i < n
Complexity
----------
> O(log n)
"""
assert 0 <= i < self.n
if i in self:
return
self.size += 1
for h in range(self.lg):
self.seg[h][i // self.B] |= 1 << (i % self.B)
i //= self.B
def discard(self, i: int) -> None:
"""It discards `i` from the set.
Constraints
-----------
> 0 <= i < n
Complexity
----------
> O(log n)
"""
assert 0 <= i < self.n
if i not in self:
return
self.size -= 1
for h in range(self.lg):
self.seg[h][i // self.B] &= ~(1 << (i % self.B))
if self.seg[h][i // self.B]:
break
i //= self.B
def next(self, i: int) -> int:
"""It returns minimum `e` in the set satisfying `i <= e`.
If such `e` does not exist, it returns `n`.
Complexity
----------
> O(log n)
"""
if self.n <= i:
return self.n
if i < 0:
i = 0
for h in range(self.lg):
if i // self.B == len(self.seg[h]):
break
d = self.seg[h][i // self.B] >> (i % self.B)
if d == 0:
i = i // self.B + 1
continue
i += _bsf(d)
for g in reversed(range(h)):
i *= self.B
i += _bsf(self.seg[g][i // self.B])
return i
return self.n
def prev(self, i: int) -> int:
"""It returns maximum `e` in the set satisfying `e < i`.
If such `e` does not exist, it returns -1.
Complexity
----------
> O(log n)
"""
if i <= 0:
return -1
if self.n <= i:
i = self.n
i -= 1
for h in range(self.lg):
if i == -1:
break
s = (-i - 1) % self.B
d = self.seg[h][i // self.B] & ((1 << (self.B - s)) - 1)
if d == 0:
i = i // self.B - 1
continue
i += _bsr(d) + s - (self.B - 1)
for g in reversed(range(h)):
i *= self.B
i += _bsr(self.seg[g][i // self.B])
return i
return -1
def minimum(self) -> int:
"""It returns the minimum element in the set.
If the set has no elements, it returns `n`.
Complexity
----------
> O(log n)
"""
return self.next(0)
def maximum(self) -> int:
"""It returns the maximum element in the set.
If the set has no elements, it returns -1.
Complexity
----------
> O(log n)
"""
return self.prev(self.n)
def __len__(self) -> int:
return self.size
def __bool__(self) -> bool:
return bool(len(self))
def __iter__(self) -> None:
e = -1
while True:
e = self.next(e + 1)
if e == self.n:
break
yield e
def __repr__(self):
return "{0}({1!r}, n={2})".format(
type(self).__name__, list(self), self.n
)
N = int(input())
Ps = list(map(int, input().split()))
inv = [-1] * N
for i in range(N):
Ps[i] -= 1
inv[Ps[i]] = i
begins = [-1] * N
ends = [-1] * N
fs = FastSet(N + 10)
fs.add(0)
fs.add(N + 1)
for P in reversed(range(N)):
i = inv[P]
begins[i] = fs.prev(i + 1)
ends[i] = fs.next(i + 1) - 1
fs.add(i + 1)
# print(fs)
dp = [1] + [0] * N
for b, e in zip(begins, ends):
for j in range(b, e):
dp[j + 1] += dp[j]
# print(dp)
print(dp[-1])
import sys
MOD = 998244353
def _bsf(n):
"n > 0"
return ((n & -n) - 1).bit_length()
def _bsr(n):
"n > 0"
return n.bit_length() - 1
class FastSet:
"""C++ like set (ordered set) whose elements are limited to integers less than about 10 ** 10.
The number `n` is supposed to be less than about 10 ** 10,
and the elements added to the set must be less than `n`.
Reference: https://www.dropbox.com/s/1zxohqaxrb87uft/Gifted_Infants_The_University_of_Tokyo___erated_files-job_14.pdf?dl=0
"""
B = sys.int_info.bits_per_digit
def __init__(self, n: int) -> None:
"""It creates an ordered set of 0 elements.
All the elements added to the set must be integers in [0, n).
Constraints
-----------
> n < 10 ** 10
Complexity
----------
> O(n / B), where `B = sys.int_info.bits_per_digit`.
"""
self.n = n
self.seg = []
while True:
self.seg.append([0] * ((n + self.B - 1) // self.B))
n = (n + self.B - 1) // self.B
if n <= 1:
break
self.lg = len(self.seg)
self.size = 0
def contains(self, i: int) -> bool:
"""It returns whether or not `i` is in the set.
Complexity
----------
> O(1)
"""
if not 0 <= i < self.n:
return False
return bool((self.seg[0][i // self.B] >> (i % self.B)) & 1)
__contains__ = contains
def add(self, i: int) -> None:
"""It adds `i` to the set.
Constraints
-----------
> 0 <= i < n
Complexity
----------
> O(log n)
"""
assert 0 <= i < self.n
if i in self:
return
self.size += 1
for h in range(self.lg):
self.seg[h][i // self.B] |= 1 << (i % self.B)
i //= self.B
def discard(self, i: int) -> None:
"""It discards `i` from the set.
Constraints
-----------
> 0 <= i < n
Complexity
----------
> O(log n)
"""
assert 0 <= i < self.n
if i not in self:
return
self.size -= 1
for h in range(self.lg):
self.seg[h][i // self.B] &= ~(1 << (i % self.B))
if self.seg[h][i // self.B]:
break
i //= self.B
def next(self, i: int) -> int:
"""It returns minimum `e` in the set satisfying `i <= e`.
If such `e` does not exist, it returns `n`.
Complexity
----------
> O(log n)
"""
if self.n <= i:
return self.n
if i < 0:
i = 0
for h in range(self.lg):
if i // self.B == len(self.seg[h]):
break
d = self.seg[h][i // self.B] >> (i % self.B)
if d == 0:
i = i // self.B + 1
continue
i += _bsf(d)
for g in reversed(range(h)):
i *= self.B
i += _bsf(self.seg[g][i // self.B])
return i
return self.n
def prev(self, i: int) -> int:
"""It returns maximum `e` in the set satisfying `e < i`.
If such `e` does not exist, it returns -1.
Complexity
----------
> O(log n)
"""
if i <= 0:
return -1
if self.n <= i:
i = self.n
i -= 1
for h in range(self.lg):
if i == -1:
break
s = (-i - 1) % self.B
d = self.seg[h][i // self.B] & ((1 << (self.B - s)) - 1)
if d == 0:
i = i // self.B - 1
continue
i += _bsr(d) + s - (self.B - 1)
for g in reversed(range(h)):
i *= self.B
i += _bsr(self.seg[g][i // self.B])
return i
return -1
def minimum(self) -> int:
"""It returns the minimum element in the set.
If the set has no elements, it returns `n`.
Complexity
----------
> O(log n)
"""
return self.next(0)
def maximum(self) -> int:
"""It returns the maximum element in the set.
If the set has no elements, it returns -1.
Complexity
----------
> O(log n)
"""
return self.prev(self.n)
def __len__(self) -> int:
return self.size
def __bool__(self) -> bool:
return bool(len(self))
def __iter__(self) -> None:
e = -1
while True:
e = self.next(e + 1)
if e == self.n:
break
yield e
def __repr__(self):
return "{0}({1!r}, n={2})".format(
type(self).__name__, list(self), self.n
)
N = int(input())
Ps = list(map(int, input().split()))
inv = [-1] * N
for i in range(N):
Ps[i] -= 1
inv[Ps[i]] = i
begins = [-1] * N
ends = [-1] * N
fs = FastSet(N + 10)
fs.add(0)
fs.add(N + 1)
for P in reversed(range(N)):
i = inv[P]
begins[i] = fs.prev(i + 1)
ends[i] = fs.next(i + 1) - 1
fs.add(i + 1)
# print(fs)
dp = [1] + [0] * N
for b, e in zip(begins, ends):
for j in range(b, e):
dp[j + 1] += dp[j]
dp[j + 1] %= MOD
# print(dp)
print(dp[-1])
|
ConDefects/ConDefects/Code/agc058_b/Python/34047806
|
condefects-python_data_2408
|
n = int(input())
P = list(map(int, input().split()))
L = []
stack = [(n + 1, 0)]
for i, p in enumerate(P, 1):
while stack[-1][0] < p:
stack.pop()
L.append(stack[-1][1])
stack.append((p, i))
R = []
stack = [(n + 1, n)]
for i in range(n - 1, -1, -1):
p = P[i]
while stack[-1][0] < p:
stack.pop()
R.append(stack[-1][1])
stack.append((p, i))
R = R[::-1]
dp = [0] * (n + 1)
dp[0] = 1
for l, r in zip(L, R):
tot = 0
for i in range(l, r + 1):
tot += dp[i]
dp[i] = tot
print(dp[-1])
MOD = 998244353
n = int(input())
P = list(map(int, input().split()))
L = []
stack = [(n + 1, 0)]
for i, p in enumerate(P, 1):
while stack[-1][0] < p:
stack.pop()
L.append(stack[-1][1])
stack.append((p, i))
R = []
stack = [(n + 1, n)]
for i in range(n - 1, -1, -1):
p = P[i]
while stack[-1][0] < p:
stack.pop()
R.append(stack[-1][1])
stack.append((p, i))
R = R[::-1]
dp = [0] * (n + 1)
dp[0] = 1
for l, r in zip(L, R):
tot = 0
for i in range(l, r + 1):
tot += dp[i]
tot %= MOD
dp[i] = tot
print(dp[-1])
|
ConDefects/ConDefects/Code/agc058_b/Python/34067395
|
condefects-python_data_2409
|
from itertools import accumulate
from typing import List, Tuple
import sys
import os
sys.setrecursionlimit(int(1e9))
input = lambda: sys.stdin.readline().rstrip("\r\n")
MOD = 998244353
INF = int(4e18)
def getRange(
nums: List[int],
*,
isMax=False,
isLeftStrict=True,
isRightStrict=False,
) -> List[Tuple[int, int]]:
"""
求每个元素作为最值的影响范围(区间)
默认为每个数作为左严格右非严格最小值的影响区间 [left,right]
有时候为了避免重复计算，我们可以考虑左侧`严格小于`当前元素的最近元素位置，
以及右侧`小于等于`当前元素的最近元素位置。
"""
def compareLeft(stackValue: int, curValue: int) -> bool:
if isLeftStrict and isMax:
return stackValue <= curValue
elif isLeftStrict and not isMax:
return stackValue >= curValue
elif not isLeftStrict and isMax:
return stackValue < curValue
else:
return stackValue > curValue
def compareRight(stackValue: int, curValue: int) -> bool:
if isRightStrict and isMax:
return stackValue <= curValue
elif isRightStrict and not isMax:
return stackValue >= curValue
elif not isRightStrict and isMax:
return stackValue < curValue
else:
return stackValue > curValue
n = len(nums)
leftMost = [0] * n
rightMost = [n - 1] * n
stack = []
for i in range(n):
while stack and compareRight(nums[stack[-1]], nums[i]):
rightMost[stack.pop()] = i - 1
stack.append(i)
stack = []
for i in range(n - 1, -1, -1):
while stack and compareLeft(nums[stack[-1]], nums[i]):
leftMost[stack.pop()] = i + 1
stack.append(i)
return list(zip(leftMost, rightMost))
n = int(input())
nums = list(map(int, input().split()))
ranges = getRange(nums, isMax=True)
# 每个数产生的不同个数由之前转移过来
dp = [0] * (n + 1)
dp[0] = 1
for i in range(n):
ndp, dpSum = dp[:], [0] + list(accumulate(dp, lambda x, y: (x + y) % MOD))
left, right = ranges[i]
for j in range(left, right + 1):
ndp[j + 1] += dpSum[j + 1] - dpSum[left]
ndp[j + 1] %= MOD
dp = ndp
print(dp[n], dp)
from itertools import accumulate
from typing import List, Tuple
import sys
import os
sys.setrecursionlimit(int(1e9))
input = lambda: sys.stdin.readline().rstrip("\r\n")
MOD = 998244353
INF = int(4e18)
def getRange(
nums: List[int],
*,
isMax=False,
isLeftStrict=True,
isRightStrict=False,
) -> List[Tuple[int, int]]:
"""
求每个元素作为最值的影响范围(区间)
默认为每个数作为左严格右非严格最小值的影响区间 [left,right]
有时候为了避免重复计算，我们可以考虑左侧`严格小于`当前元素的最近元素位置，
以及右侧`小于等于`当前元素的最近元素位置。
"""
def compareLeft(stackValue: int, curValue: int) -> bool:
if isLeftStrict and isMax:
return stackValue <= curValue
elif isLeftStrict and not isMax:
return stackValue >= curValue
elif not isLeftStrict and isMax:
return stackValue < curValue
else:
return stackValue > curValue
def compareRight(stackValue: int, curValue: int) -> bool:
if isRightStrict and isMax:
return stackValue <= curValue
elif isRightStrict and not isMax:
return stackValue >= curValue
elif not isRightStrict and isMax:
return stackValue < curValue
else:
return stackValue > curValue
n = len(nums)
leftMost = [0] * n
rightMost = [n - 1] * n
stack = []
for i in range(n):
while stack and compareRight(nums[stack[-1]], nums[i]):
rightMost[stack.pop()] = i - 1
stack.append(i)
stack = []
for i in range(n - 1, -1, -1):
while stack and compareLeft(nums[stack[-1]], nums[i]):
leftMost[stack.pop()] = i + 1
stack.append(i)
return list(zip(leftMost, rightMost))
n = int(input())
nums = list(map(int, input().split()))
ranges = getRange(nums, isMax=True)
# 每个数产生的不同个数由之前转移过来
dp = [0] * (n + 1)
dp[0] = 1
for i in range(n):
ndp, dpSum = dp[:], [0] + list(accumulate(dp, lambda x, y: (x + y) % MOD))
left, right = ranges[i]
for j in range(left, right + 1):
ndp[j + 1] += dpSum[j + 1] - dpSum[left]
ndp[j + 1] %= MOD
dp = ndp
print(dp[n])
|
ConDefects/ConDefects/Code/agc058_b/Python/34060327
|
condefects-python_data_2410
|
N = int(input())
A = list(map(int,input().split()))
if sum(A) > 0:
print(-sum(A))
else:
print(sum(A))
N = int(input())
A = list(map(int,input().split()))
if sum(A) > 0:
print(-sum(A))
else:
print(-sum(A))
|
ConDefects/ConDefects/Code/abc349_a/Python/54914679
|
condefects-python_data_2411
|
n = int(input())
a = list(map(int,input().split()))
a_n = abs(sum(a))
print(a_n)
n = int(input())
a = list(map(int,input().split()))
a_n = 0 - sum(a)
print(a_n)
|
ConDefects/ConDefects/Code/abc349_a/Python/54735340
|
condefects-python_data_2412
|
import sys
input=sys.stdin.readline
N,H = map(int,input().split())
X = list(map(int,input().split()))
X = [0] + X
P = [0 for i in range(N+1)]
F = [0 for i in range(N+1)]
for i in range(1,N):
P[i],F[i] = map(int,input().split())
inf = 10**8
dp = [[[inf for i in range(H+1)] for i in range(H+1)] for i in range(N+1)]
for i in range(H+1):
dp[0][H][i] = 0
for n in range(N-1):
d = X[n+1] - X[n]
for h in range(d,H+1):
for hh in range(H-d+1):
if dp[n][h][hh] == inf:
continue
#使わない
dp[n+1][h-d][hh+d] = min(dp[n+1][h-d][hh+d],dp[n][h][hh])
#往路で使う
hhh = min(H,h-d+F[n+1])
dp[n+1][hhh][hh+d] = min(dp[n+1][hhh][hh+d],dp[n][h][hh] + P[n+1])
#復路で使う
hhh = hh + d
if hhh == H:
for k in range(hhh-F[n+1],hhh+1):
dp[n+1][h-d][k] = min(dp[n+1][hhh][k],dp[n][h][hh] + P[n+1])
elif hhh >= F[n+1]:
dp[n+1][h-d][hhh-F[n+1]] = min(dp[n+1][h-d][hhh-F[n+1]],dp[n][h][hh] + P[n+1])
d = X[N] - X[N-1]
ans = inf
for h in range(d,H-d+1):
ans = min(ans,dp[N-1][h+d][h-d])
if ans == inf:
ans = -1
print(ans)
import sys
input=sys.stdin.readline
N,H = map(int,input().split())
X = list(map(int,input().split()))
X = [0] + X
P = [0 for i in range(N+1)]
F = [0 for i in range(N+1)]
for i in range(1,N):
P[i],F[i] = map(int,input().split())
inf = 10**8
dp = [[[inf for i in range(H+1)] for i in range(H+1)] for i in range(N+1)]
for i in range(H+1):
dp[0][H][i] = 0
for n in range(N-1):
d = X[n+1] - X[n]
for h in range(d,H+1):
for hh in range(H-d+1):
if dp[n][h][hh] == inf:
continue
#使わない
dp[n+1][h-d][hh+d] = min(dp[n+1][h-d][hh+d],dp[n][h][hh])
#往路で使う
hhh = min(H,h-d+F[n+1])
dp[n+1][hhh][hh+d] = min(dp[n+1][hhh][hh+d],dp[n][h][hh] + P[n+1])
#復路で使う
hhh = hh + d
if hhh == H:
for k in range(hhh-F[n+1],hhh+1):
dp[n+1][h-d][k] = min(dp[n+1][h-d][k],dp[n][h][hh] + P[n+1])
elif hhh >= F[n+1]:
dp[n+1][h-d][hhh-F[n+1]] = min(dp[n+1][h-d][hhh-F[n+1]],dp[n][h][hh] + P[n+1])
d = X[N] - X[N-1]
ans = inf
for h in range(d,H-d+1):
ans = min(ans,dp[N-1][h+d][h-d])
if ans == inf:
ans = -1
print(ans)
|
ConDefects/ConDefects/Code/abc320_f/Python/46034926
|
condefects-python_data_2413
|
import math
import re
import functools
import random
import sys
import os
import typing
from math import gcd,comb,sqrt
from collections import Counter, defaultdict, deque
from functools import lru_cache, reduce
from itertools import accumulate, combinations, permutations
from heapq import nsmallest, nlargest, heappushpop, heapify, heappop, heappush
from io import BytesIO, IOBase
from copy import deepcopy
import threading
from typing import *
from bisect import bisect_left, bisect_right
from types import GeneratorType
# from sortedcontainers import SortedList
from operator import add
BUFSIZE = 4096
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin = IOWrapper(sys.stdin)
sys.stdout = IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
def I():
return input()
def II():
return int(input())
def MII():
return map(int, input().split())
def LI():
return list(input().split())
def LII():
return list(map(int, input().split()))
def GMI():
return map(lambda x: int(x) - 1, input().split())
def LGMI():
return list(map(lambda x: int(x) - 1, input().split()))
inf=10**5
def solve():
n,h=MII()
A=LII()
B=[LII() for i in range(n-1)]+[[0,0]]
dp=[[inf]*(h+1) for i in range(h+1)]
for i in range(h+1):
dp[h][i]=0
pre=0
for k in range(n):
p,f=B[k]
x=A[k]-pre
pre=A[k]
ndp=[[inf]*(h+1) for i in range(h+1)]
for i in range(h+1):
for j in range(h+1):
if x<=i and j+x<=h:
ndp[i-x][j+x]=min(ndp[i-x][j+x],dp[i][j])
if i>=x and j+x<=h:
ndp[min(i-x+f,h)][j+x] = min(ndp[min(i-x+f,h)][j+x], p+dp[i][j])
if i+x<=h and min(j+f,h)>=x:
ndp[i][j] = min(ndp[i][j], p+dp[i+x][min(j+f,h)-x])
dp=ndp[:]
ans=inf
for i in range(h+1):
ans=min(dp[i][i],ans)
if ans<inf:
print(ans)
else:
print(-1)
for _ in range(1):
solve()
import math
import re
import functools
import random
import sys
import os
import typing
from math import gcd,comb,sqrt
from collections import Counter, defaultdict, deque
from functools import lru_cache, reduce
from itertools import accumulate, combinations, permutations
from heapq import nsmallest, nlargest, heappushpop, heapify, heappop, heappush
from io import BytesIO, IOBase
from copy import deepcopy
import threading
from typing import *
from bisect import bisect_left, bisect_right
from types import GeneratorType
# from sortedcontainers import SortedList
from operator import add
BUFSIZE = 4096
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin = IOWrapper(sys.stdin)
sys.stdout = IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
def I():
return input()
def II():
return int(input())
def MII():
return map(int, input().split())
def LI():
return list(input().split())
def LII():
return list(map(int, input().split()))
def GMI():
return map(lambda x: int(x) - 1, input().split())
def LGMI():
return list(map(lambda x: int(x) - 1, input().split()))
inf=10**15
def solve():
n,h=MII()
A=LII()
B=[LII() for i in range(n-1)]+[[0,0]]
dp=[[inf]*(h+1) for i in range(h+1)]
for i in range(h+1):
dp[h][i]=0
pre=0
for k in range(n):
p,f=B[k]
x=A[k]-pre
pre=A[k]
ndp=[[inf]*(h+1) for i in range(h+1)]
for i in range(h+1):
for j in range(h+1):
if x<=i and j+x<=h:
ndp[i-x][j+x]=min(ndp[i-x][j+x],dp[i][j])
if i>=x and j+x<=h:
ndp[min(i-x+f,h)][j+x] = min(ndp[min(i-x+f,h)][j+x], p+dp[i][j])
if i+x<=h and min(j+f,h)>=x:
ndp[i][j] = min(ndp[i][j], p+dp[i+x][min(j+f,h)-x])
dp=ndp[:]
ans=inf
for i in range(h+1):
ans=min(dp[i][i],ans)
if ans<inf:
print(ans)
else:
print(-1)
for _ in range(1):
solve()
|
ConDefects/ConDefects/Code/abc320_f/Python/51972231
|
condefects-python_data_2414
|
#!/usr/bin/env python3
import sys
def solve(N: int, H: int, X: "list[int]", P: "list[int]", F: "list[int]"):
INF = 99
L = []
cur = 0
for i in range(N):
L.append(X[i]-cur)
cur = X[i]
dp = [[[INF]*(H+1) for _ in range(H+1)] for _ in range(N+1)]
P.append(0)
F.append(0)
for i in range(H+1):
dp[0][H][i] = 0
for i in range(N):
for j in range(H+1):
for k in range(H+1):
if dp[i][j][k] == INF:
continue
if j-L[i] < 0 or k+L[i] > H:
continue
# 往路で利用するとき
dp[i+1][min(j-L[i]+F[i], H)][k+L[i]] = min(dp[i][j][k]+P[i], dp[i+1][min(j-L[i]+F[i], H)][k+L[i]])
# 復路で利用するとき
if k+L[i] == H:
for l in range(F[i]+1):
if 0 <= k+L[i]-l:
dp[i+1][j-L[i]][k+L[i]-l] = min(dp[i][j][k]+P[i], dp[i+1][j-L[i]][k+L[i]-l])
else:
if 0 <= k+L[i]-F[i]:
dp[i+1][j-L[i]][k+L[i]-F[i]] = min(dp[i][j][k]+P[i], dp[i+1][j-L[i]][k+L[i]-F[i]])
# どちらも利用しないとき
dp[i+1][j-L[i]][k+L[i]] = min(dp[i][j][k], dp[i+1][j-L[i]][k+L[i]])
ans = INF
for i in range(H+1):
ans = min(ans, dp[N][i][i])
if ans == INF:
print(-1)
else:
print(ans)
return
# Generated by 2.13.0 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
H = int(next(tokens)) # type: int
X = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
P = [int()] * (N - 1) # type: "List[int]"
F = [int()] * (N - 1) # type: "List[int]"
for i in range(N - 1):
P[i] = int(next(tokens))
F[i] = int(next(tokens))
solve(N, H, X, P, F)
if __name__ == '__main__':
main()
#!/usr/bin/env python3
import sys
def solve(N: int, H: int, X: "list[int]", P: "list[int]", F: "list[int]"):
INF = 10**18
L = []
cur = 0
for i in range(N):
L.append(X[i]-cur)
cur = X[i]
dp = [[[INF]*(H+1) for _ in range(H+1)] for _ in range(N+1)]
P.append(0)
F.append(0)
for i in range(H+1):
dp[0][H][i] = 0
for i in range(N):
for j in range(H+1):
for k in range(H+1):
if dp[i][j][k] == INF:
continue
if j-L[i] < 0 or k+L[i] > H:
continue
# 往路で利用するとき
dp[i+1][min(j-L[i]+F[i], H)][k+L[i]] = min(dp[i][j][k]+P[i], dp[i+1][min(j-L[i]+F[i], H)][k+L[i]])
# 復路で利用するとき
if k+L[i] == H:
for l in range(F[i]+1):
if 0 <= k+L[i]-l:
dp[i+1][j-L[i]][k+L[i]-l] = min(dp[i][j][k]+P[i], dp[i+1][j-L[i]][k+L[i]-l])
else:
if 0 <= k+L[i]-F[i]:
dp[i+1][j-L[i]][k+L[i]-F[i]] = min(dp[i][j][k]+P[i], dp[i+1][j-L[i]][k+L[i]-F[i]])
# どちらも利用しないとき
dp[i+1][j-L[i]][k+L[i]] = min(dp[i][j][k], dp[i+1][j-L[i]][k+L[i]])
ans = INF
for i in range(H+1):
ans = min(ans, dp[N][i][i])
if ans == INF:
print(-1)
else:
print(ans)
return
# Generated by 2.13.0 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
H = int(next(tokens)) # type: int
X = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
P = [int()] * (N - 1) # type: "List[int]"
F = [int()] * (N - 1) # type: "List[int]"
for i in range(N - 1):
P[i] = int(next(tokens))
F[i] = int(next(tokens))
solve(N, H, X, P, F)
if __name__ == '__main__':
main()
|
ConDefects/ConDefects/Code/abc320_f/Python/47539324
|
condefects-python_data_2415
|
n,h=map(int,input().split())
x=list(map(int,input().split()))+[0]
X=10**10
q=[[X]*(h+1) for i in range(h+1)]
for i in range(h+1):
q[h][i]=0
from atcoder import lazysegtree
for i in range(n):
nq=[[X]*(h+1) for j in range(h+1)]
p,f=0,0
if i<n-1:
p,f=map(int,input().split())
dx=x[i]-x[i-1]
for j in range(h+1):
st=lazysegtree.LazySegTree(
min,
X,
min,
min,
X,
[X]*(h+1)
)
for k in range(h+1):
if q[j][k]<X:
if j-dx>=0 and k+dx<=h:
nq[j-dx][k+dx]=min(nq[j-dx][k+dx],q[j][k])
if j-dx>=0 and k+dx<=h:
nq[min(j-dx+f,h)][k+dx]=min(nq[min(j-dx+f,h)][k+dx],q[j][k]+p)
if j-dx>=0 and k+dx<=h and k+dx-f>=0:
nq[j-dx][k+dx-f]=min(nq[j-dx][k+dx-f],q[j][k]+p)
if j-dx>=0 and k+dx==h:
for l in range(h-f,h+1):
nq[j-dx][l]=max(nq[j-dx][l],q[j][k]+p)
q=nq
g=X
for i in range(h+1):
g=min(g,q[i][i])
print(g if g<X else -1)
n,h=map(int,input().split())
x=list(map(int,input().split()))+[0]
X=10**10
q=[[X]*(h+1) for i in range(h+1)]
for i in range(h+1):
q[h][i]=0
from atcoder import lazysegtree
for i in range(n):
nq=[[X]*(h+1) for j in range(h+1)]
p,f=0,0
if i<n-1:
p,f=map(int,input().split())
dx=x[i]-x[i-1]
for j in range(h+1):
st=lazysegtree.LazySegTree(
min,
X,
min,
min,
X,
[X]*(h+1)
)
for k in range(h+1):
if q[j][k]<X:
if j-dx>=0 and k+dx<=h:
nq[j-dx][k+dx]=min(nq[j-dx][k+dx],q[j][k])
if j-dx>=0 and k+dx<=h:
nq[min(j-dx+f,h)][k+dx]=min(nq[min(j-dx+f,h)][k+dx],q[j][k]+p)
if j-dx>=0 and k+dx<=h and k+dx-f>=0:
nq[j-dx][k+dx-f]=min(nq[j-dx][k+dx-f],q[j][k]+p)
if j-dx>=0 and k+dx==h:
for l in range(h-f,h+1):
nq[j-dx][l]=min(nq[j-dx][l],q[j][k]+p)
q=nq
g=X
for i in range(h+1):
g=min(g,q[i][i])
print(g if g<X else -1)
|
ConDefects/ConDefects/Code/abc320_f/Python/48703794
|
condefects-python_data_2416
|
import collections
T=int(input())
for t in range(T):
N,M=map(int,input().split())
C=list(map(int,input().split()))
G=[[] for i in range(N)]
for i in range(M):
u,v=map(int,input().split())
u-=1
v-=1
G[u].append(v)
G[v].append(u)
inf=10**9+10
D=[[inf]*N for i in range(N)]
D[0][N-1]=0
Q=collections.deque()
Q.append((0,N-1,0))
while Q:
taka,aoki,cost=Q.popleft()
for dst_t in G[taka]:
for dst_a in G[aoki]:
if D[dst_t][dst_a]==inf and C[dst_t]!=C[dst_a]:
D[dst_t][dst_a]=cost+1
Q.appendleft((dst_t,dst_a,cost+1))
ans=D[N-1][0]
if ans==inf:
ans=-1
print(ans)
import collections
T=int(input())
for t in range(T):
N,M=map(int,input().split())
C=list(map(int,input().split()))
G=[[] for i in range(N)]
for i in range(M):
u,v=map(int,input().split())
u-=1
v-=1
G[u].append(v)
G[v].append(u)
inf=10**9+10
D=[[inf]*N for i in range(N)]
D[0][N-1]=0
Q=collections.deque()
Q.append((0,N-1,0))
while Q:
taka,aoki,cost=Q.pop()
for dst_t in G[taka]:
for dst_a in G[aoki]:
if D[dst_t][dst_a]==inf and C[dst_t]!=C[dst_a]:
D[dst_t][dst_a]=cost+1
Q.appendleft((dst_t,dst_a,cost+1))
ans=D[N-1][0]
if ans==inf:
ans=-1
print(ans)
|
ConDefects/ConDefects/Code/abc289_e/Python/45463729
|
condefects-python_data_2417
|
from collections import deque
def solve():
n, m = map(int,input().split())
c = list(map(int,input().split()))
g = [[] for _ in range(n)]
for _ in range(m):
u, v = map(int,input().split())
u -= 1
v -= 1
g[u].append(v)
g[v].append(u)
if c[0] == c[n-1]:
print(-1)
return
visited = set()
visited.add((0, n-1))
dq = deque()
dq.append((0, n-1, 0))
while dq:
p1, p2, cnt = dq.popleft()
if (p1, p2) == (n-1, 0):
print(cnt)
return
for p1nex in g[p1]:
for p2nex in g[p2]:
if c[p1nex] != c[p2nex] and (p1nex, p2nex) not in visited:
dq.append((p1nex, p2nex, cnt+1))
visited.add((p1nex, p2nex))
T = int(input())
for _ in range(T):
solve()
from collections import deque
def solve():
n, m = map(int,input().split())
c = list(map(int,input().split()))
g = [[] for _ in range(n)]
for _ in range(m):
u, v = map(int,input().split())
u -= 1
v -= 1
g[u].append(v)
g[v].append(u)
if c[0] == c[n-1]:
print(-1)
return
visited = set()
visited.add((0, n-1))
dq = deque()
dq.append((0, n-1, 0))
while dq:
p1, p2, cnt = dq.popleft()
if (p1, p2) == (n-1, 0):
print(cnt)
return
for p1nex in g[p1]:
for p2nex in g[p2]:
if c[p1nex] != c[p2nex] and (p1nex, p2nex) not in visited:
dq.append((p1nex, p2nex, cnt+1))
visited.add((p1nex, p2nex))
print(-1)
return
T = int(input())
for _ in range(T):
solve()
|
ConDefects/ConDefects/Code/abc289_e/Python/46186786
|
condefects-python_data_2418
|
from ortools.linear_solver import pywraplp
l,r=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[list(map(int,input().split())) for i in range(l)]
p=pywraplp.Solver.CreateSolver("PDLP")
x=[p.NumVar(0,p.infinity(),"x_{}".format(i)) for i in range(l)]
y=[p.NumVar(0,p.infinity(),"y_{}".format(i)) for i in range(r)]
for i in range(l):
for j in range(r):
p.Add(c[i][j]<=x[i]+y[j])
p.Minimize(sum([a[i]*x[i] for i in range(l)])+sum([b[i]*y[i] for i in range(r)]))
p.Solve()
print(int(p.Objective().Value()))
from ortools.linear_solver import pywraplp
l,r=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=[list(map(int,input().split())) for i in range(l)]
p=pywraplp.Solver.CreateSolver("CP_SAT")
x=[p.NumVar(0,p.infinity(),"x_{}".format(i)) for i in range(l)]
y=[p.NumVar(0,p.infinity(),"y_{}".format(i)) for i in range(r)]
for i in range(l):
for j in range(r):
p.Add(c[i][j]<=x[i]+y[j])
p.Minimize(sum([a[i]*x[i] for i in range(l)])+sum([b[i]*y[i] for i in range(r)]))
p.Solve()
print(int(p.Objective().Value()))
|
ConDefects/ConDefects/Code/abc224_h/Python/48473722
|
condefects-python_data_2419
|
mod = 998244353
n,*A = map(int,open(0).read().split())
A.append(A[-1])
C = [0]*(n+1)
ans = 1
l = r = 0
s = 0
c = 0
dp = [0]*n
for i in range(n):
c += C[A[i]] == 0
C[A[i]] = 1
while r < i-2 and c >= 3:
C[A[r]] -= 1
c -= C[A[r]] == 0
s += dp[r]
s %= mod
r += 1
if i == l:
t = 1
else:
t = sum(dp[max(l,i-2):i])+s
t %= mod
dp[i] = t
if A[i] == A[i+1]:
for j in range(l,i+1):
C[A[j]] = 0
l = r = i+1
s = 0
c = 0
ans *= t
ans %= mod
print(ans)
mod = 998244353
n,*A = map(int,open(0).read().split())
A.append(A[-1])
C = [0]*(n+1)
ans = 1
l = r = 0
s = 0
c = 0
dp = [0]*n
for i in range(n):
c += C[A[i]] == 0
C[A[i]] += 1
while r < i-2 and c >= 3:
C[A[r]] -= 1
c -= C[A[r]] == 0
s += dp[r]
s %= mod
r += 1
if i == l:
t = 1
else:
t = sum(dp[max(l,i-2):i])+s
t %= mod
dp[i] = t
if A[i] == A[i+1]:
for j in range(l,i+1):
C[A[j]] = 0
l = r = i+1
s = 0
c = 0
ans *= t
ans %= mod
print(ans)
|
ConDefects/ConDefects/Code/arc128_d/Python/26708943
|
condefects-python_data_2420
|
import sys
readline = sys.stdin.readline
n = int(readline())
*a, = map(int,readline().split())
a.append(a[-1])
def solve(a):
# 隣接する同じ元がない
n = len(a)
if n <= 2: return 1
# ababa パターンはダメ、それ以外はok
same = list(range(n))
for i in range(2,n):
if a[i] == a[i-2]:
same[i] = same[i-2]
#print(a)
#print(same)
dp = [0]*n
acc = [0]*n
dp[0] = acc[0] = dp[1] = 1
acc[1] = 2
for i in range(2,n):
r = 0
p = same[i]
q = same[i-1]
if q <= p-1:
r = p-1
elif q == p+1:
r = p
else:
r = q
if r > i-2: r = i
dp[i] = acc[r-1] if r else 0
if r <= i-1:
dp[i] += dp[i-1]
if r <= i-2:
dp[i] += dp[i-2]
dp[i] %= MOD
acc[i] = (acc[i-1] + dp[i])%MOD
#print(dp)
#print(acc)
#print()
return dp[-1]
MOD = 998244353
ans = 1
r = []
for ai in a:
if not r or r[-1] != ai:
r.append(ai)
else:
ans = ans*solve(r)%MOD
r = [ai]
print(ans)
import sys
readline = sys.stdin.readline
n = int(readline())
*a, = map(int,readline().split())
a.append(a[-1])
def solve(a):
# 隣接する同じ元がない
n = len(a)
if n <= 2: return 1
# ababa パターンはダメ、それ以外はok
same = list(range(n))
for i in range(2,n):
if a[i] == a[i-2]:
same[i] = same[i-2]
#print(a)
#print(same)
dp = [0]*n
acc = [0]*n
dp[0] = acc[0] = dp[1] = 1
acc[1] = 2
for i in range(2,n):
r = 0
p = same[i]
q = same[i-1]
if q <= p-1:
r = p-1
elif q == p+1:
r = p
else:
r = q-1
if r > i-2: r = i
dp[i] = acc[r-1] if r else 0
if r <= i-1:
dp[i] += dp[i-1]
if r <= i-2:
dp[i] += dp[i-2]
dp[i] %= MOD
acc[i] = (acc[i-1] + dp[i])%MOD
#print(dp)
#print(acc)
#print()
return dp[-1]
MOD = 998244353
ans = 1
r = []
for ai in a:
if not r or r[-1] != ai:
r.append(ai)
else:
ans = ans*solve(r)%MOD
r = [ai]
print(ans)
|
ConDefects/ConDefects/Code/arc128_d/Python/26604143
|
condefects-python_data_2421
|
import math
def distance_2d(x1, y1, x2, y2):
return math.sqrt((x2 - x1)**2 + (y2 - y1)**2)
n = int(input())
l = [0]*n
ans = [[0 for _ in range(n)] for _ in range(n)]
for i in range(n):
l[i]=list(map(int, input().split()))
for i in range(n):
for j in range(n):
ans[i][j] = distance_2d(l[i][0], l[i][1], l[j][0], l[j][1])
max_value = max(max(row) for row in ans)
import math
def distance_2d(x1, y1, x2, y2):
return math.sqrt((x2 - x1)**2 + (y2 - y1)**2)
n = int(input())
l = [0]*n
ans = [[0 for _ in range(n)] for _ in range(n)]
for i in range(n):
l[i]=list(map(int, input().split()))
for i in range(n):
for j in range(n):
ans[i][j] = distance_2d(l[i][0], l[i][1], l[j][0], l[j][1])
print(max(max(row) for row in ans))
|
ConDefects/ConDefects/Code/abc234_b/Python/45754993
|
condefects-python_data_2422
|
import sys
# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 18446744073709551615
# inf = 4294967295
# md = 10**9+7
md = 998244353
def nHr(hn, hr):
return nCr(hn+hr-1, hr-1)
def nPr(com_n, com_r):
if com_r < 0: return 0
if com_n < com_r: return 0
return fac[com_n]*ifac[com_n-com_r]%md
def nCr(com_n, com_r):
if com_r < 0: return 0
if com_n < com_r: return 0
return fac[com_n]*ifac[com_r]%md*ifac[com_n-com_r]%md
# 準備
n_max = 5000005
fac = [1]
for i in range(1, n_max+1): fac.append(fac[-1]*i%md)
ifac = [1]*(n_max+1)
ifac[n_max] = pow(fac[n_max], md-2, md)
for i in range(n_max-1, 1, -1): ifac[i] = ifac[i+1]*(i+1)%md
n, *abc = LI()
pw = [1]
for _ in range(n): pw.append(pw[-1]*2%md)
# jC0 to jCa
cm = [[0]*(n+1) for _ in range(3)]
for i, a in enumerate(abc):
for j in range(n+1):
if j <= a:
cm[i][j] = pw[j]
else:
cm[i][j] = (cm[i][j-1]*2-nCr(j-1, a))%md
ans = 0
coef = 1
for b in range(n+1):
ans += coef*cm[0][b]*cm[1][b]%md*cm[2][b]%md*nCr(n, b)%md
ans %= md
coef = -coef
print(ans)
import sys
# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 18446744073709551615
# inf = 4294967295
# md = 10**9+7
md = 998244353
def nHr(hn, hr):
return nCr(hn+hr-1, hr-1)
def nPr(com_n, com_r):
if com_r < 0: return 0
if com_n < com_r: return 0
return fac[com_n]*ifac[com_n-com_r]%md
def nCr(com_n, com_r):
if com_r < 0: return 0
if com_n < com_r: return 0
return fac[com_n]*ifac[com_r]%md*ifac[com_n-com_r]%md
# 準備
n_max = 5000005
fac = [1]
for i in range(1, n_max+1): fac.append(fac[-1]*i%md)
ifac = [1]*(n_max+1)
ifac[n_max] = pow(fac[n_max], md-2, md)
for i in range(n_max-1, 1, -1): ifac[i] = ifac[i+1]*(i+1)%md
n, *abc = LI()
pw = [1]
for _ in range(n): pw.append(pw[-1]*2%md)
# jC0 to jCa
cm = [[0]*(n+1) for _ in range(3)]
for i, a in enumerate(abc):
for j in range(n+1):
if j <= a:
cm[i][j] = pw[j]
else:
cm[i][j] = (cm[i][j-1]*2-nCr(j-1, a))%md
ans = 0
coef = 1
for b in range(n+1):
ans += coef*cm[0][n-b]*cm[1][n-b]%md*cm[2][n-b]%md*nCr(n, b)%md
ans %= md
coef = -coef
print(ans)
|
ConDefects/ConDefects/Code/abc235_g/Python/28594583
|
condefects-python_data_2423
|
N, A, B, C = map(int,input().split())
mod = 998244353
fact = [1]*(N+1)
invf = [1]*(N+1)
for i in range(N):
fact[i+1] = fact[i] * (i+1) % mod
invf[-1] = pow(fact[-1], mod-2, mod)
for i in range(N, 0, -1):
invf[i-1] = invf[i] * i % mod
def comb(n, k):
if n < 0 or k < 0 or n < k:
return 0
return fact[n] * invf[k] % mod * invf[n-k] % mod
f, g, h = 0, 0, 0
fb, gb, hb = 1, 1, 1
sign = 1
S = 0
for k in range(N+1):
S = (S+sign*comb(N,k)%mod * (fb - f) * (fb - g) * (fb - h) % mod)%mod
f = (2*f+comb(k, A))%mod
g = (2*g+comb(k, B))%mod
h = (2*h+comb(k, C))%mod
fb = 2*fb%mod
sign = sign*(mod-1)%mod
print(S)
N, A, B, C = map(int,input().split())
mod = 998244353
fact = [1]*(N+1)
invf = [1]*(N+1)
for i in range(N):
fact[i+1] = fact[i] * (i+1) % mod
invf[-1] = pow(fact[-1], mod-2, mod)
for i in range(N, 0, -1):
invf[i-1] = invf[i] * i % mod
def comb(n, k):
if n < 0 or k < 0 or n < k:
return 0
return fact[n] * invf[k] % mod * invf[n-k] % mod
f, g, h = 0, 0, 0
fb, gb, hb = 1, 1, 1
sign = pow(-1,N,mod)
S = 0
for k in range(N+1):
S = (S+sign*comb(N,k)%mod * (fb - f) * (fb - g) * (fb - h) % mod)%mod
f = (2*f+comb(k, A))%mod
g = (2*g+comb(k, B))%mod
h = (2*h+comb(k, C))%mod
fb = 2*fb%mod
sign = sign*(mod-1)%mod
print(S)
|
ConDefects/ConDefects/Code/abc235_g/Python/28640040
|
condefects-python_data_2424
|
class CalcFactorial:
def __init__(self, n, mod=998244353):
self.n = n
self.mod = mod
self.fact = [0] * (n + 1)
self.fact[0] = 1
for i in range(n):
self.fact[i + 1] = self.fact[i] * (i + 1) % mod
# i! のmodにおける逆元
self.inv = [0] * (n + 1)
self.inv[-1] = pow(self.fact[-1], mod - 2, mod)
for i in range(n, 0, -1):
self.inv[i - 1] = self.inv[i] * i % mod
def p(self, n, r):
if n < r or r < 0:
return 0
else:
return self.fact[n] * self.inv[n - r] % self.mod
def c(self, n, r):
if n < r or r < 0:
return 0
else:
return self.fact[n] * self.inv[n - r] * self.inv[r] % self.mod
n, a, b, c = map(int, input().split())
mod = 998244353
cal = CalcFactorial(n + 2)
sm_a = sum([cal.c(n, i) for i in range(a + 1)]) % mod
sm_b = sum([cal.c(n, i) for i in range(b + 1)]) % mod
sm_c = sum([cal.c(n, i) for i in range(c + 1)]) % mod
ans = sm_a * sm_b % mod * sm_c % mod
inv2 = cal.inv[2]
for i in range(1, n):
sm_a = (sm_a + cal.c(n - i, a)) * inv2 % mod
sm_b = (sm_b + cal.c(n - i, b)) * inv2 % mod
sm_c = (sm_c + cal.c(n - i, c)) * inv2 % mod
ans += sm_a * sm_b % mod * sm_c % mod * cal.c(n, i) * ((-1) ** (i & 1))
ans %= mod
print((ans + 1) % mod)
class CalcFactorial:
def __init__(self, n, mod=998244353):
self.n = n
self.mod = mod
self.fact = [0] * (n + 1)
self.fact[0] = 1
for i in range(n):
self.fact[i + 1] = self.fact[i] * (i + 1) % mod
# i! のmodにおける逆元
self.inv = [0] * (n + 1)
self.inv[-1] = pow(self.fact[-1], mod - 2, mod)
for i in range(n, 0, -1):
self.inv[i - 1] = self.inv[i] * i % mod
def p(self, n, r):
if n < r or r < 0:
return 0
else:
return self.fact[n] * self.inv[n - r] % self.mod
def c(self, n, r):
if n < r or r < 0:
return 0
else:
return self.fact[n] * self.inv[n - r] * self.inv[r] % self.mod
n, a, b, c = map(int, input().split())
mod = 998244353
cal = CalcFactorial(n + 2)
sm_a = sum([cal.c(n, i) for i in range(a + 1)]) % mod
sm_b = sum([cal.c(n, i) for i in range(b + 1)]) % mod
sm_c = sum([cal.c(n, i) for i in range(c + 1)]) % mod
ans = sm_a * sm_b % mod * sm_c % mod
inv2 = cal.inv[2]
for i in range(1, n):
sm_a = (sm_a + cal.c(n - i, a)) * inv2 % mod
sm_b = (sm_b + cal.c(n - i, b)) * inv2 % mod
sm_c = (sm_c + cal.c(n - i, c)) * inv2 % mod
ans += sm_a * sm_b % mod * sm_c % mod * cal.c(n, i) * ((-1) ** (i & 1))
ans %= mod
print((ans + (-1) ** (n & 1)) % mod)
|
ConDefects/ConDefects/Code/abc235_g/Python/48493148
|
condefects-python_data_2425
|
# InlineImporter
import os as _os
import sys as _sys
from functools import lru_cache as _lru_cache
from importlib.abc import ExecutionLoader, MetaPathFinder
from importlib.machinery import ModuleSpec
class InlineImporter(ExecutionLoader, MetaPathFinder):
version = None
inlined_modules = {}
namespace_packages = False
@classmethod
def find_spec(cls, fullname, path=None, target=None):
"""Find a spec for a given module.
Because we only deal with our inlined module, we don't have to care about path or target.
The import machinery also takes care of fully resolving all names, so we just have to deal with the fullnames.
"""
if fullname in cls.inlined_modules:
# We have inlined this module, so return the spec
ms = ModuleSpec(fullname, cls, origin=cls.get_filename(fullname), is_package=cls.is_package(fullname))
ms.has_location = True
if cls.namespace_packages and ms.submodule_search_locations is not None:
for p in _sys.path:
ms.submodule_search_locations.append(_os.path.join(p, _os.path.dirname(ms.origin)))
return ms
return None
@staticmethod
def _call_with_frames_removed(f, *args, **kwds):
"""remove_importlib_frames in import.c will always remove sequences
of importlib frames that end with a call to this function
Use it instead of a normal call in places where including the importlib
frames introduces unwanted noise into the traceback (e.g. when executing
module code)
"""
return f(*args, **kwds)
@classmethod
def create_module(cls, spec):
"""Create a module using the default machinery."""
return None
@classmethod
def exec_module(cls, module):
"""Execute the module."""
code = cls.get_code(module.__name__)
if code is None:
raise ImportError("cannot load module {!r} when get_code() returns None".format(module.__name__))
cls._call_with_frames_removed(exec, code, module.__dict__)
@classmethod
@_lru_cache(maxsize=None)
def get_filename(cls, fullname):
"""Returns the
Raises ImportError if the module cannot be found.
"""
if fullname not in cls.inlined_modules:
raise ImportError
mod = cls.inlined_modules[fullname]
origin = fullname
if mod[0]:
origin = ".".join([origin, "__init__"])
origin = ".".join([origin.replace(".", "/"), "py"])
return origin
@classmethod
@_lru_cache(maxsize=None)
def is_package(cls, fullname):
if fullname not in cls.inlined_modules:
raise ImportError
return cls.inlined_modules[fullname][0]
@classmethod
def get_source(cls, fullname):
if fullname not in cls.inlined_modules:
raise ImportError
return cls.inlined_modules[fullname][1]
@classmethod
def get_code(cls, fullname):
"""Method to return the code object for fullname.
Should return None if not applicable (e.g. built-in module).
Raise ImportError if the module cannot be found.
"""
source = cls.get_source(fullname)
if source is None:
return None
try:
path = cls.get_filename(fullname)
except ImportError:
return cls.source_to_code(source)
else:
return cls.source_to_code(source, path)
InlineImporter.version = '0.0.4'
InlineImporter.inlined_modules = {
'lib.array2d': (False, "class Array2dView:\n def __init__(self, arr, i_indices, j_indices):\n self.arr = arr\n self.i_indices = i_indices\n self.j_indices = j_indices\n \n def _get_view(self, i, j):\n i = self.i_indices[i]\n j = self.j_indices[j]\n return Array2dView(self.arr, i, j)\n\n def get_ind(self, i, j):\n return self.i_indices[i]+self.j_indices[j]\n \n def __getitem__(self, index):\n i, j = index\n try:\n return self.arr[self.get_ind(i,j)]\n except TypeError:\n return self._get_view(i, j)\n \n def __setitem__(self, index, value):\n i, j = index\n try:\n self.arr[self.get_ind(i,j)] = value\n except TypeError:\n x = self._get_view(i, j)\n for i in x.i_indices:\n for j in x.j_indices:\n self.arr[i+j] = value\n \n def __iter__(self):\n for i in self.i_indices:\n for j in self.j_indices:\n yield self.arr[i+j]\n \n def __reversed__(self):\n for i in reversed(self.i_indices):\n for j in reversed(self.j_indices):\n yield self.arr[i+j]\n \n def __str__(self):\n m = max(len(str(v)) for v in self)\n res = ['']*len(self.i_indices)\n row = ['']*(len(self.j_indices)+2)\n for ri,i in enumerate(self.i_indices):\n if ri == 0:\n row[0] = '['\n else:\n row[0] = ' '\n if ri == len(self.i_indices)-1:\n row[-1] = ']\\n'\n for rj,j in enumerate(self.j_indices):\n row[rj+1] = f'{str(self.arr[i+j]):>{m+1}}'\n res[ri] = ''.join(row)\n return '\\n'.join(res)\n \n def copy(self):\n return Array2d(len(self.i_indices), len(self.j_indices), list(self))\n\n\nclass Array2d:\n def __init__(self, n, m, arr):\n self.n = n\n self.m = m\n self.arr = arr\n \n @classmethod\n def full(cls, n, m, fill_value):\n return cls(n, m, [fill_value]*(n*m))\n \n @classmethod\n def from_list(cls, lst):\n n,m = len(lst), len(lst[0])\n arr = [lst[0]]*(n*m)\n k = 0\n for row in lst:\n for v in row:\n arr[k] = v\n k += 1\n return cls(n, m, arr)\n \n def _get_view(self, i, j):\n i = tuple(range(0, self.n*self.m, self.m))[i]\n j = tuple(range(self.m))[j]\n return Array2dView(self.arr, i, j)\n\n def get_ind(self, i, j):\n return i*self.m+j\n\n def __getitem__(self, index):\n try:\n return self.arr[self.get_ind(*index)]\n except TypeError:\n return self._get_view(*index)\n \n def __setitem__(self, index, value):\n try:\n self.arr[self.get_ind(*index)] = value\n except TypeError:\n x = self._get_view(*index)\n for i in x.i_indices:\n for j in x.j_indices:\n self.arr[i+j] = value\n \n def __iter__(self):\n return iter(self.arr)\n \n def __reversed__(self):\n return reversed(self.arr)\n \n def __str__(self):\n m = max(len(str(v)) for v in self)\n res = ['']*self.n\n row = ['']*(self.m+2)\n for i in range(self.n):\n if i == 0:\n row[0] = '['\n else:\n row[0] = ' '\n if i == self.n-1:\n row[-1] = ']\\n'\n for j in range(self.m):\n row[j+1] = f'{str(self.arr[i*self.m+j]):>{m+1}}'\n res[i] = ''.join(row)\n return '\\n'.join(res)\n\n def __eq__(self, other):\n return self.arr == other.arr\n\n def copy(self):\n return self.__class__(self.n, self.m, self.arr[:])\n\n @property\n def t(self):\n arr = [self.arr[0]]*(len(self.arr))\n x = 0\n for i in range(self.n):\n for j in range(self.m):\n arr[j*self.n + i] = self.arr[x]\n x += 1\n return self.__class__(self.m, self.n, arr)\n"),
'lib.array3d': (False, 'class Array3d(list):\n def __init__(self, n, m, p, arr):\n list.__init__(self, arr)\n self.n = n\n self.m = m\n self.p = p\n self.mp = m*p\n\n @classmethod\n def full(cls, n, m, p, fill_value):\n return cls(n, m, p, [fill_value] * (n * m * p))\n\n def get_ind(self, i, j, k):\n return i * self.mp + j * self.p + k\n\n def __getitem__(self, index):\n return list.__getitem__(self, self.get_ind(*index))\n\n def __setitem__(self, index, value):\n list.__setitem__(self, self.get_ind(*index), value)\n'),
'lib.benchmark': (False, '\nfrom time import perf_counter as timer\ndef simple_timeit(func, repeat=1000, warmup=100):\n for i in range(warmup):\n func(i)\n start = timer()\n for i in range(repeat):\n func(i)\n stop = timer()\n return stop-start\n'),
'lib.data_structure': (False, 'from itertools import repeat\n\n\nclass DisjointSet:\n def __init__(self, parent):\n self.parent = parent\n\n @classmethod\n def empty(cls, size):\n return cls([-1]*size)\n\n def find(self, x):\n stack = []\n while self.parent[x] >= 0:\n stack.append(x)\n x = self.parent[x]\n for y in stack:\n self.parent[y] = x\n return x\n\n def union_reps(self, xr, yr):\n if xr == yr:\n return\n if self.parent[xr] > self.parent[yr]:\n xr, yr = yr, xr\n self.parent[xr] += self.parent[yr]\n self.parent[yr] = xr\n\n def union(self, x, y):\n self.union_reps(self.find(x), self.find(y))\n\n def group_size(self, x):\n return -self.parent[self.find(x)]\n\n def is_rep(self, x):\n return self.parent[x] < 0\n\n\nclass SegmentTree:\n """\n ???????????????????????????????????\n ???????????????????????????(???????????)\n """\n\n @classmethod\n def all_identity(cls, operator, identity, size):\n return cls(operator, identity, [identity] * (2 << (size - 1).bit_length()))\n\n @classmethod\n def from_initial_data(cls, operator, identity, data):\n size = 1 << (len(data) - 1).bit_length()\n temp = [identity] * (2 * size)\n temp[size:size + len(data)] = data\n data = temp\n\n for i in reversed(range(size)):\n data[i] = operator(data[2 * i], data[2 * i + 1])\n return cls(operator, identity, data)\n\n # ??????????????????????\n def __init__(self, operator, identity, data):\n self.op = operator\n self.id = identity\n self.data = data\n self.size = len(data) // 2\n\n def reduce(self, l, r):\n l += self.size\n r += self.size\n vl = self.id\n vr = self.id\n\n while l < r:\n if l & 1:\n vl = self.op(vl, self.data[l])\n l += 1\n if r & 1:\n r -= 1\n vr = self.op(self.data[r], vr)\n l >>= 1\n r >>= 1\n return self.op(vl, vr)\n\n def elements(self, l, r):\n l += self.size\n r += self.size\n\n lefts = []\n rights = []\n\n while l < r:\n if l & 1:\n lefts.append(self.data[l])\n l += 1\n if r & 1:\n r -= 1\n rights.append(self.data[r])\n l >>= 1\n r >>= 1\n return lefts, rights\n\n def __getitem__(self, i):\n if isinstance(i, slice):\n return self.reduce(\n 0 if i.start is None else i.start,\n self.size if i.stop is None else i.stop)\n elif isinstance(i, int):\n return self.data[i + self.size]\n\n def __setitem__(self, i, v):\n i += self.size\n while i:\n self.data[i] = v\n v = self.op(self.data[i ^ 1], v) if i & 1 else self.op(v, self.data[i ^ 1])\n i >>= 1\n\n def __iter__(self):\n return iter(self.data[self.size:])\n\n\nclass LazySegmentTree:\n """\n op: ????????reduce?????????\n apply: ??????\n comp: ??????\n \n range_query: reduce(op, (apply(x,m) for x,m in zip(X,M)))\n \n ???????:\n \n ??X (??)\n op[+]: X,X -> X\n (X, op)?????\n \n ??M (???)\n comp[*]: M,M -> M\n (M, compose)?????\n \n apply[f(x,m,n)]: X,M,Z+ -> X\n (Z+????)\n \n f(x,e_M,n) = x\n f(x,m*n,p) = f(f(x,m,p),n,p)\n f(x,m,p)+f(y,m,q) = f(x+y,m,p+q)\n \n ??: https://algo-logic.info/segment-tree/#toc_id_3\n """\n\n @classmethod\n def all_identity(cls, op, op_e, comp, comp_e, apply, size):\n size = 1 << (size - 1).bit_length()\n return cls(\n op,\n op_e,\n comp,\n comp_e,\n apply,\n [op_e] * (2 * size),\n [comp_e] * size\n )\n\n @classmethod\n def from_initial_data(cls, op, op_e, comp, comp_e, apply, data):\n size = 1 << (len(data) - 1).bit_length()\n temp = [op_e] * (2 * size)\n temp[size:size + len(data)] = data\n\n for i in reversed(range(size)):\n temp[i] = op(temp[2 * i], temp[2 * i + 1])\n return cls(\n op,\n op_e,\n comp,\n comp_e,\n apply,\n temp,\n [comp_e] * size\n )\n\n # ??????????????????????\n def __init__(self, op, op_e, comp, comp_e, apply, data, lazy):\n self.op = op\n self.op_e = op_e\n self.comp = comp\n self.comp_e = comp_e\n self.apply = apply\n self.data = data\n self.lazy = lazy\n self.size = len(self.data) // 2\n self.depth = self.size.bit_length() - 1\n self._l_indices = [0] * self.depth\n self._r_indices = [0] * self.depth\n\n def _update_indices(self, i, l):\n m = i // (i & -i)\n i >>= 1\n for k in range(self.depth):\n l[k] = i if i < m else 0\n i >>= 1\n\n def _propagate_top_down(self):\n data = self.data\n lazy = self.lazy\n apply = self.apply\n comp = self.comp\n comp_e = self.comp_e\n k = self.size >> 1\n\n for i, j in zip(reversed(self._l_indices), reversed(self._r_indices)):\n if i > 0:\n temp = lazy[i]\n if temp != comp_e:\n lazy[i] = comp_e\n a = i << 1\n b = a | 1\n data[a] = apply(data[a], temp, k)\n data[b] = apply(data[b], temp, k)\n if k > 1:\n lazy[a] = comp(lazy[a], temp)\n lazy[b] = comp(lazy[b], temp)\n if i < j:\n temp = lazy[j]\n if temp != comp_e:\n lazy[j] = comp_e\n a = j << 1\n b = a | 1\n data[a] = apply(data[a], temp, k)\n data[b] = apply(data[b], temp, k)\n if k > 1:\n lazy[a] = comp(lazy[a], temp)\n lazy[b] = comp(lazy[b], temp)\n k >>= 1\n\n def _propagate_bottom_up(self):\n data = self.data\n op = self.op\n for i, j in zip(self._l_indices, self._r_indices):\n if i < j:\n data[j] = op(data[j << 1], data[j << 1 | 1])\n if i > 0:\n data[i] = op(data[i << 1], data[i << 1 | 1])\n\n def update_interval(self, l, r, m):\n lazy = self.lazy\n data = self.data\n comp = self.comp\n apply = self.apply\n\n l += self.size\n r += self.size\n self._update_indices(l, self._l_indices)\n self._update_indices(r, self._r_indices)\n self._propagate_top_down()\n k = 1\n while l < r:\n if l & 1:\n data[l] = apply(data[l], m, k)\n if k > 1:\n lazy[l] = comp(lazy[l], m)\n l += 1\n if r & 1:\n r -= 1\n data[r] = apply(data[r], m, k)\n if k > 1:\n lazy[r] = comp(lazy[r], m)\n l >>= 1\n r >>= 1\n k <<= 1\n self._propagate_bottom_up()\n\n def get_interval(self, l, r):\n data = self.data\n op = self.op\n\n l += self.size\n r += self.size\n self._update_indices(l, self._l_indices)\n self._update_indices(r, self._r_indices)\n self._propagate_top_down()\n\n lx = self.op_e\n rx = self.op_e\n while l < r:\n if l & 1:\n lx = op(lx, data[l])\n l += 1\n if r & 1:\n r -= 1\n rx = op(data[r], rx)\n l >>= 1\n r >>= 1\n return op(lx, rx)\n\n\nfrom operator import add, sub\nclass BinaryIndexedTree:\n def __init__(self, size, zero=0, operator=add, inv_operator=sub):\n self.zero = zero\n self.op = operator\n self.inv = inv_operator\n self.data = [zero] * (size + 1)\n self.msb = 1 << (size.bit_length() - 1)\n\n def _add(self, i, w):\n i += 1\n while i < len(self.data):\n self.data[i] = self.op(self.data[i], w)\n i += i & -i\n\n def _get_sum(self, i):\n res = self.zero\n while i > 0:\n res = self.op(res, self.data[i])\n i -= i & -i\n return res\n\n def __getitem__(self, i):\n """\n [0,i)\n """\n if isinstance(i, slice):\n a = self._get_sum(len(self.data) - 1 if i.stop is None else i.stop)\n b = self._get_sum(0 if i.start is None else i.start)\n return self.inv(a, b)\n else:\n return self.zero # fake value\n\n __setitem__ = _add\n\n def bisect_left(self, v):\n """\n return smallest i s.t v <= sum[:i+1]\n """\n i = 0\n k = self.msb\n l = len(self.data)\n while k > 0:\n i += k\n if i < l and self.data[i] < v:\n v -= self.data[i]\n else:\n i -= k\n k >>= 1\n return i\n\n def bisect_right(self, v):\n """\n return smallest i s.t v < sum[:i+1]\n """\n i = 0\n k = self.msb\n l = len(self.data)\n while k > 0:\n i += k\n if i < l and self.data[i] <= v:\n v -= self.data[i]\n else:\n i -= k\n k >>= 1\n return i\n\n bisect = bisect_right\n\n'),
'lib.graph': (False, 'import itertools\nimport heapq as hq\nfrom random import randrange, shuffle\nfrom lib.misc import min2\nfrom lib.array2d import Array2d\nfrom collections import defaultdict\n\nfrom typing import Union, Iterable, Any, Tuple, List, Sequence, TypeVar, Optional, Callable\n\nT = TypeVar(\'T\')\n\nINF = 2 ** 62\n\n\nclass BaseWeightedGraph:\n\n def __init__(self, n_vertices: int):\n self.n_vertices = n_vertices\n\n def wadj(self, v: int) -> Iterable[Tuple[int, Any]]:\n """\n Return an iterable of vertices adjacent to v and edge weight\n """\n raise NotImplementedError\n\n def adj(self, v: int) -> Iterable[int]:\n """\n Return an iterable of vertices adjacent to v\n """\n return (u for u, w in self.wadj(v))\n\n @property\n def wedges(self) -> Iterable[Tuple[int, int, Any]]:\n """\n Return an iterable of weighted edges (vertex_1, vertex_2, weight)\n """\n return ((v, u, w) for v in range(self.n_vertices) for u, w in self.wadj(v))\n\n @property\n def edges(self):\n return ((v, u) for v in range(self.n_vertices) for u in self.adj(v))\n\n def dist(self, s: int, t: int, inf=INF):\n return dijkstra(self, s, t, inf)[1]\n\n def warshall_floyd(self, inf=INF):\n dist = Array2d.full(self.n_vertices, self.n_vertices, inf)\n for u, v, w in self.wedges:\n dist[u, v] = w\n for i in range(self.n_vertices):\n dist[i, i] = 0\n for k in range(self.n_vertices):\n for i in range(self.n_vertices):\n for j in range(self.n_vertices):\n dist[i, j] = min2(dist[i, j], dist[i, k] + dist[k, j])\n return dist\n\n\nclass WeightedGraph(BaseWeightedGraph):\n\n def __init__(self, n_vertices: int, adj: List[int], weight: List[Any], ind: List[int]):\n super().__init__(n_vertices)\n self._adj = adj\n self._weight = weight\n self._ind = ind\n\n @classmethod\n def from_lil_adj(cls, n_vertices: int, adj_list: Iterable[Sequence[Tuple[int, int]]]) -> \'WeightedGraph\':\n n_edges = sum(len(l) for l in adj_list)\n adj = [0] * n_edges\n weight = [0] * n_edges\n ind = [0] * (n_vertices + 1)\n i = 0\n for u, l in enumerate(adj_list):\n ind[u] = i\n for v, w in l:\n adj[i] = v\n weight[i] = w\n i += 1\n ind[n_vertices] = i\n return cls(n_vertices, adj, weight, ind)\n\n @classmethod\n def from_directed_edges(cls, n_vertices: int, edges: Iterable[Tuple[int, int, int]]) -> \'WeightedGraph\':\n temp = [[] for _ in range(n_vertices)]\n for u, v, w in edges:\n temp[u].append((v, w))\n return cls.from_lil_adj(n_vertices, temp)\n\n @classmethod\n def from_undirected_edges(cls, n_vertices: int, edges: Iterable[Tuple[int, int, int]]) -> \'WeightedGraph\':\n temp = [[] for _ in range(n_vertices)]\n for u, v, w in edges:\n temp[u].append((v, w))\n temp[v].append((u, w))\n return cls.from_lil_adj(n_vertices, temp)\n\n def wadj(self, v):\n i, j = self._ind[v], self._ind[v + 1]\n return ((self._adj[k], self._weight[k]) for k in range(i, j))\n\n def to_wgraph(self) -> \'WeightedGraph\':\n l = [[] for _ in range(self.n_vertices)]\n for u, v, w in self.wedges:\n l[u].append((v, w))\n return WeightedGraph.from_lil_adj(self.n_vertices, l)\n\n def to_reverse_wgraph(self) -> \'WeightedGraph\':\n l = [[] for _ in range(self.n_vertices)]\n for u, v, w in self.wedges:\n l[v].append((u, w))\n return WeightedGraph.from_lil_adj(self.n_vertices, l)\n\n\nclass BaseGraph(BaseWeightedGraph):\n\n def adj(self, v):\n raise NotImplementedError\n\n def wadj(self, v):\n return ((u, 1) for u in self.adj(v))\n\n def bfs(self, s: Union[int, Iterable[int]], t: int = -1) -> List[int]:\n """\n Returns a list of distance. If starts contains more than one vertex, returns the shortest distance from any of them\n """\n dist = [-1] * self.n_vertices\n\n if isinstance(s, int):\n q = [s]\n dist[s] = 0\n else:\n q = list(s)\n for v in q:\n dist[v] = 0\n for d in range(1, self.n_vertices):\n nq = []\n for v in q:\n for u in self.adj(v):\n if dist[u] < 0:\n dist[u] = d\n nq.append(u)\n if u == t:\n return dist\n q = nq\n return dist\n\n def dist(self, s: int, t: int, inf: Any = INF):\n d = self.bfs(s, t)[t]\n return inf if d == -1 else d\n\n def to_graph(self) -> \'Graph\':\n l = [[] for _ in range(self.n_vertices)]\n for u, v in self.edges:\n l[u].append(v)\n return Graph.from_lil_adj(self.n_vertices, l)\n\n def to_reverse_graph(self) -> \'Graph\':\n l = [[] for _ in range(self.n_vertices)]\n for u, v in self.edges:\n l[v].append(u)\n return Graph.from_lil_adj(self.n_vertices, l)\n\n\nclass Graph(BaseGraph):\n\n def __init__(self, n_vertices: int, adj: List[int], ind: List[int]):\n super().__init__(n_vertices)\n self._adj = adj\n self._ind = ind\n\n @classmethod\n def from_lil_adj(cls, n_vertices: int, adj_list: Iterable[Sequence[int]]) -> \'Graph\':\n n_edges = sum(len(l) for l in adj_list)\n adj = [0] * n_edges\n ind = [0] * (n_vertices + 1)\n i = 0\n for u, l in enumerate(adj_list):\n ind[u] = i\n for v in l:\n adj[i] = v\n i += 1\n ind[n_vertices] = i\n return cls(n_vertices, adj, ind)\n\n @classmethod\n def from_directed_edges(cls, n_vertices: int, edges: Iterable[Tuple[int, int]]) -> \'Graph\':\n temp = [[] for _ in range(n_vertices)]\n for u, v in edges:\n temp[u].append(v)\n return cls.from_lil_adj(n_vertices, temp)\n\n @classmethod\n def from_undirected_edges(cls, n_vertices: int, edges: Iterable[Tuple[int, int]]) -> \'Graph\':\n temp = [[] for _ in range(n_vertices)]\n for u, v in edges:\n temp[u].append(v)\n temp[v].append(u)\n return cls.from_lil_adj(n_vertices, temp)\n\n def adj(self, v):\n return self._adj[self._ind[v]: self._ind[v + 1]]\n\n\nclass BaseRootedTree(BaseGraph):\n\n def __init__(self, n_vertices, root_vertex=0):\n super().__init__(n_vertices)\n self.root = root_vertex\n\n def parent(self, v: int) -> int:\n raise NotImplementedError\n\n def children(self, v: int) -> Iterable[int]:\n raise NotImplementedError\n\n def adj(self, v) -> Iterable[int]:\n if self.root == v:\n return self.children(v)\n return itertools.chain(self.children(v), (self.parent(v),))\n\n def post_order(self) -> Iterable[int]:\n """\n bottom vertices first\n """\n return (~v for v in self.prepost_order() if v < 0)\n\n def pre_order(self) -> Iterable[int]:\n """\n top vertices first\n """\n stack = [self.root]\n while stack:\n v = stack.pop()\n yield v\n for u in self.children(v):\n stack.append(u)\n\n def prepost_order(self) -> Iterable[int]:\n """\n if v >= 0: it\'s pre-order entry.\n\n otherwise: it\'s post-order entry.\n """\n stack = [~self.root, self.root]\n while stack:\n v = stack.pop()\n yield v\n if v >= 0:\n for u in self.children(v):\n stack.append(~u)\n stack.append(u)\n\n def prepost_indices(self) -> Tuple[List[int], List[int]]:\n pre_ind = [0] * self.n_vertices\n post_ind = [0] * self.n_vertices\n for i, t in enumerate(self.prepost_order()):\n if t >= 0:\n pre_ind[t] = i\n else:\n post_ind[~t] = i\n return pre_ind, post_ind\n\n def depth(self) -> List[int]:\n depth = [0] * self.n_vertices\n for v in self.pre_order():\n d = depth[v]\n for c in self.children(v):\n depth[c] = d + 1\n return depth\n\n def sort_edge_values(self, wedges: Iterable[Tuple[int, int, T]], default: Optional[T] = None) -> List[T]:\n memo = [default] * self.n_vertices\n for u, v, d in wedges:\n if self.parent(u) == v:\n memo[u] = d\n else:\n memo[v] = d\n return memo\n\n def height(self, depth=None) -> int:\n if depth is None:\n depth = self.depth()\n return max(depth) + 1\n\n def path(self, v: int, k: int) -> List[int]:\n """\n ??v??k???????????.\n\n :param v: ??\n :param k: ??????????\n :return: ??\n """\n res = [-1] * (k + 1)\n for i in range(k + 1):\n res[i] = v\n v = self.parent(v)\n if v < 0:\n break\n return res\n\n def aggregate_parent_path(self, aggregate: Callable[[T, int], T], identity: T,\n pre_order: Optional[Iterable[int]] = None) -> List[T]:\n """\n ????????????dp??????.\n\n :param aggregate: (T, V) -> T\n :param identity: ???\n :param pre_order: pre_order????\n :return ?????????????dp?\n """\n if pre_order is None:\n pre_order = self.pre_order()\n\n dp = [identity] * self.n_vertices\n for v in pre_order:\n p = self.parent(v)\n if p >= 0:\n dp[v] = aggregate(dp[p], v)\n return dp\n\n def aggregate_subtree(self, merge: Callable[[T, T], T], identity: T, finalize: Callable[[T, int], T],\n post_order: Optional[Iterable[int]] = None) -> List[T]:\n """\n ???????????????dp??????.\n\n :param merge: (T, T) -> T, (T, merge)?????\n :param identity: ???\n :param finalize: (T, V) -> T\n :param post_order: post_order????\n :return ???????????????????dp?\n """\n if post_order is None:\n post_order = self.post_order()\n\n dp = [identity] * self.n_vertices\n for v in post_order:\n t = identity\n for u in self.children(v):\n t = merge(t, dp[u])\n dp[v] = finalize(t, v)\n return dp\n\n def solve_rerooting(self, merge: Callable[[T, T], T], identity: T, finalize: Callable[[T, int, int], T],\n pre_order: Optional[Iterable[int]] = None) -> List[T]:\n """\n ????dp???.\n\n dp[u,v] = finalize(merge(dp[v,k] for k in adj[v] if k != u), u, v)\n\n (v?????u?????????????????)\n\n :param merge: (T,T) -> T, (T, merge)?????\n :param identity: ???\n :param finalize: (T, V, V) -> T\n :param pre_order: pre_order????\n :return ???????????????dp?\n """\n\n if pre_order is None:\n pre_order = list(self.pre_order())\n dp1 = [identity] * self.n_vertices\n dp2 = [identity] * self.n_vertices\n\n for v in reversed(pre_order):\n t = identity\n for u in self.children(v):\n dp2[u] = t\n t = merge(t, finalize(dp1[u], v, u))\n t = identity\n for u in reversed(list(self.children(v))):\n dp2[u] = merge(t, dp2[u])\n t = merge(t, finalize(dp1[u], v, u))\n dp1[v] = t\n for v in pre_order:\n if v == self.root:\n continue\n p = self.parent(v)\n dp2[v] = finalize(merge(dp2[v], dp2[p]), v, p)\n dp1[v] = merge(dp1[v], dp2[v])\n return dp1\n\n\nclass DoublingStrategy:\n def __init__(self, tree: BaseRootedTree, depth=None, pre_order=None):\n if pre_order is None:\n pre_order = tree.pre_order()\n if depth is None:\n depth = tree.depth()\n self.depth = depth\n self.tree = tree\n d = (max(depth) + 1).bit_length()\n dbl = Array2d.full(tree.n_vertices, d, -1)\n for v in pre_order:\n u = tree.parent(v)\n dbl[v, 0] = u\n for i in range(d - 1):\n u = dbl[u, i]\n if u < 0:\n break\n dbl[v, i + 1] = u\n self.dbl = dbl\n\n def ancestor_of(self, v: int, k: int) -> int:\n if k > self.depth[v]:\n return -1\n i = 0\n while k:\n if k & 1:\n v = self.dbl[v, i]\n k //= 2\n i += 1\n return v\n\n def lca(self, u: int, v: int) -> int:\n lu, lv = self.depth[u], self.depth[v]\n if lu > lv:\n u = self.ancestor_of(u, lu - lv)\n else:\n v = self.ancestor_of(v, lv - lu)\n if u == v:\n return u\n\n i = self.dbl.m - 1\n while True:\n while i >= 0 and self.dbl[u, i] == self.dbl[v, i]:\n i -= 1\n if i < 0:\n return self.dbl[u, 0]\n u, v = self.dbl[u, i], self.dbl[v, i]\n\n def dist(self, u: int, v: int) -> int:\n return self.depth[u] + self.depth[v] - 2 * self.depth[self.lca(u, v)]\n\n\nclass RootedTree(BaseRootedTree):\n\n def __init__(self, parent: List[int], children: Graph, root_vertex: int):\n super().__init__(len(parent), root_vertex)\n self._parent = parent\n self._children = children\n\n @classmethod\n def from_edges(cls, edges, root_vertex=0):\n n = len(edges) + 1\n g = Graph.from_undirected_edges(n, edges)\n parent = [0] * n\n parent[root_vertex] = -1\n stack = [root_vertex]\n while stack:\n v = stack.pop()\n p = parent[v]\n for u in g.adj(v):\n if u != p:\n parent[u] = v\n stack.append(u)\n return cls.from_parent(parent, root_vertex)\n\n @classmethod\n def from_parent(cls, parent, root_vertex=0):\n return cls(parent,\n Graph.from_directed_edges(len(parent), ((p, v) for v, p in enumerate(parent) if p >= 0)),\n root_vertex)\n\n @classmethod\n def random(cls, n_vertices, root_vertex=0):\n parent = [-1] * n_vertices\n vertices = list(range(root_vertex)) + list(range(root_vertex + 1, n_vertices))\n shuffle(vertices)\n vertices.append(root_vertex)\n for i, v in zip(reversed(range(n_vertices)), vertices[-2::-1]):\n parent[v] = vertices[randrange(i, n_vertices)]\n return cls.from_parent(parent, root_vertex)\n\n def parent(self, v):\n return self._parent[v]\n\n def children(self, v):\n return self._children.adj(v)\n\n\nclass Grid(BaseGraph):\n def __init__(self, grid):\n super().__init__(grid.n * grid.m)\n self.grid = grid\n\n def adj(self, v):\n if not self.grid.arr[v]:\n return\n i, j = divmod(v, self.grid.m)\n if i + 1 < self.grid.n and self.grid[i + 1, j]:\n yield v + self.grid.m\n if 0 <= i - 1 and self.grid[i - 1, j]:\n yield v - self.grid.m\n if j + 1 < self.grid.m and self.grid[i, j + 1]:\n yield v + 1\n if 0 <= j - 1 and self.grid[i, j - 1]:\n yield v - 1\n\n\ndef strongly_connected_components(graph: BaseGraph, rgraph: BaseGraph = None):\n if rgraph is None:\n rgraph = graph.to_reverse_graph()\n n = graph.n_vertices\n order = []\n color = [0] * n\n for v0 in range(n):\n if color[v0]:\n continue\n color[v0] = -1\n stack = [iter(graph.adj(v0))]\n path = [v0]\n while path:\n for u in stack[-1]:\n if color[u] == 0:\n color[u] = -1\n path.append(u)\n stack.append(iter(graph.adj(u)))\n break\n else:\n v = path.pop()\n order.append(v)\n stack.pop()\n\n label = 0\n for v0 in reversed(order):\n if color[v0] >= 0:\n continue\n color[v0] = label\n stack = [v0]\n while stack:\n v = stack.pop()\n for u in rgraph.adj(v):\n if color[u] < 0:\n color[u] = label\n stack.append(u)\n label += 1\n return label, color\n\n\ndef dijkstra(graph: BaseWeightedGraph, s: Union[int, Iterable[int]], t: Union[int, Iterable[int]] = -1,\n inf: Any = 2 ** 62) -> Tuple[List[int], Any]:\n """\n Returns a list of distance. If starts contains more than one vertex, returns the shortest distance from any of them.\n """\n K = graph.n_vertices.bit_length()\n MASK = (1 << K) - 1\n dist = [inf] * graph.n_vertices\n\n if isinstance(s, int):\n q = [s]\n dist[s] = 0\n else:\n q = list(s)\n for v in q:\n dist[v] = 0\n if isinstance(t, int):\n if t < 0:\n t = []\n else:\n t = [t]\n else:\n t = set(t)\n\n while q:\n x = hq.heappop(q)\n d, v = x >> K, x & MASK\n if v in t:\n return dist, d\n if d > dist[v]:\n continue\n for u, w in graph.wadj(v):\n if dist[u] > d + w:\n dist[u] = d + w\n hq.heappush(q, ((d + w) << K) | u)\n return dist, None\n\n\ndef dijkstra_general(graph: BaseWeightedGraph, inf: Any, zero: Any, s: Union[int, Iterable[int]],\n t: Union[int, Iterable[int]] = -1) -> Tuple[List[Any], Any]:\n """\n Returns a list of distance. If starts contains more than one vertex, returns the shortest distance from any of them.\n """\n dist = [inf] * graph.n_vertices\n\n if isinstance(s, int):\n q = [(zero, s)]\n dist[s] = zero\n else:\n q = [(zero, v) for v in s]\n for d, v in q:\n dist[v] = zero\n if isinstance(t, int):\n if t < 0:\n t = []\n else:\n t = [t]\n else:\n t = set(t)\n\n while q:\n d, v = hq.heappop(q)\n if v in t:\n return dist, d\n if d > dist[v]:\n continue\n for u, w in graph.wadj(v):\n nw = d + w\n if dist[u] > nw:\n dist[u] = nw\n hq.heappush(q, (nw, u))\n return dist, None\n\n\ndef get_dual_graph(n_vertices: int, wedges: Iterable[Tuple[int, int, int]]) -> Tuple[\n List[int], List[int], List[int], List[int]]:\n """\n ??????????????????\n (u, v, cap) in wedges???????????(u, v, cap)?(v, u, 0)?????????????????????????\n\n :param n_vertices: ???\n :param wedges: ?????\n :return: (???????, ???index?????)\n """\n\n cap = defaultdict(int)\n for u, v, c in wedges:\n cap[(u, v)] += c\n cap[(v, u)] += 0\n\n temp: List[List[Tuple[int, int]]] = [[] for _ in range(n_vertices)]\n for (u, v), w in cap.items():\n temp[u].append((v, w))\n adj = [0] * len(cap)\n weight = [0] * len(cap)\n rev = [0] * len(cap)\n ind = [0] * (n_vertices + 1)\n\n i = 0\n for u, l in enumerate(temp):\n ind[u] = i\n for v, w in l:\n adj[i] = v\n weight[i] = w\n if u < v:\n cap[(v, u)] = i\n else:\n j = cap[(u, v)]\n rev[i] = j\n rev[j] = i\n i += 1\n ind[n_vertices] = i\n\n return adj, weight, ind, rev\n\n\ndef edmonds_karp(n_vertices: int, edges: Iterable[Tuple[int, int, int]], s: int, t: int):\n """\n ?????????O(VE^2)\n\n :param n_vertices: ???\n :param edges: (??1, ??2, ??)?Iterable\n :param s: ??\n :param t: ??\n :return: (????, ?????)\n """\n\n adj, caps, ind, rev = get_dual_graph(n_vertices, edges)\n\n m0 = max(caps)\n bfs_memo = [0] * n_vertices\n pv = [-1] * n_vertices\n pe = [-1] * n_vertices\n bfs_memo[s] = n_vertices + 1\n offset = 0\n\n def find_path():\n nonlocal offset\n offset += 1\n q = [s]\n while q:\n nq = []\n for v in q:\n if v == t:\n return True\n for i in range(ind[v], ind[v + 1]):\n if caps[i] == 0:\n continue\n u = adj[i]\n if bfs_memo[u] < offset:\n bfs_memo[u] = offset\n pv[u] = v\n pe[u] = i\n nq.append(u)\n q = nq\n return False\n\n res = 0\n flag = find_path()\n while flag:\n v = t\n m = m0\n while pv[v] >= 0:\n e = pe[v]\n m = min2(m, caps[e])\n v = pv[v]\n v = t\n while pv[v] >= 0:\n e = pe[v]\n caps[e] -= m\n caps[rev[e]] += m\n v = pv[v]\n res += m\n flag = find_path()\n return res, WeightedGraph(n_vertices, adj, caps, ind), rev\n\n\ndef max_bipartite_matching(graph: BaseWeightedGraph):\n pass\n'),
'lib.itertools': (False, 'from itertools import chain, repeat, count, islice\nfrom collections import Counter\n\n\ndef repeat_chain(values, counts):\n return chain.from_iterable(map(repeat, values, counts))\n\n\ndef unique_combinations_from_value_counts(r, values, counts):\n n = len(counts)\n indices = list(islice(repeat_chain(count(), counts), r))\n if len(indices) < r:\n return\n while True:\n yield tuple(values[i] for i in indices)\n for i, j in zip(reversed(range(r)), repeat_chain(reversed(range(n)), reversed(counts))):\n if indices[i] != j:\n break\n else:\n return\n j = indices[i] + 1\n for i, j in zip(range(i, r), repeat_chain(count(j), counts[j:])):\n indices[i] = j\n\n\ndef unique_combinations(r, iterable):\n return unique_combinations_from_value_counts(r, *zip(*Counter(iterable).items()))\n'),
'lib.matrix': (False, "from lib.array2d import Array2d\n\n\ndef get_general_matrix(zero, one):\n class Matrix(Array2d):\n ZERO = zero\n ONE = one\n\n @classmethod\n def zeros(cls, n, m):\n return cls.full(n, m, cls.ZERO)\n\n @classmethod\n def ones(cls, n, m):\n return cls.full(n, m, cls.ONE)\n\n def __add__(self, other):\n if self.m != other.m or self.n != other.n:\n raise ValueError(f'Cannot add matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n return Matrix(self.n, self.m, [x + y for x, y in zip(self.arr, other.arr)])\n\n def __iadd__(self, other):\n if self.m != other.m or self.n != other.n:\n raise ValueError(f'Cannot multiply matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n for i, v in enumerate(other.arr):\n self.arr[i] += v\n return self\n\n def __sub__(self, other):\n if self.m != other.m or self.n != other.n:\n raise ValueError(f'Cannot subtract matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n return Matrix(self.n, self.m, [x - y for x, y in zip(self.arr, other.arr)])\n\n def __isub__(self, other):\n if self.m != other.m or self.n != other.n:\n raise ValueError(f'Cannot multiply matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n for i, v in enumerate(other.arr):\n self.arr[i] -= v\n return self\n\n def __mul__(self, other):\n if self.m != other.m or self.n != other.n:\n raise ValueError(f'Cannot multiply matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n return Matrix(self.n, self.m, [x * y for x, y in zip(self.arr, other.arr)])\n\n def __imul__(self, other):\n if self.m != other.m or self.n != other.n:\n raise ValueError(f'Cannot multiply matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n for i, v in enumerate(other.arr):\n self.arr[i] *= v\n return self\n\n def __truediv__(self, other):\n if self.m != other.m or self.n != other.n:\n raise ValueError(f'Cannot multiply matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n return Matrix(self.n, self.m, [x / y for x, y in zip(self.arr, other.arr)])\n\n def __matmul__(self, other):\n if self.m != other.n:\n raise ValueError(f'Cannot dot multiply matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n\n res = self.full(self.n, other.m, self.ZERO)\n\n for i in range(self.n):\n for j in range(other.m):\n c = self.ZERO\n for k in range(self.m):\n c += self[i, k] * other[k, j]\n res[i, j] = c\n return res\n\n def __imatmul__(self, other):\n if self.m != other.n:\n raise ValueError(f'Cannot multiply matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n if self is other or self.m != other.m:\n return self @ other\n\n row = [self.ZERO] * self.m\n for i in range(self.n):\n t = i * self.m\n for j in range(self.m):\n row[j] = self.arr[j + t]\n for j in range(other.m):\n c = self.ZERO\n for k in range(self.m):\n c += row[k] * other[k, j]\n self[i, j] = c\n return self\n\n def __pow__(self, power, modulo=None):\n if self.n != self.m:\n raise ValueError('pow is supported only for square matrix')\n k = self.n\n res = Matrix.full(k, k, self.ZERO)\n for i in range(k):\n res[i, i] = self.ONE\n\n m = self\n while power > 0:\n if power & 1:\n res @= m\n m @= m\n power >>= 1\n return res\n\n return Matrix\n\n\nIMatrix = get_general_matrix(0, 1)\nFMatrix = get_general_matrix(0.0, 1.0)\n\n\ndef accumulate(mat):\n res = mat.zeros(mat.n + 1, mat.m + 1)\n for i in range(mat.n):\n k = mat.ZERO\n for j in range(mat.m):\n k += mat[i, j]\n res[i + 1, j + 1] = k\n for j in range(1, mat.m + 1):\n k = mat.ZERO\n for i in range(1, mat.n + 1):\n k += res[i, j]\n res[i, j] = k\n return res\n\n\ndef accumulate_prod(mat):\n res = mat.ones(mat.n + 1, mat.m + 1)\n for i in range(mat.n):\n k = mat.ONE\n for j in range(mat.m):\n k *= mat[i, j]\n res[i + 1, j + 1] = k\n for j in range(1, mat.m + 1):\n k = mat.ONE\n for i in range(1, mat.n):\n k *= res[i, j]\n res[i, j] = k\n return res\n"),
'lib.misc': (False, 'from typing import List, Any, Callable, Sequence, Union, Tuple, TypeVar\n\nV = TypeVar(\'V\')\n\nimport sys\nfrom functools import reduce\nfrom itertools import accumulate\nfrom lib.data_structure import BinaryIndexedTree, DisjointSet\nimport bisect\n\n\ndef general_bisect(ng: int, ok: int, judge: Callable[[int], V]) -> int:\n """\n ???????????????????O(log L)??????\n\n :param ng: judge(ng)==False????\n :param ok: judge(ok)==True????\n :param judge: ??????????\n :return: judge(x)==True???????????\n """\n while abs(ng - ok) > 1:\n m = (ng + ok) // 2\n if judge(m):\n ok = m\n else:\n ng = m\n return ok\n\n\ndef fibonacci_search(left: int, right: int, func: Union[Callable[[int], V], Sequence], inf: V = 2 ** 60) -> Tuple[\n V, int]:\n """\n ??????????????????????????????O(log L)??????\n ???(left, right)?????????\n\n :param left: ?????????????\n :param right: ?????????????\n :param func: ??????\n :param inf: func???\n :return: (func????, ????????func???)\n """\n try:\n func = func.__getitem__\n except AttributeError:\n pass\n f1, f2 = 1, 1\n while f1 + f2 < right - left:\n f1, f2 = f1 + f2, f1\n l = left\n m1 = func(l + f2)\n m2 = func(l + f1)\n while f1 > 2:\n f1, f2 = f2, f1 - f2\n if m1 > m2:\n l += f1\n m1 = m2\n m2 = func(l + f1) if l + f1 < right else inf\n else:\n m2 = m1\n m1 = func(l + f2)\n if m1 < m2:\n return m1, l + 1\n else:\n return m2, l + 2\n\n\ndef max2(x: V, y: V) -> V:\n return x if x > y else y\n\n\ndef min2(x: V, y: V) -> V:\n return x if x < y else y\n\n\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\n\n\ndef rerooting(rooted_tree, merge, identity, finalize):\n """\n merge: (T,T) -> T, (T, merge)?????\n identity: ???\n finalize: (T, V, V) -> T\n\n ????????dp?????\n dp[u,v] = finalize(merge(dp[v,k] for k in adj[v] if k != u), u, v)\n ???(u,v)?? u->v\n """\n N = rooted_tree.n_vertices\n parent = rooted_tree.parent\n children = rooted_tree.children\n order = rooted_tree.dfs_order\n\n # from leaf to parent\n dp_down = [None] * N\n for v in reversed(order):\n dp_down[v] = finalize(reduce(merge,\n (dp_down[c] for c in children[v]),\n identity), parent[v], v)\n\n # from parent to leaf\n dp_up = [None] * N\n dp_up[0] = identity\n for v in order:\n if len(children[v]) == 0:\n continue\n temp = (dp_up[v],) + tuple(dp_down[u] for u in children[v]) + (identity,)\n left = accumulate(temp[:-2], merge)\n right = tuple(accumulate(reversed(temp[2:]), merge))\n for u, l, r in zip(children[v], left, reversed(right)):\n dp_up[u] = finalize(merge(l, r), u, v)\n\n res = [None] * N\n for v, l in enumerate(children):\n res[v] = reduce(merge,\n (dp_down[u] for u in children[v]),\n identity)\n res[v] = merge(res[v], dp_up[v])\n return res, dp_up, dp_down\n\n\ndef rerooting_fast(rooted_tree, merge, identity, finalize):\n """\n merge: (T,T) -> T, (T, merge)?????\n identity: ???\n finalize: (T, V, V) -> T\n\n ????????dp?????\n dp[u,v] = finalize(merge(dp[v,k] for k in adj[v] if k != u), u, v)\n ???(u,v)??\n dp[u,v]: v?????u?????????????????\n """\n dp1 = [identity] * rooted_tree.n_vertices\n dp2 = [identity] * rooted_tree.n_vertices\n\n for v in rooted_tree.post_order:\n t = identity\n for u in rooted_tree.children(v):\n dp2[u] = t\n t = merge(t, finalize(dp1[u], v, u))\n t = identity\n for u in reversed(rooted_tree.children(v)):\n dp2[u] = merge(t, dp2[u])\n t = merge(t, finalize(dp1[u], v, u))\n dp1[v] = t\n for v in rooted_tree.pre_order:\n p = rooted_tree.parent(v)\n if p >= 0:\n dp2[v] = finalize(merge(dp2[v], dp2[p]), v, p)\n dp1[v] = merge(dp1[v], dp2[v])\n return dp1\n\n\ndef longest_increasing_sequence(l, inf, strict=True):\n if not l:\n return 0\n dp = [inf] * len(l)\n if strict:\n for i, v in enumerate(l):\n dp[bisect.bisect_left(dp, v)] = v\n else:\n for i, v in enumerate(l):\n dp[bisect.bisect_right(dp, v)] = v\n\n m = next(n for n in reversed(range(len(l))) if dp[n] < inf) + 1\n return m\n\n\ndef zeta(data, merge):\n """\n ??????data????????\n M?????\n data: 2^n -> M\n output: 2^n -> M\n merge: M -> M\n \n ouput[i] = sum(data[j] for j in range(2^n) if i|j == i)\n """\n n = len(data)\n i = 1\n while i < n:\n j = i\n while j < n:\n data[j] = merge(data[j], data[j & ~i])\n j = (j + 1) | i\n i <<= 1\n return data\n\n\ndef check_bipartiteness(n_vertices, edges):\n ds = DisjointSet(2 * n_vertices)\n\n for a, b in edges:\n ds.union(a, b + n_vertices)\n ds.union(b, a + n_vertices)\n\n next_color = 0\n color = [-1] * (2 * n_vertices)\n for v in range(n_vertices):\n ra = ds.find(v)\n rb = ds.find(v + n_vertices)\n if ra == rb:\n return None\n if color[ra] < 0:\n color[ra] = next_color\n color[rb] = next_color + 1\n next_color += 2\n color[v] = color[ra]\n color[v + n_vertices] = color[rb]\n return color[:n_vertices]\n\n\ndef small_range_duplicate(a: List[int]) -> Tuple[List[int], List[int]]:\n MASK = (1 << 32) - 1\n n = len(a)\n left = [i - 1 for i in range(n + 1)]\n right = [i + 1 for i in range(n + 1)]\n\n sorted_ind = sorted((~v << 32) | i for i, v in enumerate(a))\n t = 0\n vi = sorted_ind[t]\n i = vi & MASK\n v = ~(vi >> 32)\n while t < n:\n j = i\n l = left[i]\n pi = l\n pv = v\n while v == pv and left[i] == pi:\n pi = i\n t += 1\n if t >= n:\n break\n vi = sorted_ind[t]\n i = vi & MASK\n v = ~(vi >> 32)\n r = right[pi]\n right[l] = r\n while j <= pi:\n nj = right[j]\n left[j] = l\n right[j] = r\n j = nj\n left[r] = l\n\n return left, right\n\n\ndef small_range(a: List[int]) -> Tuple[List[int], List[int]]:\n N = len(a)\n MASK = (1 << 32) - 1\n left = [i - 1 for i in range(N + 1)]\n right = [i + 1 for i in range(N + 1)]\n sorted_ind = sorted((~v << 32) | i for i, v in enumerate(a))\n for v in sorted_ind:\n i = v & MASK\n left[right[-i]] = left[-i]\n right[left[-i]] = right[-i]\n\n return left, right\n\n\ndef popcnt32(n: int) -> int:\n n = n - ((n >> 1) & 0x55555555)\n n = (n & 0x33333333) + ((n >> 2) & 0x33333333)\n return ((((n + (n >> 4)) & 0x0f0f0f0f) * 0x01010101) >> 24) & 0xff\n\n\ndef popcnt64(n: int) -> int:\n n = n - ((n >> 1) & 0x5555555555555555)\n n = (n & 0x3333333333333333) + ((n >> 2) & 0x3333333333333333)\n n = (n + (n >> 4)) & 0x0f0f0f0f0f0f0f0f\n return ((((n + (n >> 32)) & 0xffffffff) * 0x01010101) >> 24) & 0xff\n\n\ndef popcnt(n: int) -> int:\n if n < 1 << 32:\n return popcnt32(n)\n elif n < 1 << 64:\n return popcnt64(n)\n else:\n return sum(c == \'1\' for c in bin(n))\n\n\ndef reverse_bits32(x: int):\n x = ((x & 0x55555555) << 1) | ((x & 0xAAAAAAAA) >> 1)\n x = ((x & 0x33333333) << 2) | ((x & 0xCCCCCCCC) >> 2)\n x = ((x & 0x0F0F0F0F) << 4) | ((x & 0xF0F0F0F0) >> 4)\n x = ((x & 0x00FF00FF) << 8) | ((x & 0xFF00FF00) >> 8)\n return ((x & 0x0000FFFF) << 16) | ((x & 0xFFFF0000) >> 16)\n\n\ndef count_inversions(l: List[Any]) -> int:\n """\n ?????????in-place????????\n\n :param l: ???\n :return: ???\n """\n bit = BinaryIndexedTree(len(l))\n res = 0\n for i, v in enumerate(l):\n bit[v] += 1\n res += bit[v + 1:]\n return res\n\n\nclass BinaryTrie:\n class Node:\n def __init__(self):\n self.zero = None\n self.one = None\n self.cnt = 0\n\n def __init__(self, bits):\n self.root = self.Node()\n self.bits = bits\n\n def add(self, v):\n n = self.root\n n.cnt += 1\n for d in reversed(range(self.bits)):\n if (v >> d) & 1:\n if not n.one:\n n.one = self.Node()\n n = n.one\n else:\n if not n.zero:\n n.zero = self.Node()\n n = n.zero\n n.cnt += 1\n\n def remove(self, v):\n n = self.root\n n.cnt -= 1\n for d in reversed(range(self.bits)):\n if (v >> d) & 1:\n n = n.one\n else:\n n = n.zero\n n.cnt -= 1\n\n def find_argminxor(self, v):\n n = self.root\n r = 0\n for d in reversed(range(self.bits)):\n if (v >> d) & 1:\n if n.one and n.one.cnt > 0:\n n = n.one\n r |= 1 << d\n else:\n n = n.zero\n else:\n if n.zero and n.zero.cnt > 0:\n n = n.zero\n else:\n n = n.one\n r |= 1 << d\n return r\n\n def find_nth(self):\n raise NotImplementedError\n\n\n def __contains__(self, v):\n n = self.root\n for d in reversed(range(self.bits)):\n if (v >> d) & 1:\n n = n.one\n else:\n n = n.zero\n if not n or n.cnt == 0:\n return False\n return True\n'),
'lib.modint': (False, "from importlib.util import find_spec, module_from_spec\n\nmodints = {}\n\n\ndef get_modint(mod):\n try:\n return modints[mod]\n except KeyError:\n spec = find_spec('lib._modint')\n module = module_from_spec(spec)\n module.__dict__['MOD'] = mod\n spec.loader.exec_module(module)\n modints[mod] = module.ModInt\n return modints[mod]"),
'lib.number_theory': (False, 'from collections import Counter, defaultdict\nfrom math import sqrt, ceil, gcd\nfrom itertools import count\nfrom typing import Tuple\n\n\ndef sign(x):\n return int(x > 0) - int(x < 0)\n\n\ndef egcd(a: int, b: int) -> Tuple[int, int, int]:\n """\n ?????????\n\n :param a: ??\n :param b: ??\n :return: (x, y, gcd(a,b)). x, y?ax+by=gcd(a,b)????\n """\n s, ps, r, pr = 0, 1, b, a\n while r != 0:\n q = pr // r\n pr, r = r, pr - q * r\n ps, s = s, ps - q * s\n t = (pr - ps * a) // b\n if pr > 0:\n return ps, t, pr\n return -ps, -t, -pr\n\n\ndef modinv(x: int, mod: int) -> int:\n """\n Z/(mod Z)???x???\n\n :param x: ??\n :param mod: ??\n :return: x * y % mod = 1????y\n """\n s, ps, r, pr = 0, 1, mod, x\n while r != 0:\n pr, (q, r) = r, divmod(pr, r)\n ps, s = s, ps - q * s\n if pr == 1:\n return ps if ps >= 0 else ps + mod\n raise ValueError("base is not invertible for the given modulus")\n\n\ndef modpow(x, k, mod):\n """\n Z/(mod Z)???x?k?\n\n :param x: ??\n :param k: ??\n :param mod: ??\n :return: x ** k % mod\n """\n if k < 0:\n x = modinv(x, mod)\n k = -k\n r = 1\n while k != 0:\n if k & 1:\n r = (r * x) % mod\n x = (x * x) % mod\n k >>= 1\n return r\n\n\n# ?????\ndef prime_factors(n):\n i = 2\n while i * i <= n:\n if n % i:\n i += 1\n else:\n n //= i\n yield i\n if n > 1:\n yield n\n\n\ndef int_product(iterable):\n x = 1\n for y in iterable:\n x *= y\n return x\n\n\n# ?????O(sqrt(n))????\ndef divisors(n):\n for i in range(1, ceil(sqrt(n)) + 1):\n j, r = divmod(n, i)\n if not r:\n yield i\n if i != j:\n yield j\n\n\n# ?????\ndef generate_primes():\n D = defaultdict(list)\n\n q = 2\n for q in count(2):\n if q in D:\n for p in D[q]:\n D[p + q].append(p)\n del D[q]\n else:\n yield q\n D[q * q].append(q)\n\n\ndef totient_factors(n):\n def it():\n prev = -1\n for p in prime_factors(n):\n if p == prev:\n yield p\n else:\n prev = p\n for q in prime_factors(p - 1):\n yield q\n\n return it()\n\n\ndef primitive_root(mod, phi_factors=None):\n if phi_factors is None:\n phi_factors = tuple(totient_factors(mod))\n phi = int_product(phi_factors)\n primes = set(phi_factors)\n for i in range(2, mod):\n for p in primes:\n if modpow(i, (phi // p), mod) == 1:\n break\n else:\n return i\n else:\n raise ValueError(f\'There is no primitive root for modulo {mod}\')\n\n\ndef lcm(nums):\n m = 1\n for n in nums:\n m *= n // gcd(m, n)\n return m\n\n\ndef chinese_remainder_theorem(reminders, mods, mods_lcm=-1):\n """\n returns x and lcm(reminders) s.t.\n all(x%m == r for r,m in zip(reminders,mods))\n """\n s = 0\n if mods_lcm < 0:\n mods_lcm = lcm(mods)\n for m, r in zip(mods, reminders):\n p = mods_lcm // m\n s += r * p * pow(p, -1, m)\n s %= mods_lcm\n return s, mods_lcm\n\n\ndef factorials_with_inv(k, mod):\n """\n 0! ... k! ?????mod????????\n PyPy??pow????????????\n """\n fac = [1] * (k + 1)\n inv = [1] * (k + 1)\n t = 1\n for i in range(1, k + 1):\n t = (t * i) % mod\n fac[i] = t\n t = modinv(t, mod)\n for i in reversed(range(1, k + 1)):\n inv[i] = t\n t = (t * i) % mod\n return fac, inv\n\n\ndef extended_lucas_theorem(mod):\n """\n Returns a function (n,m) -> C(n,m)%mod\n """\n factors = tuple((p, q, p ** q) for p, q in Counter(prime_factors(mod)).items())\n facs = [[0] * k for p, q, k in factors]\n invs = [[0] * k for p, q, k in factors]\n for (p, q, k), fac, inv in zip(factors, facs, invs):\n t = 1\n for n in range(k):\n if n % p != 0:\n t *= n\n t %= k\n fac[n] = t\n t = modinv(t, k)\n for n in reversed(range(k)):\n inv[n] = t\n if n % p != 0:\n t *= n\n t %= k\n\n def helper(n, m):\n l = n - m\n if l < 0:\n return 0\n\n def reminders():\n for (p, q, k), fac, inv in zip(factors, facs, invs):\n a, b, c, e0, eq, i, r = n, m, l, 0, -2, 1, 1\n while a > 0:\n r *= fac[a % k] * inv[b % k] * inv[c % k]\n r %= k\n a, b, c = a // p, b // p, c // p\n if i == q:\n eq = e0\n e0 += a - b - c\n i += 1\n if eq >= 0:\n eq += e0\n if e0 >= q:\n r = 0\n else:\n r *= p ** e0\n r %= k\n if not (p == 2 and q >= 3) and (eq % 2 == 1):\n r = -r\n yield r\n\n return chinese_remainder_theorem(reminders(), (m for _, _, m in factors), mod)[0]\n\n return helper\n\n\ndef lucas_theorem(m, n, mod, comb):\n cnt = 1\n while n > 0:\n m, mr = divmod(m, mod)\n n, nr = divmod(n, mod)\n if mr < nr:\n return 0\n cnt *= comb[mr][nr]\n cnt %= mod\n return cnt\n\n\n# C(n,m) is even iff (~n&m)>0\n\ndef floor_linear_sum(n, m, a, b):\n """\n returns sum((a*i+b)//m for i in range(n))\n """\n if b < 0:\n t = (-b - 1) // m + 1\n b += m * t\n res = -t * n\n else:\n res = 0\n while True:\n if a >= m:\n res += (n - 1) * n * (a // m) // 2\n a %= m\n if b >= m:\n res += n * (b // m)\n b %= m\n\n y_max = (a * n + b) // m\n if y_max == 0:\n return res\n nx_max = b - y_max * m\n res += (n + nx_max // a) * y_max\n n, m, a, b = y_max, a, m, nx_max % a\n\ndef get_sieve(n):\n sieve = [0]*(n+1)\n for i in range(2, len(sieve)):\n if sieve[i] > 0:\n continue\n sieve[i] = i\n for j in range(i*2, len(sieve), i):\n if sieve[j] == 0:\n sieve[j] = i\n return sieve\n\ndef divisors_from_sieve(n, sieve):\n res = [1]\n while n > 1:\n k = sieve[n]\n n //= k\n l = len(res)\n t = k\n res.extend(res[i]*t for i in range(l))\n while n > 1 and sieve[n] == k:\n t *= k\n res.extend(res[i]*t for i in range(l))\n n //= k\n return res\n\ndef factorize_from_sieve(n, sieve):\n while n > 1:\n yield sieve[n]\n n //= sieve[n]\n\n\n# TODO ?????????'),
'lib.transform': (False, "from cmath import rect, pi\nfrom lib.misc import reverse_bits32\nfrom lib.number_theory import totient_factors, primitive_root, modinv, modpow\n\n\ndef fft(a, inverse=False):\n one = complex(1.0)\n n = (len(a) - 1).bit_length()\n m = 2 ** n\n a += [complex(0.0)] * (m - len(a))\n pows = [rect(1.0, (-pi if inverse else pi) / (2 ** (n - 1)))]\n for _ in range(n-1):\n pows.append(pows[-1] ** 2)\n pows.reverse()\n\n shift = 32 - n\n for i in range(m):\n j = reverse_bits32(i) >> shift\n if i < j:\n a[i], a[j] = a[j], a[i]\n\n for i in range(m):\n b = 1\n for w1 in pows:\n if not i & b:\n break\n i ^= b\n w = one\n while not i & b:\n s = a[i]\n t = a[i | b] * w\n a[i] = s + t\n a[i | b] = s - t\n w *= w1\n i += 1\n i ^= b\n b <<= 1\n if inverse:\n c = 1 / m\n for i in range(m):\n a[i] *= c\n return a\n\n\ndef ntt(a, mod, inverse=False):\n if type(a[0]) is not int:\n for i,v in enumerate(a):\n a[i] = int(v)\n n = (len(a) - 1).bit_length()\n d2 = 0\n r = 1\n phi_factors = tuple(totient_factors(mod))\n for p in phi_factors:\n if p == 2:\n d2 += 1\n else:\n r *= p\n if d2 < n:\n raise ValueError(f'Given array is too long: modulo {modint.mod} only support array length up to {2 ** d2}')\n\n pr = primitive_root(mod, phi_factors)\n if inverse:\n pr = modinv(pr, mod)\n pows = [modpow(pr, r * 2 ** (d2 - n), mod)]\n for _ in range(n - 1):\n pows.append(pows[-1] ** 2 % mod)\n pows = tuple(reversed(pows))\n\n m = 2 ** n\n a += [0] * (m - len(a))\n\n shift = 32 - n\n for i in range(m):\n j = reverse_bits32(i) >> shift\n if i < j:\n a[i], a[j] = a[j], a[i]\n\n for i in range(m):\n b = 1\n for w1 in pows:\n if not i & b:\n break\n i ^= b\n w = 1\n while not i & b:\n j = i | b\n s = a[i] % mod\n t = a[j] * w % mod\n a[i] = s + t\n a[j] = s - t\n w = (w * w1) % mod\n i += 1\n i ^= b\n b <<= 1\n\n if inverse:\n c = modinv(m, mod)\n for i, v in enumerate(a):\n a[i] = (v * c) % mod\n return a"),
'lib._modint': (False, 'from lib.number_theory import modinv, modpow\n\nclass ModInt(int):\n mod = MOD\n\n def __new__(cls, n=0, f=1):\n return int.__new__(cls, n % MOD if f else n)\n\n def __neg__(self):\n return ModInt(MOD - int(self) if self != 0 else 0, 0)\n\n def __add__(self, other):\n x = int(self) + int(other)\n return ModInt(x if x < MOD else x - MOD, 0)\n\n def __sub__(self, other):\n x = int(self) - int(other)\n return ModInt(x if x >= 0 else x + MOD, 0)\n\n def __rsub__(self, other):\n x = int(other) - int(self)\n return ModInt(x if x >= 0 else x + MOD, 0)\n\n def __mul__(self, other):\n return ModInt(int(self) * int(other))\n\n def __truediv__(self, other):\n return self * ModInt(other).inv\n\n def __rtruediv__(self, other):\n return self.inv * other\n\n __radd__ = __add__\n __rmul__ = __mul__\n\n def __pow__(self, other, **kwargs):\n return ModInt(modpow(int(self), int(other), MOD), 0)\n\n @property\n def inv(self):\n return ModInt(modinv(int(self), MOD), 0)\n\n @classmethod\n def sum(cls, iterable):\n r = 0\n for v in iterable:\n r += int(v)\n return ModInt(r)\n\n @classmethod\n def product(cls, iterable):\n r = ModInt(1)\n for v in iterable:\n r *= v\n return r'),
'lib': (True, ''),
}
_sys.meta_path.insert(2, InlineImporter)
# Entrypoint
from lib.number_theory import factorials_with_inv
mod = 998244353
n, a, b, c = map(int, input().split())
fac, inv = factorials_with_inv(n, mod)
comb = lambda n, k: fac[n] * inv[k] % mod * inv[n - k] % mod
res = 1
t = -1 if n%2 == 0 else 1
dp_a = 1
dp_b = 1
dp_c = 1
for k in range(1, n + 1):
dp_a *= 2
if k - 1 >= a:
dp_a -= comb(k - 1, a)
dp_a %= mod
dp_b *= 2
if k - 1 >= b:
dp_b -= comb(k - 1, b)
dp_b %= mod
dp_c *= 2
if k - 1 >= c:
dp_c -= comb(k - 1, c)
dp_c %= mod
res += t * comb(n, k) * dp_a % mod * dp_b % mod * dp_c % mod
res %= mod
t = -t
print(res)
# InlineImporter
import os as _os
import sys as _sys
from functools import lru_cache as _lru_cache
from importlib.abc import ExecutionLoader, MetaPathFinder
from importlib.machinery import ModuleSpec
class InlineImporter(ExecutionLoader, MetaPathFinder):
version = None
inlined_modules = {}
namespace_packages = False
@classmethod
def find_spec(cls, fullname, path=None, target=None):
"""Find a spec for a given module.
Because we only deal with our inlined module, we don't have to care about path or target.
The import machinery also takes care of fully resolving all names, so we just have to deal with the fullnames.
"""
if fullname in cls.inlined_modules:
# We have inlined this module, so return the spec
ms = ModuleSpec(fullname, cls, origin=cls.get_filename(fullname), is_package=cls.is_package(fullname))
ms.has_location = True
if cls.namespace_packages and ms.submodule_search_locations is not None:
for p in _sys.path:
ms.submodule_search_locations.append(_os.path.join(p, _os.path.dirname(ms.origin)))
return ms
return None
@staticmethod
def _call_with_frames_removed(f, *args, **kwds):
"""remove_importlib_frames in import.c will always remove sequences
of importlib frames that end with a call to this function
Use it instead of a normal call in places where including the importlib
frames introduces unwanted noise into the traceback (e.g. when executing
module code)
"""
return f(*args, **kwds)
@classmethod
def create_module(cls, spec):
"""Create a module using the default machinery."""
return None
@classmethod
def exec_module(cls, module):
"""Execute the module."""
code = cls.get_code(module.__name__)
if code is None:
raise ImportError("cannot load module {!r} when get_code() returns None".format(module.__name__))
cls._call_with_frames_removed(exec, code, module.__dict__)
@classmethod
@_lru_cache(maxsize=None)
def get_filename(cls, fullname):
"""Returns the
Raises ImportError if the module cannot be found.
"""
if fullname not in cls.inlined_modules:
raise ImportError
mod = cls.inlined_modules[fullname]
origin = fullname
if mod[0]:
origin = ".".join([origin, "__init__"])
origin = ".".join([origin.replace(".", "/"), "py"])
return origin
@classmethod
@_lru_cache(maxsize=None)
def is_package(cls, fullname):
if fullname not in cls.inlined_modules:
raise ImportError
return cls.inlined_modules[fullname][0]
@classmethod
def get_source(cls, fullname):
if fullname not in cls.inlined_modules:
raise ImportError
return cls.inlined_modules[fullname][1]
@classmethod
def get_code(cls, fullname):
"""Method to return the code object for fullname.
Should return None if not applicable (e.g. built-in module).
Raise ImportError if the module cannot be found.
"""
source = cls.get_source(fullname)
if source is None:
return None
try:
path = cls.get_filename(fullname)
except ImportError:
return cls.source_to_code(source)
else:
return cls.source_to_code(source, path)
InlineImporter.version = '0.0.4'
InlineImporter.inlined_modules = {
'lib.array2d': (False, "class Array2dView:\n def __init__(self, arr, i_indices, j_indices):\n self.arr = arr\n self.i_indices = i_indices\n self.j_indices = j_indices\n \n def _get_view(self, i, j):\n i = self.i_indices[i]\n j = self.j_indices[j]\n return Array2dView(self.arr, i, j)\n\n def get_ind(self, i, j):\n return self.i_indices[i]+self.j_indices[j]\n \n def __getitem__(self, index):\n i, j = index\n try:\n return self.arr[self.get_ind(i,j)]\n except TypeError:\n return self._get_view(i, j)\n \n def __setitem__(self, index, value):\n i, j = index\n try:\n self.arr[self.get_ind(i,j)] = value\n except TypeError:\n x = self._get_view(i, j)\n for i in x.i_indices:\n for j in x.j_indices:\n self.arr[i+j] = value\n \n def __iter__(self):\n for i in self.i_indices:\n for j in self.j_indices:\n yield self.arr[i+j]\n \n def __reversed__(self):\n for i in reversed(self.i_indices):\n for j in reversed(self.j_indices):\n yield self.arr[i+j]\n \n def __str__(self):\n m = max(len(str(v)) for v in self)\n res = ['']*len(self.i_indices)\n row = ['']*(len(self.j_indices)+2)\n for ri,i in enumerate(self.i_indices):\n if ri == 0:\n row[0] = '['\n else:\n row[0] = ' '\n if ri == len(self.i_indices)-1:\n row[-1] = ']\\n'\n for rj,j in enumerate(self.j_indices):\n row[rj+1] = f'{str(self.arr[i+j]):>{m+1}}'\n res[ri] = ''.join(row)\n return '\\n'.join(res)\n \n def copy(self):\n return Array2d(len(self.i_indices), len(self.j_indices), list(self))\n\n\nclass Array2d:\n def __init__(self, n, m, arr):\n self.n = n\n self.m = m\n self.arr = arr\n \n @classmethod\n def full(cls, n, m, fill_value):\n return cls(n, m, [fill_value]*(n*m))\n \n @classmethod\n def from_list(cls, lst):\n n,m = len(lst), len(lst[0])\n arr = [lst[0]]*(n*m)\n k = 0\n for row in lst:\n for v in row:\n arr[k] = v\n k += 1\n return cls(n, m, arr)\n \n def _get_view(self, i, j):\n i = tuple(range(0, self.n*self.m, self.m))[i]\n j = tuple(range(self.m))[j]\n return Array2dView(self.arr, i, j)\n\n def get_ind(self, i, j):\n return i*self.m+j\n\n def __getitem__(self, index):\n try:\n return self.arr[self.get_ind(*index)]\n except TypeError:\n return self._get_view(*index)\n \n def __setitem__(self, index, value):\n try:\n self.arr[self.get_ind(*index)] = value\n except TypeError:\n x = self._get_view(*index)\n for i in x.i_indices:\n for j in x.j_indices:\n self.arr[i+j] = value\n \n def __iter__(self):\n return iter(self.arr)\n \n def __reversed__(self):\n return reversed(self.arr)\n \n def __str__(self):\n m = max(len(str(v)) for v in self)\n res = ['']*self.n\n row = ['']*(self.m+2)\n for i in range(self.n):\n if i == 0:\n row[0] = '['\n else:\n row[0] = ' '\n if i == self.n-1:\n row[-1] = ']\\n'\n for j in range(self.m):\n row[j+1] = f'{str(self.arr[i*self.m+j]):>{m+1}}'\n res[i] = ''.join(row)\n return '\\n'.join(res)\n\n def __eq__(self, other):\n return self.arr == other.arr\n\n def copy(self):\n return self.__class__(self.n, self.m, self.arr[:])\n\n @property\n def t(self):\n arr = [self.arr[0]]*(len(self.arr))\n x = 0\n for i in range(self.n):\n for j in range(self.m):\n arr[j*self.n + i] = self.arr[x]\n x += 1\n return self.__class__(self.m, self.n, arr)\n"),
'lib.array3d': (False, 'class Array3d(list):\n def __init__(self, n, m, p, arr):\n list.__init__(self, arr)\n self.n = n\n self.m = m\n self.p = p\n self.mp = m*p\n\n @classmethod\n def full(cls, n, m, p, fill_value):\n return cls(n, m, p, [fill_value] * (n * m * p))\n\n def get_ind(self, i, j, k):\n return i * self.mp + j * self.p + k\n\n def __getitem__(self, index):\n return list.__getitem__(self, self.get_ind(*index))\n\n def __setitem__(self, index, value):\n list.__setitem__(self, self.get_ind(*index), value)\n'),
'lib.benchmark': (False, '\nfrom time import perf_counter as timer\ndef simple_timeit(func, repeat=1000, warmup=100):\n for i in range(warmup):\n func(i)\n start = timer()\n for i in range(repeat):\n func(i)\n stop = timer()\n return stop-start\n'),
'lib.data_structure': (False, 'from itertools import repeat\n\n\nclass DisjointSet:\n def __init__(self, parent):\n self.parent = parent\n\n @classmethod\n def empty(cls, size):\n return cls([-1]*size)\n\n def find(self, x):\n stack = []\n while self.parent[x] >= 0:\n stack.append(x)\n x = self.parent[x]\n for y in stack:\n self.parent[y] = x\n return x\n\n def union_reps(self, xr, yr):\n if xr == yr:\n return\n if self.parent[xr] > self.parent[yr]:\n xr, yr = yr, xr\n self.parent[xr] += self.parent[yr]\n self.parent[yr] = xr\n\n def union(self, x, y):\n self.union_reps(self.find(x), self.find(y))\n\n def group_size(self, x):\n return -self.parent[self.find(x)]\n\n def is_rep(self, x):\n return self.parent[x] < 0\n\n\nclass SegmentTree:\n """\n ???????????????????????????????????\n ???????????????????????????(???????????)\n """\n\n @classmethod\n def all_identity(cls, operator, identity, size):\n return cls(operator, identity, [identity] * (2 << (size - 1).bit_length()))\n\n @classmethod\n def from_initial_data(cls, operator, identity, data):\n size = 1 << (len(data) - 1).bit_length()\n temp = [identity] * (2 * size)\n temp[size:size + len(data)] = data\n data = temp\n\n for i in reversed(range(size)):\n data[i] = operator(data[2 * i], data[2 * i + 1])\n return cls(operator, identity, data)\n\n # ??????????????????????\n def __init__(self, operator, identity, data):\n self.op = operator\n self.id = identity\n self.data = data\n self.size = len(data) // 2\n\n def reduce(self, l, r):\n l += self.size\n r += self.size\n vl = self.id\n vr = self.id\n\n while l < r:\n if l & 1:\n vl = self.op(vl, self.data[l])\n l += 1\n if r & 1:\n r -= 1\n vr = self.op(self.data[r], vr)\n l >>= 1\n r >>= 1\n return self.op(vl, vr)\n\n def elements(self, l, r):\n l += self.size\n r += self.size\n\n lefts = []\n rights = []\n\n while l < r:\n if l & 1:\n lefts.append(self.data[l])\n l += 1\n if r & 1:\n r -= 1\n rights.append(self.data[r])\n l >>= 1\n r >>= 1\n return lefts, rights\n\n def __getitem__(self, i):\n if isinstance(i, slice):\n return self.reduce(\n 0 if i.start is None else i.start,\n self.size if i.stop is None else i.stop)\n elif isinstance(i, int):\n return self.data[i + self.size]\n\n def __setitem__(self, i, v):\n i += self.size\n while i:\n self.data[i] = v\n v = self.op(self.data[i ^ 1], v) if i & 1 else self.op(v, self.data[i ^ 1])\n i >>= 1\n\n def __iter__(self):\n return iter(self.data[self.size:])\n\n\nclass LazySegmentTree:\n """\n op: ????????reduce?????????\n apply: ??????\n comp: ??????\n \n range_query: reduce(op, (apply(x,m) for x,m in zip(X,M)))\n \n ???????:\n \n ??X (??)\n op[+]: X,X -> X\n (X, op)?????\n \n ??M (???)\n comp[*]: M,M -> M\n (M, compose)?????\n \n apply[f(x,m,n)]: X,M,Z+ -> X\n (Z+????)\n \n f(x,e_M,n) = x\n f(x,m*n,p) = f(f(x,m,p),n,p)\n f(x,m,p)+f(y,m,q) = f(x+y,m,p+q)\n \n ??: https://algo-logic.info/segment-tree/#toc_id_3\n """\n\n @classmethod\n def all_identity(cls, op, op_e, comp, comp_e, apply, size):\n size = 1 << (size - 1).bit_length()\n return cls(\n op,\n op_e,\n comp,\n comp_e,\n apply,\n [op_e] * (2 * size),\n [comp_e] * size\n )\n\n @classmethod\n def from_initial_data(cls, op, op_e, comp, comp_e, apply, data):\n size = 1 << (len(data) - 1).bit_length()\n temp = [op_e] * (2 * size)\n temp[size:size + len(data)] = data\n\n for i in reversed(range(size)):\n temp[i] = op(temp[2 * i], temp[2 * i + 1])\n return cls(\n op,\n op_e,\n comp,\n comp_e,\n apply,\n temp,\n [comp_e] * size\n )\n\n # ??????????????????????\n def __init__(self, op, op_e, comp, comp_e, apply, data, lazy):\n self.op = op\n self.op_e = op_e\n self.comp = comp\n self.comp_e = comp_e\n self.apply = apply\n self.data = data\n self.lazy = lazy\n self.size = len(self.data) // 2\n self.depth = self.size.bit_length() - 1\n self._l_indices = [0] * self.depth\n self._r_indices = [0] * self.depth\n\n def _update_indices(self, i, l):\n m = i // (i & -i)\n i >>= 1\n for k in range(self.depth):\n l[k] = i if i < m else 0\n i >>= 1\n\n def _propagate_top_down(self):\n data = self.data\n lazy = self.lazy\n apply = self.apply\n comp = self.comp\n comp_e = self.comp_e\n k = self.size >> 1\n\n for i, j in zip(reversed(self._l_indices), reversed(self._r_indices)):\n if i > 0:\n temp = lazy[i]\n if temp != comp_e:\n lazy[i] = comp_e\n a = i << 1\n b = a | 1\n data[a] = apply(data[a], temp, k)\n data[b] = apply(data[b], temp, k)\n if k > 1:\n lazy[a] = comp(lazy[a], temp)\n lazy[b] = comp(lazy[b], temp)\n if i < j:\n temp = lazy[j]\n if temp != comp_e:\n lazy[j] = comp_e\n a = j << 1\n b = a | 1\n data[a] = apply(data[a], temp, k)\n data[b] = apply(data[b], temp, k)\n if k > 1:\n lazy[a] = comp(lazy[a], temp)\n lazy[b] = comp(lazy[b], temp)\n k >>= 1\n\n def _propagate_bottom_up(self):\n data = self.data\n op = self.op\n for i, j in zip(self._l_indices, self._r_indices):\n if i < j:\n data[j] = op(data[j << 1], data[j << 1 | 1])\n if i > 0:\n data[i] = op(data[i << 1], data[i << 1 | 1])\n\n def update_interval(self, l, r, m):\n lazy = self.lazy\n data = self.data\n comp = self.comp\n apply = self.apply\n\n l += self.size\n r += self.size\n self._update_indices(l, self._l_indices)\n self._update_indices(r, self._r_indices)\n self._propagate_top_down()\n k = 1\n while l < r:\n if l & 1:\n data[l] = apply(data[l], m, k)\n if k > 1:\n lazy[l] = comp(lazy[l], m)\n l += 1\n if r & 1:\n r -= 1\n data[r] = apply(data[r], m, k)\n if k > 1:\n lazy[r] = comp(lazy[r], m)\n l >>= 1\n r >>= 1\n k <<= 1\n self._propagate_bottom_up()\n\n def get_interval(self, l, r):\n data = self.data\n op = self.op\n\n l += self.size\n r += self.size\n self._update_indices(l, self._l_indices)\n self._update_indices(r, self._r_indices)\n self._propagate_top_down()\n\n lx = self.op_e\n rx = self.op_e\n while l < r:\n if l & 1:\n lx = op(lx, data[l])\n l += 1\n if r & 1:\n r -= 1\n rx = op(data[r], rx)\n l >>= 1\n r >>= 1\n return op(lx, rx)\n\n\nfrom operator import add, sub\nclass BinaryIndexedTree:\n def __init__(self, size, zero=0, operator=add, inv_operator=sub):\n self.zero = zero\n self.op = operator\n self.inv = inv_operator\n self.data = [zero] * (size + 1)\n self.msb = 1 << (size.bit_length() - 1)\n\n def _add(self, i, w):\n i += 1\n while i < len(self.data):\n self.data[i] = self.op(self.data[i], w)\n i += i & -i\n\n def _get_sum(self, i):\n res = self.zero\n while i > 0:\n res = self.op(res, self.data[i])\n i -= i & -i\n return res\n\n def __getitem__(self, i):\n """\n [0,i)\n """\n if isinstance(i, slice):\n a = self._get_sum(len(self.data) - 1 if i.stop is None else i.stop)\n b = self._get_sum(0 if i.start is None else i.start)\n return self.inv(a, b)\n else:\n return self.zero # fake value\n\n __setitem__ = _add\n\n def bisect_left(self, v):\n """\n return smallest i s.t v <= sum[:i+1]\n """\n i = 0\n k = self.msb\n l = len(self.data)\n while k > 0:\n i += k\n if i < l and self.data[i] < v:\n v -= self.data[i]\n else:\n i -= k\n k >>= 1\n return i\n\n def bisect_right(self, v):\n """\n return smallest i s.t v < sum[:i+1]\n """\n i = 0\n k = self.msb\n l = len(self.data)\n while k > 0:\n i += k\n if i < l and self.data[i] <= v:\n v -= self.data[i]\n else:\n i -= k\n k >>= 1\n return i\n\n bisect = bisect_right\n\n'),
'lib.graph': (False, 'import itertools\nimport heapq as hq\nfrom random import randrange, shuffle\nfrom lib.misc import min2\nfrom lib.array2d import Array2d\nfrom collections import defaultdict\n\nfrom typing import Union, Iterable, Any, Tuple, List, Sequence, TypeVar, Optional, Callable\n\nT = TypeVar(\'T\')\n\nINF = 2 ** 62\n\n\nclass BaseWeightedGraph:\n\n def __init__(self, n_vertices: int):\n self.n_vertices = n_vertices\n\n def wadj(self, v: int) -> Iterable[Tuple[int, Any]]:\n """\n Return an iterable of vertices adjacent to v and edge weight\n """\n raise NotImplementedError\n\n def adj(self, v: int) -> Iterable[int]:\n """\n Return an iterable of vertices adjacent to v\n """\n return (u for u, w in self.wadj(v))\n\n @property\n def wedges(self) -> Iterable[Tuple[int, int, Any]]:\n """\n Return an iterable of weighted edges (vertex_1, vertex_2, weight)\n """\n return ((v, u, w) for v in range(self.n_vertices) for u, w in self.wadj(v))\n\n @property\n def edges(self):\n return ((v, u) for v in range(self.n_vertices) for u in self.adj(v))\n\n def dist(self, s: int, t: int, inf=INF):\n return dijkstra(self, s, t, inf)[1]\n\n def warshall_floyd(self, inf=INF):\n dist = Array2d.full(self.n_vertices, self.n_vertices, inf)\n for u, v, w in self.wedges:\n dist[u, v] = w\n for i in range(self.n_vertices):\n dist[i, i] = 0\n for k in range(self.n_vertices):\n for i in range(self.n_vertices):\n for j in range(self.n_vertices):\n dist[i, j] = min2(dist[i, j], dist[i, k] + dist[k, j])\n return dist\n\n\nclass WeightedGraph(BaseWeightedGraph):\n\n def __init__(self, n_vertices: int, adj: List[int], weight: List[Any], ind: List[int]):\n super().__init__(n_vertices)\n self._adj = adj\n self._weight = weight\n self._ind = ind\n\n @classmethod\n def from_lil_adj(cls, n_vertices: int, adj_list: Iterable[Sequence[Tuple[int, int]]]) -> \'WeightedGraph\':\n n_edges = sum(len(l) for l in adj_list)\n adj = [0] * n_edges\n weight = [0] * n_edges\n ind = [0] * (n_vertices + 1)\n i = 0\n for u, l in enumerate(adj_list):\n ind[u] = i\n for v, w in l:\n adj[i] = v\n weight[i] = w\n i += 1\n ind[n_vertices] = i\n return cls(n_vertices, adj, weight, ind)\n\n @classmethod\n def from_directed_edges(cls, n_vertices: int, edges: Iterable[Tuple[int, int, int]]) -> \'WeightedGraph\':\n temp = [[] for _ in range(n_vertices)]\n for u, v, w in edges:\n temp[u].append((v, w))\n return cls.from_lil_adj(n_vertices, temp)\n\n @classmethod\n def from_undirected_edges(cls, n_vertices: int, edges: Iterable[Tuple[int, int, int]]) -> \'WeightedGraph\':\n temp = [[] for _ in range(n_vertices)]\n for u, v, w in edges:\n temp[u].append((v, w))\n temp[v].append((u, w))\n return cls.from_lil_adj(n_vertices, temp)\n\n def wadj(self, v):\n i, j = self._ind[v], self._ind[v + 1]\n return ((self._adj[k], self._weight[k]) for k in range(i, j))\n\n def to_wgraph(self) -> \'WeightedGraph\':\n l = [[] for _ in range(self.n_vertices)]\n for u, v, w in self.wedges:\n l[u].append((v, w))\n return WeightedGraph.from_lil_adj(self.n_vertices, l)\n\n def to_reverse_wgraph(self) -> \'WeightedGraph\':\n l = [[] for _ in range(self.n_vertices)]\n for u, v, w in self.wedges:\n l[v].append((u, w))\n return WeightedGraph.from_lil_adj(self.n_vertices, l)\n\n\nclass BaseGraph(BaseWeightedGraph):\n\n def adj(self, v):\n raise NotImplementedError\n\n def wadj(self, v):\n return ((u, 1) for u in self.adj(v))\n\n def bfs(self, s: Union[int, Iterable[int]], t: int = -1) -> List[int]:\n """\n Returns a list of distance. If starts contains more than one vertex, returns the shortest distance from any of them\n """\n dist = [-1] * self.n_vertices\n\n if isinstance(s, int):\n q = [s]\n dist[s] = 0\n else:\n q = list(s)\n for v in q:\n dist[v] = 0\n for d in range(1, self.n_vertices):\n nq = []\n for v in q:\n for u in self.adj(v):\n if dist[u] < 0:\n dist[u] = d\n nq.append(u)\n if u == t:\n return dist\n q = nq\n return dist\n\n def dist(self, s: int, t: int, inf: Any = INF):\n d = self.bfs(s, t)[t]\n return inf if d == -1 else d\n\n def to_graph(self) -> \'Graph\':\n l = [[] for _ in range(self.n_vertices)]\n for u, v in self.edges:\n l[u].append(v)\n return Graph.from_lil_adj(self.n_vertices, l)\n\n def to_reverse_graph(self) -> \'Graph\':\n l = [[] for _ in range(self.n_vertices)]\n for u, v in self.edges:\n l[v].append(u)\n return Graph.from_lil_adj(self.n_vertices, l)\n\n\nclass Graph(BaseGraph):\n\n def __init__(self, n_vertices: int, adj: List[int], ind: List[int]):\n super().__init__(n_vertices)\n self._adj = adj\n self._ind = ind\n\n @classmethod\n def from_lil_adj(cls, n_vertices: int, adj_list: Iterable[Sequence[int]]) -> \'Graph\':\n n_edges = sum(len(l) for l in adj_list)\n adj = [0] * n_edges\n ind = [0] * (n_vertices + 1)\n i = 0\n for u, l in enumerate(adj_list):\n ind[u] = i\n for v in l:\n adj[i] = v\n i += 1\n ind[n_vertices] = i\n return cls(n_vertices, adj, ind)\n\n @classmethod\n def from_directed_edges(cls, n_vertices: int, edges: Iterable[Tuple[int, int]]) -> \'Graph\':\n temp = [[] for _ in range(n_vertices)]\n for u, v in edges:\n temp[u].append(v)\n return cls.from_lil_adj(n_vertices, temp)\n\n @classmethod\n def from_undirected_edges(cls, n_vertices: int, edges: Iterable[Tuple[int, int]]) -> \'Graph\':\n temp = [[] for _ in range(n_vertices)]\n for u, v in edges:\n temp[u].append(v)\n temp[v].append(u)\n return cls.from_lil_adj(n_vertices, temp)\n\n def adj(self, v):\n return self._adj[self._ind[v]: self._ind[v + 1]]\n\n\nclass BaseRootedTree(BaseGraph):\n\n def __init__(self, n_vertices, root_vertex=0):\n super().__init__(n_vertices)\n self.root = root_vertex\n\n def parent(self, v: int) -> int:\n raise NotImplementedError\n\n def children(self, v: int) -> Iterable[int]:\n raise NotImplementedError\n\n def adj(self, v) -> Iterable[int]:\n if self.root == v:\n return self.children(v)\n return itertools.chain(self.children(v), (self.parent(v),))\n\n def post_order(self) -> Iterable[int]:\n """\n bottom vertices first\n """\n return (~v for v in self.prepost_order() if v < 0)\n\n def pre_order(self) -> Iterable[int]:\n """\n top vertices first\n """\n stack = [self.root]\n while stack:\n v = stack.pop()\n yield v\n for u in self.children(v):\n stack.append(u)\n\n def prepost_order(self) -> Iterable[int]:\n """\n if v >= 0: it\'s pre-order entry.\n\n otherwise: it\'s post-order entry.\n """\n stack = [~self.root, self.root]\n while stack:\n v = stack.pop()\n yield v\n if v >= 0:\n for u in self.children(v):\n stack.append(~u)\n stack.append(u)\n\n def prepost_indices(self) -> Tuple[List[int], List[int]]:\n pre_ind = [0] * self.n_vertices\n post_ind = [0] * self.n_vertices\n for i, t in enumerate(self.prepost_order()):\n if t >= 0:\n pre_ind[t] = i\n else:\n post_ind[~t] = i\n return pre_ind, post_ind\n\n def depth(self) -> List[int]:\n depth = [0] * self.n_vertices\n for v in self.pre_order():\n d = depth[v]\n for c in self.children(v):\n depth[c] = d + 1\n return depth\n\n def sort_edge_values(self, wedges: Iterable[Tuple[int, int, T]], default: Optional[T] = None) -> List[T]:\n memo = [default] * self.n_vertices\n for u, v, d in wedges:\n if self.parent(u) == v:\n memo[u] = d\n else:\n memo[v] = d\n return memo\n\n def height(self, depth=None) -> int:\n if depth is None:\n depth = self.depth()\n return max(depth) + 1\n\n def path(self, v: int, k: int) -> List[int]:\n """\n ??v??k???????????.\n\n :param v: ??\n :param k: ??????????\n :return: ??\n """\n res = [-1] * (k + 1)\n for i in range(k + 1):\n res[i] = v\n v = self.parent(v)\n if v < 0:\n break\n return res\n\n def aggregate_parent_path(self, aggregate: Callable[[T, int], T], identity: T,\n pre_order: Optional[Iterable[int]] = None) -> List[T]:\n """\n ????????????dp??????.\n\n :param aggregate: (T, V) -> T\n :param identity: ???\n :param pre_order: pre_order????\n :return ?????????????dp?\n """\n if pre_order is None:\n pre_order = self.pre_order()\n\n dp = [identity] * self.n_vertices\n for v in pre_order:\n p = self.parent(v)\n if p >= 0:\n dp[v] = aggregate(dp[p], v)\n return dp\n\n def aggregate_subtree(self, merge: Callable[[T, T], T], identity: T, finalize: Callable[[T, int], T],\n post_order: Optional[Iterable[int]] = None) -> List[T]:\n """\n ???????????????dp??????.\n\n :param merge: (T, T) -> T, (T, merge)?????\n :param identity: ???\n :param finalize: (T, V) -> T\n :param post_order: post_order????\n :return ???????????????????dp?\n """\n if post_order is None:\n post_order = self.post_order()\n\n dp = [identity] * self.n_vertices\n for v in post_order:\n t = identity\n for u in self.children(v):\n t = merge(t, dp[u])\n dp[v] = finalize(t, v)\n return dp\n\n def solve_rerooting(self, merge: Callable[[T, T], T], identity: T, finalize: Callable[[T, int, int], T],\n pre_order: Optional[Iterable[int]] = None) -> List[T]:\n """\n ????dp???.\n\n dp[u,v] = finalize(merge(dp[v,k] for k in adj[v] if k != u), u, v)\n\n (v?????u?????????????????)\n\n :param merge: (T,T) -> T, (T, merge)?????\n :param identity: ???\n :param finalize: (T, V, V) -> T\n :param pre_order: pre_order????\n :return ???????????????dp?\n """\n\n if pre_order is None:\n pre_order = list(self.pre_order())\n dp1 = [identity] * self.n_vertices\n dp2 = [identity] * self.n_vertices\n\n for v in reversed(pre_order):\n t = identity\n for u in self.children(v):\n dp2[u] = t\n t = merge(t, finalize(dp1[u], v, u))\n t = identity\n for u in reversed(list(self.children(v))):\n dp2[u] = merge(t, dp2[u])\n t = merge(t, finalize(dp1[u], v, u))\n dp1[v] = t\n for v in pre_order:\n if v == self.root:\n continue\n p = self.parent(v)\n dp2[v] = finalize(merge(dp2[v], dp2[p]), v, p)\n dp1[v] = merge(dp1[v], dp2[v])\n return dp1\n\n\nclass DoublingStrategy:\n def __init__(self, tree: BaseRootedTree, depth=None, pre_order=None):\n if pre_order is None:\n pre_order = tree.pre_order()\n if depth is None:\n depth = tree.depth()\n self.depth = depth\n self.tree = tree\n d = (max(depth) + 1).bit_length()\n dbl = Array2d.full(tree.n_vertices, d, -1)\n for v in pre_order:\n u = tree.parent(v)\n dbl[v, 0] = u\n for i in range(d - 1):\n u = dbl[u, i]\n if u < 0:\n break\n dbl[v, i + 1] = u\n self.dbl = dbl\n\n def ancestor_of(self, v: int, k: int) -> int:\n if k > self.depth[v]:\n return -1\n i = 0\n while k:\n if k & 1:\n v = self.dbl[v, i]\n k //= 2\n i += 1\n return v\n\n def lca(self, u: int, v: int) -> int:\n lu, lv = self.depth[u], self.depth[v]\n if lu > lv:\n u = self.ancestor_of(u, lu - lv)\n else:\n v = self.ancestor_of(v, lv - lu)\n if u == v:\n return u\n\n i = self.dbl.m - 1\n while True:\n while i >= 0 and self.dbl[u, i] == self.dbl[v, i]:\n i -= 1\n if i < 0:\n return self.dbl[u, 0]\n u, v = self.dbl[u, i], self.dbl[v, i]\n\n def dist(self, u: int, v: int) -> int:\n return self.depth[u] + self.depth[v] - 2 * self.depth[self.lca(u, v)]\n\n\nclass RootedTree(BaseRootedTree):\n\n def __init__(self, parent: List[int], children: Graph, root_vertex: int):\n super().__init__(len(parent), root_vertex)\n self._parent = parent\n self._children = children\n\n @classmethod\n def from_edges(cls, edges, root_vertex=0):\n n = len(edges) + 1\n g = Graph.from_undirected_edges(n, edges)\n parent = [0] * n\n parent[root_vertex] = -1\n stack = [root_vertex]\n while stack:\n v = stack.pop()\n p = parent[v]\n for u in g.adj(v):\n if u != p:\n parent[u] = v\n stack.append(u)\n return cls.from_parent(parent, root_vertex)\n\n @classmethod\n def from_parent(cls, parent, root_vertex=0):\n return cls(parent,\n Graph.from_directed_edges(len(parent), ((p, v) for v, p in enumerate(parent) if p >= 0)),\n root_vertex)\n\n @classmethod\n def random(cls, n_vertices, root_vertex=0):\n parent = [-1] * n_vertices\n vertices = list(range(root_vertex)) + list(range(root_vertex + 1, n_vertices))\n shuffle(vertices)\n vertices.append(root_vertex)\n for i, v in zip(reversed(range(n_vertices)), vertices[-2::-1]):\n parent[v] = vertices[randrange(i, n_vertices)]\n return cls.from_parent(parent, root_vertex)\n\n def parent(self, v):\n return self._parent[v]\n\n def children(self, v):\n return self._children.adj(v)\n\n\nclass Grid(BaseGraph):\n def __init__(self, grid):\n super().__init__(grid.n * grid.m)\n self.grid = grid\n\n def adj(self, v):\n if not self.grid.arr[v]:\n return\n i, j = divmod(v, self.grid.m)\n if i + 1 < self.grid.n and self.grid[i + 1, j]:\n yield v + self.grid.m\n if 0 <= i - 1 and self.grid[i - 1, j]:\n yield v - self.grid.m\n if j + 1 < self.grid.m and self.grid[i, j + 1]:\n yield v + 1\n if 0 <= j - 1 and self.grid[i, j - 1]:\n yield v - 1\n\n\ndef strongly_connected_components(graph: BaseGraph, rgraph: BaseGraph = None):\n if rgraph is None:\n rgraph = graph.to_reverse_graph()\n n = graph.n_vertices\n order = []\n color = [0] * n\n for v0 in range(n):\n if color[v0]:\n continue\n color[v0] = -1\n stack = [iter(graph.adj(v0))]\n path = [v0]\n while path:\n for u in stack[-1]:\n if color[u] == 0:\n color[u] = -1\n path.append(u)\n stack.append(iter(graph.adj(u)))\n break\n else:\n v = path.pop()\n order.append(v)\n stack.pop()\n\n label = 0\n for v0 in reversed(order):\n if color[v0] >= 0:\n continue\n color[v0] = label\n stack = [v0]\n while stack:\n v = stack.pop()\n for u in rgraph.adj(v):\n if color[u] < 0:\n color[u] = label\n stack.append(u)\n label += 1\n return label, color\n\n\ndef dijkstra(graph: BaseWeightedGraph, s: Union[int, Iterable[int]], t: Union[int, Iterable[int]] = -1,\n inf: Any = 2 ** 62) -> Tuple[List[int], Any]:\n """\n Returns a list of distance. If starts contains more than one vertex, returns the shortest distance from any of them.\n """\n K = graph.n_vertices.bit_length()\n MASK = (1 << K) - 1\n dist = [inf] * graph.n_vertices\n\n if isinstance(s, int):\n q = [s]\n dist[s] = 0\n else:\n q = list(s)\n for v in q:\n dist[v] = 0\n if isinstance(t, int):\n if t < 0:\n t = []\n else:\n t = [t]\n else:\n t = set(t)\n\n while q:\n x = hq.heappop(q)\n d, v = x >> K, x & MASK\n if v in t:\n return dist, d\n if d > dist[v]:\n continue\n for u, w in graph.wadj(v):\n if dist[u] > d + w:\n dist[u] = d + w\n hq.heappush(q, ((d + w) << K) | u)\n return dist, None\n\n\ndef dijkstra_general(graph: BaseWeightedGraph, inf: Any, zero: Any, s: Union[int, Iterable[int]],\n t: Union[int, Iterable[int]] = -1) -> Tuple[List[Any], Any]:\n """\n Returns a list of distance. If starts contains more than one vertex, returns the shortest distance from any of them.\n """\n dist = [inf] * graph.n_vertices\n\n if isinstance(s, int):\n q = [(zero, s)]\n dist[s] = zero\n else:\n q = [(zero, v) for v in s]\n for d, v in q:\n dist[v] = zero\n if isinstance(t, int):\n if t < 0:\n t = []\n else:\n t = [t]\n else:\n t = set(t)\n\n while q:\n d, v = hq.heappop(q)\n if v in t:\n return dist, d\n if d > dist[v]:\n continue\n for u, w in graph.wadj(v):\n nw = d + w\n if dist[u] > nw:\n dist[u] = nw\n hq.heappush(q, (nw, u))\n return dist, None\n\n\ndef get_dual_graph(n_vertices: int, wedges: Iterable[Tuple[int, int, int]]) -> Tuple[\n List[int], List[int], List[int], List[int]]:\n """\n ??????????????????\n (u, v, cap) in wedges???????????(u, v, cap)?(v, u, 0)?????????????????????????\n\n :param n_vertices: ???\n :param wedges: ?????\n :return: (???????, ???index?????)\n """\n\n cap = defaultdict(int)\n for u, v, c in wedges:\n cap[(u, v)] += c\n cap[(v, u)] += 0\n\n temp: List[List[Tuple[int, int]]] = [[] for _ in range(n_vertices)]\n for (u, v), w in cap.items():\n temp[u].append((v, w))\n adj = [0] * len(cap)\n weight = [0] * len(cap)\n rev = [0] * len(cap)\n ind = [0] * (n_vertices + 1)\n\n i = 0\n for u, l in enumerate(temp):\n ind[u] = i\n for v, w in l:\n adj[i] = v\n weight[i] = w\n if u < v:\n cap[(v, u)] = i\n else:\n j = cap[(u, v)]\n rev[i] = j\n rev[j] = i\n i += 1\n ind[n_vertices] = i\n\n return adj, weight, ind, rev\n\n\ndef edmonds_karp(n_vertices: int, edges: Iterable[Tuple[int, int, int]], s: int, t: int):\n """\n ?????????O(VE^2)\n\n :param n_vertices: ???\n :param edges: (??1, ??2, ??)?Iterable\n :param s: ??\n :param t: ??\n :return: (????, ?????)\n """\n\n adj, caps, ind, rev = get_dual_graph(n_vertices, edges)\n\n m0 = max(caps)\n bfs_memo = [0] * n_vertices\n pv = [-1] * n_vertices\n pe = [-1] * n_vertices\n bfs_memo[s] = n_vertices + 1\n offset = 0\n\n def find_path():\n nonlocal offset\n offset += 1\n q = [s]\n while q:\n nq = []\n for v in q:\n if v == t:\n return True\n for i in range(ind[v], ind[v + 1]):\n if caps[i] == 0:\n continue\n u = adj[i]\n if bfs_memo[u] < offset:\n bfs_memo[u] = offset\n pv[u] = v\n pe[u] = i\n nq.append(u)\n q = nq\n return False\n\n res = 0\n flag = find_path()\n while flag:\n v = t\n m = m0\n while pv[v] >= 0:\n e = pe[v]\n m = min2(m, caps[e])\n v = pv[v]\n v = t\n while pv[v] >= 0:\n e = pe[v]\n caps[e] -= m\n caps[rev[e]] += m\n v = pv[v]\n res += m\n flag = find_path()\n return res, WeightedGraph(n_vertices, adj, caps, ind), rev\n\n\ndef max_bipartite_matching(graph: BaseWeightedGraph):\n pass\n'),
'lib.itertools': (False, 'from itertools import chain, repeat, count, islice\nfrom collections import Counter\n\n\ndef repeat_chain(values, counts):\n return chain.from_iterable(map(repeat, values, counts))\n\n\ndef unique_combinations_from_value_counts(r, values, counts):\n n = len(counts)\n indices = list(islice(repeat_chain(count(), counts), r))\n if len(indices) < r:\n return\n while True:\n yield tuple(values[i] for i in indices)\n for i, j in zip(reversed(range(r)), repeat_chain(reversed(range(n)), reversed(counts))):\n if indices[i] != j:\n break\n else:\n return\n j = indices[i] + 1\n for i, j in zip(range(i, r), repeat_chain(count(j), counts[j:])):\n indices[i] = j\n\n\ndef unique_combinations(r, iterable):\n return unique_combinations_from_value_counts(r, *zip(*Counter(iterable).items()))\n'),
'lib.matrix': (False, "from lib.array2d import Array2d\n\n\ndef get_general_matrix(zero, one):\n class Matrix(Array2d):\n ZERO = zero\n ONE = one\n\n @classmethod\n def zeros(cls, n, m):\n return cls.full(n, m, cls.ZERO)\n\n @classmethod\n def ones(cls, n, m):\n return cls.full(n, m, cls.ONE)\n\n def __add__(self, other):\n if self.m != other.m or self.n != other.n:\n raise ValueError(f'Cannot add matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n return Matrix(self.n, self.m, [x + y for x, y in zip(self.arr, other.arr)])\n\n def __iadd__(self, other):\n if self.m != other.m or self.n != other.n:\n raise ValueError(f'Cannot multiply matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n for i, v in enumerate(other.arr):\n self.arr[i] += v\n return self\n\n def __sub__(self, other):\n if self.m != other.m or self.n != other.n:\n raise ValueError(f'Cannot subtract matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n return Matrix(self.n, self.m, [x - y for x, y in zip(self.arr, other.arr)])\n\n def __isub__(self, other):\n if self.m != other.m or self.n != other.n:\n raise ValueError(f'Cannot multiply matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n for i, v in enumerate(other.arr):\n self.arr[i] -= v\n return self\n\n def __mul__(self, other):\n if self.m != other.m or self.n != other.n:\n raise ValueError(f'Cannot multiply matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n return Matrix(self.n, self.m, [x * y for x, y in zip(self.arr, other.arr)])\n\n def __imul__(self, other):\n if self.m != other.m or self.n != other.n:\n raise ValueError(f'Cannot multiply matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n for i, v in enumerate(other.arr):\n self.arr[i] *= v\n return self\n\n def __truediv__(self, other):\n if self.m != other.m or self.n != other.n:\n raise ValueError(f'Cannot multiply matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n return Matrix(self.n, self.m, [x / y for x, y in zip(self.arr, other.arr)])\n\n def __matmul__(self, other):\n if self.m != other.n:\n raise ValueError(f'Cannot dot multiply matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n\n res = self.full(self.n, other.m, self.ZERO)\n\n for i in range(self.n):\n for j in range(other.m):\n c = self.ZERO\n for k in range(self.m):\n c += self[i, k] * other[k, j]\n res[i, j] = c\n return res\n\n def __imatmul__(self, other):\n if self.m != other.n:\n raise ValueError(f'Cannot multiply matrices ({self.n}, {self.m}) and ({other.n}, {other.m})')\n if self is other or self.m != other.m:\n return self @ other\n\n row = [self.ZERO] * self.m\n for i in range(self.n):\n t = i * self.m\n for j in range(self.m):\n row[j] = self.arr[j + t]\n for j in range(other.m):\n c = self.ZERO\n for k in range(self.m):\n c += row[k] * other[k, j]\n self[i, j] = c\n return self\n\n def __pow__(self, power, modulo=None):\n if self.n != self.m:\n raise ValueError('pow is supported only for square matrix')\n k = self.n\n res = Matrix.full(k, k, self.ZERO)\n for i in range(k):\n res[i, i] = self.ONE\n\n m = self\n while power > 0:\n if power & 1:\n res @= m\n m @= m\n power >>= 1\n return res\n\n return Matrix\n\n\nIMatrix = get_general_matrix(0, 1)\nFMatrix = get_general_matrix(0.0, 1.0)\n\n\ndef accumulate(mat):\n res = mat.zeros(mat.n + 1, mat.m + 1)\n for i in range(mat.n):\n k = mat.ZERO\n for j in range(mat.m):\n k += mat[i, j]\n res[i + 1, j + 1] = k\n for j in range(1, mat.m + 1):\n k = mat.ZERO\n for i in range(1, mat.n + 1):\n k += res[i, j]\n res[i, j] = k\n return res\n\n\ndef accumulate_prod(mat):\n res = mat.ones(mat.n + 1, mat.m + 1)\n for i in range(mat.n):\n k = mat.ONE\n for j in range(mat.m):\n k *= mat[i, j]\n res[i + 1, j + 1] = k\n for j in range(1, mat.m + 1):\n k = mat.ONE\n for i in range(1, mat.n):\n k *= res[i, j]\n res[i, j] = k\n return res\n"),
'lib.misc': (False, 'from typing import List, Any, Callable, Sequence, Union, Tuple, TypeVar\n\nV = TypeVar(\'V\')\n\nimport sys\nfrom functools import reduce\nfrom itertools import accumulate\nfrom lib.data_structure import BinaryIndexedTree, DisjointSet\nimport bisect\n\n\ndef general_bisect(ng: int, ok: int, judge: Callable[[int], V]) -> int:\n """\n ???????????????????O(log L)??????\n\n :param ng: judge(ng)==False????\n :param ok: judge(ok)==True????\n :param judge: ??????????\n :return: judge(x)==True???????????\n """\n while abs(ng - ok) > 1:\n m = (ng + ok) // 2\n if judge(m):\n ok = m\n else:\n ng = m\n return ok\n\n\ndef fibonacci_search(left: int, right: int, func: Union[Callable[[int], V], Sequence], inf: V = 2 ** 60) -> Tuple[\n V, int]:\n """\n ??????????????????????????????O(log L)??????\n ???(left, right)?????????\n\n :param left: ?????????????\n :param right: ?????????????\n :param func: ??????\n :param inf: func???\n :return: (func????, ????????func???)\n """\n try:\n func = func.__getitem__\n except AttributeError:\n pass\n f1, f2 = 1, 1\n while f1 + f2 < right - left:\n f1, f2 = f1 + f2, f1\n l = left\n m1 = func(l + f2)\n m2 = func(l + f1)\n while f1 > 2:\n f1, f2 = f2, f1 - f2\n if m1 > m2:\n l += f1\n m1 = m2\n m2 = func(l + f1) if l + f1 < right else inf\n else:\n m2 = m1\n m1 = func(l + f2)\n if m1 < m2:\n return m1, l + 1\n else:\n return m2, l + 2\n\n\ndef max2(x: V, y: V) -> V:\n return x if x > y else y\n\n\ndef min2(x: V, y: V) -> V:\n return x if x < y else y\n\n\nread = sys.stdin.buffer.read\nreadline = sys.stdin.buffer.readline\n\n\ndef rerooting(rooted_tree, merge, identity, finalize):\n """\n merge: (T,T) -> T, (T, merge)?????\n identity: ???\n finalize: (T, V, V) -> T\n\n ????????dp?????\n dp[u,v] = finalize(merge(dp[v,k] for k in adj[v] if k != u), u, v)\n ???(u,v)?? u->v\n """\n N = rooted_tree.n_vertices\n parent = rooted_tree.parent\n children = rooted_tree.children\n order = rooted_tree.dfs_order\n\n # from leaf to parent\n dp_down = [None] * N\n for v in reversed(order):\n dp_down[v] = finalize(reduce(merge,\n (dp_down[c] for c in children[v]),\n identity), parent[v], v)\n\n # from parent to leaf\n dp_up = [None] * N\n dp_up[0] = identity\n for v in order:\n if len(children[v]) == 0:\n continue\n temp = (dp_up[v],) + tuple(dp_down[u] for u in children[v]) + (identity,)\n left = accumulate(temp[:-2], merge)\n right = tuple(accumulate(reversed(temp[2:]), merge))\n for u, l, r in zip(children[v], left, reversed(right)):\n dp_up[u] = finalize(merge(l, r), u, v)\n\n res = [None] * N\n for v, l in enumerate(children):\n res[v] = reduce(merge,\n (dp_down[u] for u in children[v]),\n identity)\n res[v] = merge(res[v], dp_up[v])\n return res, dp_up, dp_down\n\n\ndef rerooting_fast(rooted_tree, merge, identity, finalize):\n """\n merge: (T,T) -> T, (T, merge)?????\n identity: ???\n finalize: (T, V, V) -> T\n\n ????????dp?????\n dp[u,v] = finalize(merge(dp[v,k] for k in adj[v] if k != u), u, v)\n ???(u,v)??\n dp[u,v]: v?????u?????????????????\n """\n dp1 = [identity] * rooted_tree.n_vertices\n dp2 = [identity] * rooted_tree.n_vertices\n\n for v in rooted_tree.post_order:\n t = identity\n for u in rooted_tree.children(v):\n dp2[u] = t\n t = merge(t, finalize(dp1[u], v, u))\n t = identity\n for u in reversed(rooted_tree.children(v)):\n dp2[u] = merge(t, dp2[u])\n t = merge(t, finalize(dp1[u], v, u))\n dp1[v] = t\n for v in rooted_tree.pre_order:\n p = rooted_tree.parent(v)\n if p >= 0:\n dp2[v] = finalize(merge(dp2[v], dp2[p]), v, p)\n dp1[v] = merge(dp1[v], dp2[v])\n return dp1\n\n\ndef longest_increasing_sequence(l, inf, strict=True):\n if not l:\n return 0\n dp = [inf] * len(l)\n if strict:\n for i, v in enumerate(l):\n dp[bisect.bisect_left(dp, v)] = v\n else:\n for i, v in enumerate(l):\n dp[bisect.bisect_right(dp, v)] = v\n\n m = next(n for n in reversed(range(len(l))) if dp[n] < inf) + 1\n return m\n\n\ndef zeta(data, merge):\n """\n ??????data????????\n M?????\n data: 2^n -> M\n output: 2^n -> M\n merge: M -> M\n \n ouput[i] = sum(data[j] for j in range(2^n) if i|j == i)\n """\n n = len(data)\n i = 1\n while i < n:\n j = i\n while j < n:\n data[j] = merge(data[j], data[j & ~i])\n j = (j + 1) | i\n i <<= 1\n return data\n\n\ndef check_bipartiteness(n_vertices, edges):\n ds = DisjointSet(2 * n_vertices)\n\n for a, b in edges:\n ds.union(a, b + n_vertices)\n ds.union(b, a + n_vertices)\n\n next_color = 0\n color = [-1] * (2 * n_vertices)\n for v in range(n_vertices):\n ra = ds.find(v)\n rb = ds.find(v + n_vertices)\n if ra == rb:\n return None\n if color[ra] < 0:\n color[ra] = next_color\n color[rb] = next_color + 1\n next_color += 2\n color[v] = color[ra]\n color[v + n_vertices] = color[rb]\n return color[:n_vertices]\n\n\ndef small_range_duplicate(a: List[int]) -> Tuple[List[int], List[int]]:\n MASK = (1 << 32) - 1\n n = len(a)\n left = [i - 1 for i in range(n + 1)]\n right = [i + 1 for i in range(n + 1)]\n\n sorted_ind = sorted((~v << 32) | i for i, v in enumerate(a))\n t = 0\n vi = sorted_ind[t]\n i = vi & MASK\n v = ~(vi >> 32)\n while t < n:\n j = i\n l = left[i]\n pi = l\n pv = v\n while v == pv and left[i] == pi:\n pi = i\n t += 1\n if t >= n:\n break\n vi = sorted_ind[t]\n i = vi & MASK\n v = ~(vi >> 32)\n r = right[pi]\n right[l] = r\n while j <= pi:\n nj = right[j]\n left[j] = l\n right[j] = r\n j = nj\n left[r] = l\n\n return left, right\n\n\ndef small_range(a: List[int]) -> Tuple[List[int], List[int]]:\n N = len(a)\n MASK = (1 << 32) - 1\n left = [i - 1 for i in range(N + 1)]\n right = [i + 1 for i in range(N + 1)]\n sorted_ind = sorted((~v << 32) | i for i, v in enumerate(a))\n for v in sorted_ind:\n i = v & MASK\n left[right[-i]] = left[-i]\n right[left[-i]] = right[-i]\n\n return left, right\n\n\ndef popcnt32(n: int) -> int:\n n = n - ((n >> 1) & 0x55555555)\n n = (n & 0x33333333) + ((n >> 2) & 0x33333333)\n return ((((n + (n >> 4)) & 0x0f0f0f0f) * 0x01010101) >> 24) & 0xff\n\n\ndef popcnt64(n: int) -> int:\n n = n - ((n >> 1) & 0x5555555555555555)\n n = (n & 0x3333333333333333) + ((n >> 2) & 0x3333333333333333)\n n = (n + (n >> 4)) & 0x0f0f0f0f0f0f0f0f\n return ((((n + (n >> 32)) & 0xffffffff) * 0x01010101) >> 24) & 0xff\n\n\ndef popcnt(n: int) -> int:\n if n < 1 << 32:\n return popcnt32(n)\n elif n < 1 << 64:\n return popcnt64(n)\n else:\n return sum(c == \'1\' for c in bin(n))\n\n\ndef reverse_bits32(x: int):\n x = ((x & 0x55555555) << 1) | ((x & 0xAAAAAAAA) >> 1)\n x = ((x & 0x33333333) << 2) | ((x & 0xCCCCCCCC) >> 2)\n x = ((x & 0x0F0F0F0F) << 4) | ((x & 0xF0F0F0F0) >> 4)\n x = ((x & 0x00FF00FF) << 8) | ((x & 0xFF00FF00) >> 8)\n return ((x & 0x0000FFFF) << 16) | ((x & 0xFFFF0000) >> 16)\n\n\ndef count_inversions(l: List[Any]) -> int:\n """\n ?????????in-place????????\n\n :param l: ???\n :return: ???\n """\n bit = BinaryIndexedTree(len(l))\n res = 0\n for i, v in enumerate(l):\n bit[v] += 1\n res += bit[v + 1:]\n return res\n\n\nclass BinaryTrie:\n class Node:\n def __init__(self):\n self.zero = None\n self.one = None\n self.cnt = 0\n\n def __init__(self, bits):\n self.root = self.Node()\n self.bits = bits\n\n def add(self, v):\n n = self.root\n n.cnt += 1\n for d in reversed(range(self.bits)):\n if (v >> d) & 1:\n if not n.one:\n n.one = self.Node()\n n = n.one\n else:\n if not n.zero:\n n.zero = self.Node()\n n = n.zero\n n.cnt += 1\n\n def remove(self, v):\n n = self.root\n n.cnt -= 1\n for d in reversed(range(self.bits)):\n if (v >> d) & 1:\n n = n.one\n else:\n n = n.zero\n n.cnt -= 1\n\n def find_argminxor(self, v):\n n = self.root\n r = 0\n for d in reversed(range(self.bits)):\n if (v >> d) & 1:\n if n.one and n.one.cnt > 0:\n n = n.one\n r |= 1 << d\n else:\n n = n.zero\n else:\n if n.zero and n.zero.cnt > 0:\n n = n.zero\n else:\n n = n.one\n r |= 1 << d\n return r\n\n def find_nth(self):\n raise NotImplementedError\n\n\n def __contains__(self, v):\n n = self.root\n for d in reversed(range(self.bits)):\n if (v >> d) & 1:\n n = n.one\n else:\n n = n.zero\n if not n or n.cnt == 0:\n return False\n return True\n'),
'lib.modint': (False, "from importlib.util import find_spec, module_from_spec\n\nmodints = {}\n\n\ndef get_modint(mod):\n try:\n return modints[mod]\n except KeyError:\n spec = find_spec('lib._modint')\n module = module_from_spec(spec)\n module.__dict__['MOD'] = mod\n spec.loader.exec_module(module)\n modints[mod] = module.ModInt\n return modints[mod]"),
'lib.number_theory': (False, 'from collections import Counter, defaultdict\nfrom math import sqrt, ceil, gcd\nfrom itertools import count\nfrom typing import Tuple\n\n\ndef sign(x):\n return int(x > 0) - int(x < 0)\n\n\ndef egcd(a: int, b: int) -> Tuple[int, int, int]:\n """\n ?????????\n\n :param a: ??\n :param b: ??\n :return: (x, y, gcd(a,b)). x, y?ax+by=gcd(a,b)????\n """\n s, ps, r, pr = 0, 1, b, a\n while r != 0:\n q = pr // r\n pr, r = r, pr - q * r\n ps, s = s, ps - q * s\n t = (pr - ps * a) // b\n if pr > 0:\n return ps, t, pr\n return -ps, -t, -pr\n\n\ndef modinv(x: int, mod: int) -> int:\n """\n Z/(mod Z)???x???\n\n :param x: ??\n :param mod: ??\n :return: x * y % mod = 1????y\n """\n s, ps, r, pr = 0, 1, mod, x\n while r != 0:\n pr, (q, r) = r, divmod(pr, r)\n ps, s = s, ps - q * s\n if pr == 1:\n return ps if ps >= 0 else ps + mod\n raise ValueError("base is not invertible for the given modulus")\n\n\ndef modpow(x, k, mod):\n """\n Z/(mod Z)???x?k?\n\n :param x: ??\n :param k: ??\n :param mod: ??\n :return: x ** k % mod\n """\n if k < 0:\n x = modinv(x, mod)\n k = -k\n r = 1\n while k != 0:\n if k & 1:\n r = (r * x) % mod\n x = (x * x) % mod\n k >>= 1\n return r\n\n\n# ?????\ndef prime_factors(n):\n i = 2\n while i * i <= n:\n if n % i:\n i += 1\n else:\n n //= i\n yield i\n if n > 1:\n yield n\n\n\ndef int_product(iterable):\n x = 1\n for y in iterable:\n x *= y\n return x\n\n\n# ?????O(sqrt(n))????\ndef divisors(n):\n for i in range(1, ceil(sqrt(n)) + 1):\n j, r = divmod(n, i)\n if not r:\n yield i\n if i != j:\n yield j\n\n\n# ?????\ndef generate_primes():\n D = defaultdict(list)\n\n q = 2\n for q in count(2):\n if q in D:\n for p in D[q]:\n D[p + q].append(p)\n del D[q]\n else:\n yield q\n D[q * q].append(q)\n\n\ndef totient_factors(n):\n def it():\n prev = -1\n for p in prime_factors(n):\n if p == prev:\n yield p\n else:\n prev = p\n for q in prime_factors(p - 1):\n yield q\n\n return it()\n\n\ndef primitive_root(mod, phi_factors=None):\n if phi_factors is None:\n phi_factors = tuple(totient_factors(mod))\n phi = int_product(phi_factors)\n primes = set(phi_factors)\n for i in range(2, mod):\n for p in primes:\n if modpow(i, (phi // p), mod) == 1:\n break\n else:\n return i\n else:\n raise ValueError(f\'There is no primitive root for modulo {mod}\')\n\n\ndef lcm(nums):\n m = 1\n for n in nums:\n m *= n // gcd(m, n)\n return m\n\n\ndef chinese_remainder_theorem(reminders, mods, mods_lcm=-1):\n """\n returns x and lcm(reminders) s.t.\n all(x%m == r for r,m in zip(reminders,mods))\n """\n s = 0\n if mods_lcm < 0:\n mods_lcm = lcm(mods)\n for m, r in zip(mods, reminders):\n p = mods_lcm // m\n s += r * p * pow(p, -1, m)\n s %= mods_lcm\n return s, mods_lcm\n\n\ndef factorials_with_inv(k, mod):\n """\n 0! ... k! ?????mod????????\n PyPy??pow????????????\n """\n fac = [1] * (k + 1)\n inv = [1] * (k + 1)\n t = 1\n for i in range(1, k + 1):\n t = (t * i) % mod\n fac[i] = t\n t = modinv(t, mod)\n for i in reversed(range(1, k + 1)):\n inv[i] = t\n t = (t * i) % mod\n return fac, inv\n\n\ndef extended_lucas_theorem(mod):\n """\n Returns a function (n,m) -> C(n,m)%mod\n """\n factors = tuple((p, q, p ** q) for p, q in Counter(prime_factors(mod)).items())\n facs = [[0] * k for p, q, k in factors]\n invs = [[0] * k for p, q, k in factors]\n for (p, q, k), fac, inv in zip(factors, facs, invs):\n t = 1\n for n in range(k):\n if n % p != 0:\n t *= n\n t %= k\n fac[n] = t\n t = modinv(t, k)\n for n in reversed(range(k)):\n inv[n] = t\n if n % p != 0:\n t *= n\n t %= k\n\n def helper(n, m):\n l = n - m\n if l < 0:\n return 0\n\n def reminders():\n for (p, q, k), fac, inv in zip(factors, facs, invs):\n a, b, c, e0, eq, i, r = n, m, l, 0, -2, 1, 1\n while a > 0:\n r *= fac[a % k] * inv[b % k] * inv[c % k]\n r %= k\n a, b, c = a // p, b // p, c // p\n if i == q:\n eq = e0\n e0 += a - b - c\n i += 1\n if eq >= 0:\n eq += e0\n if e0 >= q:\n r = 0\n else:\n r *= p ** e0\n r %= k\n if not (p == 2 and q >= 3) and (eq % 2 == 1):\n r = -r\n yield r\n\n return chinese_remainder_theorem(reminders(), (m for _, _, m in factors), mod)[0]\n\n return helper\n\n\ndef lucas_theorem(m, n, mod, comb):\n cnt = 1\n while n > 0:\n m, mr = divmod(m, mod)\n n, nr = divmod(n, mod)\n if mr < nr:\n return 0\n cnt *= comb[mr][nr]\n cnt %= mod\n return cnt\n\n\n# C(n,m) is even iff (~n&m)>0\n\ndef floor_linear_sum(n, m, a, b):\n """\n returns sum((a*i+b)//m for i in range(n))\n """\n if b < 0:\n t = (-b - 1) // m + 1\n b += m * t\n res = -t * n\n else:\n res = 0\n while True:\n if a >= m:\n res += (n - 1) * n * (a // m) // 2\n a %= m\n if b >= m:\n res += n * (b // m)\n b %= m\n\n y_max = (a * n + b) // m\n if y_max == 0:\n return res\n nx_max = b - y_max * m\n res += (n + nx_max // a) * y_max\n n, m, a, b = y_max, a, m, nx_max % a\n\ndef get_sieve(n):\n sieve = [0]*(n+1)\n for i in range(2, len(sieve)):\n if sieve[i] > 0:\n continue\n sieve[i] = i\n for j in range(i*2, len(sieve), i):\n if sieve[j] == 0:\n sieve[j] = i\n return sieve\n\ndef divisors_from_sieve(n, sieve):\n res = [1]\n while n > 1:\n k = sieve[n]\n n //= k\n l = len(res)\n t = k\n res.extend(res[i]*t for i in range(l))\n while n > 1 and sieve[n] == k:\n t *= k\n res.extend(res[i]*t for i in range(l))\n n //= k\n return res\n\ndef factorize_from_sieve(n, sieve):\n while n > 1:\n yield sieve[n]\n n //= sieve[n]\n\n\n# TODO ?????????'),
'lib.transform': (False, "from cmath import rect, pi\nfrom lib.misc import reverse_bits32\nfrom lib.number_theory import totient_factors, primitive_root, modinv, modpow\n\n\ndef fft(a, inverse=False):\n one = complex(1.0)\n n = (len(a) - 1).bit_length()\n m = 2 ** n\n a += [complex(0.0)] * (m - len(a))\n pows = [rect(1.0, (-pi if inverse else pi) / (2 ** (n - 1)))]\n for _ in range(n-1):\n pows.append(pows[-1] ** 2)\n pows.reverse()\n\n shift = 32 - n\n for i in range(m):\n j = reverse_bits32(i) >> shift\n if i < j:\n a[i], a[j] = a[j], a[i]\n\n for i in range(m):\n b = 1\n for w1 in pows:\n if not i & b:\n break\n i ^= b\n w = one\n while not i & b:\n s = a[i]\n t = a[i | b] * w\n a[i] = s + t\n a[i | b] = s - t\n w *= w1\n i += 1\n i ^= b\n b <<= 1\n if inverse:\n c = 1 / m\n for i in range(m):\n a[i] *= c\n return a\n\n\ndef ntt(a, mod, inverse=False):\n if type(a[0]) is not int:\n for i,v in enumerate(a):\n a[i] = int(v)\n n = (len(a) - 1).bit_length()\n d2 = 0\n r = 1\n phi_factors = tuple(totient_factors(mod))\n for p in phi_factors:\n if p == 2:\n d2 += 1\n else:\n r *= p\n if d2 < n:\n raise ValueError(f'Given array is too long: modulo {modint.mod} only support array length up to {2 ** d2}')\n\n pr = primitive_root(mod, phi_factors)\n if inverse:\n pr = modinv(pr, mod)\n pows = [modpow(pr, r * 2 ** (d2 - n), mod)]\n for _ in range(n - 1):\n pows.append(pows[-1] ** 2 % mod)\n pows = tuple(reversed(pows))\n\n m = 2 ** n\n a += [0] * (m - len(a))\n\n shift = 32 - n\n for i in range(m):\n j = reverse_bits32(i) >> shift\n if i < j:\n a[i], a[j] = a[j], a[i]\n\n for i in range(m):\n b = 1\n for w1 in pows:\n if not i & b:\n break\n i ^= b\n w = 1\n while not i & b:\n j = i | b\n s = a[i] % mod\n t = a[j] * w % mod\n a[i] = s + t\n a[j] = s - t\n w = (w * w1) % mod\n i += 1\n i ^= b\n b <<= 1\n\n if inverse:\n c = modinv(m, mod)\n for i, v in enumerate(a):\n a[i] = (v * c) % mod\n return a"),
'lib._modint': (False, 'from lib.number_theory import modinv, modpow\n\nclass ModInt(int):\n mod = MOD\n\n def __new__(cls, n=0, f=1):\n return int.__new__(cls, n % MOD if f else n)\n\n def __neg__(self):\n return ModInt(MOD - int(self) if self != 0 else 0, 0)\n\n def __add__(self, other):\n x = int(self) + int(other)\n return ModInt(x if x < MOD else x - MOD, 0)\n\n def __sub__(self, other):\n x = int(self) - int(other)\n return ModInt(x if x >= 0 else x + MOD, 0)\n\n def __rsub__(self, other):\n x = int(other) - int(self)\n return ModInt(x if x >= 0 else x + MOD, 0)\n\n def __mul__(self, other):\n return ModInt(int(self) * int(other))\n\n def __truediv__(self, other):\n return self * ModInt(other).inv\n\n def __rtruediv__(self, other):\n return self.inv * other\n\n __radd__ = __add__\n __rmul__ = __mul__\n\n def __pow__(self, other, **kwargs):\n return ModInt(modpow(int(self), int(other), MOD), 0)\n\n @property\n def inv(self):\n return ModInt(modinv(int(self), MOD), 0)\n\n @classmethod\n def sum(cls, iterable):\n r = 0\n for v in iterable:\n r += int(v)\n return ModInt(r)\n\n @classmethod\n def product(cls, iterable):\n r = ModInt(1)\n for v in iterable:\n r *= v\n return r'),
'lib': (True, ''),
}
_sys.meta_path.insert(2, InlineImporter)
# Entrypoint
from lib.number_theory import factorials_with_inv
mod = 998244353
n, a, b, c = map(int, input().split())
fac, inv = factorials_with_inv(n, mod)
comb = lambda n, k: fac[n] * inv[k] % mod * inv[n - k] % mod
t = -1 if n%2 == 0 else 1
res = -t
dp_a = 1
dp_b = 1
dp_c = 1
for k in range(1, n + 1):
dp_a *= 2
if k - 1 >= a:
dp_a -= comb(k - 1, a)
dp_a %= mod
dp_b *= 2
if k - 1 >= b:
dp_b -= comb(k - 1, b)
dp_b %= mod
dp_c *= 2
if k - 1 >= c:
dp_c -= comb(k - 1, c)
dp_c %= mod
res += t * comb(n, k) * dp_a % mod * dp_b % mod * dp_c % mod
res %= mod
t = -t
print(res)
|
ConDefects/ConDefects/Code/abc235_g/Python/28570313
|
condefects-python_data_2426
|
n,a,b,c = map(int,input().split())
mod = 998244353
## nCkのmodを求める関数
# テーブルを作る(前処理)
max_n = n + 10
fac, finv, inv = [0]*max_n, [0]*max_n, [0]*max_n
def comInit(max_n):
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,max_n):
fac[i] = fac[i-1]* i% mod
inv[i] = mod - inv[mod%i] * (mod // i) % mod
finv[i] = finv[i-1] * inv[i] % mod
comInit(max_n)
# 二項係数の計算
def com(n,k):
if(n < k):
return 0
if( (n<0) | (k < 0)):
return 0
return fac[n] * (finv[k] * finv[n-k] % mod) % mod
ans = 1
mul = (-1)**(n%2)
xa,xb,xc = 1,1,1
for i in range(1,n+1):
mul *= -1
xa = (xa * 2 - com(i-1,a)) % mod
xb = (xb * 2 - com(i-1,b)) % mod
xc = (xc * 2 - com(i-1,c)) % mod
ans += (mul * xa * xb % mod) * (xc * com(n,i) % mod)
ans %= mod
print(ans)
n,a,b,c = map(int,input().split())
mod = 998244353
## nCkのmodを求める関数
# テーブルを作る(前処理)
max_n = n + 10
fac, finv, inv = [0]*max_n, [0]*max_n, [0]*max_n
def comInit(max_n):
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,max_n):
fac[i] = fac[i-1]* i% mod
inv[i] = mod - inv[mod%i] * (mod // i) % mod
finv[i] = finv[i-1] * inv[i] % mod
comInit(max_n)
# 二項係数の計算
def com(n,k):
if(n < k):
return 0
if( (n<0) | (k < 0)):
return 0
return fac[n] * (finv[k] * finv[n-k] % mod) % mod
mul = (-1)**(n%2)
ans = mul
xa,xb,xc = 1,1,1
for i in range(1,n+1):
mul *= -1
xa = (xa * 2 - com(i-1,a)) % mod
xb = (xb * 2 - com(i-1,b)) % mod
xc = (xc * 2 - com(i-1,c)) % mod
ans += (mul * xa * xb % mod) * (xc * com(n,i) % mod)
ans %= mod
print(ans)
|
ConDefects/ConDefects/Code/abc235_g/Python/30010913
|
condefects-python_data_2427
|
import sys, os, io
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
n, a, b, c = map(int, input().split())
mod = 998244353
l = n + 5
fact = [1] * (l + 1)
for i in range(1, l + 1):
fact[i] = i * fact[i - 1] % mod
inv = [1] * (l + 1)
inv[l] = pow(fact[l], mod - 2, mod)
for i in range(l - 1, -1, -1):
inv[i] = (i + 1) * inv[i + 1] % mod
def comb(n, r):
return fact[n] * inv[r] % mod * inv[n - r] % mod if n >= r >= 0 else 0
a0, b0, c0 = 1, 1, 1
ans, d = 1, -1
for i in range(1, n + 1):
a0 = (2 * a0 - comb(i - 1, a)) % mod
b0 = (2 * b0 - comb(i - 1, b)) % mod
c0 = (2 * c0 - comb(i - 1, c)) % mod
ans += d * a0 * b0 % mod * c0 % mod * comb(n, i) % mod
d *= -1
ans %= mod
print(ans)
import sys, os, io
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
n, a, b, c = map(int, input().split())
mod = 998244353
l = n + 5
fact = [1] * (l + 1)
for i in range(1, l + 1):
fact[i] = i * fact[i - 1] % mod
inv = [1] * (l + 1)
inv[l] = pow(fact[l], mod - 2, mod)
for i in range(l - 1, -1, -1):
inv[i] = (i + 1) * inv[i + 1] % mod
def comb(n, r):
return fact[n] * inv[r] % mod * inv[n - r] % mod if n >= r >= 0 else 0
a0, b0, c0 = 1, 1, 1
ans, d = 1, -1
for i in range(1, n + 1):
a0 = (2 * a0 - comb(i - 1, a)) % mod
b0 = (2 * b0 - comb(i - 1, b)) % mod
c0 = (2 * c0 - comb(i - 1, c)) % mod
ans += d * a0 * b0 % mod * c0 % mod * comb(n, i) % mod
d *= -1
ans = ans % mod if not n % 2 else -ans % mod
print(ans)
|
ConDefects/ConDefects/Code/abc235_g/Python/43758724
|
condefects-python_data_2428
|
import itertools
def main():
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for a, b, c in itertools.combinations(xy, 3):
s = abs((a[0] - c[0]) * (b[1] - c[1]) - (b[0] - c[0]) * (a[1] - c[1])) // 2
if s > 0:
ans += 1
print(ans)
if __name__ == '__main__':
main()
import itertools
def main():
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for a, b, c in itertools.combinations(xy, 3):
s = abs((a[0] - c[0]) * (b[1] - c[1]) - (b[0] - c[0]) * (a[1] - c[1]))
if s > 0:
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
ConDefects/ConDefects/Code/abc224_c/Python/46196808
|
condefects-python_data_2429
|
N=int(input())
XY=[]
for i in range(N):
XY.append(list(map(int, input().split())))
#print(N)
#print(XY)
count=0
for i in range(N):
for j in range(i+1,N):
for k in range(j+1,N):
#print(i,j,k)
if (XY[k][1]-XY[i][1])*(XY[j][0]-XY[i][0])!=(XY[j][0]-XY[i][0])*(XY[k][0]-XY[i][0]):
count+=1
print(count)
N=int(input())
XY=[]
for i in range(N):
XY.append(list(map(int, input().split())))
#print(N)
#print(XY)
count=0
for i in range(N):
for j in range(i+1,N):
for k in range(j+1,N):
#print(i,j,k)
if (XY[k][1]-XY[i][1])*(XY[j][0]-XY[i][0])!=(XY[j][1]-XY[i][1])*(XY[k][0]-XY[i][0]):
count+=1
print(count)
|
ConDefects/ConDefects/Code/abc224_c/Python/44477761
|
condefects-python_data_2430
|
# 凸四角形の十分条件→対角線が交わればOK
def getIntTuple():
return tuple(map(int, input().split()))
def isIntersect(A, B, C, D):
tb = (B[1] - A[1])*(C[0] - A[0])-(C[1] - A[1])*(B[0] - A[0])
td = (D[1] - A[1])*(C[0] - A[0])-(C[1] - A[1])*(D[0] - A[0])
ta = (A[1] - B[1])*(D[0] - B[0])-(D[1] - B[1])*(A[0] - B[0])
tc = (D[1] - B[1])*(D[0] - B[0])-(D[1] - B[1])*(C[0] - B[0])
return tb * td < 0 and ta * tc < 0
def main():
A = getIntTuple()
B = getIntTuple()
C = getIntTuple()
D = getIntTuple()
print("Yes" if isIntersect(A, B, C, D) else "No")
if __name__ == "__main__":
main()
# 凸四角形の十分条件→対角線が交わればOK
def getIntTuple():
return tuple(map(int, input().split()))
def isIntersect(A, B, C, D):
tb = (B[1] - A[1])*(C[0] - A[0])-(C[1] - A[1])*(B[0] - A[0])
td = (D[1] - A[1])*(C[0] - A[0])-(C[1] - A[1])*(D[0] - A[0])
ta = (A[1] - B[1])*(D[0] - B[0])-(D[1] - B[1])*(A[0] - B[0])
tc = (C[1] - B[1])*(D[0] - B[0])-(D[1] - B[1])*(C[0] - B[0])
return tb * td < 0 and ta * tc < 0
def main():
A = getIntTuple()
B = getIntTuple()
C = getIntTuple()
D = getIntTuple()
print("Yes" if isIntersect(A, B, C, D) else "No")
if __name__ == "__main__":
main()
|
ConDefects/ConDefects/Code/abc266_c/Python/44375735
|
condefects-python_data_2431
|
s=[list(map(int,input().split())) for i in range(4)]
for i in range(4):
cn=0
for j in range(1,4):
a,b=0,10
for k in range(1,4):
if k!=j:
a=k;b=min(b,k)
x=[s[(i+a)%4][0]-s[(i+b)%4][0],s[(i+a)%4][1]-s[(i+b)%4][1]]#0=x[1]*x-x[0]*y+c
c=x[0]*s[(i+b)%4][1]-x[1]*s[(i+b)%4][0]
if (x[1]*s[i][0]-x[0]*s[i][1]+c)*(x[1]*s[i-j][0]-x[0]*s[i-j][1]+c)>0:
cn+=1
if cn==3:
exit(print("No"))
print("Yes")
s=[list(map(int,input().split())) for i in range(4)]
for i in range(4):
cn=0
for j in range(1,4):
a,b=0,10
for k in range(1,4):
if k!=j:
a=k;b=min(b,k)
x=[s[(i+a)%4][0]-s[(i+b)%4][0],s[(i+a)%4][1]-s[(i+b)%4][1]]#0=x[1]*x-x[0]*y+c
c=x[0]*s[(i+b)%4][1]-x[1]*s[(i+b)%4][0]
if (x[1]*s[i][0]-x[0]*s[i][1]+c)*(x[1]*s[(i+j)%4][0]-x[0]*s[(i+j)%4][1]+c)>0:
cn+=1
if cn==3:
exit(print("No"))
print("Yes")
|
ConDefects/ConDefects/Code/abc266_c/Python/45522626
|
condefects-python_data_2432
|
# coding: utf-8
from fractions import Fraction
from functools import partial
try:
dummy = src
minp = partial(src.pop, 0)
except NameError:
minp = input
def ints():
return list(map(int, minp().rstrip().split(' ')))
def int1():
return int(minp().rstrip())
def above_below(p, p1, p2):
'''
点(x, y)が２点(x1, y1),(x2, y2)を通る直線の上にあるか下にあるか
0なら直線上、正なら+y領域、負なら-y領域
'''
(x, y), (x1, y1), (x2, y2) = p, p1, p2
# 鉛直線の場合
if x1 == x2:
return x - x1
# 直線 a x + y + b = 0 を求める
a = Fraction(-(y1 - y2) / (x1 - x2))
b = - (a * x1 + y1)
# x, yを代入して返す
return a * x + y + b
#@psecs
def main():
pts = [tuple(ints()) for _ in range(4)]
# print(locals())
# 対角線が作る直線に対して残りの２点が反対側にあれば凸
if above_below(pts[0], pts[1], pts[3]) * above_below(pts[2], pts[1], pts[3]) < 0 and \
above_below(pts[1], pts[0], pts[2]) * above_below(pts[3], pts[1], pts[2]) < 0:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
# coding: utf-8
from fractions import Fraction
from functools import partial
try:
dummy = src
minp = partial(src.pop, 0)
except NameError:
minp = input
def ints():
return list(map(int, minp().rstrip().split(' ')))
def int1():
return int(minp().rstrip())
def above_below(p, p1, p2):
'''
点(x, y)が２点(x1, y1),(x2, y2)を通る直線の上にあるか下にあるか
0なら直線上、正なら+y領域、負なら-y領域
'''
(x, y), (x1, y1), (x2, y2) = p, p1, p2
# 鉛直線の場合
if x1 == x2:
return x - x1
# 直線 a x + y + b = 0 を求める
a = Fraction(-(y1 - y2) / (x1 - x2))
b = - (a * x1 + y1)
# x, yを代入して返す
return a * x + y + b
#@psecs
def main():
pts = [tuple(ints()) for _ in range(4)]
# print(locals())
# 対角線が作る直線に対して残りの２点が反対側にあれば凸
if above_below(pts[0], pts[1], pts[3]) * above_below(pts[2], pts[1], pts[3]) < 0 and \
above_below(pts[1], pts[0], pts[2]) * above_below(pts[3], pts[0], pts[2]) < 0:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
|
ConDefects/ConDefects/Code/abc266_c/Python/45028964
|
condefects-python_data_2433
|
N = int(input())
A = [int(input()) for i in range(N)]
MOD = [998244353, 1000000007, 1000000009]
M = len(MOD)
C = [[A[i] % MOD[c] for i in range(N)] for c in range(M)]
d = [{} for _ in range(M)]
for c in range(M):
for i in range(N):
if C[c][i] not in d[c]:
d[c][C[c][i]] = 1
else:
d[c][C[c][i]] += 1
ans = 0
for i in range(N):
for j in range(N):
f = True
for c in range(M):
f &= ((C[c][i] * C[c][j]) % MOD[c]) in d[c]
if f :
ans += d[c][(C[c][i] * C[c][j]) % MOD[c]]
print(ans)
N = int(input())
A = [int(input()) for i in range(N)]
MOD = [998244353, 1000000007, 1000000009, 1000000021]
M = len(MOD)
C = [[A[i] % MOD[c] for i in range(N)] for c in range(M)]
d = [{} for _ in range(M)]
for c in range(M):
for i in range(N):
if C[c][i] not in d[c]:
d[c][C[c][i]] = 1
else:
d[c][C[c][i]] += 1
ans = 0
for i in range(N):
for j in range(N):
f = True
for c in range(M):
f &= ((C[c][i] * C[c][j]) % MOD[c]) in d[c]
if f :
ans += d[c][(C[c][i] * C[c][j]) % MOD[c]]
print(ans)
|
ConDefects/ConDefects/Code/abc339_f/Python/53281757
|
condefects-python_data_2434
|
import sys
sys.set_int_max_str_digits(0)
input = sys.stdin.readline
from bisect import bisect_left
N = int(input())
A = sorted(int(input()) for _ in range(N))
ans = 0
for i in range(N-1):
for j in range(i, N):
x = A[i] * A[j]
idx = bisect_left(A, x)
if idx == N: break
while idx < N and x == A[idx]:
ans += 1
if i != j: ans += 1
idx += 1
print(ans)
import sys
sys.set_int_max_str_digits(0)
input = sys.stdin.readline
from bisect import bisect_left
N = int(input())
A = sorted(int(input()) for _ in range(N))
ans = 0
for i in range(N):
for j in range(i, N):
x = A[i] * A[j]
idx = bisect_left(A, x)
if idx == N: break
while idx < N and x == A[idx]:
ans += 1
if i != j: ans += 1
idx += 1
print(ans)
|
ConDefects/ConDefects/Code/abc339_f/Python/52982584
|
condefects-python_data_2435
|
import sys
from typing import Counter
inf = 1e9
def input():
return sys.stdin.readline().strip()
def solution(nums):
MOD = 10**9 + 9
N = len(nums)
nums = [x % MOD for x in nums]
count = Counter(nums)
ans = 0
for i in range(N):
for j in range(N):
ans += count[(nums[i] * nums[j]) % MOD]
print(ans)
def main():
n = int(input())
solution([int(input()) for _ in range(n)])
if __name__ == "__main__":
main()
import sys
from typing import Counter
inf = 1e9
def input():
return sys.stdin.readline().strip()
def solution(nums):
MOD = 10**56 + 9
N = len(nums)
nums = [x % MOD for x in nums]
count = Counter(nums)
ans = 0
for i in range(N):
for j in range(N):
ans += count[(nums[i] * nums[j]) % MOD]
print(ans)
def main():
n = int(input())
solution([int(input()) for _ in range(n)])
if __name__ == "__main__":
main()
|
ConDefects/ConDefects/Code/abc339_f/Python/53967299
|
condefects-python_data_2436
|
from collections import defaultdict
from random import randint
n = int(input())
a_list = [int(input()) for _ in range(n)]
m = randint(10 ** 32, 10 ** 33)
d = defaultdict(lambda: 0)
for a in a_list:
d[a] += 1
ans = 0
for p in a_list:
for q in a_list:
ans += d[p * q % m]
print(ans)
from collections import defaultdict
from random import randint
n = int(input())
m = randint(10 ** 32, 10 ** 33)
a_list = [int(input()) % m for _ in range(n)]
d = defaultdict(lambda: 0)
for a in a_list:
d[a] += 1
ans = 0
for p in a_list:
for q in a_list:
ans += d[p * q % m]
print(ans)
|
ConDefects/ConDefects/Code/abc339_f/Python/54497544
|
condefects-python_data_2437
|
n = int(input())
mod = 2**127-1
a = [int(input())%mod for _ in range(n)]
d = dict()
for i in a:
d.setdefault(i,0)
d[i] += 1
ans = 0
for i in a:
for j in a:
value = i*j%mod
if value in d: ans += d[value%mod]
print(ans)
n = int(input())
mod = 98080989074039189058908908209991
a = [int(input())%mod for _ in range(n)]
d = dict()
for i in a:
d.setdefault(i,0)
d[i] += 1
ans = 0
for i in a:
for j in a:
value = i*j%mod
if value in d: ans += d[value%mod]
print(ans)
|
ConDefects/ConDefects/Code/abc339_f/Python/52897763
|
condefects-python_data_2438
|
S = input()
print(S[:-1] + "1")
S = input()
print(S[:-1] + "4")
|
ConDefects/ConDefects/Code/abc335_a/Python/54722195
|
condefects-python_data_2439
|
s = input()
s[:-1]
print(s + "4")
s = input()
s = s[:-1]
print(s + "4")
|
ConDefects/ConDefects/Code/abc335_a/Python/54743914
|
condefects-python_data_2440
|
N,M=map(int,input().split())
mod=998244353
answer=(-1)**(N%2)*(M-1)+pow(M-1,N,mod)
print(answer)
N,M=map(int,input().split())
mod=998244353
answer=(-1)**(N%2)*(M-1)+pow(M-1,N,mod)
print(answer%mod)
|
ConDefects/ConDefects/Code/abc307_e/Python/46214607
|
condefects-python_data_2441
|
from collections import deque, defaultdict
from math import log, asin, acos, cos, sin, tan, atan2, floor, gcd, sqrt, pi
# from math import *
from heapq import *
from bisect import bisect, bisect_left
import sys
from itertools import combinations, permutations, count
from functools import lru_cache, cmp_to_key
from operator import add, mul, sub, xor
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
# atan2(y, x) :=
# artan(y/x) ([-pi, pi] -> if theta < 0 -> theta += 2pi -> [0, 2pi])
def ceil(m, n):
if n == 0:
return INF
return (m + n - 1) // n
INF = 10**20
BASE = 31
CONST = 10 ** 9
MAX = 10 ** 6
MOD = 998244353
def dfs(x, parent):
color = -1
for y in adj[x]:
if y == parent:
continue
dfs(y, x)
if ret[y] == S[x]:
mj[x] += 1
else:
mj[x] -= 1
if mj[y] < 0:
color = INF
break
if mj[y] > 0:
continue
if S[y] == 'B':
if color == 1:
color = INF
break
mj[y] += 1
color = 0
else:
if color == 0:
color = INF
break
mj[y] += 1
color = 1
if color == -1:
color = S[parent]
elif color == 0:
color = 'B'
elif color == 1:
color = 'W'
ret[x] = color
return
for _ in range(int(input().strip())):
N = int(input().strip())
adj = [[] for _ in range(N + 1)]
mj = [0] * (N + 1)
for _ in range(N - 1):
a, b = map(int, input().split())
adj[a].append(b)
adj[b].append(a)
S = 'B' + input().strip()
ret = [-1] * (N + 1)
root = 1
dfs(root, 0)
if INF in ret[1:]:
print(-1)
else:
print(''.join(ret[1:]))
from collections import deque, defaultdict
from math import log, asin, acos, cos, sin, tan, atan2, floor, gcd, sqrt, pi
# from math import *
from heapq import *
from bisect import bisect, bisect_left
import sys
from itertools import combinations, permutations, count
from functools import lru_cache, cmp_to_key
from operator import add, mul, sub, xor
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
# atan2(y, x) :=
# artan(y/x) ([-pi, pi] -> if theta < 0 -> theta += 2pi -> [0, 2pi])
def ceil(m, n):
if n == 0:
return INF
return (m + n - 1) // n
INF = 10**20
BASE = 31
CONST = 10 ** 9
MAX = 10 ** 6
MOD = 998244353
def dfs(x, parent):
color = -1
for y in adj[x]:
if y == parent:
continue
dfs(y, x)
if ret[y] == S[x]:
mj[x] += 1
else:
mj[x] -= 1
if mj[y] < 0:
color = INF
break
if mj[y] > 0:
continue
if S[y] == 'B':
if color == 1:
color = INF
break
mj[y] += 1
color = 0
else:
if color == 0:
color = INF
break
mj[y] += 1
color = 1
if color == -1:
color = S[parent]
elif color == 0:
color = 'B'
elif color == 1:
color = 'W'
ret[x] = color
return
for _ in range(int(input().strip())):
N = int(input().strip())
adj = [[] for _ in range(N + 1)]
mj = [0] * (N + 1)
for _ in range(N - 1):
a, b = map(int, input().split())
adj[a].append(b)
adj[b].append(a)
S = 'B' + input().strip()
ret = [-1] * (N + 1)
root = 1
dfs(root, 0)
if INF in ret[1:] or mj[root] < 0:
print(-1)
else:
print(''.join(ret[1:]))
|
ConDefects/ConDefects/Code/arc161_c/Python/42020807
|
condefects-python_data_2442
|
import sys
sys.setrecursionlimit(10**7)
def dfs(u,v):
seen[v]=True
temp=0
X[v]=u
for next_v in G[v]:
if seen[next_v]:
continue
temp+=1
dfs(u,next_v)
if ans[next_v] in set(['',S[v]]) :
count[v]+=1
if temp>0:
if (count[v]>len(G[v])//2):
pass
elif (count[v]==len(G[v])//2) & (u!=v) & (ans[u] in set(['',S[v]])):
ans[u]=S[v]
else:
ans[v]='-1'
else:
if ans[u] in set(['',S[v]]):
ans[u]=S[v]
else:
ans[v]='-1'
T=int(input())
for _ in range(T):
N=int(input())
G=[[] for _ in range(N)]
for _ in range(N-1):
A,B=map(int,input().split())
A-=1
B-=1
G[A].append(B)
G[B].append(A)
S=input()
ans=['']*N
count=[0]*N
seen=[False]*N
check=False
X=[0]*N
dfs(0,0)
for i in range(N):
if ans[i]=='-1':
check=True
break
elif ans[i]=='':
ans[i]=S[X[i]]
if check:
print('-1')
else:
print(''.join(ans))
import sys
sys.setrecursionlimit(10**7)
def dfs(u,v):
seen[v]=True
temp=0
X[v]=u
for next_v in G[v]:
if seen[next_v]:
continue
temp+=1
dfs(v,next_v)
if ans[next_v] in set(['',S[v]]) :
count[v]+=1
if temp>0:
if (count[v]>len(G[v])//2):
pass
elif (count[v]==len(G[v])//2) & (u!=v) & (ans[u] in set(['',S[v]])):
ans[u]=S[v]
else:
ans[v]='-1'
else:
if ans[u] in set(['',S[v]]):
ans[u]=S[v]
else:
ans[v]='-1'
T=int(input())
for _ in range(T):
N=int(input())
G=[[] for _ in range(N)]
for _ in range(N-1):
A,B=map(int,input().split())
A-=1
B-=1
G[A].append(B)
G[B].append(A)
S=input()
ans=['']*N
count=[0]*N
seen=[False]*N
check=False
X=[0]*N
dfs(0,0)
for i in range(N):
if ans[i]=='-1':
check=True
break
elif ans[i]=='':
ans[i]=S[X[i]]
if check:
print('-1')
else:
print(''.join(ans))
|
ConDefects/ConDefects/Code/arc161_c/Python/42743947
|
condefects-python_data_2443
|
from collections import deque
T=int(input())
for _ in range(T):
N=int(input())
G=[[] for i in range(N)]
for i in range(N-1):
a,b=map(int,input().split())
G[a-1].append(b-1)
G[b-1].append(a-1)
S=input()
ans=[""]*N
Ecnt=[0]*N
todo=deque()
for i in range(N):
Ecnt[i]=len(G[i])
if Ecnt[i]==1:
todo.append(i)
flag=[0]*N
while todo:
node = todo.popleft()
flag[node]=1
x=S[node]
b=0
w=0
# print(node,ans)
if Ecnt[node]==0:
for nextnode in G[node]:
if ans[nextnode]!="":
if ans[nextnode]=="B":
b+=1
else:
w+=1
else:
if flag[nextnode]==1:
ans[nextnode]=x
if x=="B":
b+=1
else:
w+=1
if b>len(G[node])//2:
if x=="B":
continue
else:
break
elif w>len(G[node])//2:
if x=="W":
continue
else:
break
for nextnode in G[node]:
if ans[nextnode]!="":
if ans[nextnode]=="B":
b+=1
else:
w+=1
else:
if flag[nextnode]==1:
ans[nextnode]=x
if x=="B":
b+=1
else:
w+=1
Ecnt[nextnode]-=1
if Ecnt[nextnode]==1:
todo.append(nextnode)
if b>len(G[node])//2:
if x=="B":
continue
else:
break
elif w>len(G[node])//2:
if x=="W":
continue
else:
break
elif b==w:
for nextnode in G[node]:
if ans[nextnode]=="":
ans[nextnode]=x
if x=="B":
b+=1
else:
w+=1
if b>len(G[node])//2:
if x=="B":
continue
else:
break
elif w>len(G[node])//2:
if x=="W":
continue
else:
break
else:
break
else:
print("".join(ans))
continue
print(-1)
from collections import deque
T=int(input())
for _ in range(T):
N=int(input())
G=[[] for i in range(N)]
for i in range(N-1):
a,b=map(int,input().split())
G[a-1].append(b-1)
G[b-1].append(a-1)
S=input()
ans=[""]*N
Ecnt=[0]*N
todo=deque()
for i in range(N):
Ecnt[i]=len(G[i])
if Ecnt[i]==1:
todo.append(i)
flag=[0]*N
while todo:
node = todo.popleft()
flag[node]=1
x=S[node]
b=0
w=0
# print(node,ans)
if Ecnt[node]==0:
if ans[node]=="":
ans[node]="B"
for nextnode in G[node]:
if ans[nextnode]!="":
if ans[nextnode]=="B":
b+=1
else:
w+=1
else:
if flag[nextnode]==1:
ans[nextnode]=x
if x=="B":
b+=1
else:
w+=1
if b>len(G[node])//2:
if x=="B":
continue
else:
break
elif w>len(G[node])//2:
if x=="W":
continue
else:
break
for nextnode in G[node]:
if ans[nextnode]!="":
if ans[nextnode]=="B":
b+=1
else:
w+=1
else:
if flag[nextnode]==1:
ans[nextnode]=x
if x=="B":
b+=1
else:
w+=1
Ecnt[nextnode]-=1
if Ecnt[nextnode]==1:
todo.append(nextnode)
if b>len(G[node])//2:
if x=="B":
continue
else:
break
elif w>len(G[node])//2:
if x=="W":
continue
else:
break
elif b==w:
for nextnode in G[node]:
if ans[nextnode]=="":
ans[nextnode]=x
if x=="B":
b+=1
else:
w+=1
if b>len(G[node])//2:
if x=="B":
continue
else:
break
elif w>len(G[node])//2:
if x=="W":
continue
else:
break
else:
break
else:
print("".join(ans))
continue
print(-1)
|
ConDefects/ConDefects/Code/arc161_c/Python/41901042
|
condefects-python_data_2444
|
from heapq import *
n, m = map(int, input().split())
A = [*map(int, input().split())]
G = [set() for _ in range(n)]
score = [0] * n
for _ in range(m):
u, v = map(int, input().split())
G[u - 1].add(v - 1)
G[v - 1].add(u - 1)
score[u - 1] += A[v - 1]
score[v - 1] += A[u - 1]
Q = [(c, i) for i, c in enumerate(score)]
heapify(Q)
used = [0] * n
ans = 0
while Q:
_, u = heappop(Q)
if used[u]:
continue
used[u] = 1
cnt = 0
for v in G[u]:
cnt += A[v]
G[v].remove(u)
score[v] -= u
heappush(Q, (score[v], v))
ans = max(ans, cnt)
print(ans)
from heapq import *
n, m = map(int, input().split())
A = [*map(int, input().split())]
G = [set() for _ in range(n)]
score = [0] * n
for _ in range(m):
u, v = map(int, input().split())
G[u - 1].add(v - 1)
G[v - 1].add(u - 1)
score[u - 1] += A[v - 1]
score[v - 1] += A[u - 1]
Q = [(c, i) for i, c in enumerate(score)]
heapify(Q)
used = [0] * n
ans = 0
while Q:
_, u = heappop(Q)
if used[u]:
continue
used[u] = 1
cnt = 0
for v in G[u]:
cnt += A[v]
G[v].remove(u)
score[v] -= A[u]
heappush(Q, (score[v], v))
ans = max(ans, cnt)
print(ans)
|
ConDefects/ConDefects/Code/abc267_e/Python/46128146
|
condefects-python_data_2445
|
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
n, m = map(int, input().split())
a = list(map(int, input().split()))
edges = [[] for _ in range(n)]
s = [0] * n
for _ in range(m):
u, v = map(int, input().split())
u -= 1
v -= 1
edges[u].append(v)
edges[v].append(u)
s[u] += a[v]
s[v] += a[u]
ok = 2 * 10 ** 14
ng = 0
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
p = []
finished = [False for _ in range(n)]
for i in range(n):
if s[i] <= mid:
p.append(i)
finished[i] = True
s2 = [0] * n
while p:
pp = p.pop()
for to in edges[pp]:
if finished[to]:
continue
s2[to] += a[pp]
if s[to] - s2[to] <= mid:
finished[to] = True
p.append(to)
if all(finished):
ok = mid
else:
ng = mid
print(ok)
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
n, m = map(int, input().split())
a = list(map(int, input().split()))
edges = [[] for _ in range(n)]
s = [0] * n
for _ in range(m):
u, v = map(int, input().split())
u -= 1
v -= 1
edges[u].append(v)
edges[v].append(u)
s[u] += a[v]
s[v] += a[u]
ok = 2 * 10 ** 14
ng = -1
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
p = []
finished = [False for _ in range(n)]
for i in range(n):
if s[i] <= mid:
p.append(i)
finished[i] = True
s2 = [0] * n
while p:
pp = p.pop()
for to in edges[pp]:
if finished[to]:
continue
s2[to] += a[pp]
if s[to] - s2[to] <= mid:
finished[to] = True
p.append(to)
if all(finished):
ok = mid
else:
ng = mid
print(ok)
|
ConDefects/ConDefects/Code/abc267_e/Python/44930062
|
condefects-python_data_2446
|
n, m = map(int, input().split())
x = list(map(int, input().split()))
imos_l = [0] * (n + 1)
for i in range(m - 1):
st, en = x[i], x[i + 1]
dist1 = max(st, en) - min(st, en)
dist2 = n - dist1
short_dist = min(dist1, dist2)
long_dist = max(dist1, dist2)
dist_diff = long_dist - short_dist
# 短い方を繋ぐ線を消すことでどれくらい距離が増えるか？
if short_dist == dist1:
imos_l[min(st, en) - 1] += dist_diff
imos_l[max(st, en)] -= dist_diff
else:
imos_l[max(st, en) - 1] += dist_diff
imos_l[0] += dist_diff
imos_l[min(st, en) - 1] -= dist_diff
l = [imos_l[0]]
for i in range(1, n):
l.append(l[-1] + imos_l[i])
# print(l)
min_l = min(l)
for i in range(n):
if l[i] == min_l:
min_l_index = i + 1
break
new_x = []
for i in range(m):
if x[i] - min_l_index <= 0:
new_x.append(x[i] - min_l_index + n)
else:
new_x.append(x[i] - min_l_index)
# print(new_x)
ans = 0
for i in range(m - 1):
st, en = new_x[i], new_x[i + 1]
ans += max(st, en) - min(st, en)
print(ans)
n, m = map(int, input().split())
x = list(map(int, input().split()))
imos_l = [0] * (n + 1)
for i in range(m - 1):
st, en = x[i], x[i + 1]
dist1 = max(st, en) - min(st, en)
dist2 = n - dist1
short_dist = min(dist1, dist2)
long_dist = max(dist1, dist2)
dist_diff = long_dist - short_dist
# 短い方を繋ぐ線を消すことでどれくらい距離が増えるか？
if short_dist == dist1:
imos_l[min(st, en) - 1] += dist_diff
imos_l[max(st, en) - 1] -= dist_diff
else:
imos_l[max(st, en) - 1] += dist_diff
imos_l[0] += dist_diff
imos_l[min(st, en) - 1] -= dist_diff
l = [imos_l[0]]
for i in range(1, n):
l.append(l[-1] + imos_l[i])
# print(l)
min_l = min(l)
for i in range(n):
if l[i] == min_l:
min_l_index = i + 1
break
new_x = []
for i in range(m):
if x[i] - min_l_index <= 0:
new_x.append(x[i] - min_l_index + n)
else:
new_x.append(x[i] - min_l_index)
# print(new_x)
ans = 0
for i in range(m - 1):
st, en = new_x[i], new_x[i + 1]
ans += max(st, en) - min(st, en)
print(ans)
|
ConDefects/ConDefects/Code/abc338_d/Python/52942487
|
condefects-python_data_2447
|
n, m = map(int, input().split())
x = list(map(int, input().split()))
cost = [0]*(n + 1)
for i in range(m - 1):
l, r = min(x[i], x[i + 1]), max(x[i], x[i + 1])
cost[1] += r - l
cost[l] += n - 2*(r - l)
cost[r] -= n - 2*(r - l)
ans = 1 << 32
for i in range(1, n + 1):
cost[i] += cost[i - 1]
if cost[i] < ans:
ans = cost[i]
print(ans)
n, m = map(int, input().split())
x = list(map(int, input().split()))
cost = [0]*(n + 1)
for i in range(m - 1):
l, r = min(x[i], x[i + 1]), max(x[i], x[i + 1])
cost[1] += r - l
cost[l] += n - 2*(r - l)
cost[r] -= n - 2*(r - l)
ans = 1 << 64
for i in range(1, n + 1):
cost[i] += cost[i - 1]
if cost[i] < ans:
ans = cost[i]
print(ans)
|
ConDefects/ConDefects/Code/abc338_d/Python/53178716
|
condefects-python_data_2448
|
def main():
N, M = map(int, input().split())
A = list(map(int, input().split()))
cost = [0]*(2*N)
ans = 0
for i in range(M-1):
s, t = A[i], A[i+1]
s, t = min(s, t), max(s, t)
if 2*(t-s) < N:
ans += t-s
d = N + 2*s - 2*t
cost[s] += d
cost[t+1] -= d
else:
ans += N+s-t
d = - N - 2*s + 2*t
cost[t] += d
cost[N+s] -= d
for i in range(2*N-1):
cost[i+1] += cost[i]
_cost = []
for i in range(N):
_cost.append(cost[i] + cost[N+i])
print(ans+min(_cost))
if __name__ == '__main__':
main()
def main():
N, M = map(int, input().split())
A = list(map(int, input().split()))
cost = [0]*(2*N)
ans = 0
for i in range(M-1):
s, t = A[i], A[i+1]
s, t = min(s, t), max(s, t)
if 2*(t-s) < N:
ans += t-s
d = N + 2*s - 2*t
cost[s] += d
cost[t] -= d
else:
ans += N+s-t
d = - N - 2*s + 2*t
cost[t] += d
cost[N+s] -= d
for i in range(2*N-1):
cost[i+1] += cost[i]
_cost = []
for i in range(N):
_cost.append(cost[i] + cost[N+i])
print(ans+min(_cost))
if __name__ == '__main__':
main()
|
ConDefects/ConDefects/Code/abc338_d/Python/52286746
|
condefects-python_data_2449
|
n=11
s=bin(n).replace('0b','').replace('1','2')
print(s)
n=int(input())
s=bin(n).replace('0b','').replace('1','2')
print(s)
|
ConDefects/ConDefects/Code/abc234_c/Python/45751042
|
condefects-python_data_2450
|
k=int(input())
ans=bin(k).replace('1','2')
print(ans)
k=int(input())
ans=bin(k)[2:].replace('1','2')
print(ans)
|
ConDefects/ConDefects/Code/abc234_c/Python/46127385
|
condefects-python_data_2451
|
from collections import defaultdict
inf = 2 * 10 ** 18
N, M = map(int, input().split())
A = sorted([int(a) for a in input().split()])[::-1]
X = defaultdict(list)
L = [inf]
for _ in range(M):
x, y = map(int, input().split())
X[x].append(x - y)
L.append(x - y)
for x in X:
X[x].sort()
SA = sorted(X.keys()) + [inf]
L = sorted(set(L))
count = defaultdict(int)
s = 0
ma = 0
pre_x = 0
ii = 0
G = {}
for x in SA:
while A and A[-1] < x:
grundy = ma + (A.pop() - pre_x)
s ^= grundy
while L[ii] < x:
G[L[ii]] = ma + (L[ii] - pre_x)
ii += 1
mi = inf
for y in X[x]:
g = G[y]
count[g] -= 1
if count[g] < 0:
mi = min(mi, g)
for y in X[x]:
g = G[y]
count[g] += 1
if mi < inf:
grundy = mi
count[grundy] += 1
pre_x += 1
else:
ma += x - pre_x
grundy = ma
pre_x = x
if A and A[-1] == x:
s ^= grundy
A.pop()
if L[ii] == x:
G[L[ii]] = grundy
ii += 1
print("Takahashi" if s else "Aoki")
from collections import defaultdict
inf = 2 * 10 ** 18
N, M = map(int, input().split())
A = sorted([int(a) for a in input().split()])[::-1]
X = defaultdict(list)
L = [inf]
for _ in range(M):
x, y = map(int, input().split())
X[x].append(x - y)
L.append(x - y)
for x in X:
X[x].sort()
SA = sorted(X.keys()) + [inf]
L = sorted(set(L))
count = defaultdict(int)
s = 0
ma = 0
pre_x = 0
ii = 0
G = {}
for x in SA:
while A and A[-1] < x:
grundy = ma + (A.pop() - pre_x)
s ^= grundy
while L[ii] < x:
G[L[ii]] = ma + (L[ii] - pre_x)
ii += 1
mi = inf
for y in X[x]:
g = G[y]
count[g] -= 1
if count[g] < 0:
mi = min(mi, g)
for y in X[x]:
g = G[y]
count[g] += 1
if mi < inf:
grundy = mi
count[grundy] += 1
pre_x += 1
else:
ma += x - pre_x
grundy = ma
pre_x = x
while A and A[-1] == x:
s ^= grundy
A.pop()
if L[ii] == x:
G[L[ii]] = grundy
ii += 1
print("Takahashi" if s else "Aoki")
|
ConDefects/ConDefects/Code/abc255_g/Python/35788058
|
condefects-python_data_2452
|
import sys
sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353
from collections import defaultdict, Counter
n, m = LI()
aa = LI()
xy = LLI(m)
xx = set(aa)
xtoy = defaultdict(list)
for x, y in xy:
xx.add(x)
xx.add(x-y)
xtoy[x].append(x-y)
gr = defaultdict(int)
sp = Counter()
cs = 0
for x in sorted(xx):
if xtoy[x]:
if x == len(xtoy[x]):
gr[x] = 0
sp[0] += 1
cs += 1
else:
cnt = Counter()
for y in xtoy[x]: cnt[gr[y]] += 1
for g, c in sorted(cnt.items()):
if c == sp[g]+1:
gr[x] = g
sp[g] += 1
cs += 1
break
else:
gr[x] = x-cs
g = 0
for a in aa: g ^= gr[a]
print("Takahashi" if g else "Aoki")
import sys
sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
md = 998244353
from collections import defaultdict, Counter
n, m = LI()
aa = LI()
xy = LLI(m)
xx = set(aa)
xtoy = defaultdict(list)
for x, y in xy:
xx.add(x)
xx.add(x-y)
xtoy[x].append(x-y)
gr = defaultdict(int)
sp = Counter()
cs = 0
for x in sorted(xx):
if xtoy[x]:
if x == len(xtoy[x]):
gr[x] = 0
sp[0] += 1
cs += 1
else:
cnt = Counter()
for y in xtoy[x]: cnt[gr[y]] += 1
for g, c in sorted(cnt.items()):
if c == sp[g]+1:
gr[x] = g
sp[g] += 1
cs += 1
break
else:
gr[x] = x-cs
else:
gr[x] = x-cs
g = 0
for a in aa: g ^= gr[a]
print("Takahashi" if g else "Aoki")
|
ConDefects/ConDefects/Code/abc255_g/Python/32458462
|
condefects-python_data_2453
|
DEBUG = 0
class BitSet():
def __init__(self, L = [], X = None):
self.m = 63
if X is None:
self.n = (len(L) - 1) // self.m + 1
self.X = [0] * self.n
for i in range(self.n):
for j in range(self.m):
ij = i * self.m + j
if ij >= len(L):
continue
if L[ij]:
self.X[i] |= 1 << j
else:
self.n = len(X)
self.X = X
def copy(self):
return BitSet(None, self.X)
def __getitem__(self, sl):
if type(sl) == int:
i = sl // self.m
j = sl % self.m
return self.X[i] >> j & 1 if i < len(self.X) else 0
if not sl.start:
if sl.stop is None or sl.stop == self.n:
return 1 // 0
else:
return 1 // 0
else:
if sl.stop is None or sl.stop == self.n:
return 1 // 0
else:
return 1 // 0
def __and__(self, other):
print(self.n, other.n)
n = min(self.n, other.n)
X = [0] * n
for i in range(n):
X[i] = self.X[i] & other.X[i]
return BitSet(None, X)
def __or__(self, other):
n = min(self.n, other.n)
if self.n > other.n:
X = [0] * n + self.X[n:]
else:
X = [0] * n + other.X[n:]
for i in range(n):
X[i] = self.X[i] | other.X[i]
return BitSet(None, X)
def __xor__(self, other):
n = min(self.n, other.n)
if self.n > other.n:
X = [0] * n + self.X[n:]
else:
X = [0] * n + other.X[n:]
for i in range(n):
X[i] = self.X[i] ^ other.X[i]
return BitSet(None, X)
def __irshift__(self, k):
i = k // self.m
j = k % self.m
if j == 0:
self.X = self.X[i:]
else:
X = []
mmm = (1 << j) - 1
for ii in range(i, self.n - 1):
X.append((self.X[ii] >> j) | ((self.X[ii+1] & mmm) << self.m - j))
a = self.X[self.n - 1] >> j
if a:
X.append(a)
self.X = X
self.n = len(self.X)
return self
def __rshift__(self, k):
i = k // self.m
j = k % self.m
if j == 0:
X = self.X[i:]
else:
X = []
mmm = (1 << j) - 1
for ii in range(i, self.n - 1):
X.append((self.X[ii] >> j) | ((self.X[ii+1] & mmm) << self.m - j))
a = self.X[self.n - 1] >> j
if a:
X.append(a)
return BitSet(None, X)
def __ilshift__(self, k):
i = k // self.m
j = k % self.m
if j == 0:
self.X = [0] * i + self.X
else:
X = [0] * (self.n + i + 1)
mmm = (1 << self.m - j) - 1
for ii, x in enumerate(self.X):
x1 = x & mmm
x2 = x >> self.m - j
X[ii+i] |= x1 << j
X[ii+i+1] |= x2
self.X = X
self.n = len(self.X)
return self
def __lshift__(self, k):
i = k // self.m
j = k % self.m
if j == 0:
X = [0] * i + self.X
else:
X = [0] * (self.n + i + 1)
mmm = (1 << self.m - j) - 1
for ii, x in enumerate(self.X):
x1 = x & mmm
x2 = x >> self.m - j
X[ii+i] |= x1 << j
X[ii+i+1] |= x2
return BitSet(None, X)
def xor_kth_bit(self, k, x = 1):
if x:
i = k // self.m
j = k % self.m
while i >= len(self.X):
self.X.append(0)
self.n = len(self.X)
self.X[i] ^= 1 << j
def or_kth_bit(self, k, x = 1):
if x:
i = k // self.m
j = k % self.m
while i >= len(self.X):
self.X.append(0)
self.n = len(self.X)
self.X[i] |= 1 << j
def and_kth_bit(self, k, x = 0):
if x == 0:
i = k // self.m
j = k % self.m
while i >= len(self.X):
self.X.append(0)
self.n = len(self.X)
if self.X[i] >> j & 1:
self.X[i] ^= 1 << j
def __bool__(self):
for a in self.X:
if a:
return True
return False
def lsb(self):
for i, x in enumerate(self.X):
if x:
a = (x & -x).bit_length() - 1
return i * self.m + a
return -1
def disp(self):
s = 0
for x in self.X[::-1]:
s <<= self.m
s |= x
print(bin(s)[2:])
bs = BitSet([1,0,1,1,0,1,1])
def gauss(n, A):
def disp():
print("-" * 10)
print("i, j =", i, j)
for a in A:
# print(bin(a % (1 << n))[2:].zfill(n)[::-1], bin(a >> n)[2:].zfill(m)[::-1])
print(bin(a % (1 << n))[2:].zfill(n)[::-1], bin(a >> n)[2:][::-1])
k = len(A)
j = 0
i = 0
while i < k and j < n:
if DEBUG:
disp()
ii = i
while ii < k and A[ii][j] == 0:
ii += 1
if ii >= k:
j += 1
continue
if ii > i:
A[ii], A[i] = A[i], A[ii]
for ii in range(k):
if i == ii: continue
if A[ii][j]:
A[ii] ^= A[i]
i += 1
j += 1
if DEBUG:
disp()
# mmm = (1 << n) - 1
V = []
s = BitSet()
B, C = [], []
for a in A:
b = a.copy()
c = a[n]
b.and_kth_bit(n)
B.append(b)
C.append(c)
j = 0
for a1, a2 in zip(B, C):
if a1:
# aa = a1 & -a1
l = a1.lsb()
if a2:
s.xor_kth_bit(l)
else:
if a2:
return (None, None, None)
while j < n and a1[j] == 0:
u = BitSet()
u.xor_kth_bit(j)
for b in B:
if b[j]:
l = b.lsb()
if l >= 0:
u.xor_kth_bit(l)
V.append(u)
j += 1
j += 1
while j < n:
u = BitSet()
u.xor_kth_bit(j)
for b in B:
if b[j]:
l = b.lsb()
if l >= 0:
u.xor_kth_bit(l)
j += 1
V.append(u)
return (len(V), s, V)
N, Q = map(int, input().split())
NN = N + 5
NN = 2020
X = []
for _ in range(Q):
a, b, c, d, e = map(int, input().split())
a -= 1
c -= 1
X.append((a, b, c, d, e))
if DEBUG:
print("X =", X)
# Zero Check
Z = [[0] * (N + 2) for _ in range(N + 2)]
for a, b, c, d, e in X:
if e:
Z[a+1][c+1] += 1
Z[a+1][d+1] -= 1
Z[b+1][c+1] -= 1
Z[b+1][d+1] += 1
if DEBUG:
print("Z =")
for z in Z:
print(*z)
for i in range(N + 1):
for j in range(N + 2):
Z[i+1][j] += Z[i][j]
for i in range(N + 2):
for j in range(N + 1):
Z[i][j+1] += Z[i][j]
if DEBUG:
print("Z =")
for z in Z:
print(*z)
for i in range(N + 2):
for j in range(N + 2):
Z[i][j] = min(Z[i][j], 1)
if DEBUG:
print("Z =")
for z in Z:
print(*z)
ZZ = [z[1:-1] for z in Z[1:-1]]
if DEBUG:
print("ZZ =")
for z in ZZ:
print(*z)
for i in range(N + 1):
for j in range(N + 2):
Z[i+1][j] += Z[i][j]
for i in range(N + 2):
for j in range(N + 1):
Z[i][j+1] += Z[i][j]
if DEBUG:
print("Z =")
for z in Z:
print(*z)
for a, b, c, d, e in X:
if e == 0:
if Z[b][d] - Z[a][d] - Z[b][c] + Z[a][c] == (b - a) * (d - c):
print("No")
exit()
Y = []
for a, b, c, d, e in X:
if e:
if a == c == 0:
Y.append((b * NN + d, e - 1))
elif a == 0:
Y.append((b * NN + c, b * NN + d, e - 1))
elif c == 0:
Y.append((a * NN + d, b * NN + d, e - 1))
else:
Y.append((a * NN + c, a * NN + d, b * NN + c, b * NN + d, e - 1))
S = set()
for y in Y:
for yy in y:
S.add(yy)
SS = sorted(S)
M = len(SS)
D = {a: i for i, a in enumerate(SS)}
DY = []
for y in Y:
if len(y) == 2:
a, e = y
DY.append((D[a], e))
elif len(y) == 3:
a, b, e = y
DY.append((D[a], D[b], e))
else:
a, b, c, d, e = y
DY.append((D[a], D[b], D[c], D[d], e))
# DY = [(D[a], D[b], D[c], D[d], e) for a, b, c, d, e in Y]
if DEBUG:
print("SS =", SS)
print("D =", D)
print("Y =", Y)
print("DY =", DY)
A = []
J = []
for y in Y:
if len(y) == 2:
a, e = y
bs = BitSet()
bs.xor_kth_bit(D[a])
bs.xor_kth_bit(M, e)
s = (1 << D[a]) | (e << M)
elif len(y) == 3:
a, b, e = y
bs = BitSet()
bs.xor_kth_bit(D[a])
bs.xor_kth_bit(D[b])
bs.xor_kth_bit(M, e)
s = (1 << D[a]) | (1 << D[b]) | (e << M)
else:
a, b, c, d, e = y
bs.xor_kth_bit(D[a])
bs.xor_kth_bit(D[b])
bs.xor_kth_bit(D[c])
bs.xor_kth_bit(D[d])
s = (1 << D[a]) | (1 << D[b]) | (1 << D[c]) | (1 << D[d]) | (e << M)
A.append(s)
J.append(bs)
_, s, _ = gauss(M, J)
if DEBUG:
print("s =", s)
if s is None:
print("No")
exit()
L = []
for k in range(M):
if s[k]:
L.append(SS[k])
L.sort()
if DEBUG:
print("L =", L)
print(" =", [(a // NN, a % NN) for a in L])
L.append(-1)
k = 0
cucu = [0] * (N + 1)
for i in range(N):
cu = 0
for j in range(N):
ij = (i + 1) * NN + (j + 1)
if L[k] == ij:
a = 1
k += 1
else:
a = 0
s = cucu[j] ^ cu ^ a
if ZZ[i][j] and s:
ZZ[i][j] = 2
cu ^= s
cucu[j] ^= cu
print("Yes")
if DEBUG:
print("ZZ =")
for z in ZZ:
print(*z)
DEBUG = 0
class BitSet():
def __init__(self, L = [], X = None):
self.m = 63
if X is None:
self.n = (len(L) - 1) // self.m + 1
self.X = [0] * self.n
for i in range(self.n):
for j in range(self.m):
ij = i * self.m + j
if ij >= len(L):
continue
if L[ij]:
self.X[i] |= 1 << j
else:
self.n = len(X)
self.X = X
def copy(self):
return BitSet(None, self.X)
def __getitem__(self, sl):
if type(sl) == int:
i = sl // self.m
j = sl % self.m
return self.X[i] >> j & 1 if i < len(self.X) else 0
if not sl.start:
if sl.stop is None or sl.stop == self.n:
return 1 // 0
else:
return 1 // 0
else:
if sl.stop is None or sl.stop == self.n:
return 1 // 0
else:
return 1 // 0
def __and__(self, other):
print(self.n, other.n)
n = min(self.n, other.n)
X = [0] * n
for i in range(n):
X[i] = self.X[i] & other.X[i]
return BitSet(None, X)
def __or__(self, other):
n = min(self.n, other.n)
if self.n > other.n:
X = [0] * n + self.X[n:]
else:
X = [0] * n + other.X[n:]
for i in range(n):
X[i] = self.X[i] | other.X[i]
return BitSet(None, X)
def __xor__(self, other):
n = min(self.n, other.n)
if self.n > other.n:
X = [0] * n + self.X[n:]
else:
X = [0] * n + other.X[n:]
for i in range(n):
X[i] = self.X[i] ^ other.X[i]
return BitSet(None, X)
def __irshift__(self, k):
i = k // self.m
j = k % self.m
if j == 0:
self.X = self.X[i:]
else:
X = []
mmm = (1 << j) - 1
for ii in range(i, self.n - 1):
X.append((self.X[ii] >> j) | ((self.X[ii+1] & mmm) << self.m - j))
a = self.X[self.n - 1] >> j
if a:
X.append(a)
self.X = X
self.n = len(self.X)
return self
def __rshift__(self, k):
i = k // self.m
j = k % self.m
if j == 0:
X = self.X[i:]
else:
X = []
mmm = (1 << j) - 1
for ii in range(i, self.n - 1):
X.append((self.X[ii] >> j) | ((self.X[ii+1] & mmm) << self.m - j))
a = self.X[self.n - 1] >> j
if a:
X.append(a)
return BitSet(None, X)
def __ilshift__(self, k):
i = k // self.m
j = k % self.m
if j == 0:
self.X = [0] * i + self.X
else:
X = [0] * (self.n + i + 1)
mmm = (1 << self.m - j) - 1
for ii, x in enumerate(self.X):
x1 = x & mmm
x2 = x >> self.m - j
X[ii+i] |= x1 << j
X[ii+i+1] |= x2
self.X = X
self.n = len(self.X)
return self
def __lshift__(self, k):
i = k // self.m
j = k % self.m
if j == 0:
X = [0] * i + self.X
else:
X = [0] * (self.n + i + 1)
mmm = (1 << self.m - j) - 1
for ii, x in enumerate(self.X):
x1 = x & mmm
x2 = x >> self.m - j
X[ii+i] |= x1 << j
X[ii+i+1] |= x2
return BitSet(None, X)
def xor_kth_bit(self, k, x = 1):
if x:
i = k // self.m
j = k % self.m
while i >= len(self.X):
self.X.append(0)
self.n = len(self.X)
self.X[i] ^= 1 << j
def or_kth_bit(self, k, x = 1):
if x:
i = k // self.m
j = k % self.m
while i >= len(self.X):
self.X.append(0)
self.n = len(self.X)
self.X[i] |= 1 << j
def and_kth_bit(self, k, x = 0):
if x == 0:
i = k // self.m
j = k % self.m
while i >= len(self.X):
self.X.append(0)
self.n = len(self.X)
if self.X[i] >> j & 1:
self.X[i] ^= 1 << j
def __bool__(self):
for a in self.X:
if a:
return True
return False
def lsb(self):
for i, x in enumerate(self.X):
if x:
a = (x & -x).bit_length() - 1
return i * self.m + a
return -1
def disp(self):
s = 0
for x in self.X[::-1]:
s <<= self.m
s |= x
print(bin(s)[2:])
bs = BitSet([1,0,1,1,0,1,1])
def gauss(n, A):
def disp():
print("-" * 10)
print("i, j =", i, j)
for a in A:
# print(bin(a % (1 << n))[2:].zfill(n)[::-1], bin(a >> n)[2:].zfill(m)[::-1])
print(bin(a % (1 << n))[2:].zfill(n)[::-1], bin(a >> n)[2:][::-1])
k = len(A)
j = 0
i = 0
while i < k and j < n:
if DEBUG:
disp()
ii = i
while ii < k and A[ii][j] == 0:
ii += 1
if ii >= k:
j += 1
continue
if ii > i:
A[ii], A[i] = A[i], A[ii]
for ii in range(k):
if i == ii: continue
if A[ii][j]:
A[ii] ^= A[i]
i += 1
j += 1
if DEBUG:
disp()
# mmm = (1 << n) - 1
V = []
s = BitSet()
B, C = [], []
for a in A:
b = a.copy()
c = a[n]
b.and_kth_bit(n)
B.append(b)
C.append(c)
j = 0
for a1, a2 in zip(B, C):
if a1:
# aa = a1 & -a1
l = a1.lsb()
if a2:
s.xor_kth_bit(l)
else:
if a2:
return (None, None, None)
while j < n and a1[j] == 0:
u = BitSet()
u.xor_kth_bit(j)
for b in B:
if b[j]:
l = b.lsb()
if l >= 0:
u.xor_kth_bit(l)
V.append(u)
j += 1
j += 1
while j < n:
u = BitSet()
u.xor_kth_bit(j)
for b in B:
if b[j]:
l = b.lsb()
if l >= 0:
u.xor_kth_bit(l)
j += 1
V.append(u)
return (len(V), s, V)
N, Q = map(int, input().split())
NN = N + 5
NN = 2020
X = []
for _ in range(Q):
a, b, c, d, e = map(int, input().split())
a -= 1
c -= 1
X.append((a, b, c, d, e))
if DEBUG:
print("X =", X)
# Zero Check
Z = [[0] * (N + 2) for _ in range(N + 2)]
for a, b, c, d, e in X:
if e:
Z[a+1][c+1] += 1
Z[a+1][d+1] -= 1
Z[b+1][c+1] -= 1
Z[b+1][d+1] += 1
if DEBUG:
print("Z =")
for z in Z:
print(*z)
for i in range(N + 1):
for j in range(N + 2):
Z[i+1][j] += Z[i][j]
for i in range(N + 2):
for j in range(N + 1):
Z[i][j+1] += Z[i][j]
if DEBUG:
print("Z =")
for z in Z:
print(*z)
for i in range(N + 2):
for j in range(N + 2):
Z[i][j] = min(Z[i][j], 1)
if DEBUG:
print("Z =")
for z in Z:
print(*z)
ZZ = [z[1:-1] for z in Z[1:-1]]
if DEBUG:
print("ZZ =")
for z in ZZ:
print(*z)
for i in range(N + 1):
for j in range(N + 2):
Z[i+1][j] += Z[i][j]
for i in range(N + 2):
for j in range(N + 1):
Z[i][j+1] += Z[i][j]
if DEBUG:
print("Z =")
for z in Z:
print(*z)
for a, b, c, d, e in X:
if e == 0:
if Z[b][d] - Z[a][d] - Z[b][c] + Z[a][c] == (b - a) * (d - c):
print("No")
exit()
Y = []
for a, b, c, d, e in X:
if e:
if a == c == 0:
Y.append((b * NN + d, e - 1))
elif a == 0:
Y.append((b * NN + c, b * NN + d, e - 1))
elif c == 0:
Y.append((a * NN + d, b * NN + d, e - 1))
else:
Y.append((a * NN + c, a * NN + d, b * NN + c, b * NN + d, e - 1))
S = set()
for y in Y:
for yy in y:
S.add(yy)
SS = sorted(S)
M = len(SS)
D = {a: i for i, a in enumerate(SS)}
DY = []
for y in Y:
if len(y) == 2:
a, e = y
DY.append((D[a], e))
elif len(y) == 3:
a, b, e = y
DY.append((D[a], D[b], e))
else:
a, b, c, d, e = y
DY.append((D[a], D[b], D[c], D[d], e))
# DY = [(D[a], D[b], D[c], D[d], e) for a, b, c, d, e in Y]
if DEBUG:
print("SS =", SS)
print("D =", D)
print("Y =", Y)
print("DY =", DY)
A = []
J = []
for y in Y:
if len(y) == 2:
a, e = y
bs = BitSet()
bs.xor_kth_bit(D[a])
bs.xor_kth_bit(M, e)
s = (1 << D[a]) | (e << M)
elif len(y) == 3:
a, b, e = y
bs = BitSet()
bs.xor_kth_bit(D[a])
bs.xor_kth_bit(D[b])
bs.xor_kth_bit(M, e)
s = (1 << D[a]) | (1 << D[b]) | (e << M)
else:
a, b, c, d, e = y
bs = BitSet()
bs.xor_kth_bit(D[a])
bs.xor_kth_bit(D[b])
bs.xor_kth_bit(D[c])
bs.xor_kth_bit(D[d])
bs.xor_kth_bit(M, e)
s = (1 << D[a]) | (1 << D[b]) | (1 << D[c]) | (1 << D[d]) | (e << M)
A.append(s)
J.append(bs)
_, s, _ = gauss(M, J)
if DEBUG:
print("s =", s)
if s is None:
print("No")
exit()
L = []
for k in range(M):
if s[k]:
L.append(SS[k])
L.sort()
if DEBUG:
print("L =", L)
print(" =", [(a // NN, a % NN) for a in L])
L.append(-1)
k = 0
cucu = [0] * (N + 1)
for i in range(N):
cu = 0
for j in range(N):
ij = (i + 1) * NN + (j + 1)
if L[k] == ij:
a = 1
k += 1
else:
a = 0
s = cucu[j] ^ cu ^ a
if ZZ[i][j] and s:
ZZ[i][j] = 2
cu ^= s
cucu[j] ^= cu
print("Yes")
if DEBUG:
print("ZZ =")
for z in ZZ:
print(*z)
|
ConDefects/ConDefects/Code/abc276_h/Python/36292897
|
condefects-python_data_2454
|
DEBUG = 0
class VectorSpace01:
def __init__(self):
self.E = []
def __contains__(self, n):
for e in self.E:
n = min(n, n ^ e)
return 1 if n == 0 else 0
def add(self, n):
for e in self.E:
n = min(n, n ^ e)
if n:
self.E.append(n)
return 0
return 1
def dimension(self):
return len(self.E)
def gauss(n, A):
def disp():
print("-" * 10)
print("i, j =", i, j)
for a in A:
# print(bin(a % (1 << n))[2:].zfill(n)[::-1], bin(a >> n)[2:].zfill(m)[::-1])
print(bin(a % (1 << n))[2:].zfill(n)[::-1], bin(a >> n)[2:][::-1])
k = len(A)
j = 0
i = 0
while i < k and j < n:
if DEBUG:
disp()
ii = i
while ii < k and A[ii] >> j & 1 == 0:
ii += 1
if ii >= k:
j += 1
continue
if ii > i:
A[ii], A[i] = A[i], A[ii]
for ii in range(k):
if i == ii: continue
if A[ii] >> j & 1:
A[ii] ^= A[i]
i += 1
j += 1
if DEBUG:
disp()
mmm = (1 << n) - 1
V = []
s = 0
B, C = [], []
for a in A:
B.append(a & mmm)
C.append(a >> n)
j = 0
for a1, a2 in zip(B, C):
if a1:
aa = a1 & -a1
if a2: s ^= aa
else:
if a2: return (-1, -1, [])
while j < n and a1 & (1 << j) == 0:
u = 1 << j
for b in B:
if b >> j & 1:
u ^= b & -b
V.append(u)
j += 1
j += 1
while j < n:
u = 1 << j
for b in B:
if b >> j & 1:
u ^= b & -b
j += 1
V.append(u)
return (len(V), s, V)
N, Q = map(int, input().split())
NN = N + 5
NN = 1000
X = []
for _ in range(Q):
a, b, c, d, e = map(int, input().split())
a -= 1
c -= 1
X.append((a, b, c, d, e))
if DEBUG:
print("X =", X)
# Zero Check
Z = [[0] * (N + 2) for _ in range(N + 2)]
for a, b, c, d, e in X:
if e:
Z[a+1][c+1] += 1
Z[a+1][d+1] -= 1
Z[b+1][c+1] -= 1
Z[b+1][d+1] += 1
if DEBUG:
print("Z =")
for z in Z:
print(*z)
for i in range(N + 1):
for j in range(N + 2):
Z[i+1][j] += Z[i][j]
for i in range(N + 2):
for j in range(N + 1):
Z[i][j+1] += Z[i][j]
if DEBUG:
print("Z =")
for z in Z:
print(*z)
for i in range(N + 2):
for j in range(N + 2):
Z[i][j] = min(Z[i][j], 1)
if DEBUG:
print("Z =")
for z in Z:
print(*z)
ZZ = [z[1:-1] for z in Z[1:-1]]
if DEBUG:
print("ZZ =")
for z in ZZ:
print(*z)
for i in range(N + 1):
for j in range(N + 2):
Z[i+1][j] += Z[i][j]
for i in range(N + 2):
for j in range(N + 1):
Z[i][j+1] += Z[i][j]
if DEBUG:
print("Z =")
for z in Z:
print(*z)
for a, b, c, d, e in X:
if e == 0:
if Z[b][d] - Z[a][d] - Z[b][c] + Z[a][c] == (b - a) * (d - c):
print("No")
exit()
Y = []
for a, b, c, d, e in X:
if e:
if a == c == 0:
Y.append((b * NN + d, e - 1))
elif a == 0:
Y.append((b * NN + c, b * NN + d, e - 1))
elif c == 0:
Y.append((a * NN + d, b * NN + d, e - 1))
else:
Y.append((a * NN + c, a * NN + d, b * NN + c, b * NN + d, e - 1))
S = set()
for y in Y:
for yy in y:
S.add(yy)
SS = sorted(S)
M = len(SS)
D = {a: i for i, a in enumerate(SS)}
DY = []
for y in Y:
if len(y) == 2:
a, e = y
DY.append((D[a], e))
elif len(y) == 3:
a, b, e = y
DY.append((D[a], D[b], e))
else:
a, b, c, d, e = y
DY.append((D[a], D[b], D[c], D[d], e))
# DY = [(D[a], D[b], D[c], D[d], e) for a, b, c, d, e in Y]
if DEBUG:
print("SS =", SS)
print("D =", D)
print("Y =", Y)
print("DY =", DY)
A = []
for y in Y:
if len(y) == 2:
a, e = y
s = (1 << D[a]) | (e << M)
elif len(y) == 3:
a, b, e = y
s = (1 << D[a]) | (1 << D[b]) | (e << M)
else:
a, b, c, d, e = y
s = (1 << D[a]) | (1 << D[b]) | (1 << D[c]) | (1 << D[d]) | (e << M)
A.append(s)
_, s, _ = gauss(M, A)
if DEBUG:
print("s =", s)
if s < 0:
print("No")
exit()
L = []
for k in range(M):
if s >> k & 1:
L.append(SS[k])
L.sort()
if DEBUG:
print("L =", L)
print(" =", [(a // NN, a % NN) for a in L])
L.append(-1)
k = 0
cucu = [0] * (N + 1)
for i in range(N):
cu = 0
for j in range(N):
ij = (i + 1) * NN + (j + 1)
if L[k] == ij:
a = 1
k += 1
else:
a = 0
s = cucu[j] ^ cu ^ a
if ZZ[i][j] and s:
ZZ[i][j] = 2
cu ^= s
cucu[j] ^= cu
print("Yes")
if DEBUG:
print("ZZ =")
for z in ZZ:
print(*z)
DEBUG = 0
class VectorSpace01:
def __init__(self):
self.E = []
def __contains__(self, n):
for e in self.E:
n = min(n, n ^ e)
return 1 if n == 0 else 0
def add(self, n):
for e in self.E:
n = min(n, n ^ e)
if n:
self.E.append(n)
return 0
return 1
def dimension(self):
return len(self.E)
def gauss(n, A):
def disp():
print("-" * 10)
print("i, j =", i, j)
for a in A:
# print(bin(a % (1 << n))[2:].zfill(n)[::-1], bin(a >> n)[2:].zfill(m)[::-1])
print(bin(a % (1 << n))[2:].zfill(n)[::-1], bin(a >> n)[2:][::-1])
k = len(A)
j = 0
i = 0
while i < k and j < n:
if DEBUG:
disp()
ii = i
while ii < k and A[ii] >> j & 1 == 0:
ii += 1
if ii >= k:
j += 1
continue
if ii > i:
A[ii], A[i] = A[i], A[ii]
for ii in range(k):
if i == ii: continue
if A[ii] >> j & 1:
A[ii] ^= A[i]
i += 1
j += 1
if DEBUG:
disp()
mmm = (1 << n) - 1
V = []
s = 0
B, C = [], []
for a in A:
B.append(a & mmm)
C.append(a >> n)
j = 0
for a1, a2 in zip(B, C):
if a1:
aa = a1 & -a1
if a2: s ^= aa
else:
if a2: return (-1, -1, [])
while j < n and a1 & (1 << j) == 0:
u = 1 << j
for b in B:
if b >> j & 1:
u ^= b & -b
V.append(u)
j += 1
j += 1
while j < n:
u = 1 << j
for b in B:
if b >> j & 1:
u ^= b & -b
j += 1
V.append(u)
return (len(V), s, V)
N, Q = map(int, input().split())
NN = N + 5
NN = 2020
X = []
for _ in range(Q):
a, b, c, d, e = map(int, input().split())
a -= 1
c -= 1
X.append((a, b, c, d, e))
if DEBUG:
print("X =", X)
# Zero Check
Z = [[0] * (N + 2) for _ in range(N + 2)]
for a, b, c, d, e in X:
if e:
Z[a+1][c+1] += 1
Z[a+1][d+1] -= 1
Z[b+1][c+1] -= 1
Z[b+1][d+1] += 1
if DEBUG:
print("Z =")
for z in Z:
print(*z)
for i in range(N + 1):
for j in range(N + 2):
Z[i+1][j] += Z[i][j]
for i in range(N + 2):
for j in range(N + 1):
Z[i][j+1] += Z[i][j]
if DEBUG:
print("Z =")
for z in Z:
print(*z)
for i in range(N + 2):
for j in range(N + 2):
Z[i][j] = min(Z[i][j], 1)
if DEBUG:
print("Z =")
for z in Z:
print(*z)
ZZ = [z[1:-1] for z in Z[1:-1]]
if DEBUG:
print("ZZ =")
for z in ZZ:
print(*z)
for i in range(N + 1):
for j in range(N + 2):
Z[i+1][j] += Z[i][j]
for i in range(N + 2):
for j in range(N + 1):
Z[i][j+1] += Z[i][j]
if DEBUG:
print("Z =")
for z in Z:
print(*z)
for a, b, c, d, e in X:
if e == 0:
if Z[b][d] - Z[a][d] - Z[b][c] + Z[a][c] == (b - a) * (d - c):
print("No")
exit()
Y = []
for a, b, c, d, e in X:
if e:
if a == c == 0:
Y.append((b * NN + d, e - 1))
elif a == 0:
Y.append((b * NN + c, b * NN + d, e - 1))
elif c == 0:
Y.append((a * NN + d, b * NN + d, e - 1))
else:
Y.append((a * NN + c, a * NN + d, b * NN + c, b * NN + d, e - 1))
S = set()
for y in Y:
for yy in y:
S.add(yy)
SS = sorted(S)
M = len(SS)
D = {a: i for i, a in enumerate(SS)}
DY = []
for y in Y:
if len(y) == 2:
a, e = y
DY.append((D[a], e))
elif len(y) == 3:
a, b, e = y
DY.append((D[a], D[b], e))
else:
a, b, c, d, e = y
DY.append((D[a], D[b], D[c], D[d], e))
# DY = [(D[a], D[b], D[c], D[d], e) for a, b, c, d, e in Y]
if DEBUG:
print("SS =", SS)
print("D =", D)
print("Y =", Y)
print("DY =", DY)
A = []
for y in Y:
if len(y) == 2:
a, e = y
s = (1 << D[a]) | (e << M)
elif len(y) == 3:
a, b, e = y
s = (1 << D[a]) | (1 << D[b]) | (e << M)
else:
a, b, c, d, e = y
s = (1 << D[a]) | (1 << D[b]) | (1 << D[c]) | (1 << D[d]) | (e << M)
A.append(s)
_, s, _ = gauss(M, A)
if DEBUG:
print("s =", s)
if s < 0:
print("No")
exit()
L = []
for k in range(M):
if s >> k & 1:
L.append(SS[k])
L.sort()
if DEBUG:
print("L =", L)
print(" =", [(a // NN, a % NN) for a in L])
L.append(-1)
k = 0
cucu = [0] * (N + 1)
for i in range(N):
cu = 0
for j in range(N):
ij = (i + 1) * NN + (j + 1)
if L[k] == ij:
a = 1
k += 1
else:
a = 0
s = cucu[j] ^ cu ^ a
if ZZ[i][j] and s:
ZZ[i][j] = 2
cu ^= s
cucu[j] ^= cu
print("Yes")
if DEBUG:
print("ZZ =")
for z in ZZ:
print(*z)
|
ConDefects/ConDefects/Code/abc276_h/Python/36291832
|
condefects-python_data_2455
|
num = list(map(int ,input().split(" ")))
N = num[0]
M = num[1]
S = input()
T = input()
if T == S:
print(0)
elif T[:N] == S:
print(1)
elif T[-N:] == S:
print(2)
else:
print(3)
num = list(map(int ,input().split(" ")))
N = num[0]
M = num[1]
S = input()
T = input()
if T[:N] == S and T[-N:] == S:
print(0)
elif T[:N] == S:
print(1)
elif T[-N:] == S:
print(2)
else:
print(3)
|
ConDefects/ConDefects/Code/abc322_b/Python/46194153
|
condefects-python_data_2456
|
n,m=map(int,input().split())
s=input()
t=input()
k=3
if t[0:n]==s:
k-=2
elif t[-n::]==s:
k-=1
print(k)
n,m=map(int,input().split())
s=input()
t=input()
k=3
if t[0:n]==s:
k-=2
if t[-n::]==s:
k-=1
print(k)
|
ConDefects/ConDefects/Code/abc322_b/Python/46209097
|
condefects-python_data_2457
|
N,M=input().split()
S=tuple(input())
T=tuple(input())
if S==T[:int(N)]:
if S==T[int(M)-int(N)+1:]:
print(0)
else:
print(1)
else:
if S==T[int(M)-int(N):]:
print(2)
else:
print(3)
N,M=input().split()
S=tuple(input())
T=tuple(input())
if S==T[:int(N)]:
if S==T[int(M)-int(N):]:
print(0)
else:
print(1)
else:
if S==T[int(M)-int(N):]:
print(2)
else:
print(3)
|
ConDefects/ConDefects/Code/abc322_b/Python/46203237
|
condefects-python_data_2458
|
N,M = map(int,input().split())
S = input()
T = input()
if(S==T):
print(0)
else:
atama = T.find(S) == 0
sippo = T.find(S) == len(T) - len(S)
if(atama and sippo):
print(0)
elif(atama):
print(1)
elif(sippo):
print(2)
else:
print(3)
N,M = map(int,input().split())
S = input()
T = input()
if(S==T):
print(0)
else:
atama = T.find(S) == 0
sippo = T.rfind(S) == len(T) - len(S)
if(atama and sippo):
print(0)
elif(atama):
print(1)
elif(sippo):
print(2)
else:
print(3)
|
ConDefects/ConDefects/Code/abc322_b/Python/46203055
|
condefects-python_data_2459
|
n,m=map(int,input().split())
s=input()
t=input()
if t == s:
print(0)
elif t.find(s)==0:
print(1)
elif t.rfind(s)==m-n:
print(2)
else:
print(3)
n,m=map(int,input().split())
s=input()
t=input()
if (t.find(s)==0)and(t.rfind(s)==m-n):
print(0)
elif t.find(s)==0:
print(1)
elif t.rfind(s)==m-n:
print(2)
else:
print(3)
|
ConDefects/ConDefects/Code/abc322_b/Python/54956037
|
condefects-python_data_2460
|
length1, length2 = map(int,input().split())
word1 = str(input())
word2 = str(input())
if word2[length1:length2] == word1:
a = True
else:
a = False
if word2[0:length1] == word1:
b = True
else:
b = False
if a == True and b == True:
print(0)
elif a == False and b == True:
print(1)
elif a == True and b == False:
print(2)
elif a == False and b == False:
print(3)
length1, length2 = map(int,input().split())
word1 = str(input())
word2 = str(input())
if word2[(length2-length1):length2] == word1:
a = True
else:
a = False
if word2[0:length1] == word1:
b = True
else:
b = False
if a == True and b == True:
print(0)
elif a == False and b == True:
print(1)
elif a == True and b == False:
print(2)
elif a == False and b == False:
print(3)
|
ConDefects/ConDefects/Code/abc322_b/Python/55147333
|
condefects-python_data_2461
|
N,M = map(int,input().split())
S = input()
T = input()
is_head = True
is_tail = True
for i in range(N):
if S[i] != T[i]:
is_head = False
break
for i in range(N):
if S[-i] != T[-i]:
is_tail = False
break
if is_head and is_tail:
print(0)
elif is_head and is_tail == False:
print(1)
elif is_head == False and is_tail:
print(2)
elif is_head == False and is_tail == False:
print(3)
N,M = map(int,input().split())
S = input()
T = input()
is_head = True
is_tail = True
for i in range(N):
if S[i] != T[i]:
is_head = False
break
for i in range(N):
if S[-1-i] != T[-1-i]:
is_tail = False
break
if is_head and is_tail:
print(0)
elif is_head and is_tail == False:
print(1)
elif is_head == False and is_tail:
print(2)
elif is_head == False and is_tail == False:
print(3)
|
ConDefects/ConDefects/Code/abc322_b/Python/46196763
|
condefects-python_data_2462
|
n,m = map(int,input().split())
s = input()
t = input()
if s == t:
print(0)
elif s == t[:n]:
print(1)
elif s == t[-n:]:
print(2)
else:
print(3)
n,m = map(int,input().split())
s = input()
t = input()
if s == t[:n] and s == t[-n:]:
print(0)
elif s == t[:n]:
print(1)
elif s == t[-n:]:
print(2)
else:
print(3)
|
ConDefects/ConDefects/Code/abc322_b/Python/54506289
|
condefects-python_data_2463
|
#!/usr/bin/env python3
n, m = map(int, input().split())
s = input()
t = input()
if s == t:
print(0)
elif s == t[:n]:
print(1)
elif s == t[-n:]:
print(2)
else:
print(3)
#!/usr/bin/env python3
n, m = map(int, input().split())
s = input()
t = input()
if s == t[:n] and s == t[-n:]:
print(0)
elif s == t[:n]:
print(1)
elif s == t[-n:]:
print(2)
else:
print(3)
|
ConDefects/ConDefects/Code/abc322_b/Python/55147125
|
condefects-python_data_2464
|
T = int(input())
for i in range(T):
N = int(input())
if N < 7:
print(-1)
continue
tem = str(bin(N))[2:]
res = [0 for i in range(len(tem))]
count = 0
flag = True
for i in reversed(range(len(tem))):
if tem[i] == "1":
count += 1
if count >= 3:
count2 = 0
for i in range(len(tem)):
if count2 >= 3:
break
if tem[i] == "1":
res[i] = 1
count2 += 1
else:
for i in reversed(range(len(tem))):
if tem[i] == "1":
res[i] = 1
count2 = 0
for ind, i in enumerate(reversed(tem)):
if i == "1":
count2 += 1
if ind >= (3-count) + count2:
res[len(res)-ind-1] = 0
for j in range((3-count) + count2):
res[len(res)-ind+j] = 1
break
res_num = 0
for i in range(len(res)):
if res[i] == 0:
continue
res_num += 1 << (len(res)-i-1)
print(res_num)
T = int(input())
for i in range(T):
N = int(input())
if N < 7:
print(-1)
continue
tem = str(bin(N))[2:]
res = [0 for i in range(len(tem))]
count = 0
flag = True
for i in reversed(range(len(tem))):
if tem[i] == "1":
count += 1
if count >= 3:
count2 = 0
for i in range(len(tem)):
if count2 >= 3:
break
if tem[i] == "1":
res[i] = 1
count2 += 1
else:
for i in reversed(range(len(tem))):
if tem[i] == "1":
res[i] = 1
count2 = 0
for ind, i in enumerate(reversed(tem)):
if i == "1":
count2 += 1
if ind >= (3-count) + count2:
res[len(res)-ind-1] = 0
for j in range((3-count) + count2):
res[len(res)-ind+j] = 1
break
else:
res[len(res)-ind-1] = 0
res_num = 0
for i in range(len(res)):
if res[i] == 0:
continue
res_num += 1 << (len(res)-i-1)
print(res_num)
|
ConDefects/ConDefects/Code/arc161_b/Python/45955580
|
condefects-python_data_2465
|
t=int(input())
bits=[1<<i for i in range(60)]
def r(x):
if x<7:
return -1
cnt=0
bs = []
for i in range(60)[::-1]:
if t&bits[i]:
if cnt==2:
return bits[bs[0]]+bits[bs[1]]+bits[i]
bs.append(i)
cnt+=1
if cnt==1:
return bits[bs[0]-1]+bits[bs[0]-2]+bits[bs[0]-3]
else:
if bs[1]<2:
return bits[bs[0]-1]+bits[bs[0]-2]+bits[bs[0]-3]
return bits[bs[0]]+bits[bs[1]-1]+bits[bs[1]-2]
print(*[r(int(input())) for i in range(t)],sep="\n")
t=int(input())
bits=[1<<i for i in range(60)]
def r(x):
if x<7:
return -1
cnt=0
bs = []
for i in range(60)[::-1]:
if x&bits[i]:
if cnt==2:
return bits[bs[0]]+bits[bs[1]]+bits[i]
bs.append(i)
cnt+=1
if cnt==1:
return bits[bs[0]-1]+bits[bs[0]-2]+bits[bs[0]-3]
else:
if bs[1]<2:
return bits[bs[0]-1]+bits[bs[0]-2]+bits[bs[0]-3]
return bits[bs[0]]+bits[bs[1]-1]+bits[bs[1]-2]
print(*[r(int(input())) for i in range(t)],sep="\n")
|
ConDefects/ConDefects/Code/arc161_b/Python/43559540
|
condefects-python_data_2466
|
T = int(input())
for _ in range(T):
N = int(input())
if N < 7:
print(-1)
continue
cnt = bin(N).count('1')
if cnt == 1:
print((N>>1) + (N>>2) + (N>>3))
elif cnt == 2:
if N & 1 or N & 2:
print((N>>1) + (N>>2) + (N>>3))
else:
s = 0
while N & (1<<s) == 0:
s += 1
print(N - (1<<s) + (1<<(s-1)) + (1<<(s-2)))
else:
tmp = 0
for i in range(60):
if cnt - tmp == 3:
break
if N & (1<<i):
N ^= 1<<i
tmp += 1
print(N)
T = int(input())
for _ in range(T):
N = int(input())
if N < 7:
print(-1)
continue
cnt = bin(N).count('1')
if cnt == 1:
print((N>>1) + (N>>2) + (N>>3))
elif cnt == 2:
if N & 1 or N & 2:
print((N>>1) + (N>>2) + (N>>3) - (N&2)//2)
else:
s = 0
while N & (1<<s) == 0:
s += 1
print(N - (1<<s) + (1<<(s-1)) + (1<<(s-2)))
else:
tmp = 0
for i in range(60):
if cnt - tmp == 3:
break
if N & (1<<i):
N ^= 1<<i
tmp += 1
print(N)
|
ConDefects/ConDefects/Code/arc161_b/Python/45311674
|
condefects-python_data_2467
|
a=1
flg=[]
while a < 10**18:
flg.append(a)
a*=2
s=set()
l=len(flg)
for i in range(l):
for j in range(l):
for k in range(l):
if i != j and i != k and j != k:
if flg[i]+flg[j]+flg[k] <= 10**18:
s.add(flg[i]+flg[j]+flg[k])
l=list(s)
l.sort()
le=len(l)
import sys
# sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd
def sol(n):
idx=bisect_right(l,n)
if idx-1<=0:
return -1
else:
return l[idx-1]
T = int(input())
for i in range(T):
n = int(input())
print(sol(n))
a=1
flg=[]
while a < 10**18:
flg.append(a)
a*=2
s=set()
l=len(flg)
for i in range(l):
for j in range(l):
for k in range(l):
if i != j and i != k and j != k:
if flg[i]+flg[j]+flg[k] <= 10**18:
s.add(flg[i]+flg[j]+flg[k])
l=list(s)
l.sort()
le=len(l)
import sys
# sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd
def sol(n):
idx=bisect_right(l,n)
if idx-1<0:
return -1
else:
return l[idx-1]
T = int(input())
for i in range(T):
n = int(input())
print(sol(n))
|
ConDefects/ConDefects/Code/arc161_b/Python/43572863
|
condefects-python_data_2468
|
N = int(input())
XY = [[int(i) for i in input().split()] for _ in range(N)]
INF = 10**13
maC = 30
dp = [INF]*((N)*(maC+1))
def pos2ind(n,c):
return n*(maC+1) + c
dp[0] = 0
for i in range(1, N):
x,y = XY[i]
for j in range(maC+1):
if j>i-1:
break
for k in range(1, j+2):
# print(f'{i,j,k = }')
# print(f'{i-k = }')
xx, yy = XY[i-k]
dist2 = (x-xx)**2 + (y-yy)**2
dist = dist2**.5
# print(f'{dist2 = }')
# print(f'{dp[pos2ind(i,j)] = }')
# print(f'{dp[pos2ind(i-k,j-(k-1))]+dist2 = }')
dp[pos2ind(i,j)] = min(dp[pos2ind(i,j)], dp[pos2ind(i-k,j-(k-1))]+dist)
ans = INF
for j in range(maC+1):
# print(f'{j, dp[pos2ind(N-1,j)] = }')
ans = min(ans, dp[pos2ind(N-1,j)] + 2**(j-1))
print(ans)
N = int(input())
XY = [[int(i) for i in input().split()] for _ in range(N)]
INF = 10**13
maC = 30
dp = [INF]*((N)*(maC+1))
def pos2ind(n,c):
return n*(maC+1) + c
dp[0] = 0
for i in range(1, N):
x,y = XY[i]
for j in range(maC+1):
if j>i-1:
break
for k in range(1, j+2):
# print(f'{i,j,k = }')
# print(f'{i-k = }')
xx, yy = XY[i-k]
dist2 = (x-xx)**2 + (y-yy)**2
dist = dist2**.5
# print(f'{dist2 = }')
# print(f'{dp[pos2ind(i,j)] = }')
# print(f'{dp[pos2ind(i-k,j-(k-1))]+dist2 = }')
dp[pos2ind(i,j)] = min(dp[pos2ind(i,j)], dp[pos2ind(i-k,j-(k-1))]+dist)
ans = INF
for j in range(maC+1):
# print(f'{j, dp[pos2ind(N-1,j)] = }')
ans = min(ans, dp[pos2ind(N-1,j)] + (2**(j-1) if j>=1 else 0))
print(ans)
|
ConDefects/ConDefects/Code/abc315_f/Python/46136201
|
condefects-python_data_2469
|
import math
N = int(input())
XY = [[int(i) for i in input().split()] for _ in range(N)]
inf = 1e10
M = min(20, N)
dp = [[inf] * (M + 1) for _ in range(N + 1)]
dp[0][0] = 0.0
for i in range(N - 1):
for c in range(M):
if dp[i][c] == inf:
continue
for c2 in range(c, M):
np = i + (c2 - c) + 1
if np >= N:
break
di = math.dist(XY[np], XY[i])
dp[np][c2] = min(dp[np][c2], dp[i][c] + di)
ans = dp[N - 1][c]
for c in range(1, M):
ans = min(ans, dp[N - 1][c] + 2**(c - 1))
print(ans)
import math
N = int(input())
XY = [[int(i) for i in input().split()] for _ in range(N)]
inf = 1e10
M = min(20, N)
dp = [[inf] * (M + 1) for _ in range(N + 1)]
dp[0][0] = 0.0
for i in range(N - 1):
for c in range(M):
if dp[i][c] == inf:
continue
for c2 in range(c, M):
np = i + (c2 - c) + 1
if np >= N:
break
di = math.dist(XY[np], XY[i])
dp[np][c2] = min(dp[np][c2], dp[i][c] + di)
ans = dp[N - 1][0]
for c in range(1, M):
ans = min(ans, dp[N - 1][c] + 2**(c - 1))
print(ans)
|
ConDefects/ConDefects/Code/abc315_f/Python/46043300
|
condefects-python_data_2470
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = K*(K+1)//2
for a in set(A):
if a < K:
ans -= a
print(ans)
N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = K*(K+1)//2
for a in set(A):
if a <= K:
ans -= a
print(ans)
|
ConDefects/ConDefects/Code/abc346_c/Python/55155506
|
condefects-python_data_2471
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
sa = set(A)
dis = 0
for a in sa:
if a < K:
dis += a
print((K + 1) * K // 2 - dis)
N, K = map(int, input().split())
A = list(map(int, input().split()))
sa = set(A)
dis = 0
for a in sa:
if a <= K:
dis += a
print((K + 1) * K // 2 - dis)
|
ConDefects/ConDefects/Code/abc346_c/Python/55135268
|
condefects-python_data_2472
|
N, K = map(int, input().split())
A = set(map(int, input().split()))
sum = int((K * (K + 1)) / 2)
for a in A:
if 1 <= a <= K:
sum -= a
print(sum)
N, K = map(int, input().split())
A = set(map(int, input().split()))
sum = K * (K + 1) // 2
for a in A:
if 1 <= a <= K:
sum -= a
print(sum)
|
ConDefects/ConDefects/Code/abc346_c/Python/54986100
|
condefects-python_data_2473
|
from bisect import bisect_right
import sys
input = sys.stdin.readline
def comb_preprocess(n, mod):
fact = [1] * (n+1)
fact_inv = [1] * (n+1)
for i in range(1, n+1):
fact[i] = i * fact[i-1] % mod
fact_inv[n] = pow(fact[n], mod-2, mod)
for i in range(1, n+1)[::-1]:
fact_inv[i-1] = i * fact_inv[i] % mod
def comb(n, k):
if k < 0 or n < k:
return 0
return fact[n] * fact_inv[k] * fact_inv[n-k] % mod
return fact, fact_inv, comb
mod = 998244353
N, M, K, X = map(int, input().split())
X -= 1
A = list(map(int, input().split()))
A.sort()
fact, fact_inv, comb = comb_preprocess(K, mod)
ans = 0
for Y in range(1, M+1):
x = bisect_right(A, Y)
if x <= X:
p = pow(M-Y, K, mod)
q = Y * pow(M-Y, mod-2, mod) % mod
for k in range(K+1):
ans = (ans + min(x+k, X)*p*comb(K, k)) % mod
p = p * q % mod
else:
p = pow(Y, K, mod)
q = (M-Y) * pow(Y, mod-2, mod) % mod
for k in range(K+1):
ans = (ans + max(x-k, X)*p*comb(K, k)) % mod
p = p * q % mod
ans = (pow(M, K, mod) * (M + 1) * N - ans) % mod
print(ans)
from bisect import bisect_right
import sys
input = sys.stdin.readline
def comb_preprocess(n, mod):
fact = [1] * (n+1)
fact_inv = [1] * (n+1)
for i in range(1, n+1):
fact[i] = i * fact[i-1] % mod
fact_inv[n] = pow(fact[n], mod-2, mod)
for i in range(1, n+1)[::-1]:
fact_inv[i-1] = i * fact_inv[i] % mod
def comb(n, k):
if k < 0 or n < k:
return 0
return fact[n] * fact_inv[k] * fact_inv[n-k] % mod
return fact, fact_inv, comb
mod = 998244353
N, M, K, X = map(int, input().split())
X -= 1
A = list(map(int, input().split()))
A.sort()
fact, fact_inv, comb = comb_preprocess(K, mod)
ans = 0
for Y in range(1, M+1):
x = bisect_right(A, Y)
if x < X:
p = pow(M-Y, K, mod)
q = Y * pow(M-Y, mod-2, mod) % mod
for k in range(K+1):
ans = (ans + min(x+k, X)*p*comb(K, k)) % mod
p = p * q % mod
else:
p = pow(Y, K, mod)
q = (M-Y) * pow(Y, mod-2, mod) % mod
for k in range(K+1):
ans = (ans + max(x-k, X)*p*comb(K, k)) % mod
p = p * q % mod
ans = (pow(M, K, mod) * (M + 1) * N - ans) % mod
print(ans)
|
ConDefects/ConDefects/Code/arc139_d/Python/31251082
|
condefects-python_data_2474
|
x1,y1,x2,y2 = map(int,input().split())
if (abs(x1-x2)==1 or abs(x1-x2)==3) and (abs(y1-y2)==1 or abs(y1-y2)==3) :
print("Yes")
else:
print("No")
x1,y1,x2,y2 = map(int,input().split())
if ((abs(x1-x2)==1 or abs(x1-x2)==3) and (abs(y1-y2)==1 or abs(y1-y2)==3)) or ((abs(x1-x2)==2 and abs(y1-y2)==4) or (abs(x1-x2)==4 and abs(y1-y2)==2)) or ((abs(x1-x2)==0 and (abs(y1-y2)==2 or abs(y1-y2)==4)) or ((abs(x1-x2)==2 or abs(x1-x2)==4) and abs(y1-y2)==0)):
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc239_c/Python/45467238
|
condefects-python_data_2475
|
import sys
sys.setrecursionlimit(10**9)
def main():
x1, y1, x2, y2 = map(int, input().split())
if abs(x1 - x2) <= 4 and abs(y1 - y2) <= 4:
if abs(x1 - x2) == 1 and abs(y1 - y2) in [1, 3]:
print("Yes")
elif abs(x1 - x2) == 0 and abs(y1 - y2) in [2, 4]:
print("Yes")
elif abs(x1 - x2) == 2 and abs(y1 - y2) in [0, 4]:
print("Yes")
elif abs(x1 - x2) == 3 and abs(y1 - y2) in [1, 3]:
print("Yes")
elif abs(x1 - x2) == 4 and abs(y1 - y2) == 0:
print("Yes")
else:
print("No")
else:
print("No")
if __name__ == "__main__":
main()
import sys
sys.setrecursionlimit(10**9)
def main():
x1, y1, x2, y2 = map(int, input().split())
if abs(x1 - x2) <= 4 and abs(y1 - y2) <= 4:
if abs(x1 - x2) == 1 and abs(y1 - y2) in [1, 3]:
print("Yes")
elif abs(x1 - x2) == 0 and abs(y1 - y2) in [2, 4]:
print("Yes")
elif abs(x1 - x2) == 2 and abs(y1 - y2) in [0, 4]:
print("Yes")
elif abs(x1 - x2) == 3 and abs(y1 - y2) in [1, 3]:
print("Yes")
elif abs(x1 - x2) == 4 and abs(y1 - y2) in [0, 2]:
print("Yes")
else:
print("No")
else:
print("No")
if __name__ == "__main__":
main()
|
ConDefects/ConDefects/Code/abc239_c/Python/44818357
|
condefects-python_data_2476
|
p, q, r, s = [int(x) for x in input().split()]
d = (p - r) ** 2 + (q - s) ** 2
if d in (2, 4, 10, 16, 20):
print("Yes")
else:
print("No")
p, q, r, s = [int(x) for x in input().split()]
d = (p - r) ** 2 + (q - s) ** 2
if d in (2, 4, 10, 16, 18, 20):
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc239_c/Python/46171405
|
condefects-python_data_2477
|
x1,y1,x2,y2 = map(int,input().split())
def culc(a,b,c,d):
return (a-c)**2+(b-d)**2
for i in range(x1-2,y1+3):
for j in range(y1-2,y1+3):
if culc(i,j,x2,y2)==5 and culc(i,j,x1,y1)==5 :
print("Yes")
exit()
print("No")
x1,y1,x2,y2 = map(int,input().split())
def culc(a,b,c,d):
return (a-c)**2+(b-d)**2
for i in range(x1-2,x1+3):
for j in range(y1-2,y1+3):
if culc(i,j,x2,y2)==5 and culc(i,j,x1,y1)==5 :
print("Yes")
exit()
print("No")
|
ConDefects/ConDefects/Code/abc239_c/Python/45558170
|
condefects-python_data_2478
|
N = int(input())
W,X = [],[]
for i in range(N) :
w,x = map(int,input().split())
W.append(w)
X.append(x)
max_count = 0
for j in range(24):
count = 0
for i in range(N):
now_time = (X[i]+j)%24
if ((now_time >= 9)and(now_time <= 18)):
count += W[i]
max_count = max(max_count,count)
print(max_count)
N = int(input())
W,X = [],[]
for i in range(N) :
w,x = map(int,input().split())
W.append(w)
X.append(x)
max_count = 0
for j in range(24):
count = 0
for i in range(N):
now_time = (X[i]+j)%24
if ((now_time >= 9)and(now_time < 18)):
count += W[i]
max_count = max(max_count,count)
print(max_count)
|
ConDefects/ConDefects/Code/abc325_b/Python/54778964
|
condefects-python_data_2479
|
#0509
N = int(input())
C = [0] * 24
for i in range(N):
W, X = map(int, input().split())
C[X] = W
B = 0
for j in range(24):
A = 0
for k in range(9):
A += C[(k + j) % 24]
B = max(A, B)
print(B)
#0509
N = int(input())
C = [0] * 24
for i in range(N):
W, X = map(int, input().split())
C[X] += W
B = 0
for j in range(24):
A = 0
for k in range(9):
A += C[(k + j) % 24]
B = max(A, B)
print(B)
|
ConDefects/ConDefects/Code/abc325_b/Python/54237927
|
condefects-python_data_2480
|
N = int(input())
A = [0 for _ in range(24)]
for _ in range(N) :
w, x = map(int, input().split())
A[x] += w
A += A
res = 0
for i in range(0, 24) :
res = max(res, max(A[9 + i : 19 + i]))
print(res)
N = int(input())
A = [0 for _ in range(24)]
for _ in range(N) :
w, x = map(int, input().split())
A[x] += w
A += A
res = 0
for i in range(0, 24) :
res = max(res, sum(A[9 + i : 18 + i]))
print(res)
|
ConDefects/ConDefects/Code/abc325_b/Python/54888009
|
condefects-python_data_2481
|
N = int(input())
W = [0] * N
X = [0] * N
for i in range(N):
w, x = (int(x) for x in input().split())
W[i] = w
X[i] = x
ans = 0
for i in range(24):
c = 0
for j in range(N):
t = (X[j] + i) % 24
if 9 < t < 18:
c += W[j]
ans = max(ans, c)
print(ans)
N = int(input())
W = [0] * N
X = [0] * N
for i in range(N):
w, x = (int(x) for x in input().split())
W[i] = w
X[i] = x
ans = 0
for i in range(24):
c = 0
for j in range(N):
t = (X[j] + i) % 24
if 9 <= t < 18:
c += W[j]
ans = max(ans, c)
print(ans)
|
ConDefects/ConDefects/Code/abc325_b/Python/54669093
|
condefects-python_data_2482
|
MOD = 998244353
class ml(list):
def __setitem__(self, key, value):
super().__setitem__(key, value%MOD)
n = int(input())
a = list(map(int, input().split()))
dp = [ml([0] * (1<<10)) for _ in range(n+1)]
dp[0][0] = 1
for i in range(n):
inv = pow(a[i], -1, MOD)
for bit in range(1<<10):
if dp[i][bit] == 0: continue
for plus in range(1, min(11, a[i]+1)):
nex = ((bit * (2 ** plus) + 2 ** (plus - 1)) % (1 << 10))
dp[i+1][bit|nex] += dp[i][bit] * inv
ans = 0
for bit in range(1<<10):
if bit & (1<<9): ans = (ans + dp[n][bit]) % MOD
print(ans)
MOD = 998244353
class ml(list):
def __setitem__(self, key, value):
super().__setitem__(key, value%MOD)
n = int(input())
a = list(map(int, input().split()))
dp = [ml([0] * (1<<10)) for _ in range(n+1)]
dp[0][0] = 1
for i in range(n):
inv = pow(a[i], -1, MOD)
for bit in range(1<<10):
dp[i+1][bit] += dp[i][bit] * max(0, a[i] - 10) * inv
for plus in range(1, min(11, a[i]+1)):
nex = ((bit * (2 ** plus) + 2 ** (plus - 1)) % (1 << 10))
dp[i+1][bit|nex] += dp[i][bit] * inv
ans = 0
for bit in range(1<<10):
if bit & (1<<9): ans = (ans + dp[n][bit]) % MOD
print(ans)
|
ConDefects/ConDefects/Code/abc310_f/Python/50729164
|
condefects-python_data_2483
|
BigPrime = 998244353
N = int(input())
# ac ¥equiv 1 mod b となるcを求める
# @lru_cache(maxsize=4096)
# def modinv(a, b):
# b0 = b
# x0, x1 = 0, 1
# while a > 1:
# q = a // b
# a, b = b, a % b
# x0, x1 = x1 - q * x0, x0
# if x1 < 0:
# x1 += b0
# return x1
def modinv(a, b):
return pow(a, b-2, b)
def mod_time(a,b):
return (a*b) % BigPrime
# 高速化のために後で使う値を計算しておく
# M は N^2 mod BigPrime
# n は M の modinv
# m は n の modinv
# poweri[i] は i^2 mod BigPrime
# rate2jou[i] i^2/N^2 mod BigPrime
# timesiN_i[i] i*(N-i) mod BigPrime
# fractimesiN_i[i] i*(N-i)/N^2 mod BigPrime
# fraci[i] i/N mod BigPrime
# complementfraci[i] 1-(i/N) mod BigPrime
n = modinv(N, BigPrime)
M = (N ** 2) % BigPrime
m = modinv(M, BigPrime)
fraci = [0] * (N+1)
complementfraci = [0] * (N+1)
poweri = [0] * (N+1)
rate2jou = [0] * (N+1)
# i/N mod BigPrime
# 1-(i/N) mod BigPrime
for i in range(1, N+1):
fraci[i] = (fraci[i-1] + n) % BigPrime
complementfraci[i] = (BigPrime - fraci[i]+1) % BigPrime
# i^2 mod BigPrime
# i^2/N^2 mod BigPrime
for i in range(1, N+1):
poweri[i] = (i**2) % BigPrime
rate2jou[i] = mod_time(poweri[i], m)
def limitPr(init, rate):
init = init % BigPrime
rate = rate % BigPrime
limval = mod_time(init, modinv(BigPrime+1 - rate, BigPrime))
return limval
def first_to_second(i):
return limitPr(complementfraci[i], rate2jou[i])
def val_first(i):
return limitPr(fraci[i],rate2jou[i])
ans = [0, 0]
Prob = [[0, 0] for _ in range(N+1)]
Prob[0] = [1, 0]
for i in range(N):
f_s = first_to_second(i)
f_f = mod_time(f_s, fraci[i])
Prob[i+1][0] = (mod_time(f_f, Prob[i][0]) + mod_time(f_s, Prob[i][1])) % BigPrime
Prob[i+1][1] = (BigPrime - Prob[i+1][0]+1) % BigPrime
v_f = val_first(i)
v_s = mod_time(v_f, fraci[i])
ans[0] += (mod_time(v_f, Prob[i][0]) + mod_time(v_s, Prob[i][1])) % BigPrime
ans[1] += (mod_time(v_s, Prob[i][0]) + mod_time(v_f, Prob[i][1])) % BigPrime
print(*ans)
BigPrime = 998244353
N = int(input())
# ac ¥equiv 1 mod b となるcを求める
# @lru_cache(maxsize=4096)
# def modinv(a, b):
# b0 = b
# x0, x1 = 0, 1
# while a > 1:
# q = a // b
# a, b = b, a % b
# x0, x1 = x1 - q * x0, x0
# if x1 < 0:
# x1 += b0
# return x1
def modinv(a, b):
return pow(a, b-2, b)
def mod_time(a,b):
return (a*b) % BigPrime
# 高速化のために後で使う値を計算しておく
# M は N^2 mod BigPrime
# n は M の modinv
# m は n の modinv
# poweri[i] は i^2 mod BigPrime
# rate2jou[i] i^2/N^2 mod BigPrime
# timesiN_i[i] i*(N-i) mod BigPrime
# fractimesiN_i[i] i*(N-i)/N^2 mod BigPrime
# fraci[i] i/N mod BigPrime
# complementfraci[i] 1-(i/N) mod BigPrime
n = modinv(N, BigPrime)
M = (N ** 2) % BigPrime
m = modinv(M, BigPrime)
fraci = [0] * (N+1)
complementfraci = [0] * (N+1)
poweri = [0] * (N+1)
rate2jou = [0] * (N+1)
# i/N mod BigPrime
# 1-(i/N) mod BigPrime
for i in range(1, N+1):
fraci[i] = (fraci[i-1] + n) % BigPrime
complementfraci[i] = (BigPrime - fraci[i]+1) % BigPrime
# i^2 mod BigPrime
# i^2/N^2 mod BigPrime
for i in range(1, N+1):
poweri[i] = (i**2) % BigPrime
rate2jou[i] = mod_time(poweri[i], m)
def limitPr(init, rate):
init = init % BigPrime
rate = rate % BigPrime
limval = mod_time(init, modinv(BigPrime+1 - rate, BigPrime))
return limval
def first_to_second(i):
return limitPr(complementfraci[i], rate2jou[i])
def val_first(i):
return limitPr(fraci[i],rate2jou[i])
ans = [0, 0]
Prob = [[0, 0] for _ in range(N+1)]
Prob[0] = [1, 0]
for i in range(N):
f_s = first_to_second(i)
f_f = mod_time(f_s, fraci[i])
Prob[i+1][0] = (mod_time(f_f, Prob[i][0]) + mod_time(f_s, Prob[i][1])) % BigPrime
Prob[i+1][1] = (BigPrime - Prob[i+1][0]+1) % BigPrime
v_f = val_first(i)
v_s = mod_time(v_f, fraci[i])
ans[0] += (mod_time(v_f, Prob[i][0]) + mod_time(v_s, Prob[i][1])) % BigPrime
ans[0] %= BigPrime
ans[1] += (mod_time(v_s, Prob[i][0]) + mod_time(v_f, Prob[i][1])) % BigPrime
ans[1] %= BigPrime
print(*ans)
|
ConDefects/ConDefects/Code/arc174_c/Python/51488503
|
condefects-python_data_2484
|
import sys
sys.setrecursionlimit(10**6)
def e(x):
if dp[x] != -1:
return dp[x]
if x == 0:
dp[x] = 0
return 0
if x == 1:
dp[x] = n*(n-1)*pow(2*n-1,mod-2,mod)%mod
return dp[x]
inv = pow(2*n*x-x**2,mod-2,mod)
res = inv*(x*(x-1)*e(x-2) + (2*n*x-2*x*x+x)*e(x-1) + (n-x))%mod
dp[x] = res
return res
n= int(input())
mod = 998244353
dp = [-1]*(n+1)
dp[0] = 0
e(n)
print(dp[n],dp[n-1])
import sys
sys.setrecursionlimit(10**6)
def e(x):
if dp[x] != -1:
return dp[x]
if x == 0:
dp[x] = 0
return 0
if x == 1:
dp[x] = n*(n-1)*pow(2*n-1,mod-2,mod)%mod
return dp[x]
inv = pow(2*n*x-x**2,mod-2,mod)
res = inv*(x*(x-1)*e(x-2)%mod + (2*n*x-2*x*x+x)*e(x-1)%mod + n*(n-x))%mod
dp[x] = res
return res
n= int(input())
mod = 998244353
dp = [-1]*(n+1)
dp[0] = 0
e(n)
print(dp[n],dp[n-1])
|
ConDefects/ConDefects/Code/arc174_c/Python/54909674
|
condefects-python_data_2485
|
H,W = map(int,input().split())
C = []
for i in range(H):
C.append(list(input()))
def check(y,x):
size = 0
while True:
if (y + (size + 1) < H and x + (size + 1) < W and C[y+(size+1)][x+(size+1)] == '#') and \
(y + (size + 1) < H and x - (size + 1) >= 0 and C[y+(size+1)][x-(size+1)] == '#') and \
(y - (size + 1) >= 0 and x + (size + 1) < W and C[y-(size+1)][x+(size+1)] == '#') and \
(y - (size + 1) >= 0 and x - (size + 1) >= 0 and C[y-(size+1)][x-(size+1)] == '#'):
size += 1
else:
break
ans[size] += 1
ans = [0 for _ in range(H+1)]
for i in range(H):
for j in range(W):
if C[i][j] == '#':
check(i,j)
print(*ans[1:])
H,W = map(int,input().split())
C = []
for i in range(H):
C.append(list(input()))
def check(y,x):
size = 0
while True:
if (y + (size + 1) < H and x + (size + 1) < W and C[y+(size+1)][x+(size+1)] == '#') and \
(y + (size + 1) < H and x - (size + 1) >= 0 and C[y+(size+1)][x-(size+1)] == '#') and \
(y - (size + 1) >= 0 and x + (size + 1) < W and C[y-(size+1)][x+(size+1)] == '#') and \
(y - (size + 1) >= 0 and x - (size + 1) >= 0 and C[y-(size+1)][x-(size+1)] == '#'):
size += 1
else:
break
ans[size] += 1
ans = [0 for _ in range(min(H,W)+1)]
for i in range(H):
for j in range(W):
if C[i][j] == '#':
check(i,j)
print(*ans[1:])
|
ConDefects/ConDefects/Code/abc300_c/Python/45723345
|
condefects-python_data_2486
|
# Copyright (c) 2023, Le Duc Phuc Long
# If you don't think twice, you have to code twice.
# Import session
import sys
#input = sys.stdin.readline
from collections import defaultdict
############ ---- Input Functions ---- ############
def inp():
return int(input())
def inlt():
return list(map(int, input().split()))
def instr():
return list(input().strip())
def invr():
return map(int, input().split())
############ ---- Other Functions ---- ############
# Precompute
# IO
#input = sys.stdin.readline
# sys.stdin = open('in.txt', 'r')
# sys.stdout = open('out.txt', 'w')
# Main function
n, m = invr()
mtx = [list(input()) for _ in range(n)]
def dfs(x, y):
mtx[x][y] = '.'
cnt = 1
for i in range(-1, 2):
for j in range(-1, 2):
u, v = x+i, y+j
if 0 <= u < n and 0 <= v < m and mtx[u][v] == '#':
cnt += dfs(u, v)
return cnt
ans = [0]*(n+1)
for i in range(n):
for j in range(m):
if (mtx[i][j] == '#'):
ans[dfs(i, j)//4] += 1
ans.pop(0)
print(' '.join(map(str, ans)))
# Copyright (c) 2023, Le Duc Phuc Long
# If you don't think twice, you have to code twice.
# Import session
import sys
#input = sys.stdin.readline
from collections import defaultdict
############ ---- Input Functions ---- ############
def inp():
return int(input())
def inlt():
return list(map(int, input().split()))
def instr():
return list(input().strip())
def invr():
return map(int, input().split())
############ ---- Other Functions ---- ############
# Precompute
# IO
#input = sys.stdin.readline
# sys.stdin = open('in.txt', 'r')
# sys.stdout = open('out.txt', 'w')
# Main function
n, m = invr()
mtx = [list(input()) for _ in range(n)]
def dfs(x, y):
mtx[x][y] = '.'
cnt = 1
for i in range(-1, 2):
for j in range(-1, 2):
u, v = x+i, y+j
if 0 <= u < n and 0 <= v < m and mtx[u][v] == '#':
cnt += dfs(u, v)
return cnt
ans = [0]*(min(n, m)+1)
for i in range(n):
for j in range(m):
if (mtx[i][j] == '#'):
ans[dfs(i, j)//4] += 1
ans.pop(0)
print(' '.join(map(str, ans)))
|
ConDefects/ConDefects/Code/abc300_c/Python/45749744
|
condefects-python_data_2487
|
import sys,random,bisect,copy, time
from math import gcd, comb
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from functools import lru_cache, cmp_to_key
from itertools import permutations, combinations
from math import gcd,log,sqrt
from sortedcontainers import SortedList
from atcoder.modint import ModContext, Modint
from atcoder.dsu import DSU
from atcoder.segtree import SegTree
from atcoder.fenwicktree import FenwickTree
ModContext(1).context.append(998244353)
sys.setrecursionlimit(100000000)
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
N = int(input())
MOD = 998244353
P = li()
Q = li()
uf = DSU(N)
for i in range(N):
uf.merge(P[i]-1, Q[i]-1)
f = [2, 3]
for i in range(N-2):
f.append((f[-1] + f[-2]) % MOD)
ans = 1
for g in uf.groups():
k = len(g)
if k == 1:
t = 1
elif k == 2:
t = 3
elif k == 3:
t = 4
else:
t = f[k-1] + f[k-3]
ans *= t
ans %= MOD
print(ans)
import sys,random,bisect,copy, time
from math import gcd, comb
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from functools import lru_cache, cmp_to_key
from itertools import permutations, combinations
from math import gcd,log,sqrt
from sortedcontainers import SortedList
from atcoder.modint import ModContext, Modint
from atcoder.dsu import DSU
from atcoder.segtree import SegTree
from atcoder.fenwicktree import FenwickTree
ModContext(1).context.append(998244353)
sys.setrecursionlimit(100000000)
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
N = int(input())
MOD = 998244353
P = li()
Q = li()
uf = DSU(N)
for i in range(N):
uf.merge(P[i]-1, Q[i]-1)
f = [2, 3]
for i in range(N-2):
f.append((f[-1] + f[-2]) % MOD)
ans = 1
for g in uf.groups():
k = len(g)
if k == 1:
t = 1
elif k == 2:
t = 3
elif k == 3:
t = 4
else:
t = f[k-1-1] + f[k-3-1]
ans *= t
ans %= MOD
print(ans)
|
ConDefects/ConDefects/Code/abc247_f/Python/49035803
|
condefects-python_data_2488
|
N = int(input())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
f = [0]*(200001)
f[1] = 1
f[2] = 3
mod = 998244353
for i in range(3,200001):
f[i] = (f[i-1] + f[i-2])%mod
dp = [0]*(200001)
dp[1] = 1
dp[2] = 3
dp[3] = 4
for i in range(4,200001):
dp[i] = (f[i-3] + f[i-1])%mod
edge = [-1] * N
for i,j in zip(P,Q):
i-=1;j-=1
edge[i] = j
#print(edge)
visited = [-1] * N
from collections import *
ans = 1
for i in range(N):
if visited[i] == 1:
continue
visited[i] = 1
que = deque([i])
cnt = 1
while que:
now = que.popleft()
if visited[edge[now]] == -1:
visited[edge[now]] = 1
cnt += 1
que.append(edge[now])
# print(cnt)
# print(cnt)
ans *= dp[cnt]%mod
ans %= mod
print(ans)
N = int(input())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
f = [0]*(200001)
f[1] = 2
f[2] = 3
mod = 998244353
for i in range(3,200001):
f[i] = (f[i-1] + f[i-2])%mod
dp = [0]*(200001)
dp[1] = 1
dp[2] = 3
dp[3] = 4
for i in range(4,200001):
dp[i] = (f[i-3] + f[i-1])%mod
edge = [-1] * N
for i,j in zip(P,Q):
i-=1;j-=1
edge[i] = j
#print(edge)
visited = [-1] * N
from collections import *
ans = 1
for i in range(N):
if visited[i] == 1:
continue
visited[i] = 1
que = deque([i])
cnt = 1
while que:
now = que.popleft()
if visited[edge[now]] == -1:
visited[edge[now]] = 1
cnt += 1
que.append(edge[now])
# print(cnt)
# print(cnt)
ans *= dp[cnt]%mod
ans %= mod
print(ans)
|
ConDefects/ConDefects/Code/abc247_f/Python/55036523
|
condefects-python_data_2489
|
from collections import defaultdict
class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rank = [0]*(n+1)
def find(self, x):
if(self.root[x] < 0):
return x
else:
self.root[x] = self.find(self.root[x])
return self.root[x]
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if(x == y):
return
elif(self.rank[x] > self.rank[y]):
self.root[x] += self.root[y]
self.root[y] = x
else:
self.root[y] += self.root[x]
self.root[x] = y
if(self.rank[x] == self.rank[y]):
self.rank[y] += 1
def same(self, x, y):
return self.find(x) == self.find(y)
def size(self, x):
return -self.root[self.find(x)]
def roots(self):
return [i for i, x in enumerate(self.root) if x < 0]
def group_size(self):
return len(self.roots())
def group_members(self):
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
N = int(input())
P = list(map(int,input().split()))
Q = list(map(int,input().split()))
mod = 998244353
dp = [[[0,0],[0,0]] for i in range(N+1)]
dp[1][0][0] = 1
dp[1][1][1] = 1
for i in range(1,N):
dp[i+1][0][0] = dp[i][0][1]
dp[i+1][0][1] = sum(dp[i][0]) % mod
dp[i+1][1][0] = dp[i][1][1]
dp[i+1][1][1] = sum(dp[i][1]) % mod
C = [0,1]
for i in range(2,N+1):
c = sum(dp[i-1][0]) + sum(dp[i-1][1]) + dp[i-1][1][1]
c %= mod
C.append(c)
uf = UnionFind(N)
for i in range(N):
uf.unite(P[i]-1,Q[i-1])
d = {}
for i in range(N):
r = uf.find(i)
if r not in d:
d[r] = 0
d[r] += 1
ans = 1
for r in d:
ans *= C[d[r]]
ans %= mod
print(ans)
from collections import defaultdict
class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rank = [0]*(n+1)
def find(self, x):
if(self.root[x] < 0):
return x
else:
self.root[x] = self.find(self.root[x])
return self.root[x]
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if(x == y):
return
elif(self.rank[x] > self.rank[y]):
self.root[x] += self.root[y]
self.root[y] = x
else:
self.root[y] += self.root[x]
self.root[x] = y
if(self.rank[x] == self.rank[y]):
self.rank[y] += 1
def same(self, x, y):
return self.find(x) == self.find(y)
def size(self, x):
return -self.root[self.find(x)]
def roots(self):
return [i for i, x in enumerate(self.root) if x < 0]
def group_size(self):
return len(self.roots())
def group_members(self):
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
N = int(input())
P = list(map(int,input().split()))
Q = list(map(int,input().split()))
mod = 998244353
dp = [[[0,0],[0,0]] for i in range(N+1)]
dp[1][0][0] = 1
dp[1][1][1] = 1
for i in range(1,N):
dp[i+1][0][0] = dp[i][0][1]
dp[i+1][0][1] = sum(dp[i][0]) % mod
dp[i+1][1][0] = dp[i][1][1]
dp[i+1][1][1] = sum(dp[i][1]) % mod
C = [0,1]
for i in range(2,N+1):
c = sum(dp[i-1][0]) + sum(dp[i-1][1]) + dp[i-1][1][1]
c %= mod
C.append(c)
uf = UnionFind(N)
for i in range(N):
uf.unite(P[i]-1,Q[i]-1)
d = {}
for i in range(N):
r = uf.find(i)
if r not in d:
d[r] = 0
d[r] += 1
ans = 1
for r in d:
ans *= C[d[r]]
ans %= mod
print(ans)
|
ConDefects/ConDefects/Code/abc247_f/Python/52972964
|
condefects-python_data_2490
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
N, *A = map(int, read().split())
inf = 1 << 60
ans = inf
dp = [[inf, inf] for _ in range(N + 1)]
dp[1][0] = 0
for i in range(1, N):
dp[i + 1][0] = dp[i][1]
dp[i + 1][1] = min(dp[i]) + A[i]
ans = min(ans, dp[N][1])
dp = [[inf, inf] for _ in range(N + 1)]
dp[1][1] = A[0]
for i in range(1, N):
dp[i + 1][0] = dp[i][1]
dp[i + 1][1] = min(dp[i]) + A[i]
ans = min(ans, dp[N][0])
print(ans)
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
N, *A = map(int, read().split())
inf = 1 << 60
ans = inf
dp = [[inf, inf] for _ in range(N + 1)]
dp[1][0] = 0
for i in range(1, N):
dp[i + 1][0] = dp[i][1]
dp[i + 1][1] = min(dp[i]) + A[i]
ans = min(ans, dp[N][1])
dp = [[inf, inf] for _ in range(N + 1)]
dp[1][1] = A[0]
for i in range(1, N):
dp[i + 1][0] = dp[i][1]
dp[i + 1][1] = min(dp[i]) + A[i]
ans = min(ans, min(dp[N]))
print(ans)
|
ConDefects/ConDefects/Code/abc251_e/Python/45556624
|
condefects-python_data_2491
|
import numpy as np
import sys
from functools import lru_cache
import math
sys.setrecursionlimit(int(1e7))
from collections import *
from fractions import Fraction
import heapq
import bisect
import itertools
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://raw.githubusercontent.com/shakayami/ACL-for-python/master/segtree.py
class segtree:
n = 1
size = 1
log = 2
d = [0]
op = None
e = 10**15
def __init__(self, V, OP, E):
self.n = len(V)
self.op = OP
self.e = E
self.log = (self.n - 1).bit_length()
self.size = 1 << self.log
self.d = [E for i in range(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 set(self, p, x):
assert 0 <= p and p < self.n
p += self.size
self.d[p] = x
for i in range(1, self.log + 1):
self.update(p >> i)
def get(self, p):
assert 0 <= p and p < self.n
return self.d[p + self.size]
def prod(self, l, r):
assert 0 <= l and l <= r and r <= self.n
sml = self.e
smr = self.e
l += self.size
r += self.size
while l < r:
if l & 1:
sml = self.op(sml, self.d[l])
l += 1
if r & 1:
smr = self.op(self.d[r - 1], smr)
r -= 1
l >>= 1
r >>= 1
return self.op(sml, smr)
def all_prod(self):
return self.d[1]
def max_right(self, l, f):
assert 0 <= l and l <= self.n
assert f(self.e)
if l == self.n:
return self.n
l += self.size
sm = self.e
while 1:
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 min_left(self, r, f):
assert 0 <= r and r <= self.n
assert f(self.e)
if r == 0:
return 0
r += self.size
sm = self.e
while 1:
r -= 1
while r > 1 and (r % 2):
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 __str__(self):
return str([self.get(i) for i in range(self.n)])
def get_list(self):
return [self.get(i) for i in range(self.n)] # オリジナルで追加
# RMQのとき
# def op(x, y):
# return x if x < y else y
# seg = segtree([10**9] * N, op, 10**9) # Vの要素とEの値は同じにする #10**9 -> INF
# seg.prod(l, r) # op(a[l],...a[r-1])を返す
class BIT:
def __init__(self, n):
self.n = len(n) if isinstance(n, list) else n
self.size = 1 << (self.n - 1).bit_length()
if isinstance(n, list): # nは1-indexedなリスト
a = [0]
for p in n:
a.append(p + a[-1])
a += [a[-1]] * (self.size - self.n)
self.d = [a[p] - a[p - (p & -p)] for p in range(self.size + 1)]
else: # nは大きさ
self.d = [0] * (self.size + 1)
def __repr__(self):
p = self.size
res = []
while p > 0:
res2 = []
for r in range(p, self.size + 1, p * 2):
l = r - (r & -r) + 1
res2.append(f"[{l}, {r}]:{self.d[r]}")
res.append(" ".join(res2))
p >>= 1
res.append(f"{[self.sum(p + 1) - self.sum(p) for p in range(self.size)]}")
return "\n".join(res)
def add(self, p, x): # O(log(n)), 点pにxを加算
assert p > 0
while p <= self.size:
self.d[p] += x
p += p & -p
def get(self, p, default=None): # O(log(n))
assert p > 0
return (
self.sum(p) - self.sum(p - 1)
if 1 <= p <= self.n or default is None
else default
)
def sum(self, p): # O(log(n)), 閉区間[1, p]の累積和
assert p >= 0
res = 0
while p > 0:
res += self.d[p]
p -= p & -p
return res
def lower_bound(self, x): # O(log(n)), x <= 閉区間[1, p]の累積和 となる最小のp
if x <= 0:
return 0
p, r = 0, self.size
while r > 0:
if p + r <= self.n and self.d[p + r] < x:
x -= self.d[p + r]
p += r
r >>= 1
return p + 1
class MultiSet:
# n: サイズ、compress: 座圧対象list-likeを指定(nは無効)
# multi: マルチセットか通常のOrderedSetか
def __init__(self, n=0, *, compress=[], multi=True):
self.multi = multi
self.inv_compress = (
sorted(set(compress)) if len(compress) > 0 else [i for i in range(n)]
)
self.compress = {k: v for v, k in enumerate(self.inv_compress)}
self.counter_all = 0
self.counter = [0] * len(self.inv_compress)
self.bit = BIT(len(self.inv_compress))
def add(self, x, n=1): # O(log n)
if not self.multi and n != 1:
raise KeyError(n)
x = self.compress[x]
count = self.counter[x]
if count == 0 or self.multi: # multiなら複数カウントできる
self.bit.add(x + 1, n)
self.counter_all += n
self.counter[x] += n
def remove(self, x, n=1): # O(log n)
if not self.multi and n != 1:
raise KeyError(n)
x = self.compress[x]
count = self.bit.get(x + 1)
if count < n:
raise KeyError(x)
self.bit.add(x + 1, -n)
self.counter_all -= n
self.counter[x] -= n
def __repr__(self):
return f'MultiSet {{{(", ".join(map(str, list(self))))}}}'
def __len__(self): # oprator len: O(1)
return self.counter_all
def count(self, x): # O(1)
return self.counter[self.compress[x]] if x in self.compress else 0
def __getitem__(self, i): # operator []: O(log n)
if i < 0:
i += len(self)
x = self.bit.lower_bound(i + 1)
if x > self.bit.n:
raise IndexError("list index out of range")
return self.inv_compress[x - 1]
def __contains__(self, x): # operator in: O(1)
return self.count(x) > 0
def bisect_left(self, x): # O(log n)
return self.bit.sum(bisect.bisect_left(self.inv_compress, x))
def bisect_right(self, x): # O(log n)
return self.bit.sum(bisect.bisect_right(self.inv_compress, x))
# 宣言方法
# MultiSet(compress=X,multi=False)
# MultiSet(N+1,multi=True)
# リストを渡すと座標圧縮して返してくれる
def compress(arr):
(*XS,) = set(arr)
XS.sort()
return {cmp_e: cmp_i for cmp_i, cmp_e in enumerate(XS)}
def ctov(c):
return ord(c) - ord("a")
def CTOV(c):
return ord(c) - ord("A")
def make_divisors(n):
lower_divisors, upper_divisors = [], []
i = 1
while i * i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n // i)
i += 1
return lower_divisors + upper_divisors[::-1]
dxdy1 = ((0, 1), (0, -1), (1, 0), (-1, 0))
dxdy2 = ((0, 1), (0, -1), (1, 0), (-1, 0), (1, 1), (-1, -1), (1, -1), (-1, 1))
dxdy3 = ((0, 1), (1, 0))
dxdy4 = ((1, 1), (1, -1), (-1, 1), (-1, -1))
INF = float("inf")
MOD = 998244353
mod = 998244353
# memo : len([a,b,...,z])==26
N = int(input())
A = list(map(int, input().split()))
dp = [[INF] * 2 for _ in range(N + 1)]
dp[1][0] = 0
for i in range(1, N):
dp[i + 1][0] = dp[i][1]
dp[i + 1][1] = min(dp[i][0] + A[i], dp[i][1] + A[i])
ans1 = dp[N][1]
dp = [[INF] * 2 for _ in range(N + 1)]
dp[1][1] = A[0]
for i in range(1, N):
dp[i + 1][0] = dp[i][1]
dp[i + 1][1] = min(dp[i][0] + A[i], dp[i][1] + A[i])
ans2 = dp[N][0]
print(min(ans1, ans2))
import numpy as np
import sys
from functools import lru_cache
import math
sys.setrecursionlimit(int(1e7))
from collections import *
from fractions import Fraction
import heapq
import bisect
import itertools
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://raw.githubusercontent.com/shakayami/ACL-for-python/master/segtree.py
class segtree:
n = 1
size = 1
log = 2
d = [0]
op = None
e = 10**15
def __init__(self, V, OP, E):
self.n = len(V)
self.op = OP
self.e = E
self.log = (self.n - 1).bit_length()
self.size = 1 << self.log
self.d = [E for i in range(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 set(self, p, x):
assert 0 <= p and p < self.n
p += self.size
self.d[p] = x
for i in range(1, self.log + 1):
self.update(p >> i)
def get(self, p):
assert 0 <= p and p < self.n
return self.d[p + self.size]
def prod(self, l, r):
assert 0 <= l and l <= r and r <= self.n
sml = self.e
smr = self.e
l += self.size
r += self.size
while l < r:
if l & 1:
sml = self.op(sml, self.d[l])
l += 1
if r & 1:
smr = self.op(self.d[r - 1], smr)
r -= 1
l >>= 1
r >>= 1
return self.op(sml, smr)
def all_prod(self):
return self.d[1]
def max_right(self, l, f):
assert 0 <= l and l <= self.n
assert f(self.e)
if l == self.n:
return self.n
l += self.size
sm = self.e
while 1:
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 min_left(self, r, f):
assert 0 <= r and r <= self.n
assert f(self.e)
if r == 0:
return 0
r += self.size
sm = self.e
while 1:
r -= 1
while r > 1 and (r % 2):
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 __str__(self):
return str([self.get(i) for i in range(self.n)])
def get_list(self):
return [self.get(i) for i in range(self.n)] # オリジナルで追加
# RMQのとき
# def op(x, y):
# return x if x < y else y
# seg = segtree([10**9] * N, op, 10**9) # Vの要素とEの値は同じにする #10**9 -> INF
# seg.prod(l, r) # op(a[l],...a[r-1])を返す
class BIT:
def __init__(self, n):
self.n = len(n) if isinstance(n, list) else n
self.size = 1 << (self.n - 1).bit_length()
if isinstance(n, list): # nは1-indexedなリスト
a = [0]
for p in n:
a.append(p + a[-1])
a += [a[-1]] * (self.size - self.n)
self.d = [a[p] - a[p - (p & -p)] for p in range(self.size + 1)]
else: # nは大きさ
self.d = [0] * (self.size + 1)
def __repr__(self):
p = self.size
res = []
while p > 0:
res2 = []
for r in range(p, self.size + 1, p * 2):
l = r - (r & -r) + 1
res2.append(f"[{l}, {r}]:{self.d[r]}")
res.append(" ".join(res2))
p >>= 1
res.append(f"{[self.sum(p + 1) - self.sum(p) for p in range(self.size)]}")
return "\n".join(res)
def add(self, p, x): # O(log(n)), 点pにxを加算
assert p > 0
while p <= self.size:
self.d[p] += x
p += p & -p
def get(self, p, default=None): # O(log(n))
assert p > 0
return (
self.sum(p) - self.sum(p - 1)
if 1 <= p <= self.n or default is None
else default
)
def sum(self, p): # O(log(n)), 閉区間[1, p]の累積和
assert p >= 0
res = 0
while p > 0:
res += self.d[p]
p -= p & -p
return res
def lower_bound(self, x): # O(log(n)), x <= 閉区間[1, p]の累積和 となる最小のp
if x <= 0:
return 0
p, r = 0, self.size
while r > 0:
if p + r <= self.n and self.d[p + r] < x:
x -= self.d[p + r]
p += r
r >>= 1
return p + 1
class MultiSet:
# n: サイズ、compress: 座圧対象list-likeを指定(nは無効)
# multi: マルチセットか通常のOrderedSetか
def __init__(self, n=0, *, compress=[], multi=True):
self.multi = multi
self.inv_compress = (
sorted(set(compress)) if len(compress) > 0 else [i for i in range(n)]
)
self.compress = {k: v for v, k in enumerate(self.inv_compress)}
self.counter_all = 0
self.counter = [0] * len(self.inv_compress)
self.bit = BIT(len(self.inv_compress))
def add(self, x, n=1): # O(log n)
if not self.multi and n != 1:
raise KeyError(n)
x = self.compress[x]
count = self.counter[x]
if count == 0 or self.multi: # multiなら複数カウントできる
self.bit.add(x + 1, n)
self.counter_all += n
self.counter[x] += n
def remove(self, x, n=1): # O(log n)
if not self.multi and n != 1:
raise KeyError(n)
x = self.compress[x]
count = self.bit.get(x + 1)
if count < n:
raise KeyError(x)
self.bit.add(x + 1, -n)
self.counter_all -= n
self.counter[x] -= n
def __repr__(self):
return f'MultiSet {{{(", ".join(map(str, list(self))))}}}'
def __len__(self): # oprator len: O(1)
return self.counter_all
def count(self, x): # O(1)
return self.counter[self.compress[x]] if x in self.compress else 0
def __getitem__(self, i): # operator []: O(log n)
if i < 0:
i += len(self)
x = self.bit.lower_bound(i + 1)
if x > self.bit.n:
raise IndexError("list index out of range")
return self.inv_compress[x - 1]
def __contains__(self, x): # operator in: O(1)
return self.count(x) > 0
def bisect_left(self, x): # O(log n)
return self.bit.sum(bisect.bisect_left(self.inv_compress, x))
def bisect_right(self, x): # O(log n)
return self.bit.sum(bisect.bisect_right(self.inv_compress, x))
# 宣言方法
# MultiSet(compress=X,multi=False)
# MultiSet(N+1,multi=True)
# リストを渡すと座標圧縮して返してくれる
def compress(arr):
(*XS,) = set(arr)
XS.sort()
return {cmp_e: cmp_i for cmp_i, cmp_e in enumerate(XS)}
def ctov(c):
return ord(c) - ord("a")
def CTOV(c):
return ord(c) - ord("A")
def make_divisors(n):
lower_divisors, upper_divisors = [], []
i = 1
while i * i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n // i)
i += 1
return lower_divisors + upper_divisors[::-1]
dxdy1 = ((0, 1), (0, -1), (1, 0), (-1, 0))
dxdy2 = ((0, 1), (0, -1), (1, 0), (-1, 0), (1, 1), (-1, -1), (1, -1), (-1, 1))
dxdy3 = ((0, 1), (1, 0))
dxdy4 = ((1, 1), (1, -1), (-1, 1), (-1, -1))
INF = float("inf")
MOD = 998244353
mod = 998244353
# memo : len([a,b,...,z])==26
N = int(input())
A = list(map(int, input().split()))
dp = [[INF] * 2 for _ in range(N + 1)]
dp[1][0] = 0
for i in range(1, N):
dp[i + 1][0] = dp[i][1]
dp[i + 1][1] = min(dp[i][0] + A[i], dp[i][1] + A[i])
ans1 = dp[N][1]
dp = [[INF] * 2 for _ in range(N + 1)]
dp[1][1] = A[0]
for i in range(1, N):
dp[i + 1][0] = dp[i][1]
dp[i + 1][1] = min(dp[i][0] + A[i], dp[i][1] + A[i])
ans2 = min(dp[N][0], dp[N][1])
print(min(ans1, ans2))
|
ConDefects/ConDefects/Code/abc251_e/Python/45699667
|
condefects-python_data_2492
|
n,t=[int(x) for x in input().split()]
s=input()
x=[int(x) for x in input().split()]
x0=[]
x1=[]
for i,s1 in enumerate(s):
if(s1=="0"):
x0.append(x[i])
else:
x1.append(x[i])
nx0=len(x0)
nx1=len(x1)
i=0
j=0
ans=0
#print(x0)
#print(x1)
for y in x1:
while(i<(nx0) and x0[i]<y):
i+=1
while(j<(nx0) and x0[j]<(y+2*t+0.1)):
j+=1
ans+=(j-i)
#print(ans,j,i)
print(ans)
n,t=[int(x) for x in input().split()]
s=input()
x=[int(x) for x in input().split()]
x0=[]
x1=[]
for i,s1 in enumerate(s):
if(s1=="0"):
x0.append(x[i])
else:
x1.append(x[i])
x0.sort()
x1.sort()
nx0=len(x0)
nx1=len(x1)
i=0
j=0
ans=0
#print(x0)
#print(x1)
for y in x1:
while(i<(nx0) and x0[i]<y):
i+=1
while(j<(nx0) and x0[j]<(y+2*t+0.1)):
j+=1
ans+=(j-i)
#print(ans,j,i)
print(ans)
|
ConDefects/ConDefects/Code/abc360_d/Python/55144134
|
condefects-python_data_2493
|
from bisect import bisect_right
N, T = map(int, input().split())
S = list(input())
X = list(map(int, input().split()))
LS = len(S)
ans = 0
Z = []
for i in range(LS):
if S[i] == '0':
Z.append(X[i])
Z.sort()
for i in range(LS):
if S[i] == '1':
ans += bisect_right(Z, X[i] * 2 * T) - bisect_right(Z, X[i])
print(ans)
from bisect import bisect_right
N, T = map(int, input().split())
S = list(input())
X = list(map(int, input().split()))
LS = len(S)
ans = 0
Z = []
for i in range(LS):
if S[i] == '0':
Z.append(X[i])
Z.sort()
for i in range(LS):
if S[i] == '1':
ans += bisect_right(Z, X[i] + 2 * T) - bisect_right(Z, X[i])
print(ans)
|
ConDefects/ConDefects/Code/abc360_d/Python/55158034
|
condefects-python_data_2494
|
import sys, math, string
from collections import Counter
from bisect import bisect_right as upper_bound, bisect_left as lower_bound
input = lambda: sys.stdin.readline().rstrip()
read = lambda: int(input())
reads = lambda: map(int, input().split())
readlist = lambda n=None: (
list(map(int, input().split()))
if n == None
else [list(map(int, input().split())) for _ in range(n)]
)
readstr = lambda n=None: (
list(input()) if n == None else [list(input()) for _ in range(n)]
)
if __name__ == "__main__":
N, T = reads()
S = input()
A = readlist()
a, b = [], []
for i, x in enumerate(A):
if S[i] == "1":
a.append(x)
else:
b.append(x)
ans = 0
for i in a:
ans += upper_bound(b, i + 2 * T) - lower_bound(b, i)
print(ans)
pass
import sys, math, string
from collections import Counter
from bisect import bisect_right as upper_bound, bisect_left as lower_bound
input = lambda: sys.stdin.readline().rstrip()
read = lambda: int(input())
reads = lambda: map(int, input().split())
readlist = lambda n=None: (
list(map(int, input().split()))
if n == None
else [list(map(int, input().split())) for _ in range(n)]
)
readstr = lambda n=None: (
list(input()) if n == None else [list(input()) for _ in range(n)]
)
if __name__ == "__main__":
N, T = reads()
S = input()
A = readlist()
a, b = [], []
for i, x in enumerate(A):
if S[i] == "1":
a.append(x)
else:
b.append(x)
a.sort()
b.sort()
ans = 0
for i in a:
ans += upper_bound(b, i + 2 * T) - lower_bound(b, i)
print(ans)
pass
|
ConDefects/ConDefects/Code/abc360_d/Python/55135895
|
condefects-python_data_2495
|
def query(a, x):
l = 0
r = len(a)
m = (l+r)//2
while l < r:
if a[m] <= x:
l = m+1
else:
r = m
m = (l+r)//2
return m
n, t = tuple(map(int,input().split()))
s = input()
x = list(map(int,input().split()))
pos = []
neg = []
for i in range(n):
if s[i] == '0':
neg.append(x[i])
else:
pos.append(x[i])
ans = 0
for x in pos:
# how many in neg between x and x+2t
ans += query(neg, x+2*t) - query(neg, x-1)
print(ans)
def query(a, x):
l = 0
r = len(a)
m = (l+r)//2
while l < r:
if a[m] <= x:
l = m+1
else:
r = m
m = (l+r)//2
return m
n, t = tuple(map(int,input().split()))
s = input()
x = list(map(int,input().split()))
pos = []
neg = []
for i in range(n):
if s[i] == '0':
neg.append(x[i])
else:
pos.append(x[i])
pos.sort()
neg.sort()
ans = 0
for x in pos:
# how many in neg between x and x+2t
ans += query(neg, x+2*t) - query(neg, x-1)
print(ans)
|
ConDefects/ConDefects/Code/abc360_d/Python/55161015
|
condefects-python_data_2496
|
import bisect
n,t = map(int, input().split())
s = input()
x = list(map(int, input().split()))
x.sort()
r = []
l = []
for i in range(n):
if s[i] == "1":
r.append(x[i])
else:
l.append(x[i])
s = 0
for i in r:
s += bisect.bisect_right(l, i+t*2) - bisect.bisect_right(l, i)
print(s)
import bisect
n,t = map(int, input().split())
s = input()
x = list(map(int, input().split()))
r = []
l = []
for i in range(n):
if s[i] == "1":
r.append(x[i])
else:
l.append(x[i])
l.sort()
s = 0
for i in r:
s += bisect.bisect_right(l, i+t*2) - bisect.bisect_right(l, i)
print(s)
|
ConDefects/ConDefects/Code/abc360_d/Python/55163205
|
condefects-python_data_2497
|
from collections import deque
N, T = map(int, input().split())
S = input()
X = list(map(int, input().split()))
num_l_ants = S.count('0')
l_ants = [0] * num_l_ants
r_ants = [0] * (N - num_l_ants)
l = 0
r = 0
for i, (c, x) in enumerate(zip(S, X)):
if c == '0':
l_ants[l] = x
l += 1
else:
r_ants[r] = x
r += 1
l_ants.sort()
r_ants.sort()
first_crossings = [-1] * len(r_ants)
l = 0
q = deque()
left_end = -1
right_end = 0
count = 0
while True:
while right_end < len(r_ants) and r_ants[right_end] < l_ants[l]:
if r_ants[right_end] + T * 2 > l_ants[l]:
first_crossings[right_end] = l
q.append(right_end)
right_end += 1
if left_end == -1 and len(q) > 0:
left_end = q.popleft()
while left_end != -1 and r_ants[left_end] + T * 2 < l_ants[l]:
count += l - 1 - first_crossings[left_end] + 1
if len(q) > 0:
left_end = q.popleft()
else:
left_end = -1
l += 1
if l >= len(l_ants):
while left_end != -1:
count += l - 1 - first_crossings[left_end] + 1
if len(q) > 0:
left_end = q.popleft()
else:
left_end = -1
break
print(count)
from collections import deque
N, T = map(int, input().split())
S = input()
X = list(map(int, input().split()))
num_l_ants = S.count('0')
l_ants = [0] * num_l_ants
r_ants = [0] * (N - num_l_ants)
l = 0
r = 0
for i, (c, x) in enumerate(zip(S, X)):
if c == '0':
l_ants[l] = x
l += 1
else:
r_ants[r] = x
r += 1
l_ants.sort()
r_ants.sort()
first_crossings = [-1] * len(r_ants)
l = 0
q = deque()
left_end = -1
right_end = 0
count = 0
while True:
while right_end < len(r_ants) and r_ants[right_end] < l_ants[l]:
if r_ants[right_end] + T * 2 >= l_ants[l]:
first_crossings[right_end] = l
q.append(right_end)
right_end += 1
if left_end == -1 and len(q) > 0:
left_end = q.popleft()
while left_end != -1 and r_ants[left_end] + T * 2 < l_ants[l]:
count += l - 1 - first_crossings[left_end] + 1
if len(q) > 0:
left_end = q.popleft()
else:
left_end = -1
l += 1
if l >= len(l_ants):
while left_end != -1:
count += l - 1 - first_crossings[left_end] + 1
if len(q) > 0:
left_end = q.popleft()
else:
left_end = -1
break
print(count)
|
ConDefects/ConDefects/Code/abc360_d/Python/55130899
|
condefects-python_data_2498
|
mod=67280421310721
class segtree:
def __init__(self,n):
self.size=1
self.height=0
while self.size<n:
self.size*=2
self.height+=1
self.dat=[10**10]*(self.size*2)
self.lazy=[10**10]*(self.size*2)
def update(self,l,r,a):
l+=self.size
r+=self.size
while l<r:
if l&1:
self.lazy[l]=min(self.lazy[l],a)
l+=1
if r&1:
r-=1
self.lazy[r]=min(self.lazy[l],a)
l//=2
r//=2
def querry(self,l,r):
l+=self.size
r+=self.size
score=10**20
while l<r:
if l&1:
w=min(self.dat[l],self.lazy[l])
score=min(score,w)
l+=1
if r&1:
r-=1
w=min(self.dat[r],self.lazy[r])
score=min(score,w)
l//=2
r//=2
return score
def propagate(self,x):
x+=self.size
for h in range(self.height,0,-1):
y=x>>h
self.lazy[2*y]=min(self.lazy[2*y],self.lazy[y])
self.lazy[2*y+1]=min(self.lazy[2*y+1],self.lazy[y])
self.dat[y]=min(self.dat[y],self.lazy[y])
self.lazy[y]=10**10
def bottom(self,x):
x+=self.size
while x>1:
x//=2
self.dat[x]=min(min(self.dat[2*x],self.lazy[2*x]),min(self.dat[2*x+1],self.lazy[2*x+1]))
S=input()
T=input()
N=len(T)
M=len(S)
if S[0]!=T[0]:
print(-1)
exit()
dp=[10**10]*N
dp[0]=0
x100=[1]*(N+1)
for i in range(1,N+1):
x100[i]=x100[i-1]*100
x100[i]%=mod
ra=[0]*M
rb=[0]*N
Z=segtree(N+1)
Z.propagate(0)
Z.update(0,1,0)
Z.bottom(0)
for i in range(M):
x=ord(S[i])-ord('a')+1
ra[i]=ra[i-1]*100+x
ra[i]%=mod
for i in range(N):
x=ord(T[i])-ord('a')+1
rb[i]=rb[i-1]*100+x
rb[i]%=mod
for i in range(N):
Z.propagate(i)
x=Z.querry(i,i+1)
if x>=10**10:
continue
if T[i]==S[0]:
l=i
r=N-1
while True:
if l==r:
break
m=(l+r+1)//2
if m-i+1>M:
r=m-1
else:
a=ra[m-i]
if i==0:
b=rb[m]
else:
b=rb[m]-rb[i-1]*x100[m-i+1]
b%=mod
if a==b:
l=m
else:
r=m-1
Z.propagate(i+1)
Z.propagate(l+1)
Z.update(i+1,l+2,x+1)
Z.bottom(i+1)
Z.bottom(l+1)
Z.propagate(N)
result=Z.querry(N,N+1)
if result>=10**10:
print(-1)
else:
print(result)
mod=67280421310721
class segtree:
def __init__(self,n):
self.size=1
self.height=0
while self.size<n:
self.size*=2
self.height+=1
self.dat=[10**10]*(self.size*2)
self.lazy=[10**10]*(self.size*2)
def update(self,l,r,a):
l+=self.size
r+=self.size
while l<r:
if l&1:
self.lazy[l]=min(self.lazy[l],a)
l+=1
if r&1:
r-=1
self.lazy[r]=min(self.lazy[r],a)
l//=2
r//=2
def querry(self,l,r):
l+=self.size
r+=self.size
score=10**20
while l<r:
if l&1:
w=min(self.dat[l],self.lazy[l])
score=min(score,w)
l+=1
if r&1:
r-=1
w=min(self.dat[r],self.lazy[r])
score=min(score,w)
l//=2
r//=2
return score
def propagate(self,x):
x+=self.size
for h in range(self.height,0,-1):
y=x>>h
self.lazy[2*y]=min(self.lazy[2*y],self.lazy[y])
self.lazy[2*y+1]=min(self.lazy[2*y+1],self.lazy[y])
self.dat[y]=min(self.dat[y],self.lazy[y])
self.lazy[y]=10**10
def bottom(self,x):
x+=self.size
while x>1:
x//=2
self.dat[x]=min(min(self.dat[2*x],self.lazy[2*x]),min(self.dat[2*x+1],self.lazy[2*x+1]))
S=input()
T=input()
N=len(T)
M=len(S)
if S[0]!=T[0]:
print(-1)
exit()
dp=[10**10]*N
dp[0]=0
x100=[1]*(N+1)
for i in range(1,N+1):
x100[i]=x100[i-1]*100
x100[i]%=mod
ra=[0]*M
rb=[0]*N
Z=segtree(N+1)
Z.propagate(0)
Z.update(0,1,0)
Z.bottom(0)
for i in range(M):
x=ord(S[i])-ord('a')+1
ra[i]=ra[i-1]*100+x
ra[i]%=mod
for i in range(N):
x=ord(T[i])-ord('a')+1
rb[i]=rb[i-1]*100+x
rb[i]%=mod
for i in range(N):
Z.propagate(i)
x=Z.querry(i,i+1)
if x>=10**10:
continue
if T[i]==S[0]:
l=i
r=N-1
while True:
if l==r:
break
m=(l+r+1)//2
if m-i+1>M:
r=m-1
else:
a=ra[m-i]
if i==0:
b=rb[m]
else:
b=rb[m]-rb[i-1]*x100[m-i+1]
b%=mod
if a==b:
l=m
else:
r=m-1
Z.propagate(i+1)
Z.propagate(l+1)
Z.update(i+1,l+2,x+1)
Z.bottom(i+1)
Z.bottom(l+1)
Z.propagate(N)
result=Z.querry(N,N+1)
if result>=10**10:
print(-1)
else:
print(result)
|
ConDefects/ConDefects/Code/abc257_g/Python/45268157
|
condefects-python_data_2499
|
s = input()
print("Yes" if s[0].isupper() and s[1:].islower() else "No")
s = input()
print("Yes" if s.istitle() else "No")
|
ConDefects/ConDefects/Code/abc338_a/Python/54692987
|
condefects-python_data_2500
|
print("YNeos"[input().istitle()::2])
print("NYoe s"[input().istitle()::2])
|
ConDefects/ConDefects/Code/abc338_a/Python/54708656
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.