id
stringlengths 24
27
| content
stringlengths 37
384k
| max_stars_repo_path
stringlengths 51
51
|
|---|---|---|
condefects-python_data_1701
|
from itertools import combinations
N, M = list(map(int, input().split()))
flavors_of_stands = []
for _ in range(N):
s = int("".join(list(map(lambda x: '1' if x == 'o' else '0', input()))), base=2)
flavors_of_stands.append(s)
total = 2 ** M - 1
for i in range(1, N):
all_cases = combinations(range(N), i)
for case in all_cases:
cur_ans = 0
for idx in case:
cur_ans |= flavors_of_stands[idx]
if cur_ans == total:
print(len(case))
exit(0)
from itertools import combinations
N, M = list(map(int, input().split()))
flavors_of_stands = []
for _ in range(N):
s = int("".join(list(map(lambda x: '1' if x == 'o' else '0', input()))), base=2)
flavors_of_stands.append(s)
total = 2 ** M - 1
for i in range(1, N+1):
all_cases = combinations(range(N), i)
for case in all_cases:
cur_ans = 0
for idx in case:
cur_ans |= flavors_of_stands[idx]
if cur_ans == total:
print(len(case))
exit(0)
|
ConDefects/ConDefects/Code/abc358_c/Python/54954465
|
condefects-python_data_1702
|
n, m = map(int, input().split())
grid = []
for _ in range(n):
row = input().strip()
grid.append(list(row))
ans = n
for bin in range(1 << n):
exist = [False] * m
cnt = 0
for i in range(n):
if (bin >> i) & 1:
cnt += 1
for j in range(m):
if grid[i][j] == "o":
exist[j] == True
if all(exist):
ans = min(ans, cnt)
print(ans)
n, m = map(int, input().split())
grid = []
for _ in range(n):
row = input().strip()
grid.append(list(row))
ans = n
for bin in range(1 << n):
exist = [False] * m
cnt = 0
for i in range(n):
if (bin >> i) & 1:
cnt += 1
for j in range(m):
if grid[i][j] == "o":
exist[j] = True
if all(exist):
ans = min(ans, cnt)
print(ans)
|
ConDefects/ConDefects/Code/abc358_c/Python/54942631
|
condefects-python_data_1703
|
import sys
sys.setrecursionlimit(9999)
N,M=map(int,input().split())
con=[[] for _ in range(N)]
for i in range(M):
A,B,V=map(str,input().split())
A,B,V=int(A)-1,int(B)-1,1 if V=="(" else -1
con[A].append((B,V))#(終点、±)のタプル
inc,dec=False,False
go =[False for _ in range(N)]
back=[False for _ in range(N)]
pm =[set() for _ in range(N)]
roop=[0 for _ in range(N)]
def DFS(i,dfs_pm):
global inc,dec
if go[i] and not back[i]:
if roop[i]<dfs_pm : inc=True
if dfs_pm<roop[i] : dec=True
else:
if dfs_pm not in pm[i]:
pm[i].add(dfs_pm)
go[i]=True
back[i]=False
roop[i]=dfs_pm
for g,v in con[i]:
DFS(g,dfs_pm+v)
back[i]=True
DFS(0,0)
import sys
sys.setrecursionlimit(9999)
N,M=map(int,input().split())
con=[[] for _ in range(N)]
for i in range(M):
A,B,V=map(str,input().split())
A,B,V=int(A)-1,int(B)-1,1 if V=="(" else -1
con[A].append((B,V))#(終点、±)のタプル
inc,dec=False,False
go =[False for _ in range(N)]
back=[False for _ in range(N)]
pm =[set() for _ in range(N)]
roop=[0 for _ in range(N)]
def DFS(i,dfs_pm):
global inc,dec
if go[i] and not back[i]:
if roop[i]<dfs_pm : inc=True
if dfs_pm<roop[i] : dec=True
else:
if dfs_pm not in pm[i]:
pm[i].add(dfs_pm)
go[i]=True
back[i]=False
roop[i]=dfs_pm
for g,v in con[i]:
DFS(g,dfs_pm+v)
back[i]=True
DFS(0,0)
if inc and dec or not inc and not dec : print("Yes")
else : print("No")
|
ConDefects/ConDefects/Code/arc173_d/Python/52512786
|
condefects-python_data_1704
|
MOD = 998244353
def solve(h, w, s_list):
count_y = 0
for s in s_list:
count_y += s.count("Y")
if count_y % 2 == 1:
return 0
count_y //= 2
candidates = []
for i in range(1, 2002):
if i * i > count_y:
break
if count_y % i == 0:
candidates.append(i)
if i * i < count_y:
candidates.append(count_y // i)
# 2-dim cum sum
count_y_cum = [[0] * w for _ in range(h)]
if s_list[0][0] == "Y":
count_y_cum[0][0] = 1
else:
count_y_cum[0][0] = 0
for i in range(1, h):
if s_list[i][0] == "Y":
count_y_cum[i][0] = count_y_cum[i - 1][0] + 1
else:
count_y_cum[i][0] = count_y_cum[i - 1][0]
for j in range(1, w):
if s_list[0][j] == "Y":
count_y_cum[0][j] = count_y_cum[0][j - 1] + 1
else:
count_y_cum[0][j] = count_y_cum[0][j - 1]
for i in range(1, h):
for j in range(1, w):
count_y_cum[i][j] = count_y_cum[i][j - 1] + count_y_cum[i - 1][j] - count_y_cum[i - 1][j - 1]
if s_list[i][j] == "Y":
count_y_cum[i][j] += 1
res = 0
for p in candidates:
q = count_y // p
if p > h or q > w:
continue
r = 1
free = 0
target = 0
h_list = []
for i in range(h):
if count_y_cum[i][w - 1] == target:
free += 1
elif count_y_cum[i][w - 1] == target + 2 * q:
if 0 < target < 2 * count_y - 2 * q:
r *= free
r %= MOD
target += 2 * q
free = 1
h_list.append(i)
free = 0
target = 0
w_list = []
for j in range(w):
if count_y_cum[h - 1][j] == target:
free += 1
elif count_y_cum[h - 1][j] == target + 2 * p:
if 0 < target <= 2 * count_y - 2 * p:
r *= free
r %= MOD
target += 2 * p
free = 1
w_list.append(j)
# print(p, q)
# print(h_list)
# print(w_list)
if len(h_list) != p or len(w_list) != q:
continue
# check
flag = 1
for i, h_ in enumerate(h_list):
for j, w_ in enumerate(w_list):
if count_y_cum[h_][w_] != (i + 1) * (j + 1) * 2:
flag = 0
if flag == 1:
# print(p, q, r)
res += r
res %= MOD
return res
def main():
h, w = map(int, input().split())
s_list = [input() for _ in range(h)]
res = solve(h, w, s_list)
print(res)
def test():
assert solve(2, 3, ["XYY", "YXY"]) == 2
assert solve(2, 3, ["XYX", "YYY"]) == 0
assert solve(2, 58, [
"YXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXY",
"YXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXY"
]) == 164036797
if __name__ == "__main__":
test()
main()
MOD = 998244353
def solve(h, w, s_list):
count_y = 0
for s in s_list:
count_y += s.count("Y")
if count_y % 2 == 1:
return 0
count_y //= 2
candidates = []
for i in range(1, 2002):
if i * i > count_y:
break
if count_y % i == 0:
candidates.append(i)
if i * i < count_y:
candidates.append(count_y // i)
# 2-dim cum sum
count_y_cum = [[0] * w for _ in range(h)]
if s_list[0][0] == "Y":
count_y_cum[0][0] = 1
else:
count_y_cum[0][0] = 0
for i in range(1, h):
if s_list[i][0] == "Y":
count_y_cum[i][0] = count_y_cum[i - 1][0] + 1
else:
count_y_cum[i][0] = count_y_cum[i - 1][0]
for j in range(1, w):
if s_list[0][j] == "Y":
count_y_cum[0][j] = count_y_cum[0][j - 1] + 1
else:
count_y_cum[0][j] = count_y_cum[0][j - 1]
for i in range(1, h):
for j in range(1, w):
count_y_cum[i][j] = count_y_cum[i][j - 1] + count_y_cum[i - 1][j] - count_y_cum[i - 1][j - 1]
if s_list[i][j] == "Y":
count_y_cum[i][j] += 1
res = 0
for p in candidates:
q = count_y // p
if p > h or q > w:
continue
r = 1
free = 0
target = 0
h_list = []
for i in range(h):
if count_y_cum[i][w - 1] == target:
free += 1
elif count_y_cum[i][w - 1] == target + 2 * q:
if 0 < target <= 2 * count_y - 2 * q:
r *= free
r %= MOD
target += 2 * q
free = 1
h_list.append(i)
free = 0
target = 0
w_list = []
for j in range(w):
if count_y_cum[h - 1][j] == target:
free += 1
elif count_y_cum[h - 1][j] == target + 2 * p:
if 0 < target <= 2 * count_y - 2 * p:
r *= free
r %= MOD
target += 2 * p
free = 1
w_list.append(j)
# print(p, q)
# print(h_list)
# print(w_list)
if len(h_list) != p or len(w_list) != q:
continue
# check
flag = 1
for i, h_ in enumerate(h_list):
for j, w_ in enumerate(w_list):
if count_y_cum[h_][w_] != (i + 1) * (j + 1) * 2:
flag = 0
if flag == 1:
# print(p, q, r)
res += r
res %= MOD
return res
def main():
h, w = map(int, input().split())
s_list = [input() for _ in range(h)]
res = solve(h, w, s_list)
print(res)
def test():
assert solve(2, 3, ["XYY", "YXY"]) == 2
assert solve(2, 3, ["XYX", "YYY"]) == 0
assert solve(2, 58, [
"YXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXY",
"YXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXYXXY"
]) == 164036797
if __name__ == "__main__":
test()
main()
|
ConDefects/ConDefects/Code/arc157_d/Python/39202960
|
condefects-python_data_1705
|
from itertools import groupby
MOD = 998244353
INF = MOD
H, W = map(int, input().split())
Ss = [input() for _ in range(H)]
if not any("Y" in S for S in Ss):
print(pow(2, H - 1, MOD) * pow(2, W - 1, MOD) % MOD)
exit()
lef_trim = 0
while "Y" not in Ss[lef_trim]:
lef_trim += 1
rig_trim = H
while "Y" not in Ss[rig_trim - 1]:
rig_trim -= 1
Ss = Ss[lef_trim:rig_trim]
H = rig_trim - lef_trim
csum = [[0] * (W + 1) for _ in range(H + 1)]
for i in range(H):
for j in range(W):
csum[i + 1][j + 1] = int(Ss[i][j] == "Y")
for i in range(H + 1):
for j in range(W):
csum[i][j + 1] += csum[i][j]
for i in range(H):
for j in range(W + 1):
csum[i + 1][j] += csum[i][j]
def get(i_begin, i_end, j_begin, j_end):
return (
csum[i_end][j_end]
- csum[i_end][j_begin]
- csum[i_begin][j_end]
+ csum[i_begin][j_begin]
)
# print(Ss)
row_counts = [S.count("Y") for S in Ss]
all_count = sum(row_counts)
first_row_count = 0
cut_counts = set()
for first_row_length in range(H):
if row_counts[first_row_length] > 0:
first_row_count += row_counts[first_row_length]
if first_row_count % 2 == 0 and all_count % first_row_count == 0:
cut_counts.add(first_row_count)
# print(cut_counts)
answer = 0
for row_count in cut_counts:
fail = False
edge_points = [0]
row_csum = 0
factor = 1
length = 0
for i in range(H):
row_csum += row_counts[i]
if length > 0:
if row_csum:
factor *= length
factor %= MOD
length = 0
else:
length += 1
if row_csum > row_count:
fail = True
break
elif row_csum == row_count:
edge_points.append(i + 1)
row_csum = 0
length = 1
if row_csum or fail:
continue
col_cut_count = row_count // 2 - 1
lbs_among_row = [-INF] * col_cut_count
ubs_among_row = [INF] * col_cut_count
for i in range(len(edge_points) - 1):
lbs = []
ubs = []
i_begin = edge_points[i]
i_end = edge_points[i + 1]
count = 0
for j in range(W):
count += get(i_begin, i_end, j, j + 1)
if count and len(lbs) > len(ubs):
ubs.append(j)
if count > 2:
fail = True
break
elif count == 2:
count = 0
lbs.append(j + 1)
if fail:
break
lbs.pop()
# print(lbs, ubs, col_cut_count)
for i in range(col_cut_count):
lbs_among_row[i] = max(lbs_among_row[i], lbs[i])
ubs_among_row[i] = min(ubs_among_row[i], ubs[i])
if fail:
continue
col_cut_factor = 1
for i in range(col_cut_count):
col_cut_factor *= max(0, ubs_among_row[i] - lbs_among_row[i] + 1)
answer += factor * col_cut_factor % MOD
answer %= MOD
# print(row_count, edge_points, factor, col_cut_factor)
# print(lbs_among_row, ubs_among_row)
print(answer)
from itertools import groupby
MOD = 998244353
INF = MOD
H, W = map(int, input().split())
Ss = [input() for _ in range(H)]
if not any("Y" in S for S in Ss):
print(0)
exit()
lef_trim = 0
while "Y" not in Ss[lef_trim]:
lef_trim += 1
rig_trim = H
while "Y" not in Ss[rig_trim - 1]:
rig_trim -= 1
Ss = Ss[lef_trim:rig_trim]
H = rig_trim - lef_trim
csum = [[0] * (W + 1) for _ in range(H + 1)]
for i in range(H):
for j in range(W):
csum[i + 1][j + 1] = int(Ss[i][j] == "Y")
for i in range(H + 1):
for j in range(W):
csum[i][j + 1] += csum[i][j]
for i in range(H):
for j in range(W + 1):
csum[i + 1][j] += csum[i][j]
def get(i_begin, i_end, j_begin, j_end):
return (
csum[i_end][j_end]
- csum[i_end][j_begin]
- csum[i_begin][j_end]
+ csum[i_begin][j_begin]
)
# print(Ss)
row_counts = [S.count("Y") for S in Ss]
all_count = sum(row_counts)
first_row_count = 0
cut_counts = set()
for first_row_length in range(H):
if row_counts[first_row_length] > 0:
first_row_count += row_counts[first_row_length]
if first_row_count % 2 == 0 and all_count % first_row_count == 0:
cut_counts.add(first_row_count)
# print(cut_counts)
answer = 0
for row_count in cut_counts:
fail = False
edge_points = [0]
row_csum = 0
factor = 1
length = 0
for i in range(H):
row_csum += row_counts[i]
if length > 0:
if row_csum:
factor *= length
factor %= MOD
length = 0
else:
length += 1
if row_csum > row_count:
fail = True
break
elif row_csum == row_count:
edge_points.append(i + 1)
row_csum = 0
length = 1
if row_csum or fail:
continue
col_cut_count = row_count // 2 - 1
lbs_among_row = [-INF] * col_cut_count
ubs_among_row = [INF] * col_cut_count
for i in range(len(edge_points) - 1):
lbs = []
ubs = []
i_begin = edge_points[i]
i_end = edge_points[i + 1]
count = 0
for j in range(W):
count += get(i_begin, i_end, j, j + 1)
if count and len(lbs) > len(ubs):
ubs.append(j)
if count > 2:
fail = True
break
elif count == 2:
count = 0
lbs.append(j + 1)
if fail:
break
lbs.pop()
# print(lbs, ubs, col_cut_count)
for i in range(col_cut_count):
lbs_among_row[i] = max(lbs_among_row[i], lbs[i])
ubs_among_row[i] = min(ubs_among_row[i], ubs[i])
if fail:
continue
col_cut_factor = 1
for i in range(col_cut_count):
col_cut_factor *= max(0, ubs_among_row[i] - lbs_among_row[i] + 1)
answer += factor * col_cut_factor % MOD
answer %= MOD
# print(row_count, edge_points, factor, col_cut_factor)
# print(lbs_among_row, ubs_among_row)
print(answer)
|
ConDefects/ConDefects/Code/arc157_d/Python/39194356
|
condefects-python_data_1706
|
def divisors(M):
d=[]
i=1
while M>=i**2:
if M%i==0:
d.append(i)
if i**2!=M:
d.append(M//i)
i=i+1
return d
def popcount(x):
x = x - ((x >> 1) & 0x55555555)
x = (x & 0x33333333) + ((x >> 2) & 0x33333333)
x = (x + (x >> 4)) & 0x0f0f0f0f
x = x + (x >> 8)
x = x + (x >> 16)
return x & 0x0000007f
def eratosthenes(n):
res=[0 for i in range(n+1)]
prime=set([])
for i in range(2,n+1):
if not res[i]:
prime.add(i)
for j in range(1,n//i+1):
res[i*j]=1
return prime
def factorization(n):
res=[]
for p in prime:
if n%p==0:
while n%p==0:
n//=p
res.append(p)
if n!=1:
res.append(n)
return res
def euler_phi(n):
res = n
for x in range(2,n+1):
if x ** 2 > n:
break
if n%x==0:
res = res//x * (x-1)
while n%x==0:
n //= x
if n!=1:
res = res//n * (n-1)
return res
def ind(b,n):
res=0
while n%b==0:
res+=1
n//=b
return res
def isPrimeMR(n):
d = n - 1
d = d // (d & -d)
L = [2, 3, 5, 7, 11, 13, 17]
for a in L:
t = d
y = pow(a, t, n)
if y == 1: continue
while y != n - 1:
y = (y * y) % n
if y == 1 or t == n - 1: return 0
t <<= 1
return 1
def findFactorRho(n):
from math import gcd
m = 1 << n.bit_length() // 8
for c in range(1, 99):
f = lambda x: (x * x + c) % n
y, r, q, g = 2, 1, 1, 1
while g == 1:
x = y
for i in range(r):
y = f(y)
k = 0
while k < r and g == 1:
ys = y
for i in range(min(m, r - k)):
y = f(y)
q = q * abs(x - y) % n
g = gcd(q, n)
k += m
r <<= 1
if g == n:
g = 1
while g == 1:
ys = f(ys)
g = gcd(abs(x - ys), n)
if g < n:
if isPrimeMR(g): return g
elif isPrimeMR(n // g): return n // g
return findFactorRho(g)
def primeFactor(n):
i = 2
ret = {}
rhoFlg = 0
while i*i <= n:
k = 0
while n % i == 0:
n //= i
k += 1
if k: ret[i] = k
i += 1 + i % 2
if i == 101 and n >= 2 ** 20:
while n > 1:
if isPrimeMR(n):
ret[n], n = 1, 1
else:
rhoFlg = 1
j = findFactorRho(n)
k = 0
while n % j == 0:
n //= j
k += 1
ret[j] = k
if n > 1: ret[n] = 1
if rhoFlg: ret = {x: ret[x] for x in sorted(ret)}
return ret
def divisors(n):
res = [1]
prime = primeFactor(n)
for p in prime:
newres = []
for d in res:
for j in range(prime[p]+1):
newres.append(d*p**j)
res = newres
res.sort()
return res
def xorfactorial(num):
if num==0:
return 0
elif num==1:
return 1
elif num==2:
return 3
elif num==3:
return 0
else:
x=baseorder(num)
return (2**x)*((num-2**x+1)%2)+function(num-2**x)
def xorconv(n,X,Y):
if n==0:
res=[(X[0]*Y[0])%mod]
return res
x=[X[i]+X[i+2**(n-1)] for i in range(2**(n-1))]
y=[Y[i]+Y[i+2**(n-1)] for i in range(2**(n-1))]
z=[X[i]-X[i+2**(n-1)] for i in range(2**(n-1))]
w=[Y[i]-Y[i+2**(n-1)] for i in range(2**(n-1))]
res1=xorconv(n-1,x,y)
res2=xorconv(n-1,z,w)
former=[(res1[i]+res2[i])*inv for i in range(2**(n-1))]
latter=[(res1[i]-res2[i])*inv for i in range(2**(n-1))]
former=list(map(lambda x:x%mod,former))
latter=list(map(lambda x:x%mod,latter))
return former+latter
def merge_sort(A,B):
pos_A,pos_B = 0,0
n,m = len(A),len(B)
res = []
while pos_A < n and pos_B < m:
a,b = A[pos_A],B[pos_B]
if a < b:
res.append(a)
pos_A += 1
else:
res.append(b)
pos_B += 1
res += A[pos_A:]
res += B[pos_B:]
return res
class UnionFindVerSize():
def __init__(self, N):
self._parent = [n for n in range(0, N)]
self._size = [1] * N
self.group = N
def find_root(self, x):
if self._parent[x] == x: return x
self._parent[x] = self.find_root(self._parent[x])
stack = [x]
while self._parent[stack[-1]]!=stack[-1]:
stack.append(self._parent[stack[-1]])
for v in stack:
self._parent[v] = stack[-1]
return self._parent[x]
def unite(self, x, y):
gx = self.find_root(x)
gy = self.find_root(y)
if gx == gy: return
self.group -= 1
if self._size[gx] < self._size[gy]:
self._parent[gx] = gy
self._size[gy] += self._size[gx]
else:
self._parent[gy] = gx
self._size[gx] += self._size[gy]
def get_size(self, x):
return self._size[self.find_root(x)]
def is_same_group(self, x, y):
return self.find_root(x) == self.find_root(y)
class WeightedUnionFind():
def __init__(self,N):
self.parent = [i for i in range(N)]
self.size = [1 for i in range(N)]
self.val = [0 for i in range(N)]
self.flag = True
self.edge = [[] for i in range(N)]
def dfs(self,v,pv):
stack = [(v,pv)]
new_parent = self.parent[pv]
while stack:
v,pv = stack.pop()
self.parent[v] = new_parent
for nv,w in self.edge[v]:
if nv!=pv:
self.val[nv] = self.val[v] + w
stack.append((nv,v))
def unite(self,x,y,w):
if not self.flag:
return
if self.parent[x]==self.parent[y]:
self.flag = (self.val[x] - self.val[y] == w)
return
if self.size[self.parent[x]]>self.size[self.parent[y]]:
self.edge[x].append((y,-w))
self.edge[y].append((x,w))
self.size[x] += self.size[y]
self.val[y] = self.val[x] - w
self.dfs(y,x)
else:
self.edge[x].append((y,-w))
self.edge[y].append((x,w))
self.size[y] += self.size[x]
self.val[x] = self.val[y] + w
self.dfs(x,y)
class Dijkstra():
class Edge():
def __init__(self, _to, _cost):
self.to = _to
self.cost = _cost
def __init__(self, V):
self.G = [[] for i in range(V)]
self._E = 0
self._V = V
@property
def E(self):
return self._E
@property
def V(self):
return self._V
def add_edge(self, _from, _to, _cost):
self.G[_from].append(self.Edge(_to, _cost))
self._E += 1
def shortest_path(self, s):
import heapq
que = []
d = [10**15] * self.V
d[s] = 0
heapq.heappush(que, (0, s))
while len(que) != 0:
cost, v = heapq.heappop(que)
if d[v] < cost: continue
for i in range(len(self.G[v])):
e = self.G[v][i]
if d[e.to] > d[v] + e.cost:
d[e.to] = d[v] + e.cost
heapq.heappush(que, (d[e.to], e.to))
return d
#Z[i]:length of the longest list starting from S[i] which is also a prefix of S
#O(|S|)
def Z_algorithm(s):
N = len(s)
Z_alg = [0]*N
Z_alg[0] = N
i = 1
j = 0
while i < N:
while i+j < N and s[j] == s[i+j]:
j += 1
Z_alg[i] = j
if j == 0:
i += 1
continue
k = 1
while i+k < N and k + Z_alg[k]<j:
Z_alg[i+k] = Z_alg[k]
k += 1
i += k
j -= k
return Z_alg
class BIT():
def __init__(self,n,mod=0):
self.BIT = [0]*(n+1)
self.num = n
self.mod = mod
def query(self,idx):
res_sum = 0
mod = self.mod
while idx > 0:
res_sum += self.BIT[idx]
if mod:
res_sum %= mod
idx -= idx&(-idx)
return res_sum
#Ai += x O(logN)
def update(self,idx,x):
mod = self.mod
while idx <= self.num:
self.BIT[idx] += x
if mod:
self.BIT[idx] %= mod
idx += idx&(-idx)
return
class dancinglink():
def __init__(self,n,debug=False):
self.n = n
self.debug = debug
self._left = [i-1 for i in range(n)]
self._right = [i+1 for i in range(n)]
self.exist = [True for i in range(n)]
def pop(self,k):
if self.debug:
assert self.exist[k]
L = self._left[k]
R = self._right[k]
if L!=-1:
if R!=self.n:
self._right[L],self._left[R] = R,L
else:
self._right[L] = self.n
elif R!=self.n:
self._left[R] = -1
self.exist[k] = False
def left(self,idx,k=1):
if self.debug:
assert self.exist[idx]
res = idx
while k:
res = self._left[res]
if res==-1:
break
k -= 1
return res
def right(self,idx,k=1):
if self.debug:
assert self.exist[idx]
res = idx
while k:
res = self._right[res]
if res==self.n:
break
k -= 1
return res
class SparseTable():
def __init__(self,A,merge_func,ide_ele):
N = len(A)
self.merge_func = merge_func
self.lg = [0]*(N + 1)
for i in range(2, N+1):
self.lg[i] = self.lg[i >> 1] + 1
self.pow_2 = [pow(2,i) for i in range(20)]
self.table = [None]*(self.lg[N] + 1)
st0 = self.table[0] = [a for a in A]
b = 1
for i in range(self.lg[N]):
st0 = self.table[i+1] = [self.merge_func(u,v) for u, v in zip(st0, st0[b:])]
b <<= 1
def query(self,s,t):
b = t-s+1
m = self.lg[b]
return self.merge_func(self.table[m][s],self.table[m][t-self.pow_2[m]+1])
class BinaryTrie:
class node:
def __init__(self,val):
self.left = None
self.right = None
self.max = val
def __init__(self):
self.root = self.node(-10**15)
def append(self,key,val):
pos = self.root
for i in range(29,-1,-1):
pos.max = max(pos.max,val)
if key>>i & 1:
if pos.right is None:
pos.right = self.node(val)
pos = pos.right
else:
pos = pos.right
else:
if pos.left is None:
pos.left = self.node(val)
pos = pos.left
else:
pos = pos.left
pos.max = max(pos.max,val)
def search(self,M,xor):
res = -10**15
pos = self.root
for i in range(29,-1,-1):
if pos is None:
break
if M>>i & 1:
if xor>>i & 1:
if pos.right:
res = max(res,pos.right.max)
pos = pos.left
else:
if pos.left:
res = max(res,pos.left.max)
pos = pos.right
else:
if xor>>i & 1:
pos = pos.right
else:
pos = pos.left
if pos:
res = max(res,pos.max)
return res
def solveequation(edge,ans,n,m):
#edge=[[to,dire,id]...]
def dfs(v):
used[v]=True
r=ans[v]
for to,dire,id in edge[v]:
if used[to]:
continue
y=dfs(to)
if dire==-1:
x[id]=y
else:
x[id]=-y
r+=y
return r
x=[0]*m
used=[False]*n
for v in range(n):
if used[v]:
continue
y = dfs(v)
if y!=0:
return False
return x
class slope_trick():
def __init__(self):
self.L = [10**17]
self.R = [10**17]
self.min_f = 0
self.x_left = 0
self.x_right = 0
def add_right(self,a):
a -= self.x_left
l0 = -self.L[0]
self.min_f = self.min_f + max(0,l0-a)
if l0 <= a:
a += self.x_left
a -= self.x_right
heappush(self.R,a)
else:
heappush(self.L,-a)
a = -heappop(self.L)
a += self.x_left
a -= self.x_right
heappush(self.R,a)
#self.min_f = self.min_f + max(0,l0-a)
def add_left(self,a):
a -= self.x_right
r0 = self.R[0]
self.min_f = self.min_f + max(0,a-r0)
if a <= r0:
a += self.x_right
a -= self.x_left
heappush(self.L,-a)
else:
heappush(self.R,a)
a = heappop(self.R)
a += self.x_right
a -= self.x_left
heappush(self.L,-a)
#self.min_f = self.min_f + max(0,a-r0)
def add_abs(self,a):
self.add_left(a)
self.add_right(a)
def change_min_slide(self,a,b):
self.x_left += a
self.x_right += b
def get_val(self,x):
L = [-l+self.x_left for l in self.L]
L.sort()
R = [r+self.x_right for r in self.R]
R.sort()
res = self.min_f
if 0 < L[-1]:
L = L[::-1]
n = len(L)
for i in range(n):
c0 = L[i]
c1 = L[i+1]
if c1 <= x <= c0:
res += (i+1) * (c0-x)
break
else:
res += (i+1) * (c0-c1)
return res
elif L[-1] <= x <= R[0]:
return res
else:
n = len(R)
for i in range(n):
c0 = R[i]
c1 = R[i+1]
if c0 <= x <= c1:
res += (i+1) * (x-c0)
break
else:
res += (i+1) * (c1-c0)
return res
class SegmentTree:
def __init__(self, init_val, segfunc, ide_ele):
n = len(init_val)
self.segfunc = segfunc
self.ide_ele = ide_ele
self.num = 1 << (n - 1).bit_length()
self.tree = [ide_ele] * 2 * self.num
self.size = n
for i in range(n):
self.tree[self.num + i] = init_val[i]
for i in range(self.num - 1, 0, -1):
self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])
def update(self, k, x):
k += self.num
self.tree[k] = x
while k > 1:
k >>= 1
self.tree[k] = self.segfunc(self.tree[2*k], self.tree[2*k+1])
def query(self, l, r):
if r==self.size:
r = self.num
res = self.ide_ele
l += self.num
r += self.num
right = []
while l < r:
if l & 1:
res = self.segfunc(res, self.tree[l])
l += 1
if r & 1:
right.append(self.tree[r-1])
l >>= 1
r >>= 1
for e in right[::-1]:
res = self.segfunc(res,e)
return res
def bisect_l(self,l,r,x):
l += self.num
r += self.num
Lmin = -1
Rmin = -1
while l<r:
if l & 1:
if self.tree[l] <= x and Lmin==-1:
Lmin = l
l += 1
if r & 1:
if self.tree[r-1] <=x:
Rmin = r-1
l >>= 1
r >>= 1
if Lmin != -1:
pos = Lmin
while pos<self.num:
if self.tree[2 * pos] <=x:
pos = 2 * pos
else:
pos = 2 * pos +1
return pos-self.num
elif Rmin != -1:
pos = Rmin
while pos<self.num:
if self.tree[2 * pos] <=x:
pos = 2 * pos
else:
pos = 2 * pos +1
return pos-self.num
else:
return -1
import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
mod = 998244353
H,W = mi()
S = [input() for i in range(H)]
cnt = [[0 for j in range(W+1)] for i in range(H+1)]
row = [0 for i in range(H+1)]
column = [0 for i in range(W+1)]
for i in range(H+1):
for j in range(W+1):
if 1 <= i and 1 <= j:
if S[i-1][j-1]=="Y":
cnt[i][j] += 1
row[i] += 1
column[j] += 1
cnt[i][j] -= cnt[i-1][j-1]
if i!=0:
cnt[i][j] += cnt[i-1][j]
if j!=0:
cnt[i][j] += cnt[i][j-1]
#print(cnt)
for i in range(H):
row[i+1] += row[i]
for j in range(W):
column[j+1] += column[j]
#print(row,column)
K = cnt[H][W]
res = 0
for p in range(1,W+1):
if K % (2*p):
continue
q = K // (2*p)
#print(p,q)
tmp = 1
c_idx = [0]
c = 1
for i in range(1,p+1):
while c <= W and column[c] < i*2*q:
c += 1
if c == W+1:
tmp = 0
break
c_idx.append(c)
k = 0
while c <= W and column[c]==i*2*q:
k += 1
c += 1
if i!=p:
tmp = tmp * k % mod
r_idx = [0]
r = 1
for i in range(1,q+1):
while r <= H and row[r] < i*2*p:
r += 1
if r == H+1:
tmp = 0
break
if row[r] != i*2*p:
tmp = 0
break
r_idx.append(r)
k = 0
while r <= H and row[r] == i*2*p:
k += 1
r += 1
if i!=q:
tmp = tmp * k % mod
#print("rc",r_idx,c_idx)
for i,r in enumerate(r_idx[1:q+1],1):
for j,c in enumerate(c_idx[1:p+1],1):
pr,pc = r_idx[i-1],c_idx[j-1]
check = cnt[r][c] - cnt[pr][c] - cnt[r][pc] + cnt[pr][pc]
if check!=2:
tmp = 0
res += tmp
res %= mod
print(res)
def divisors(M):
d=[]
i=1
while M>=i**2:
if M%i==0:
d.append(i)
if i**2!=M:
d.append(M//i)
i=i+1
return d
def popcount(x):
x = x - ((x >> 1) & 0x55555555)
x = (x & 0x33333333) + ((x >> 2) & 0x33333333)
x = (x + (x >> 4)) & 0x0f0f0f0f
x = x + (x >> 8)
x = x + (x >> 16)
return x & 0x0000007f
def eratosthenes(n):
res=[0 for i in range(n+1)]
prime=set([])
for i in range(2,n+1):
if not res[i]:
prime.add(i)
for j in range(1,n//i+1):
res[i*j]=1
return prime
def factorization(n):
res=[]
for p in prime:
if n%p==0:
while n%p==0:
n//=p
res.append(p)
if n!=1:
res.append(n)
return res
def euler_phi(n):
res = n
for x in range(2,n+1):
if x ** 2 > n:
break
if n%x==0:
res = res//x * (x-1)
while n%x==0:
n //= x
if n!=1:
res = res//n * (n-1)
return res
def ind(b,n):
res=0
while n%b==0:
res+=1
n//=b
return res
def isPrimeMR(n):
d = n - 1
d = d // (d & -d)
L = [2, 3, 5, 7, 11, 13, 17]
for a in L:
t = d
y = pow(a, t, n)
if y == 1: continue
while y != n - 1:
y = (y * y) % n
if y == 1 or t == n - 1: return 0
t <<= 1
return 1
def findFactorRho(n):
from math import gcd
m = 1 << n.bit_length() // 8
for c in range(1, 99):
f = lambda x: (x * x + c) % n
y, r, q, g = 2, 1, 1, 1
while g == 1:
x = y
for i in range(r):
y = f(y)
k = 0
while k < r and g == 1:
ys = y
for i in range(min(m, r - k)):
y = f(y)
q = q * abs(x - y) % n
g = gcd(q, n)
k += m
r <<= 1
if g == n:
g = 1
while g == 1:
ys = f(ys)
g = gcd(abs(x - ys), n)
if g < n:
if isPrimeMR(g): return g
elif isPrimeMR(n // g): return n // g
return findFactorRho(g)
def primeFactor(n):
i = 2
ret = {}
rhoFlg = 0
while i*i <= n:
k = 0
while n % i == 0:
n //= i
k += 1
if k: ret[i] = k
i += 1 + i % 2
if i == 101 and n >= 2 ** 20:
while n > 1:
if isPrimeMR(n):
ret[n], n = 1, 1
else:
rhoFlg = 1
j = findFactorRho(n)
k = 0
while n % j == 0:
n //= j
k += 1
ret[j] = k
if n > 1: ret[n] = 1
if rhoFlg: ret = {x: ret[x] for x in sorted(ret)}
return ret
def divisors(n):
res = [1]
prime = primeFactor(n)
for p in prime:
newres = []
for d in res:
for j in range(prime[p]+1):
newres.append(d*p**j)
res = newres
res.sort()
return res
def xorfactorial(num):
if num==0:
return 0
elif num==1:
return 1
elif num==2:
return 3
elif num==3:
return 0
else:
x=baseorder(num)
return (2**x)*((num-2**x+1)%2)+function(num-2**x)
def xorconv(n,X,Y):
if n==0:
res=[(X[0]*Y[0])%mod]
return res
x=[X[i]+X[i+2**(n-1)] for i in range(2**(n-1))]
y=[Y[i]+Y[i+2**(n-1)] for i in range(2**(n-1))]
z=[X[i]-X[i+2**(n-1)] for i in range(2**(n-1))]
w=[Y[i]-Y[i+2**(n-1)] for i in range(2**(n-1))]
res1=xorconv(n-1,x,y)
res2=xorconv(n-1,z,w)
former=[(res1[i]+res2[i])*inv for i in range(2**(n-1))]
latter=[(res1[i]-res2[i])*inv for i in range(2**(n-1))]
former=list(map(lambda x:x%mod,former))
latter=list(map(lambda x:x%mod,latter))
return former+latter
def merge_sort(A,B):
pos_A,pos_B = 0,0
n,m = len(A),len(B)
res = []
while pos_A < n and pos_B < m:
a,b = A[pos_A],B[pos_B]
if a < b:
res.append(a)
pos_A += 1
else:
res.append(b)
pos_B += 1
res += A[pos_A:]
res += B[pos_B:]
return res
class UnionFindVerSize():
def __init__(self, N):
self._parent = [n for n in range(0, N)]
self._size = [1] * N
self.group = N
def find_root(self, x):
if self._parent[x] == x: return x
self._parent[x] = self.find_root(self._parent[x])
stack = [x]
while self._parent[stack[-1]]!=stack[-1]:
stack.append(self._parent[stack[-1]])
for v in stack:
self._parent[v] = stack[-1]
return self._parent[x]
def unite(self, x, y):
gx = self.find_root(x)
gy = self.find_root(y)
if gx == gy: return
self.group -= 1
if self._size[gx] < self._size[gy]:
self._parent[gx] = gy
self._size[gy] += self._size[gx]
else:
self._parent[gy] = gx
self._size[gx] += self._size[gy]
def get_size(self, x):
return self._size[self.find_root(x)]
def is_same_group(self, x, y):
return self.find_root(x) == self.find_root(y)
class WeightedUnionFind():
def __init__(self,N):
self.parent = [i for i in range(N)]
self.size = [1 for i in range(N)]
self.val = [0 for i in range(N)]
self.flag = True
self.edge = [[] for i in range(N)]
def dfs(self,v,pv):
stack = [(v,pv)]
new_parent = self.parent[pv]
while stack:
v,pv = stack.pop()
self.parent[v] = new_parent
for nv,w in self.edge[v]:
if nv!=pv:
self.val[nv] = self.val[v] + w
stack.append((nv,v))
def unite(self,x,y,w):
if not self.flag:
return
if self.parent[x]==self.parent[y]:
self.flag = (self.val[x] - self.val[y] == w)
return
if self.size[self.parent[x]]>self.size[self.parent[y]]:
self.edge[x].append((y,-w))
self.edge[y].append((x,w))
self.size[x] += self.size[y]
self.val[y] = self.val[x] - w
self.dfs(y,x)
else:
self.edge[x].append((y,-w))
self.edge[y].append((x,w))
self.size[y] += self.size[x]
self.val[x] = self.val[y] + w
self.dfs(x,y)
class Dijkstra():
class Edge():
def __init__(self, _to, _cost):
self.to = _to
self.cost = _cost
def __init__(self, V):
self.G = [[] for i in range(V)]
self._E = 0
self._V = V
@property
def E(self):
return self._E
@property
def V(self):
return self._V
def add_edge(self, _from, _to, _cost):
self.G[_from].append(self.Edge(_to, _cost))
self._E += 1
def shortest_path(self, s):
import heapq
que = []
d = [10**15] * self.V
d[s] = 0
heapq.heappush(que, (0, s))
while len(que) != 0:
cost, v = heapq.heappop(que)
if d[v] < cost: continue
for i in range(len(self.G[v])):
e = self.G[v][i]
if d[e.to] > d[v] + e.cost:
d[e.to] = d[v] + e.cost
heapq.heappush(que, (d[e.to], e.to))
return d
#Z[i]:length of the longest list starting from S[i] which is also a prefix of S
#O(|S|)
def Z_algorithm(s):
N = len(s)
Z_alg = [0]*N
Z_alg[0] = N
i = 1
j = 0
while i < N:
while i+j < N and s[j] == s[i+j]:
j += 1
Z_alg[i] = j
if j == 0:
i += 1
continue
k = 1
while i+k < N and k + Z_alg[k]<j:
Z_alg[i+k] = Z_alg[k]
k += 1
i += k
j -= k
return Z_alg
class BIT():
def __init__(self,n,mod=0):
self.BIT = [0]*(n+1)
self.num = n
self.mod = mod
def query(self,idx):
res_sum = 0
mod = self.mod
while idx > 0:
res_sum += self.BIT[idx]
if mod:
res_sum %= mod
idx -= idx&(-idx)
return res_sum
#Ai += x O(logN)
def update(self,idx,x):
mod = self.mod
while idx <= self.num:
self.BIT[idx] += x
if mod:
self.BIT[idx] %= mod
idx += idx&(-idx)
return
class dancinglink():
def __init__(self,n,debug=False):
self.n = n
self.debug = debug
self._left = [i-1 for i in range(n)]
self._right = [i+1 for i in range(n)]
self.exist = [True for i in range(n)]
def pop(self,k):
if self.debug:
assert self.exist[k]
L = self._left[k]
R = self._right[k]
if L!=-1:
if R!=self.n:
self._right[L],self._left[R] = R,L
else:
self._right[L] = self.n
elif R!=self.n:
self._left[R] = -1
self.exist[k] = False
def left(self,idx,k=1):
if self.debug:
assert self.exist[idx]
res = idx
while k:
res = self._left[res]
if res==-1:
break
k -= 1
return res
def right(self,idx,k=1):
if self.debug:
assert self.exist[idx]
res = idx
while k:
res = self._right[res]
if res==self.n:
break
k -= 1
return res
class SparseTable():
def __init__(self,A,merge_func,ide_ele):
N = len(A)
self.merge_func = merge_func
self.lg = [0]*(N + 1)
for i in range(2, N+1):
self.lg[i] = self.lg[i >> 1] + 1
self.pow_2 = [pow(2,i) for i in range(20)]
self.table = [None]*(self.lg[N] + 1)
st0 = self.table[0] = [a for a in A]
b = 1
for i in range(self.lg[N]):
st0 = self.table[i+1] = [self.merge_func(u,v) for u, v in zip(st0, st0[b:])]
b <<= 1
def query(self,s,t):
b = t-s+1
m = self.lg[b]
return self.merge_func(self.table[m][s],self.table[m][t-self.pow_2[m]+1])
class BinaryTrie:
class node:
def __init__(self,val):
self.left = None
self.right = None
self.max = val
def __init__(self):
self.root = self.node(-10**15)
def append(self,key,val):
pos = self.root
for i in range(29,-1,-1):
pos.max = max(pos.max,val)
if key>>i & 1:
if pos.right is None:
pos.right = self.node(val)
pos = pos.right
else:
pos = pos.right
else:
if pos.left is None:
pos.left = self.node(val)
pos = pos.left
else:
pos = pos.left
pos.max = max(pos.max,val)
def search(self,M,xor):
res = -10**15
pos = self.root
for i in range(29,-1,-1):
if pos is None:
break
if M>>i & 1:
if xor>>i & 1:
if pos.right:
res = max(res,pos.right.max)
pos = pos.left
else:
if pos.left:
res = max(res,pos.left.max)
pos = pos.right
else:
if xor>>i & 1:
pos = pos.right
else:
pos = pos.left
if pos:
res = max(res,pos.max)
return res
def solveequation(edge,ans,n,m):
#edge=[[to,dire,id]...]
def dfs(v):
used[v]=True
r=ans[v]
for to,dire,id in edge[v]:
if used[to]:
continue
y=dfs(to)
if dire==-1:
x[id]=y
else:
x[id]=-y
r+=y
return r
x=[0]*m
used=[False]*n
for v in range(n):
if used[v]:
continue
y = dfs(v)
if y!=0:
return False
return x
class slope_trick():
def __init__(self):
self.L = [10**17]
self.R = [10**17]
self.min_f = 0
self.x_left = 0
self.x_right = 0
def add_right(self,a):
a -= self.x_left
l0 = -self.L[0]
self.min_f = self.min_f + max(0,l0-a)
if l0 <= a:
a += self.x_left
a -= self.x_right
heappush(self.R,a)
else:
heappush(self.L,-a)
a = -heappop(self.L)
a += self.x_left
a -= self.x_right
heappush(self.R,a)
#self.min_f = self.min_f + max(0,l0-a)
def add_left(self,a):
a -= self.x_right
r0 = self.R[0]
self.min_f = self.min_f + max(0,a-r0)
if a <= r0:
a += self.x_right
a -= self.x_left
heappush(self.L,-a)
else:
heappush(self.R,a)
a = heappop(self.R)
a += self.x_right
a -= self.x_left
heappush(self.L,-a)
#self.min_f = self.min_f + max(0,a-r0)
def add_abs(self,a):
self.add_left(a)
self.add_right(a)
def change_min_slide(self,a,b):
self.x_left += a
self.x_right += b
def get_val(self,x):
L = [-l+self.x_left for l in self.L]
L.sort()
R = [r+self.x_right for r in self.R]
R.sort()
res = self.min_f
if 0 < L[-1]:
L = L[::-1]
n = len(L)
for i in range(n):
c0 = L[i]
c1 = L[i+1]
if c1 <= x <= c0:
res += (i+1) * (c0-x)
break
else:
res += (i+1) * (c0-c1)
return res
elif L[-1] <= x <= R[0]:
return res
else:
n = len(R)
for i in range(n):
c0 = R[i]
c1 = R[i+1]
if c0 <= x <= c1:
res += (i+1) * (x-c0)
break
else:
res += (i+1) * (c1-c0)
return res
class SegmentTree:
def __init__(self, init_val, segfunc, ide_ele):
n = len(init_val)
self.segfunc = segfunc
self.ide_ele = ide_ele
self.num = 1 << (n - 1).bit_length()
self.tree = [ide_ele] * 2 * self.num
self.size = n
for i in range(n):
self.tree[self.num + i] = init_val[i]
for i in range(self.num - 1, 0, -1):
self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])
def update(self, k, x):
k += self.num
self.tree[k] = x
while k > 1:
k >>= 1
self.tree[k] = self.segfunc(self.tree[2*k], self.tree[2*k+1])
def query(self, l, r):
if r==self.size:
r = self.num
res = self.ide_ele
l += self.num
r += self.num
right = []
while l < r:
if l & 1:
res = self.segfunc(res, self.tree[l])
l += 1
if r & 1:
right.append(self.tree[r-1])
l >>= 1
r >>= 1
for e in right[::-1]:
res = self.segfunc(res,e)
return res
def bisect_l(self,l,r,x):
l += self.num
r += self.num
Lmin = -1
Rmin = -1
while l<r:
if l & 1:
if self.tree[l] <= x and Lmin==-1:
Lmin = l
l += 1
if r & 1:
if self.tree[r-1] <=x:
Rmin = r-1
l >>= 1
r >>= 1
if Lmin != -1:
pos = Lmin
while pos<self.num:
if self.tree[2 * pos] <=x:
pos = 2 * pos
else:
pos = 2 * pos +1
return pos-self.num
elif Rmin != -1:
pos = Rmin
while pos<self.num:
if self.tree[2 * pos] <=x:
pos = 2 * pos
else:
pos = 2 * pos +1
return pos-self.num
else:
return -1
import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
mod = 998244353
H,W = mi()
S = [input() for i in range(H)]
cnt = [[0 for j in range(W+1)] for i in range(H+1)]
row = [0 for i in range(H+1)]
column = [0 for i in range(W+1)]
for i in range(H+1):
for j in range(W+1):
if 1 <= i and 1 <= j:
if S[i-1][j-1]=="Y":
cnt[i][j] += 1
row[i] += 1
column[j] += 1
cnt[i][j] -= cnt[i-1][j-1]
if i!=0:
cnt[i][j] += cnt[i-1][j]
if j!=0:
cnt[i][j] += cnt[i][j-1]
#print(cnt)
for i in range(H):
row[i+1] += row[i]
for j in range(W):
column[j+1] += column[j]
#print(row,column)
K = cnt[H][W]
if K == 0:
exit(print(0))
res = 0
for p in range(1,W+1):
if K % (2*p):
continue
q = K // (2*p)
#print(p,q)
tmp = 1
c_idx = [0]
c = 1
for i in range(1,p+1):
while c <= W and column[c] < i*2*q:
c += 1
if c == W+1:
tmp = 0
break
c_idx.append(c)
k = 0
while c <= W and column[c]==i*2*q:
k += 1
c += 1
if i!=p:
tmp = tmp * k % mod
r_idx = [0]
r = 1
for i in range(1,q+1):
while r <= H and row[r] < i*2*p:
r += 1
if r == H+1:
tmp = 0
break
if row[r] != i*2*p:
tmp = 0
break
r_idx.append(r)
k = 0
while r <= H and row[r] == i*2*p:
k += 1
r += 1
if i!=q:
tmp = tmp * k % mod
#print("rc",r_idx,c_idx)
for i,r in enumerate(r_idx[1:q+1],1):
for j,c in enumerate(c_idx[1:p+1],1):
pr,pc = r_idx[i-1],c_idx[j-1]
check = cnt[r][c] - cnt[pr][c] - cnt[r][pc] + cnt[pr][pc]
if check!=2:
tmp = 0
res += tmp
res %= mod
print(res)
|
ConDefects/ConDefects/Code/arc157_d/Python/39193714
|
condefects-python_data_1707
|
H,W = map(int,input().split())
S = [list(input()) for i in range(H)]
cnth = []
cntw = []
for i in range(H):
cnt = 0
for j in range(W):
if S[i][j]=="Y":
cnt+=1
cnth.append(cnt)
for j in range(W):
cnt=0
for i in range(H):
if S[i][j]=="Y":
cnt+=1
cntw.append(cnt)
countx = 0
for i in range(H):
for j in range(W):
if S[i][j]=="Y":
countx+=1
mod = 998244353
#print(countx)
if countx&1 or countx==0:
print(0)
exit()
countx>>=1
divisors = []
for i in range(1,countx+1):
if i*i>countx:
break
if i*i==countx:
divisors.append(i)
break
if countx%i==0:
divisors.append(i)
divisors.append(countx//i)
divisors.sort()
ans = 0
for m in divisors:
cut_point = [0]
n = countx//m
i = 0
pack = 0
flag = False
case = 1
for _ in range(m-1):
while True:
pack+=cnth[i]
i+=1
if pack>=2*n:
break
if pack>2*n:
flag=True
break
case_count=1
cut_point.append(i)
while True:
if cnth[i]==0:
case_count+=1
i+=1
else:
break
case*=case_count
case%=mod
if flag:
continue
groups = [m-1 for _ in range(H)]
for t in range(m-1):
for h in range(cut_point[t],cut_point[t+1]):
groups[h]=t
j = 0
for _ in range(n-1):
groups_count = [0 for i in range(m)]
while True:
for i in range(H):
if S[i][j]=="Y":
groups_count[groups[i]]+=1
j+=1
#print(m,groups_count)
if min(groups_count)>=2:
break
if max(groups_count)>2:
flag=True
break
#print(groups_count)
#print(n,j)
case_count=1
while True:
if cntw[j]==0:
case_count+=1
j+=1
else:
break
case*=case_count
case%=mod
if flag:
continue
ans+=case
ans%=mod
print(ans)
H,W = map(int,input().split())
S = [list(input()) for i in range(H)]
cnth = []
cntw = []
for i in range(H):
cnt = 0
for j in range(W):
if S[i][j]=="Y":
cnt+=1
cnth.append(cnt)
for j in range(W):
cnt=0
for i in range(H):
if S[i][j]=="Y":
cnt+=1
cntw.append(cnt)
countx = 0
for i in range(H):
for j in range(W):
if S[i][j]=="Y":
countx+=1
mod = 998244353
#print(countx)
if countx&1 or countx==0:
print(0)
exit()
countx>>=1
divisors = []
for i in range(1,countx+1):
if i*i>countx:
break
if i*i==countx:
divisors.append(i)
break
if countx%i==0:
divisors.append(i)
divisors.append(countx//i)
divisors.sort()
ans = 0
for m in divisors:
cut_point = [0]
n = countx//m
i = 0
flag = False
case = 1
for _ in range(m-1):
pack = 0
while True:
pack+=cnth[i]
i+=1
if pack>=2*n:
break
if pack>2*n:
flag=True
break
case_count=1
cut_point.append(i)
while True:
if cnth[i]==0:
case_count+=1
i+=1
else:
break
case*=case_count
case%=mod
if flag:
continue
groups = [m-1 for _ in range(H)]
for t in range(m-1):
for h in range(cut_point[t],cut_point[t+1]):
groups[h]=t
j = 0
for _ in range(n-1):
groups_count = [0 for i in range(m)]
while True:
for i in range(H):
if S[i][j]=="Y":
groups_count[groups[i]]+=1
j+=1
#print(m,groups_count)
if min(groups_count)>=2:
break
if max(groups_count)>2:
flag=True
break
#print(groups_count)
#print(n,j)
case_count=1
while True:
if cntw[j]==0:
case_count+=1
j+=1
else:
break
case*=case_count
case%=mod
if flag:
continue
ans+=case
ans%=mod
print(ans)
|
ConDefects/ConDefects/Code/arc157_d/Python/39199908
|
condefects-python_data_1708
|
def solve(n, A):
A.sort()
main, cur = 0, 0
if (A[0]%2) == 1:
cur = 1
if n == 1:
return "Yes"
for i in range(1, n):
if A[i] == A[i - 1]:
if (A[i] % 2) == 1:
cur += 1
else:
main += cur
cur = 0
if main < A[i] - 1:
return "Yes"
else:
if (A[i]%2) == 1:
cur = 1
return "No"
T = int(input())
for _ in range(T):
n = int(input())
A = list(map(int, input().split()))
print(solve(n, A))
def solve(n, A):
A.sort()
main, cur = 0, 0
if (A[0]%2) == 1:
cur = 1
if n == 1:
return "Yes"
if A[0] > 1:
return "Yes"
for i in range(1, n):
if A[i] == A[i - 1]:
if (A[i] % 2) == 1:
cur += 1
else:
main += cur
cur = 0
if main < A[i] - 1:
return "Yes"
else:
if (A[i]%2) == 1:
cur = 1
return "No"
T = int(input())
for _ in range(T):
n = int(input())
A = list(map(int, input().split()))
print(solve(n, A))
|
ConDefects/ConDefects/Code/agc065_c/Python/49687962
|
condefects-python_data_1709
|
def solve(n, A):
A.sort()
main, cur = 0, 0
A = [-1] + A
for i in range(n):
if A[i] == A[i - 1]:
if (A[i] % 2) == 1:
cur += 1
else:
main += cur
cur = 0
if main < A[i] - 1:
return "Yes"
else:
if (A[i]%2) == 1:
cur = 1
return "No"
T = int(input())
for _ in range(T):
n = int(input())
A = list(map(int, input().split()))
print(solve(n, A))
def solve(n, A):
A.sort()
main, cur = 0, 0
A = [-1] + A
for i in range(1, n + 1):
if A[i] == A[i - 1]:
if (A[i] % 2) == 1:
cur += 1
else:
main += cur
cur = 0
if main < A[i] - 1:
return "Yes"
else:
if (A[i]%2) == 1:
cur = 1
return "No"
T = int(input())
for _ in range(T):
n = int(input())
A = list(map(int, input().split()))
print(solve(n, A))
|
ConDefects/ConDefects/Code/agc065_c/Python/49687882
|
condefects-python_data_1710
|
T = int(input())
for _ in range(T):
N = int(input())
A = sorted(list(map(int, input().split())))
Odd = 0
Test = 0
Em = 0
for i in A:
if i % 2 == 1:
Odd += 1
if Odd % 2 == 0 and i >= 2*Odd-1:
print("Yes")
Test = 1
break
else:
Em = max(Em, i)
if Test == 1:
continue
if Em > Odd:
print("Yes")
continue
print("No")
T = int(input())
for _ in range(T):
N = int(input())
A = sorted(list(map(int, input().split())))
Odd = 0
Test = 0
Em = 0
for i in A:
if i % 2 == 1:
Odd += 1
if Odd % 2 == 0 and i >= Odd+1:
print("Yes")
Test = 1
break
else:
Em = max(Em, i)
if Test == 1:
continue
if Em > Odd:
print("Yes")
continue
print("No")
|
ConDefects/ConDefects/Code/agc065_c/Python/48625236
|
condefects-python_data_1711
|
import sys, random
input = lambda : sys.stdin.readline().rstrip()
write = lambda x: sys.stdout.write(x+"\n"); writef = lambda x: print("{:.12f}".format(x))
debug = lambda x: sys.stderr.write(x+"\n")
YES="Yes"; NO="No"; pans = lambda v: print(YES if v else NO); INF=10**18
LI = lambda v=0: list(map(lambda i: int(i)-v, input().split())); II=lambda : int(input()); SI=lambda : [ord(c)-ord("a") for c in input()]
def debug(_l_):
for s in _l_.split():
print(f"{s}={eval(s)}", end=" ")
print()
def dlist(*l, fill=0):
if len(l)==1:
return [fill]*l[0]
ll = l[1:]
return [dlist(*ll, fill=fill) for _ in range(l[0])]
t = II()
for _ in range(t):
n = int(input())
a = list(map(int, input().split()))
if all((v%2==0 for v in a)):
ans = 1
else:
M2 = -INF
M = -INF
na = []
for v in a:
if v%2:
na.append(v)
M = max(M, v)
else:
M2 = max(M2, v)
a = na
a.sort(reverse=True)
if M2>len(a):
ans = 1
else:
for i in range(0, len(a), 2):
if a[i]>n-1-i:
ans = 1
break
else:
ans = 0
pans(ans)
import sys, random
input = lambda : sys.stdin.readline().rstrip()
write = lambda x: sys.stdout.write(x+"\n"); writef = lambda x: print("{:.12f}".format(x))
debug = lambda x: sys.stderr.write(x+"\n")
YES="Yes"; NO="No"; pans = lambda v: print(YES if v else NO); INF=10**18
LI = lambda v=0: list(map(lambda i: int(i)-v, input().split())); II=lambda : int(input()); SI=lambda : [ord(c)-ord("a") for c in input()]
def debug(_l_):
for s in _l_.split():
print(f"{s}={eval(s)}", end=" ")
print()
def dlist(*l, fill=0):
if len(l)==1:
return [fill]*l[0]
ll = l[1:]
return [dlist(*ll, fill=fill) for _ in range(l[0])]
t = II()
for _ in range(t):
n = int(input())
a = list(map(int, input().split()))
if all((v%2==0 for v in a)):
ans = 1
else:
M2 = -INF
M = -INF
na = []
for v in a:
if v%2:
na.append(v)
M = max(M, v)
else:
M2 = max(M2, v)
a = na
a.sort(reverse=True)
if M2>len(a):
ans = 1
else:
for i in range(0, len(a), 2):
if a[i]>len(a)-1-i:
ans = 1
break
else:
ans = 0
pans(ans)
|
ConDefects/ConDefects/Code/agc065_c/Python/48625380
|
condefects-python_data_1712
|
N, M, X, T, D = map(int, input().split())
h = T
if M >= X:
print(T)
else:
print(T + (X - M) * D)
N, M, X, T, D = map(int, input().split())
h = T
if M >= X:
print(T)
else:
print(T - (X - M) * D)
|
ConDefects/ConDefects/Code/abc259_a/Python/46054994
|
condefects-python_data_1713
|
# cf. https://atcoder.jp/contests/abc343/editorial/9435
def f(v):
return max(0, min(v)) + 7 - max(v)
def count2(a1, b1, c1, a2, b2, c2):
return f((a1, a2)) * f((b1, b2)) * f((c1, c2))
def count3(a1, b1, c1, a2, b2, c2, a3, b3, c3):
return f((a1, a2, a3)) * f((b1, b2, b3)) * f((c1, c2, c3))
def generate():
candidates = range(-1, 8)
for a in candidates:
for b in candidates:
for c in candidates:
yield a, b, c
def solve(v1, v2, v3):
for a2, b2, c2 in generate():
for a3, b3, c3 in generate():
nv3 = count3(0, 0, 0, a2, b2, c2, a3, b3, c3)
nv2 = count2(0, 0, 0, a2, b2, c2) + count2(0, 0, 0, a3, b3, c3) + count2(a2, b2, c2, a3, b3, c3) - 3*nv3
nv1 = 3*(7**3) - 2*nv2 - 3*nv3
if v1 == nv1 and v2 == nv2 and v3 == nv3:
return f"Yes\n0 0 0 {a2} {b2} {c2} {a3} {b3} {c3}"
return "No"
v1, v2, v3 = map(int, input().split())
print(solve(v1, v2, v3))
# cf. https://atcoder.jp/contests/abc343/editorial/9435
def f(v):
return max(0, min(v) + 7 - max(v))
def count2(a1, b1, c1, a2, b2, c2):
return f((a1, a2)) * f((b1, b2)) * f((c1, c2))
def count3(a1, b1, c1, a2, b2, c2, a3, b3, c3):
return f((a1, a2, a3)) * f((b1, b2, b3)) * f((c1, c2, c3))
def generate():
candidates = range(-1, 8)
for a in candidates:
for b in candidates:
for c in candidates:
yield a, b, c
def solve(v1, v2, v3):
for a2, b2, c2 in generate():
for a3, b3, c3 in generate():
nv3 = count3(0, 0, 0, a2, b2, c2, a3, b3, c3)
nv2 = count2(0, 0, 0, a2, b2, c2) + count2(0, 0, 0, a3, b3, c3) + count2(a2, b2, c2, a3, b3, c3) - 3*nv3
nv1 = 3*(7**3) - 2*nv2 - 3*nv3
if v1 == nv1 and v2 == nv2 and v3 == nv3:
return f"Yes\n0 0 0 {a2} {b2} {c2} {a3} {b3} {c3}"
return "No"
v1, v2, v3 = map(int, input().split())
print(solve(v1, v2, v3))
|
ConDefects/ConDefects/Code/abc343_e/Python/54516497
|
condefects-python_data_1714
|
N, K = map(int,input().split())
A = list(map(int,input().split()))
digit = 0
left = 1
right = N * (N+1) // 2
while digit < N:
small = [i for i in A[digit:] if i < A[digit]]
large = [i for i in A[digit:] if i > A[digit]]
x = False
if K - left < len(small):
small.sort()
x = small[K-left]
elif right - K < len(large):
large.sort()
large.reverse()
x = large[right-K]
if not x:
left += len(small)
right -= len(large)
digit += 1
else:
j = 0
while A[j] != x:
j += 1
tem = A[:digit] + list(reversed(A[digit:j+1])) + A[j+1:]
print(tem)
exit()
print(*A)
N, K = map(int,input().split())
A = list(map(int,input().split()))
digit = 0
left = 1
right = N * (N+1) // 2
while digit < N:
small = [i for i in A[digit:] if i < A[digit]]
large = [i for i in A[digit:] if i > A[digit]]
x = False
if K - left < len(small):
small.sort()
x = small[K-left]
elif right - K < len(large):
large.sort()
large.reverse()
x = large[right-K]
if not x:
left += len(small)
right -= len(large)
digit += 1
else:
j = 0
while A[j] != x:
j += 1
tem = A[:digit] + list(reversed(A[digit:j+1])) + A[j+1:]
print(*tem)
exit()
print(*A)
|
ConDefects/ConDefects/Code/arc160_a/Python/45909573
|
condefects-python_data_1715
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
ind = [0] * N
for i in range(N):
ind[A[i] - 1] = i
def re(l, r):
if r < N - 1:
return A[:l] + list(reversed(A[l:r + 1])) + A[r + 1:]
elif r == N - 1:
return A[:l] + list(reversed(A[l:r + 1]))
count = 0
flag = True
visit = set()
for j in range(N): #j+1桁目をみる
for i in range(N): #j+1桁目が i になる個数
if i in visit:
continue
if ind[i] == j:
count += (((N - 2 - j) * (N - j - 1)) // 2)
count += N
else:
count += 1
if count == K:
print(*re(j, ind[i]))
exit()
#print(count, j + 1, i + 1)
if count > K:
count -= (((N - 2 - j) * (N - j - 1)) // 2)
count -= N
visit.add(i)
break
N, K = map(int, input().split())
A = list(map(int, input().split()))
ind = [0] * N
for i in range(N):
ind[A[i] - 1] = i
def re(l, r):
if r < N - 1:
return A[:l] + list(reversed(A[l:r + 1])) + A[r + 1:]
elif r == N - 1:
return A[:l] + list(reversed(A[l:r + 1]))
count = 0
flag = True
visit = set()
for j in range(N): #j+1桁目をみる
for i in range(N): #j+1桁目が i になる個数
if i in visit:
continue
if ind[i] == j:
count += (((N - 2 - j) * (N - j - 1)) // 2)
count += N
else:
count += 1
if count == K:
print(*re(j, ind[i]))
exit()
if count > K:
count -= (((N - 2 - j) * (N - j - 1)) // 2)
count -= N
visit.add(i)
break
print(*A)
|
ConDefects/ConDefects/Code/arc160_a/Python/43403535
|
condefects-python_data_1716
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
K -= 1
inda = [-1]*(N+1)
for i, a in enumerate(A):
inda[a] = i
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
i += 1
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def sumrange(self, i, j):
si = self.sum(i - 1)
sj = self.sum(j)
return sj - si
def add(self, i, x):
i += 1
while i <= self.size:
self.tree[i] += x
i += i & -i
def lower_bound(self, w):
if w <= 0:
return 0
x = 0
r = 1 << (self.size).bit_length()
while r > 0:
if x+r < self.size and self.tree[x+r] < w:
w -= self.tree[x+r]
x += r
r = r >> 1
return x
ctl, ctr = 0, N*(N+1)//2
flag = 0
state = Bit(N+2)
ans = A[:]
for i in range(1, N+1):
state.add(i, 1)
for i, a in enumerate(A):
state.add(a, -1)
vl = state.sumrange(0, a-1)
vr = state.sumrange(a+1, N)
if ctl+vl > K:
x = state.lower_bound(K-ctl)
ind = inda[x]
for j in range(i, ind+1):
ans[j] = A[ind-j+i]
break
if ctr-vr <= K:
x = state.lower_bound(K-ctr+vr+vl+1)
ind = inda[x]
for j in range(i, ind+1):
ans[j] = A[ind-j+i]
break
ctl += vl
ctr -= vr
print(*ans)
N, K = map(int, input().split())
A = list(map(int, input().split()))
K -= 1
inda = [-1]*(N+1)
for i, a in enumerate(A):
inda[a] = i
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
i += 1
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def sumrange(self, i, j):
si = self.sum(i - 1)
sj = self.sum(j)
return sj - si
def add(self, i, x):
i += 1
while i <= self.size:
self.tree[i] += x
i += i & -i
def lower_bound(self, w):
if w <= 0:
return 0
x = 0
r = 1 << (self.size).bit_length()
while r > 0:
if x+r < self.size and self.tree[x+r] < w:
w -= self.tree[x+r]
x += r
r = r >> 1
return x
ctl, ctr = 0, N*(N+1)//2
flag = 0
state = Bit(N+2)
ans = A[:]
for i in range(1, N+1):
state.add(i, 1)
for i, a in enumerate(A):
state.add(a, -1)
vl = state.sumrange(0, a-1)
vr = state.sumrange(a+1, N)
if ctl+vl > K:
x = state.lower_bound(K-ctl+1)
ind = inda[x]
for j in range(i, ind+1):
ans[j] = A[ind-j+i]
break
if ctr-vr <= K:
x = state.lower_bound(K-ctr+vr+vl+1)
ind = inda[x]
for j in range(i, ind+1):
ans[j] = A[ind-j+i]
break
ctl += vl
ctr -= vr
print(*ans)
|
ConDefects/ConDefects/Code/arc160_a/Python/43405529
|
condefects-python_data_1717
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
fixed1 = 1
fixed2 = N*(N+1)//2
for i, a in enumerate(A):
l = []
r = []
for j in range(i+1, N):
if A[j] < A[i]:
l.append(A[j])
if A[j] > A[i]:
r.append(A[j])
value = -1
if len(l)+fixed1 > K:
l.sort()
value = l[K-fixed1]
if fixed2-K < len(r):
r.sort(reverse=True)
value = r[fixed2-K]
if value != -1:
idx = A.index(value)
print(*A[:i], *A[i:idx+1][::-1], *A[idx+1:])
exit()
fixed1 += len(l)
fixed2 -= len(r)
print(A)
N, K = map(int, input().split())
A = list(map(int, input().split()))
fixed1 = 1
fixed2 = N*(N+1)//2
for i, a in enumerate(A):
l = []
r = []
for j in range(i+1, N):
if A[j] < A[i]:
l.append(A[j])
if A[j] > A[i]:
r.append(A[j])
value = -1
if len(l)+fixed1 > K:
l.sort()
value = l[K-fixed1]
if fixed2-K < len(r):
r.sort(reverse=True)
value = r[fixed2-K]
if value != -1:
idx = A.index(value)
print(*A[:i], *A[i:idx+1][::-1], *A[idx+1:])
exit()
fixed1 += len(l)
fixed2 -= len(r)
print(*A)
|
ConDefects/ConDefects/Code/arc160_a/Python/42065409
|
condefects-python_data_1718
|
x,y,n = map(int,input().split())
yn = n//3
xn = n - yn*3
print(xn*x + yn*y)
x,y,n = map(int,input().split())
yn = n//3
xn = n - yn*3
print(min(xn*x + yn*y , n*x))
|
ConDefects/ConDefects/Code/abc265_a/Python/45305147
|
condefects-python_data_1719
|
x,y,n = map(int,input().split())
if x*3 > y:
print(n/3 * y + n%3 * x)
else:
print(x*n)
x,y,n = map(int,input().split())
if x*3 > y:
print(n//3 * y + n%3 * x)
else:
print(x*n)
|
ConDefects/ConDefects/Code/abc265_a/Python/45840285
|
condefects-python_data_1720
|
N, A = map(int, input().split())
T = list(map(int, input().split()))
in_retu = 0
for i in range(N):
go = max(in_retu, T[i]) +A
print(go)
in_retu = go
N, A = map(int, input().split())
T = list(map(int, input().split()))
in_retu = 0
for i in range(N):
go = max(in_retu, T[i]) +A
print(go)
in_retu = go
|
ConDefects/ConDefects/Code/abc358_b/Python/54987803
|
condefects-python_data_1721
|
n,a = list(map(int,input().split()))
T = list(map(int,input().split()))
time = 0
for i in T:
if (i>=time):
time=i+a-time
print(time)
else:
time+=a
print(time)
n,a = list(map(int,input().split()))
T = list(map(int,input().split()))
time = 0
for i in T:
if (i>=time):
time=i+a
print(time)
else:
time+=a
print(time)
|
ConDefects/ConDefects/Code/abc358_b/Python/55111511
|
condefects-python_data_1722
|
N,A =map(int,input().split())
T = list(map(int,input().split()))
time = 0
for i in range(N):
time = max(time, T[i]) + A
print(time, end = ' ')
N,A =map(int,input().split())
T = list(map(int,input().split()))
time = 0
for i in range(N):
time = max(time, T[i]) + A
print(time, end = ' ')
|
ConDefects/ConDefects/Code/abc358_b/Python/55163067
|
condefects-python_data_1723
|
n,y,x=map(int,input().split())
a=list(map(int,input().split()))
ans=0
def calc(B):
next_x=[n+1]*len(B)
next_y=[n+1]*len(B)
for i in range(len(B)):
if B[i]==x:
next_x[i]=i
if B[i]==y:
next_y[i]=i
for i in range(len(B)-1,0,-1):
if next_y[i]!=n+1:
if next_y[i-1]==n+1:
next_y[i-1]=next_y[i]
if next_x[i]!=n+1:
if next_x[i-1]==n+1:
next_x[i-1]=next_x[i]
r=0
for i in range(len(B)):
k=max(next_x[i],next_y[i])
if k!=n+1:
r+=n-k
return r
li=[]
inner=[]
for i in range(n):
if x<=a[i]<=y:
inner.append(a[i])
else:
if inner:
li.append(inner)
inner=[]
if inner:
li.append(inner)
for k in li:
ans+=calc(k)
print(ans)
n,y,x=map(int,input().split())
a=list(map(int,input().split()))
ans=0
def calc(B):
next_x=[n+1]*len(B)
next_y=[n+1]*len(B)
for i in range(len(B)):
if B[i]==x:
next_x[i]=i
if B[i]==y:
next_y[i]=i
for i in range(len(B)-1,0,-1):
if next_y[i]!=n+1:
if next_y[i-1]==n+1:
next_y[i-1]=next_y[i]
if next_x[i]!=n+1:
if next_x[i-1]==n+1:
next_x[i-1]=next_x[i]
r=0
for i in range(len(B)):
k=max(next_x[i],next_y[i])
if k!=n+1:
r+=len(B)-k
return r
li=[]
inner=[]
for i in range(n):
if x<=a[i]<=y:
inner.append(a[i])
else:
if inner:
li.append(inner)
inner=[]
if inner:
li.append(inner)
for k in li:
ans+=calc(k)
print(ans)
|
ConDefects/ConDefects/Code/abc247_e/Python/45003873
|
condefects-python_data_1724
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
N, X, Y, *A = map(int, read().split())
index_X = -1
index_Y = -1
index_ng = -1
ans = 0
for i in range(N):
if A[i] == X:
index_X = i
elif A[i] == Y:
index_Y = i
elif A[i] > X or A[i] < Y:
index_ng = i
ans += max(0, min(index_X, index_Y) - index_ng)
print(ans)
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
N, X, Y, *A = map(int, read().split())
index_X = -1
index_Y = -1
index_ng = -1
ans = 0
for i in range(N):
if A[i] == X:
index_X = i
if A[i] == Y:
index_Y = i
elif A[i] > X or A[i] < Y:
index_ng = i
ans += max(0, min(index_X, index_Y) - index_ng)
print(ans)
|
ConDefects/ConDefects/Code/abc247_e/Python/45540952
|
condefects-python_data_1725
|
s1=input()
s2=input()
if (s1[0]=="#" and s2[0]=="#") or (s1[1]=="#" and s2[1]=="#"):
print("Yes")
else:
print("No")
s1=input()
s2=input()
if (s1[0]=="#" and s2[0]=="#") or (s1[1]=="#" and s2[1]=="#") or (s1[0]=="#" and s1[1]=="#") or (s2[0]=="#" and s2[1]=="#"):
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc229_a/Python/45784135
|
condefects-python_data_1726
|
def solve() -> None:
if black >= 3:
print("Yes")
return
if (s1[0] == "#" and s2[1] == "#") or (s1[1] == "#" and s2[0] == "#"):
print("No")
return
s1 = input()
s2 = input()
black = s1.count("#")
black += s2.count("#")
solve()
def solve() -> None:
if black >= 3:
print("Yes")
return
if (s1[0] == "#" and s2[1] == "#") or (s1[1] == "#" and s2[0] == "#"):
print("No")
else:
print("Yes")
return
s1 = input()
s2 = input()
black = s1.count("#")
black += s2.count("#")
solve()
|
ConDefects/ConDefects/Code/abc229_a/Python/45690274
|
condefects-python_data_1727
|
S1 = input()
S2 = input()
if S1==".#" and S2=="#.":
print("No")
else:
print("Yes")
S1 = input()
S2 = input()
if S1==".#" and S2=="#.":
print("No")
elif S1=="#." and S2==".#":
print("No")
else:
print("Yes")
|
ConDefects/ConDefects/Code/abc229_a/Python/45477841
|
condefects-python_data_1728
|
S1 = input()
S2 = input()
if S1 == "##" or S2 == "##":
print("Yes")
elif S1 == ".#" and S2 == "#.":
print("No")
elif S1 == "#." and S2 == ".#":
print("No")
S1 = input()
S2 = input()
if S1 == "##" or S2 == "##":
print("Yes")
elif S1 == ".#" and S2 == "#.":
print("No")
elif S1 == "#." and S2 == ".#":
print("No")
else:
print("Yes")
|
ConDefects/ConDefects/Code/abc229_a/Python/45808992
|
condefects-python_data_1729
|
s1 = input()
s2 = input()
if [s1, s2]==["#.",".#"] or[".#","#."]:
print('No')
exit()
else:
print('Yes')
s1 = input()
s2 = input()
if [s1, s2]==["#.",".#"] or [s1, s2]==[".#","#."]:
print('No')
exit()
else:
print('Yes')
|
ConDefects/ConDefects/Code/abc229_a/Python/46216070
|
condefects-python_data_1730
|
S1 = input()
S2 = input()
k = []
s = []
k.append(S1[0])
k.append(S1[1])
s.append(k)
k = []
k.append(S2[0])
k.append(S2[1])
s.append(k)
o = 0
if s[0][0] == "#":
o +=1
if s[0][1] == "#":
o += 1
if s[1][0] == "#":
o += 1
if s[1][1] == "#":
o += 1
# answer
if o == 1 or o >= 3:
print("Yes")
else:
if (s[0][0] == "#" and s[1][1]) or (s[0][1] == "#" and s[1][0] == "#"):
print("No")
else:
print("Yes")
S1 = input()
S2 = input()
k = []
s = []
k.append(S1[0])
k.append(S1[1])
s.append(k)
k = []
k.append(S2[0])
k.append(S2[1])
s.append(k)
o = 0
if s[0][0] == "#":
o +=1
if s[0][1] == "#":
o += 1
if s[1][0] == "#":
o += 1
if s[1][1] == "#":
o += 1
# answer
if o == 1 or o >= 3:
print("Yes")
else:
if (s[0][0] == "#" and s[1][1] == "#") or (s[0][1] == "#" and s[1][0] == "#"):
print("No")
else:
print("Yes")
|
ConDefects/ConDefects/Code/abc229_a/Python/44996770
|
condefects-python_data_1731
|
S1 = input()
S2 = input()
if S1[0] == S2[0] or S1[1] == S2[1]:
print("Yes")
else:
print("No")
S1 = input()
S2 = input()
if S1[0] == S2[0] or S1[1] == S2[1] or S1[0] == S1[1] or S2[0] == S2[1]:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc229_a/Python/46233112
|
condefects-python_data_1732
|
S = input() + input()
if S == '.#.#' or S == '#.#.' :
print('No')
else:
print('Yes')
S = input() + input()
if S == '.##.' or S == '#..#' :
print('No')
else:
print('Yes')
|
ConDefects/ConDefects/Code/abc229_a/Python/44625287
|
condefects-python_data_1733
|
N, M = map(int, input().split())
X=[]
for _ in range(M):
_, *x=map(int, input().split())
X.append(set(x))
flag=False
from itertools import combinations
for cmb in combinations(range(1,N+1), 2):
for i in X:
if cmb[0] in i and cmb[1] in i:
flag=True
break
else:
print("No")
exit()
print("Yes" if flag else "No")
N, M = map(int, input().split())
X=[]
for _ in range(M):
_, *x=map(int, input().split())
X.append(set(x))
flag=False
from itertools import combinations
for cmb in combinations(range(1,N+1), 2):
for i in X:
if cmb[0] in i and cmb[1] in i:
flag=True
break
else:
print("No")
exit()
print("Yes" if flag else "No")
|
ConDefects/ConDefects/Code/abc272_b/Python/53303936
|
condefects-python_data_1734
|
N,K = map(int,input().split())
S = [input() for _ in range(N)]
import functools
S.sort(key=functools.cmp_to_key(lambda x,y:-1 if x+y>y+x else 1))
dp = ['|']*(K+1)
dp[0]= ''
for i in range(N):
for k in range(min(i,K),0,-1):
dp[k] = min(dp[k],S[i]+dp[k-1])
print(dp[K])
N,K = map(int,input().split())
S = [input() for _ in range(N)]
import functools
S.sort(key=functools.cmp_to_key(lambda x,y:-1 if x+y>y+x else 1))
dp = ['|']*(K+1)
dp[0]= ''
for i in range(N):
for k in range(min(i+1,K),0,-1):
dp[k] = min(dp[k],S[i]+dp[k-1])
print(dp[K])
|
ConDefects/ConDefects/Code/abc225_f/Python/29050129
|
condefects-python_data_1735
|
import os, sys; sys.setrecursionlimit(10**7)
readline = sys.stdin.readline
if os.path.basename(__file__) == "Main.py":
import pypyjit; pypyjit.set_param('max_unroll_recursion=-1')
from functools import cmp_to_key
alphabet_to_int = lambda x:ord(x)-97
mod = 998244353
def f(S):
res = 0
for i in range(len(S)):
res += alphabet_to_int(S[~i]) * pow(26, i)
return res
def compare(x, y):
n = len(x)
m = len(y)
return f(x) * (m - 1) - f(y) * (n - 1)
def main():
n, k = map(int, readline().split())
S = [input() for _ in range(n)]
S.sort(key=cmp_to_key(compare))
dp = [[None] * (k + 1) for _ in range(n + 1)]
for i in range(n + 1):
dp[i][0] = ""
for i in range(1, n + 1)[::-1]:
for j in range(k + 1):
if not dp[i][j] == None:
if not dp[i - 1][j] == None:
dp[i - 1][j] = min(dp[i][j], dp[i - 1][j])
else:
dp[i - 1][j] = dp[i][j]
if j < k:
if not dp[i - 1][j + 1] == None:
dp[i - 1][j + 1] = min(dp[i - 1][j + 1], S[i - 1] + dp[i][j])
else:
dp[i - 1][j + 1] = S[i - 1] + dp[i][j]
print(dp[0][-1])
if __name__ == '__main__':
main()
import os, sys; sys.setrecursionlimit(10**7)
readline = sys.stdin.readline
if os.path.basename(__file__) == "Main.py":
import pypyjit; pypyjit.set_param('max_unroll_recursion=-1')
from functools import cmp_to_key
alphabet_to_int = lambda x:ord(x)-97
mod = 998244353
def f(S):
res = 0
for i in range(len(S)):
res += alphabet_to_int(S[~i]) * pow(26, i)
return res
def compare(x, y):
n = len(x)
m = len(y)
return f(x) * (pow(26, m) - 1) - f(y) * (pow(26, n) - 1)
def main():
n, k = map(int, readline().split())
S = [input() for _ in range(n)]
S.sort(key=cmp_to_key(compare))
dp = [[None] * (k + 1) for _ in range(n + 1)]
for i in range(n + 1):
dp[i][0] = ""
for i in range(1, n + 1)[::-1]:
for j in range(k + 1):
if not dp[i][j] == None:
if not dp[i - 1][j] == None:
dp[i - 1][j] = min(dp[i][j], dp[i - 1][j])
else:
dp[i - 1][j] = dp[i][j]
if j < k:
if not dp[i - 1][j + 1] == None:
dp[i - 1][j + 1] = min(dp[i - 1][j + 1], S[i - 1] + dp[i][j])
else:
dp[i - 1][j + 1] = S[i - 1] + dp[i][j]
print(dp[0][-1])
if __name__ == '__main__':
main()
|
ConDefects/ConDefects/Code/abc225_f/Python/30550444
|
condefects-python_data_1736
|
N, K = map(int, input().split())
S = [input() for _ in range(N)]
rule = []
for _ in range(N):
for i in range(N-1):
if S[i] + S[i+1] <= S[i+1] + S[i]:
pass
else:
S[i+1], S[i] = S[i], S[i+1]
dp = [[None]*N for _ in range(N)]
for i in range(N):
dp[i][0] = min(S[i:])
def dpfunc(i,j):
if dp[i][j] is not None:
return dp[i][j]
if i + j == N:
dp[i][j] = "".join(S[i:])
return dp[i][j]
ans = min(dpfunc(i+1,j), S[i] + dpfunc(i+1,j-1))
dp[i][j] = ans
return ans
ans = dpfunc(0,K-1)
print(ans)
N, K = map(int, input().split())
S = [input() for _ in range(N)]
rule = []
for _ in range(N):
for i in range(N-1):
if S[i] + S[i+1] <= S[i+1] + S[i]:
pass
else:
S[i+1], S[i] = S[i], S[i+1]
dp = [[None]*N for _ in range(N)]
for i in range(N):
dp[i][0] = min(S[i:])
def dpfunc(i,j):
if dp[i][j] is not None:
return dp[i][j]
if i + j == N-1:
dp[i][j] = "".join(S[i:])
return dp[i][j]
ans = min(dpfunc(i+1,j), S[i] + dpfunc(i+1,j-1))
dp[i][j] = ans
return ans
ans = dpfunc(0,K-1)
print(ans)
|
ConDefects/ConDefects/Code/abc225_f/Python/31785117
|
condefects-python_data_1737
|
n, l = map(int, input().split())
a_list = list(map(int, input().split()))
ans_half = float('inf')
i = 0
j = n-1
while i < j:
ai = a_list[i]
aj = a_list[j]
l_west = (aj-ai) + 2 * ai
l_east = (aj-ai) + 2 * (l-aj)
newans_half = max(l_west, l_east)
ans_half = min(ans_half, newans_half)
if l_east == l_west:
break
elif l_east < l_west:
j -= 1
else:
i += 1
print(2 * ans_half)
n, l = map(int, input().split())
a_list = list(map(int, input().split()))
ans_half = float('inf')
i = 0
j = n-1
while i <= j:
ai = a_list[i]
aj = a_list[j]
l_west = (aj-ai) + 2 * ai
l_east = (aj-ai) + 2 * (l-aj)
newans_half = max(l_west, l_east)
ans_half = min(ans_half, newans_half)
if l_east == l_west:
break
elif l_east < l_west:
j -= 1
else:
i += 1
print(2 * ans_half)
|
ConDefects/ConDefects/Code/arc152_b/Python/37047246
|
condefects-python_data_1738
|
n,L=map(int,input().split())
a=list(map(int,input().split()))
a.append(10**18)
a=[-10**18]+a
ans=10**18
for i in range(n):
r=n
l=-1
while r-l>1:
v=(r+l)//2
if a[v]>=L-a[i+1]:
r=v
else:
l=v
ans=min(ans,2*L+min(L-a[i+1]-a[r-1],a[r]-L+a[i+1])*2)
print(ans)
n,L=map(int,input().split())
a=list(map(int,input().split()))
a.append(10**18)
a=[-10**18]+a
ans=10**18
for i in range(n):
r=n+1
l=-1
while r-l>1:
v=(r+l)//2
if a[v]>=L-a[i+1]:
r=v
else:
l=v
ans=min(ans,2*L+min(L-a[i+1]-a[r-1],a[r]-L+a[i+1])*2)
print(ans)
|
ConDefects/ConDefects/Code/arc152_b/Python/46130280
|
condefects-python_data_1739
|
from bisect import*
n,l,*a=map(int,open(0).read().split())
t=4*l
for c in a:x=l-c;i=bisect(a,x);t=min(t,min(x-a[i-1],a[min(i,n-1)]-x))
print(2*(t+l))
from bisect import*
n,l,*a=map(int,open(0).read().split())
t=4*l
for c in a:x=l-c;i=bisect(a,x);t=min(t,min(abs(x-a[min(max(j,0),n-1)])for j in[i,i-1]))
print(2*(t+l))
|
ConDefects/ConDefects/Code/arc152_b/Python/36754688
|
condefects-python_data_1740
|
N,L = map(int,input().split())
A = list(map(int,input().split()))
A = [0]+A+[L]
amin = 10**9
for i in range(1,N+1):
s = A[i]
high = N
low = 1
while high-low>1:
mid = (high+low)//2
t = A[mid]
dr = L-s+L-t
dl = s+t
if dr>=dl:
low = mid
else:
high = mid
t1 = A[low]
dr1 = L-s+L-t1
dl1 = s+t1
d1 = abs(dr1-dl1)
t2 = A[high]
dr2 = L-s+L-t2
dl2 = s+t2
d2 = abs(dr2-dl2)
amin = min(amin,min(d1,d2))
print(2*L+amin)
N,L = map(int,input().split())
A = list(map(int,input().split()))
A = [0]+A+[L]
amin = 2*10**9
for i in range(1,N+1):
s = A[i]
high = N
low = 1
while high-low>1:
mid = (high+low)//2
t = A[mid]
dr = L-s+L-t
dl = s+t
if dr>=dl:
low = mid
else:
high = mid
t1 = A[low]
dr1 = L-s+L-t1
dl1 = s+t1
d1 = abs(dr1-dl1)
t2 = A[high]
dr2 = L-s+L-t2
dl2 = s+t2
d2 = abs(dr2-dl2)
amin = min(amin,min(d1,d2))
print(2*L+amin)
|
ConDefects/ConDefects/Code/arc152_b/Python/37067201
|
condefects-python_data_1741
|
import bisect
n,l = map(int,input().split())
a = list(map(int,input().split()))
mi = l
for i in range(n):
aa = bisect.bisect_right(a,l-a[i])
if aa == n:
m = abs(a[i] - (l-a[aa-1]))
else:
m = min(abs(a[i] - (l-a[n-1])),abs(a[i] - (l-a[aa])))
mi = min(mi,m)
print(2 * (l + mi))
import bisect
n,l = map(int,input().split())
a = list(map(int,input().split()))
mi = l
for i in range(n):
aa = bisect.bisect_right(a,l-a[i])
if aa == n:
m = abs(a[i] - (l-a[aa-1]))
else:
m = min(abs(a[i] - (l-a[aa-1])),abs(a[i] - (l-a[aa])))
mi = min(mi,m)
print(2 * (l + mi))
|
ConDefects/ConDefects/Code/arc152_b/Python/37447201
|
condefects-python_data_1742
|
from bisect import *
N,L = map(int,input().split())
inf = L*4
A = list(map(int,input().split()))
ans = inf
for a in A:
b = L-a
p = bisect_left(A,b)
p1 = A[p] if p < N else inf
p2 = A[p-1]
ans_ = 2*L + min(abs(b-p1),abs(b-p2))
ans = min(ans,ans_)
print(ans)
from bisect import *
N,L = map(int,input().split())
inf = L*4
A = list(map(int,input().split()))
ans = inf
for a in A:
b = L-a
p = bisect_left(A,b)
p1 = A[p] if p < N else inf
p2 = A[p-1]
ans_ = 2*L + min(abs(b-p1),abs(b-p2))*2
ans = min(ans,ans_)
print(ans)
|
ConDefects/ConDefects/Code/arc152_b/Python/36775118
|
condefects-python_data_1743
|
def main():
T = input()
N = int(input())
S = []
for _ in range(N):
tmp = input().split()
del(tmp[0])
S.append(tmp)
INF = 10**18
# dp[i] : i番目の袋から出した後
# dp[i][j] : j文字目まで完成しているときの最小スコア
dp = [([0] + [INF]*(len(T))) for _ in range(N+1)]
for i in range(1, N+1):
# 何も取り出さないとき
dp[i] = dp[i-1]
for s in S[i-1]:
# j:足す前の文字数
for j in range(len(T)+1):
# 足したときの文字数
post_len = j + len(s)
if post_len > len(T):
break
# 足した結果が正しいか
if (T[0:j]+s == T[0:post_len]):
# 0から足したとき
if j == 0:
dp[i][post_len] = 1
else:
dp[i][post_len] = min(dp[i][post_len], dp[i-1][j] + 1)
if dp[N][len(T)] > N:
print(-1)
else:
print(dp[N][len(T)])
return
main()
def main():
T = input()
N = int(input())
S = []
for _ in range(N):
tmp = input().split()
del(tmp[0])
S.append(tmp)
INF = 10**18
# dp[i] : i番目の袋から出した後
# dp[i][j] : j文字目まで完成しているときの最小スコア
dp = [([0] + [INF]*(len(T))) for _ in range(N+1)]
for i in range(1, N+1):
# 何も取り出さないとき
dp[i] = dp[i-1].copy()
for s in S[i-1]:
# j:足す前の文字数
for j in range(len(T)+1):
# 足したときの文字数
post_len = j + len(s)
if post_len > len(T):
break
# 足した結果が正しいか
if (T[0:j]+s == T[0:post_len]):
# 0から足したとき
if j == 0:
dp[i][post_len] = 1
else:
dp[i][post_len] = min(dp[i][post_len], dp[i-1][j] + 1)
if dp[N][len(T)] > N:
print(-1)
else:
print(dp[N][len(T)])
return
main()
|
ConDefects/ConDefects/Code/abc344_d/Python/54876594
|
condefects-python_data_1744
|
import sys
def main():
input = sys.stdin.readline
T = input().rstrip()
N = int(input())
l = len(T)
dp = [[10**9] * (l + 1) for _ in [0] * (N + 1)]
dp[0][0] = 0
for i in range(N):
a,*si = input().rstrip().split()
for j in range(l):
if dp[i][j] + 1:
dp[i+1][j] = min(dp[i+1][j],dp[i][j])
for s in si:
if T[j:j+len(s)] == s:
dp[i+1][j+len(s)] = min(dp[i+1][j+len(s)],dp[i][j] + 1)
print(dp[N][l] if dp[N][l] < 10**9 else -1)
if __name__ == '__main__':
main()
import sys
def main():
input = sys.stdin.readline
T = input().rstrip()
N = int(input())
l = len(T)
dp = [[10**9] * (l + 1) for _ in [0] * (N + 1)]
dp[0][0] = 0
for i in range(N):
a,*si = input().rstrip().split()
for j in range(l + 1):
if dp[i][j] + 1:
dp[i+1][j] = min(dp[i+1][j],dp[i][j])
for s in si:
if T[j:j+len(s)] == s:
dp[i+1][j+len(s)] = min(dp[i+1][j+len(s)],dp[i][j] + 1)
print(dp[N][l] if dp[N][l] < 10**9 else -1)
if __name__ == '__main__':
main()
|
ConDefects/ConDefects/Code/abc344_d/Python/54960181
|
condefects-python_data_1745
|
n = int(input())
p = list(map(int, input().split()))
cnt = [0]
ans = []
def swap(i):
p[i], p[i+1] = p[i], p[i+1]
cnt[0] += 1
ans.append(i+1)
for i in range(0, 2*n, 2):
if i == 0:
if p[0] > p[1]:
swap(0)
continue
if p[i-1] > p[i]:
if p[i] > p[i+1]:
swap(i)
else:
if p[i] < p[i+1]:
swap(i-1)
else:
if p[i-1] < p[i+1]:
swap(i-1)
else:
swap(i)
print(cnt[0])
if cnt[0] != 0:
print(*ans)
n = int(input())
p = list(map(int, input().split()))
cnt = [0]
ans = []
def swap(i):
p[i], p[i+1] = p[i+1], p[i]
cnt[0] += 1
ans.append(i+1)
for i in range(0, 2*n, 2):
if i == 0:
if p[0] > p[1]:
swap(0)
continue
if p[i-1] > p[i]:
if p[i] > p[i+1]:
swap(i)
else:
if p[i] < p[i+1]:
swap(i-1)
else:
if p[i-1] < p[i+1]:
swap(i-1)
else:
swap(i)
print(cnt[0])
if cnt[0] != 0:
print(*ans)
|
ConDefects/ConDefects/Code/agc058_a/Python/46230782
|
condefects-python_data_1746
|
n=int(input())
a=list(map(int,input().split()))
q=[]
for i in range(n):
if i==0:
if a[0]>a[1]:
a[0],a[1]=a[1],a[0]
q.append(1)
else:
if a[i*2-1]<a[i*2] and a[i*2+1]>a[i*2]:
if a[i*2-1]<a[i*2+1]:
a[i*2-1],a[i*2]=a[i*2],a[i*2-1]
q.append(i*2)
else:
a[i*2],a[i*2+1]=a[i*2+1],a[i*2]
q.append(i*2+1)
elif a[i*2-1]<a[i*2]:
a[i*2-1],a[i*2]=a[i*2],a[i*2-1]
q.append(i*2)
elif a[i*2]>a[i*2+1]:
a[i*2],a[i*2+1]=a[i*2+1],a[i*2]
q.append(i*2+1)
print(len(q))
print(*q)
n=int(input())
a=list(map(int,input().split()))
q=[]
for i in range(n):
if i==0:
if a[0]>a[1]:
a[0],a[1]=a[1],a[0]
q.append(1)
else:
if a[i*2-1]<a[i*2] and a[i*2]>a[i*2+1]:
if a[i*2-1]<a[i*2+1]:
a[i*2-1],a[i*2]=a[i*2],a[i*2-1]
q.append(i*2)
else:
a[i*2],a[i*2+1]=a[i*2+1],a[i*2]
q.append(i*2+1)
elif a[i*2-1]<a[i*2]:
a[i*2-1],a[i*2]=a[i*2],a[i*2-1]
q.append(i*2)
elif a[i*2]>a[i*2+1]:
a[i*2],a[i*2+1]=a[i*2+1],a[i*2]
q.append(i*2+1)
print(len(q))
print(*q)
|
ConDefects/ConDefects/Code/agc058_a/Python/44643713
|
condefects-python_data_1747
|
N = int(input())
p = list(map(int, input().split()))
ans = []
for i in range(1, 2 * N - 1, 2):
a, b, c = p[i-1], p[i], p[i+1]
if (max(a, b, c) == a):
ans.append(i)
p[i-1], p[i] = p[i], p[i-1]
elif (max(a, b, c) == c):
ans.append(i+2)
p[i], p[i+1] = p[i+1], p[i]
if p[2 * N - 2] > p[2 * N - 1]:
ans.append(2 * N - 1)
print(len(ans))
print(*ans)
N = int(input())
p = list(map(int, input().split()))
ans = []
for i in range(1, 2 * N - 1, 2):
a, b, c = p[i-1], p[i], p[i+1]
if (max(a, b, c) == a):
ans.append(i)
p[i-1], p[i] = p[i], p[i-1]
elif (max(a, b, c) == c):
ans.append(i+1)
p[i], p[i+1] = p[i+1], p[i]
if p[2 * N - 2] > p[2 * N - 1]:
ans.append(2 * N - 1)
print(len(ans))
print(*ans)
|
ConDefects/ConDefects/Code/agc058_a/Python/43781605
|
condefects-python_data_1748
|
N=int(input())
#HA,WA=map(int,input().split())
A=list(map(int,input().split()))
#S=[(input(),i) for i in range(N)]
def solve():
K=0
ans=[]
for i in range(2*N-1):
if i%2==1: #should be A[i]>A[i+1]
if A[i]<A[i+1]:
if A[i]>A[i+2]:
A[i],A[i+1]=A[i+1],A[i]
ans.append(i+1)
else:
A[i+1],A[i+2]=A[i+2],A[i+1]
ans.append(i+2)
K+=1
else:
if A[i]>A[i+1]:
if i==2*N-2 or A[i]>A[i+2]:
A[i],A[i+1]=A[i+1],A[i]
ans.append(i+1)
else:
A[i+1],A[i+2]=A[i+2],A[i+1]
ans.append(i+2)
K+=1
print(K)
#print(A)
print(*ans)
solve()
N=int(input())
#HA,WA=map(int,input().split())
A=list(map(int,input().split()))
#S=[(input(),i) for i in range(N)]
def solve():
K=0
ans=[]
for i in range(2*N-1):
if i%2==1: #should be A[i]>A[i+1]
if A[i]<A[i+1]:
if A[i]<A[i+2]:
A[i],A[i+1]=A[i+1],A[i]
ans.append(i+1)
else:
A[i+1],A[i+2]=A[i+2],A[i+1]
ans.append(i+2)
K+=1
else:
if A[i]>A[i+1]:
if i==2*N-2 or A[i]>A[i+2]:
A[i],A[i+1]=A[i+1],A[i]
ans.append(i+1)
else:
A[i+1],A[i+2]=A[i+2],A[i+1]
ans.append(i+2)
K+=1
print(K)
#print(A)
print(*ans)
solve()
|
ConDefects/ConDefects/Code/agc058_a/Python/43275130
|
condefects-python_data_1749
|
def check(b,c):
#start at a and end at bth day, check if everyone is available
for i in range(N):
for j in range(b,c+1):
if(a[i][j] == 'x'):
return False
return True
a = []
temp = []
N,D = map(int,input().split()) #N = 3, D = 5
for i in range(N):
s = input()
a.append(s)
for i in range(N):
print(a[i])
ans = 0
for i in range(D):
for j in range(i,D):
#start at i and end at jth day
if(check(i,j) == True):
ans = max(ans,j-i+1)
print(ans)
# x = int((1 + D)*D/2)
# for i in range(N):
# i = input("ox")
# a.append(i)
# for i in range(x):
# print("hello")
def check(b,c):
#start at a and end at bth day, check if everyone is available
for i in range(N):
for j in range(b,c+1):
if(a[i][j] == 'x'):
return False
return True
a = []
temp = []
N,D = map(int,input().split()) #N = 3, D = 5
for i in range(N):
s = input()
a.append(s)
ans = 0
for i in range(D):
for j in range(i,D):
#start at i and end at jth day
if(check(i,j) == True):
ans = max(ans,j-i+1)
print(ans)
# x = int((1 + D)*D/2)
# for i in range(N):
# i = input("ox")
# a.append(i)
# for i in range(x):
# print("hello")
|
ConDefects/ConDefects/Code/abc311_b/Python/45980619
|
condefects-python_data_1750
|
h,w=map(int,input().split())
c=[input() for _ in range(h)]
q=int(input())
rh=0
sh=1
rw=0
sw=1
for _ in range(q):
a,b=map(int,input().split())
a-=1
b-=1
if rh<=a:
rh=a-rh
else:
rh=h-(rh-a)
if sh<=a:
sh=a-sh
else:
sh=w-(sh-a)
if rw<=b:
rw=b-rw
else:
rw=w-(rw-b)
if sw<=b:
sw=b-sw
else:
sw=w-(sw-b)
ansh=[0]*h
answ=[0]*w
x=sh-rh
y=sw-rw
for i in range(h):
ansh[rh]=i
rh+=x
rh%=h
for i in range(w):
answ[rw]=i
rw+=y
rw%=w
ans=[[0]*w for _ in range(h)]
for i in range(h):
for j in range(w):
ans[i][j]=c[ansh[i]][answ[j]]
for i in ans:
print(''.join(i))
h,w=map(int,input().split())
c=[input() for _ in range(h)]
q=int(input())
rh=0
sh=1
rw=0
sw=1
for _ in range(q):
a,b=map(int,input().split())
a-=1
b-=1
if rh<=a:
rh=a-rh
else:
rh=h-(rh-a)
if sh<=a:
sh=a-sh
else:
sh=h-(sh-a)
if rw<=b:
rw=b-rw
else:
rw=w-(rw-b)
if sw<=b:
sw=b-sw
else:
sw=w-(sw-b)
ansh=[0]*h
answ=[0]*w
x=sh-rh
y=sw-rw
for i in range(h):
ansh[rh]=i
rh+=x
rh%=h
for i in range(w):
answ[rw]=i
rw+=y
rw%=w
ans=[[0]*w for _ in range(h)]
for i in range(h):
for j in range(w):
ans[i][j]=c[ansh[i]][answ[j]]
for i in ans:
print(''.join(i))
|
ConDefects/ConDefects/Code/arc153_b/Python/44454861
|
condefects-python_data_1751
|
import sys
readline = sys.stdin.readline
H, W = map(int, readline().split())
A = [list(readline().strip()) for _ in range(H)]
x, y = 0, 0
Q = int(readline())
for q in range(Q):
a, b = map(int, readline().split())
if y < a:
y = a - 1 - y
else:
y = H - 1 - (y-a)
if x < b:
x = b - 1 - x
else:
x = W - 1 - (x-b)
if Q&1:
B = [[A[-(i+y)%H][-(j-x)%W] for j in range(W)] for i in range(H)]
else:
B = [[A[(i-y)%H][(j-x)%W] for j in range(W)] for i in range(H)]
for b in B:
print("".join(b))
import sys
readline = sys.stdin.readline
H, W = map(int, readline().split())
A = [list(readline().strip()) for _ in range(H)]
x, y = 0, 0
Q = int(readline())
for q in range(Q):
a, b = map(int, readline().split())
if y < a:
y = a - 1 - y
else:
y = H - 1 - (y-a)
if x < b:
x = b - 1 - x
else:
x = W - 1 - (x-b)
if Q&1:
B = [[A[-(i-y)%H][-(j-x)%W] for j in range(W)] for i in range(H)]
else:
B = [[A[(i-y)%H][(j-x)%W] for j in range(W)] for i in range(H)]
for b in B:
print("".join(b))
|
ConDefects/ConDefects/Code/arc153_b/Python/43165491
|
condefects-python_data_1752
|
def main():
# write code here.
N = II()
A = LM()
A = [0] + A
#width[i]:=i連勤の時のその部分での生産量.
width = [0]*N
for i in range(1,N):
now = 0
for j in range(1,i+1):
now += A[min(j,i-j+1)]
width[i] = now
dp = [-INF]*(N+1)
dp[0] = 0
for i in range(1,N):
for j in range(N+1):
if j+i+1 > N: break
dp[j+i+1] = max(dp[j+i+1], dp[j]+width[i])
print(dp[N])
# user config
############
DEBUG_MODE=1
############
# import
import sys
import itertools
import bisect
import math
from collections import *
from pprint import pprint
from functools import cache
import heapq
# alias
DD = defaultdict
BSL = bisect.bisect_left
BSR = bisect.bisect_right
# config
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
# input template
def II(): return int(input())
def IS(): return input()[:-1]
def MI(): return map(int,input().split())
def LM(): return list(MI())
def LL(n): return [LM() for _ in range(n)]
def INPUT_TABLE_LIST(n,remove_br=True): return [list(input())[:-1] if remove_br else list(input()) for _ in range(n)]
def INPUT_TABLE_STRING(n): return [IS() for _ in range(n)]
def MI_1(): return map(lambda x:int(x)-1,input().split())
def LM_1(): return list(MI_1())
def LL_1(n): return [LM_1() for _ in range(n)]
# functions
def bit_count(num):
length = num.bit_length()
res = 0
for i in range(length):
if num >> i & 1:
res += 1
return res
def DB(*args,**kwargs):
global DEBUG_MODE
if not DEBUG_MODE:
return
if args:
print(*args)
return
for name, value in kwargs.items():
print(f"{name} : {value}")
def expand_table(table, h_mag, w_mag):
#引数の二次元配列などをタイルのように繰り替えしたものを返す.
res = []
for row in table:
res.append(row*w_mag)
return res*h_mag
def safe_sqrt(N):
#[平方根]の誤差が怖いとき用.
rough = int(N**0.5)
left = rough - 10
right = rough + 10
while left != right:
mid = (left+right+1)//2
if mid**2 <= N:
left = mid
else:
right = mid - 1
return left
def sigma_LinearFunc(bound_included1, bound_included2, coeff1, coeff0):
"""
coeff1*x + coeff0
の x = [left, right] の和を求める.
"""
left = min(bound_included1, bound_included2)
right = max(bound_included1, bound_included2)
return coeff0*(right-left+1) + coeff1*(left+right)*(right-left+1)//2
def find_divisors(n):
divisors_small = []
divisors_big = []
i = 1
while i * i <= n:
if n % i == 0:
divisors_small.append(i)
# iと一致しない場合、n/iも約数
if i != n // i:
divisors_big.append(n // i)
i += 1
return divisors_small + divisors_big[::-1]
def makeTableBit(table, letter1="#", rev=False):
H,W = len(table), len(table[0])
res = []
for h in range(H):
rowBit = 0
for w in range(W):
if rev:
if table[h][w] == letter1:
rowBit += 2**w
else:
if table[h][W-w-1] == letter1:
rowBit += 2**w
res.append(rowBit)
return res
def rot(S):return list(zip(*S))[::-1]
def topological_sort(G, indegree=None):
N = len(G)
if indegree is None:
indegree = [0]*N
for v in range(N):
for adj in G[v]:
indegree[adj] += 1
deq = deque()
for v in range(N):
if indegree[v] == 0:
deq.append(v)
res = []
while deq:
v = deq.popleft()
res.append(v)
for adj in G[v]:
indegree[adj] -= 1
if indegree[adj] == 0:
deq.append(adj)
return res
def mal_matrix(A, B, mod):
N = len(A)
K = len(A[0])
M = len(B[0])
res = [[0 for _ in range(M)] for _ in range(N)]
for i in range(N) :
for j in range(K) :
for k in range(M) :
res[i][k] += A[i][j] * B[j][k]
res[i][k] %= mod
return res
def pow_matrix(mat, exp, mod):
N = len(mat)
res = [[1 if i == j else 0 for i in range(N)] for j in range(N)]
while exp > 0 :
if exp%2 == 1 :
res = mal_matrix(res, mat, mod)
mat = mal_matrix(mat, mat, mod)
exp //= 2
return res
#classes
"""
・使い方
s=SortedSet() : 引数にイテラブル渡せる.
s.a: SortedSetの中身を返す。
len(s), x in s, x not in s: リストと同じ要領で使える。
s.add(x): xを追加してTrueを返す。ただしxがすでにs内にある場合、xは追加せずにFalseを返す。
s.discard(x): xを削除してTrueを返す。ただしxがs内にない場合、何もせずにFalseを返す。
s.lt(x): xより小さい最大の要素を返す。もし存在しないなら、Noneを返す。
s.le(x): x 以下の 最大の要素を返す。もし存在しないなら、Noneを返す。
s.gt(x): xより大きい最小の要素を返す。もし存在しないなら、Noneを返す。
s.ge(x): x 以上の 最小の要素を返す。もし存在しないなら、Noneを返す。
s.index(x): xより小さい要素の数を返す。
s.index_right(x): x以下の要素の数を返す。
"""
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedSet(Generic[T]):
BUCKET_RATIO = 16
SPLIT_RATIO = 24
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)
n = self.size = len(a)
if any(a[i] > a[i + 1] for i in range(n - 1)):
a.sort()
if any(a[i] >= a[i + 1] for i in range(n - 1)):
a, b = [], a
for x in b:
if not a or a[-1] != x:
a.append(x)
bucket_size = int(math.ceil(math.sqrt(n / self.BUCKET_RATIO)))
self.a = [a[n * i // bucket_size : n * (i + 1) // bucket_size] for i in range(bucket_size)]
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, int]:
"return the bucket, index of the bucket and position in which x should be. self must not be empty."
for i, a in enumerate(self.a):
if x <= a[-1]: break
return (a, i, 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, b, 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.SPLIT_RATIO:
mid = len(a) >> 1
self.a[b:b+1] = [a[:mid], a[mid:]]
return True
def _pop(self, a: List[T], b: int, i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: del self.a[b]
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, b, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, b, 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 b, a in enumerate(reversed(self.a)):
i += len(a)
if i >= 0: return self._pop(a, ~b, i)
else:
for b, a in enumerate(self.a):
if i < len(a): return self._pop(a, b, 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
"""
(num, cnt)を要素としたSSを管理してMultiset化したいとき用.
"""
def exist(self, x):
ret = self.gt((x,0))
if ret is None:
return False
elif ret[0] == x:
return True
else:
return False
def increment(self, x):
if not self.exist(x):
self.add((x,1))
else:
num, cnt = self.gt((x,0))
self.discard((x,cnt))
self.add((x,cnt+1))
def decrement(self, x):
num, cnt = self.gt((x,0))
if cnt == 1:
self.discard((x,cnt))
else:
self.discard((x,cnt))
self.add((x,cnt-1))
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
T = TypeVar('T')
class SortedMultiset(Generic[T]):
BUCKET_RATIO = 16
SPLIT_RATIO = 24
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(a)
n = self.size = len(a)
if any(a[i] > a[i + 1] for i in range(n - 1)):
a.sort()
num_bucket = int(math.ceil(math.sqrt(n / self.BUCKET_RATIO)))
self.a = [a[n * i // num_bucket : n * (i + 1) // num_bucket] for i in range(num_bucket)]
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, int]:
"return the bucket, index of the bucket and position in which x should be. self must not be empty."
for i, a in enumerate(self.a):
if x <= a[-1]: break
return (a, i, 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, b, i = self._position(x)
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.SPLIT_RATIO:
mid = len(a) >> 1
self.a[b:b+1] = [a[:mid], a[mid:]]
def _pop(self, a: List[T], b: int, i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: del self.a[b]
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, b, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, b, 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 b, a in enumerate(reversed(self.a)):
i += len(a)
if i >= 0: return self._pop(a, ~b, i)
else:
for b, a in enumerate(self.a):
if i < len(a): return self._pop(a, b, 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
class UnionFind:
"""
二次元の時は、初期化時に (H,W) のように二次元配列の高さと幅を入力.
引数一個の root とか size は (r,c) みたいに.
引数二個の unite とか same は ((ra,ca),(rb,cb)) みたいに引数入れる.
"""
def __init__(self,*N):
if not isinstance(N[0],int):
N = N[0]
if len(N)==1:
N=N[0]
elif len(N)==2:
self.H, self.W = N[0], N[1]
N = self.H * self.W
self.par = [ i for i in range(N) ]
self.tree_size = [ 1 for i in range(N) ]
def root(self,*x):
x = self._dimCheck1(x)
if self.par[x] == x:
return x
self.par[x] = self.root(self.par[x])
return self.par[x]
def unite(self,*xy):
x,y = self._dimCheck2(xy)
rx = self.root(x)
ry = self.root(y)
if rx == ry:
return
self.par[rx] = ry
self.tree_size[ry] += self.tree_size[rx]
def same(self,*xy):
x,y = self._dimCheck2(xy)
rx = self.root(x)
ry = self.root(y)
return rx == ry
def size(self,*x):
x = self._dimCheck1(x)
rx = self.root(x)
return self.tree_size[rx]
def _dimCheck1(self,x):
if len(x)==1: return x[0]
if len(x)==2: return x[0]*self.W + x[1]
def _dimCheck2(self,xy):
if isinstance(xy[0],int): return xy[0],xy[1]
return xy[0][0]*self.W + xy[0][1], xy[1][0]*self.W + xy[1][1]
class Comb:
def __init__(self,table_len,MOD):
"""
MODが素数の場合しか使用できない.
table_len に指定した数まで法MODでのコンビネーションの計算が可能になる.
"""
self.fac = [1,1]
self.inv = [1,1]
self.finv = [1,1]
self.MOD = MOD
for i in range(2,table_len+1):
self.fac.append(self.fac[i-1]*i%MOD)
self.inv.append(-self.inv[MOD%i]*(MOD//i)%MOD)
self.finv.append(self.finv[i-1]*self.inv[i]%MOD)
def comb(self,a,b):
return self.fac[a]*self.finv[b]*self.finv[a-b]%MOD
global DIRECTION_4, DIRECTION_8, DIRECTION_DIAGONAL, DIRECTION_URDL_TABLE, DIRECTION_URDL_COORD_PLANE, MOD, INF, LOWER_ALPS, UPPER_ALPS, ALL_ALPS
# well-used const
# clockwise from top.
DIRECTION_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIRECTION_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIRECTION_DIAGONAL = [[-1,1],[1,1],[1,-1],[-1,-1]]
DIRECTION_URDL_TABLE = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIRECTION_URDL_COORD_PLANE = {'U':(0,1), 'R':(1,0), 'D':(0,-1), 'L':(-1,0)}
MOD = 998244353
INF = float("inf")
LOWER_ALPS = "abcdefghijklmnopqrstuvwxyz"
UPPER_ALPS = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
ALL_ALPS = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
main()
def main():
# write code here.
N = II()
A = LM()
A = [0] + A
#width[i]:=i連勤の時のその部分での生産量.
width = [0]*N
for i in range(1,N):
now = 0
for j in range(1,i+1):
now += A[min(j,i-j+1)]
width[i] = now
dp = [-INF]*(N+1)
dp[0] = 0
for i in range(N):
for j in range(N+1):
if j+i+1 > N: break
dp[j+i+1] = max(dp[j+i+1], dp[j]+width[i])
print(dp[N])
# user config
############
DEBUG_MODE=1
############
# import
import sys
import itertools
import bisect
import math
from collections import *
from pprint import pprint
from functools import cache
import heapq
# alias
DD = defaultdict
BSL = bisect.bisect_left
BSR = bisect.bisect_right
# config
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
# input template
def II(): return int(input())
def IS(): return input()[:-1]
def MI(): return map(int,input().split())
def LM(): return list(MI())
def LL(n): return [LM() for _ in range(n)]
def INPUT_TABLE_LIST(n,remove_br=True): return [list(input())[:-1] if remove_br else list(input()) for _ in range(n)]
def INPUT_TABLE_STRING(n): return [IS() for _ in range(n)]
def MI_1(): return map(lambda x:int(x)-1,input().split())
def LM_1(): return list(MI_1())
def LL_1(n): return [LM_1() for _ in range(n)]
# functions
def bit_count(num):
length = num.bit_length()
res = 0
for i in range(length):
if num >> i & 1:
res += 1
return res
def DB(*args,**kwargs):
global DEBUG_MODE
if not DEBUG_MODE:
return
if args:
print(*args)
return
for name, value in kwargs.items():
print(f"{name} : {value}")
def expand_table(table, h_mag, w_mag):
#引数の二次元配列などをタイルのように繰り替えしたものを返す.
res = []
for row in table:
res.append(row*w_mag)
return res*h_mag
def safe_sqrt(N):
#[平方根]の誤差が怖いとき用.
rough = int(N**0.5)
left = rough - 10
right = rough + 10
while left != right:
mid = (left+right+1)//2
if mid**2 <= N:
left = mid
else:
right = mid - 1
return left
def sigma_LinearFunc(bound_included1, bound_included2, coeff1, coeff0):
"""
coeff1*x + coeff0
の x = [left, right] の和を求める.
"""
left = min(bound_included1, bound_included2)
right = max(bound_included1, bound_included2)
return coeff0*(right-left+1) + coeff1*(left+right)*(right-left+1)//2
def find_divisors(n):
divisors_small = []
divisors_big = []
i = 1
while i * i <= n:
if n % i == 0:
divisors_small.append(i)
# iと一致しない場合、n/iも約数
if i != n // i:
divisors_big.append(n // i)
i += 1
return divisors_small + divisors_big[::-1]
def makeTableBit(table, letter1="#", rev=False):
H,W = len(table), len(table[0])
res = []
for h in range(H):
rowBit = 0
for w in range(W):
if rev:
if table[h][w] == letter1:
rowBit += 2**w
else:
if table[h][W-w-1] == letter1:
rowBit += 2**w
res.append(rowBit)
return res
def rot(S):return list(zip(*S))[::-1]
def topological_sort(G, indegree=None):
N = len(G)
if indegree is None:
indegree = [0]*N
for v in range(N):
for adj in G[v]:
indegree[adj] += 1
deq = deque()
for v in range(N):
if indegree[v] == 0:
deq.append(v)
res = []
while deq:
v = deq.popleft()
res.append(v)
for adj in G[v]:
indegree[adj] -= 1
if indegree[adj] == 0:
deq.append(adj)
return res
def mal_matrix(A, B, mod):
N = len(A)
K = len(A[0])
M = len(B[0])
res = [[0 for _ in range(M)] for _ in range(N)]
for i in range(N) :
for j in range(K) :
for k in range(M) :
res[i][k] += A[i][j] * B[j][k]
res[i][k] %= mod
return res
def pow_matrix(mat, exp, mod):
N = len(mat)
res = [[1 if i == j else 0 for i in range(N)] for j in range(N)]
while exp > 0 :
if exp%2 == 1 :
res = mal_matrix(res, mat, mod)
mat = mal_matrix(mat, mat, mod)
exp //= 2
return res
#classes
"""
・使い方
s=SortedSet() : 引数にイテラブル渡せる.
s.a: SortedSetの中身を返す。
len(s), x in s, x not in s: リストと同じ要領で使える。
s.add(x): xを追加してTrueを返す。ただしxがすでにs内にある場合、xは追加せずにFalseを返す。
s.discard(x): xを削除してTrueを返す。ただしxがs内にない場合、何もせずにFalseを返す。
s.lt(x): xより小さい最大の要素を返す。もし存在しないなら、Noneを返す。
s.le(x): x 以下の 最大の要素を返す。もし存在しないなら、Noneを返す。
s.gt(x): xより大きい最小の要素を返す。もし存在しないなら、Noneを返す。
s.ge(x): x 以上の 最小の要素を返す。もし存在しないなら、Noneを返す。
s.index(x): xより小さい要素の数を返す。
s.index_right(x): x以下の要素の数を返す。
"""
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedSet(Generic[T]):
BUCKET_RATIO = 16
SPLIT_RATIO = 24
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)
n = self.size = len(a)
if any(a[i] > a[i + 1] for i in range(n - 1)):
a.sort()
if any(a[i] >= a[i + 1] for i in range(n - 1)):
a, b = [], a
for x in b:
if not a or a[-1] != x:
a.append(x)
bucket_size = int(math.ceil(math.sqrt(n / self.BUCKET_RATIO)))
self.a = [a[n * i // bucket_size : n * (i + 1) // bucket_size] for i in range(bucket_size)]
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, int]:
"return the bucket, index of the bucket and position in which x should be. self must not be empty."
for i, a in enumerate(self.a):
if x <= a[-1]: break
return (a, i, 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, b, 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.SPLIT_RATIO:
mid = len(a) >> 1
self.a[b:b+1] = [a[:mid], a[mid:]]
return True
def _pop(self, a: List[T], b: int, i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: del self.a[b]
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, b, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, b, 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 b, a in enumerate(reversed(self.a)):
i += len(a)
if i >= 0: return self._pop(a, ~b, i)
else:
for b, a in enumerate(self.a):
if i < len(a): return self._pop(a, b, 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
"""
(num, cnt)を要素としたSSを管理してMultiset化したいとき用.
"""
def exist(self, x):
ret = self.gt((x,0))
if ret is None:
return False
elif ret[0] == x:
return True
else:
return False
def increment(self, x):
if not self.exist(x):
self.add((x,1))
else:
num, cnt = self.gt((x,0))
self.discard((x,cnt))
self.add((x,cnt+1))
def decrement(self, x):
num, cnt = self.gt((x,0))
if cnt == 1:
self.discard((x,cnt))
else:
self.discard((x,cnt))
self.add((x,cnt-1))
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
T = TypeVar('T')
class SortedMultiset(Generic[T]):
BUCKET_RATIO = 16
SPLIT_RATIO = 24
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(a)
n = self.size = len(a)
if any(a[i] > a[i + 1] for i in range(n - 1)):
a.sort()
num_bucket = int(math.ceil(math.sqrt(n / self.BUCKET_RATIO)))
self.a = [a[n * i // num_bucket : n * (i + 1) // num_bucket] for i in range(num_bucket)]
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, int]:
"return the bucket, index of the bucket and position in which x should be. self must not be empty."
for i, a in enumerate(self.a):
if x <= a[-1]: break
return (a, i, 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, b, i = self._position(x)
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.SPLIT_RATIO:
mid = len(a) >> 1
self.a[b:b+1] = [a[:mid], a[mid:]]
def _pop(self, a: List[T], b: int, i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: del self.a[b]
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, b, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, b, 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 b, a in enumerate(reversed(self.a)):
i += len(a)
if i >= 0: return self._pop(a, ~b, i)
else:
for b, a in enumerate(self.a):
if i < len(a): return self._pop(a, b, 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
class UnionFind:
"""
二次元の時は、初期化時に (H,W) のように二次元配列の高さと幅を入力.
引数一個の root とか size は (r,c) みたいに.
引数二個の unite とか same は ((ra,ca),(rb,cb)) みたいに引数入れる.
"""
def __init__(self,*N):
if not isinstance(N[0],int):
N = N[0]
if len(N)==1:
N=N[0]
elif len(N)==2:
self.H, self.W = N[0], N[1]
N = self.H * self.W
self.par = [ i for i in range(N) ]
self.tree_size = [ 1 for i in range(N) ]
def root(self,*x):
x = self._dimCheck1(x)
if self.par[x] == x:
return x
self.par[x] = self.root(self.par[x])
return self.par[x]
def unite(self,*xy):
x,y = self._dimCheck2(xy)
rx = self.root(x)
ry = self.root(y)
if rx == ry:
return
self.par[rx] = ry
self.tree_size[ry] += self.tree_size[rx]
def same(self,*xy):
x,y = self._dimCheck2(xy)
rx = self.root(x)
ry = self.root(y)
return rx == ry
def size(self,*x):
x = self._dimCheck1(x)
rx = self.root(x)
return self.tree_size[rx]
def _dimCheck1(self,x):
if len(x)==1: return x[0]
if len(x)==2: return x[0]*self.W + x[1]
def _dimCheck2(self,xy):
if isinstance(xy[0],int): return xy[0],xy[1]
return xy[0][0]*self.W + xy[0][1], xy[1][0]*self.W + xy[1][1]
class Comb:
def __init__(self,table_len,MOD):
"""
MODが素数の場合しか使用できない.
table_len に指定した数まで法MODでのコンビネーションの計算が可能になる.
"""
self.fac = [1,1]
self.inv = [1,1]
self.finv = [1,1]
self.MOD = MOD
for i in range(2,table_len+1):
self.fac.append(self.fac[i-1]*i%MOD)
self.inv.append(-self.inv[MOD%i]*(MOD//i)%MOD)
self.finv.append(self.finv[i-1]*self.inv[i]%MOD)
def comb(self,a,b):
return self.fac[a]*self.finv[b]*self.finv[a-b]%MOD
global DIRECTION_4, DIRECTION_8, DIRECTION_DIAGONAL, DIRECTION_URDL_TABLE, DIRECTION_URDL_COORD_PLANE, MOD, INF, LOWER_ALPS, UPPER_ALPS, ALL_ALPS
# well-used const
# clockwise from top.
DIRECTION_4 = [[-1,0],[0,1],[1,0],[0,-1]]
DIRECTION_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]]
DIRECTION_DIAGONAL = [[-1,1],[1,1],[1,-1],[-1,-1]]
DIRECTION_URDL_TABLE = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)}
DIRECTION_URDL_COORD_PLANE = {'U':(0,1), 'R':(1,0), 'D':(0,-1), 'L':(-1,0)}
MOD = 998244353
INF = float("inf")
LOWER_ALPS = "abcdefghijklmnopqrstuvwxyz"
UPPER_ALPS = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
ALL_ALPS = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ"
main()
|
ConDefects/ConDefects/Code/abc285_e/Python/51473049
|
condefects-python_data_1753
|
# i番目の重みws[i], 価値vs[i]
def solve(N, W, ws, vs):
dp = [0] * (W+1)
for i in range(N):
# 価値v, 重さw
v = vs[i]; w = ws[i]
for j in range(W, w-1, -1):
dp[j] = max(dp[j-w] + v, dp[j])
return max(dp)
N = int(input())
A = list(map(int,input().split()))
# 初日と翌週初日はお休み
# 開けた日数分の労働力を前計算
# あとはナップサック
from itertools import accumulate
R = list(accumulate(A))
V = [R[0]] + [R[i//2] + R[(i+1)//2] for i in range(N)]
W = [i+2 for i in range(N)]
# print(V,W)
ans = solve(N,N,W,V)
print(ans)
# i番目の重みws[i], 価値vs[i]
def solve(N, W, ws, vs):
dp = [0] * (W+1)
for i in range(N):
# 価値v, 重さw
v = vs[i]; w = ws[i]
for j in range(w, W+1):
dp[j] = max(dp[j-w] + v, dp[j])
return max(dp)
N = int(input())
A = list(map(int,input().split()))
# 初日と翌週初日はお休み
# 開けた日数分の労働力を前計算
# あとはナップサック
from itertools import accumulate
R = list(accumulate(A))
V = [R[0]] + [R[i//2] + R[(i+1)//2] for i in range(N)]
W = [i+2 for i in range(N)]
# print(V,W)
ans = solve(N,N,W,V)
print(ans)
|
ConDefects/ConDefects/Code/abc285_e/Python/53461443
|
condefects-python_data_1754
|
# 初日を休日
# dp[i][j] := i日目を考える、j日平日が続いている
# 10
# 10 10
# 10 10 10
# 10 10 10 10
# 10 10 1 10 10
# 10 10 1 1 10 10
n = int(input())
base_productivity = list(map(int, input().split()))
productivity = [0]
for i in range(n):
productivity.append(productivity[-1] + base_productivity[i//2])
INF = float('inf')
dp = [[-INF]*n for _ in range(n)]
dp[0][0] = 0
for i in range(n-1):
for j in range(n):
if j < n - 1:
dp[i+1][j+1] = dp[i][j]
if dp[i][j] != -INF:
dp[i+1][0] = dp[i][j] + productivity[j]
#print(productivity)
#print(dp)
ans = 0
for i in range(n):
ans = max(ans, dp[n-1][i] + productivity[i])
print(ans)
# 初日を休日
# dp[i][j] := i日目を考える、j日平日が続いている
# 10
# 10 10
# 10 10 10
# 10 10 10 10
# 10 10 1 10 10
# 10 10 1 1 10 10
n = int(input())
base_productivity = list(map(int, input().split()))
productivity = [0]
for i in range(n):
productivity.append(productivity[-1] + base_productivity[i//2])
INF = float('inf')
dp = [[-INF]*n for _ in range(n)]
dp[0][0] = 0
for i in range(n-1):
for j in range(n):
if j < n - 1:
dp[i+1][j+1] = dp[i][j]
if dp[i][j] != -INF:
dp[i+1][0] = max(dp[i+1][0], dp[i][j] + productivity[j])
#print(productivity)
#print(dp)
ans = 0
for i in range(n):
ans = max(ans, dp[n-1][i] + productivity[i])
print(ans)
|
ConDefects/ConDefects/Code/abc285_e/Python/48880084
|
condefects-python_data_1755
|
import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
return (g1[n] * g2[r] % mod) * g2[n-r] % mod
mod = 998244353
N = 2*10**5
g1 = [1]*(N+1)
g2 = [1]*(N+1)
inverse = [1]*(N+1)
for i in range( 2, N + 1 ):
g1[i]=( ( g1[i-1] * i ) % mod )
inverse[i]=( ( -inverse[mod % i] * (mod//i) ) % mod )
g2[i]=( (g2[i-1] * inverse[i]) % mod )
inverse[0]=0
def solve_fixed_sg(edges):
N = 8
in_deg = [0] * N
out_deg = [0] * N
for i in range(N):
for j in range(N):
in_deg[j] += edges[i][j]
out_deg[i] += edges[i][j]
vertex = [v for v in range(N) if in_deg[v]+out_deg[v]!=0]
s,g = -1,-1
for v in vertex:
if in_deg[v] == out_deg[v]-1:
if s!=-1:
return 0
else:
s = v
elif in_deg[v] == out_deg[v] + 1:
if g!=-1:
return 0
else:
g = v
elif in_deg[v]!=out_deg[v]:
return 0
if s == -1 or g == -1:
return 0
edges[g][s] += 1
in_deg[s] += 1
out_deg[g] += 1
assert all(in_deg[v] == out_deg[v] for v in vertex)
deg_prod = 1
for v in vertex:
deg_prod = deg_prod * g1[out_deg[v]-1] % mod
#print(in_deg)
edge_set = [(i,j) for i in range(N) for j in range(N) if edges[i][j]]
#print(edge_set)
E = len(edge_set)
n = len(vertex)
res = 0
#print(edge_set)
for S in range(1<<E):
tmp_edge = [[] for v in range(N)]
deg = [0] * N
tmp_prod = 1
check = []
for i in range(E):
if S>>i & 1:
u,v = edge_set[i]
check.append((u,v))
tmp_edge[v].append(u)
deg[u] += 1
tmp_prod = tmp_prod * edges[u][v] % mod
if sum(deg)!=n-1 or tmp_prod == 0:
continue
visit = [False] * N
st = [s]
visit[s] = True
while st:
v = st.pop()
for nv in tmp_edge[v]:
if not visit[nv]:
visit[nv] = True
st.append(nv)
if any(not visit[v] for v in vertex):
continue
#print("OK",tmp_prod)
#print(s,check)
res += tmp_prod * deg_prod % mod
res %= mod
for i in range(N):
for j in range(N):
if (i,j)!=(g,s):
res *= g2[edges[i][j]]
res %= mod
else:
res *= g2[edges[i][j]-1]
res %= mod
return res
def solve(A):
N = 8
edges = [[0]*N for i in range(N)]
in_deg = [0] * N
out_deg = [0] * N
for S in range(16):
u = S>>1
v = S & 7
if 1:
edges[u][v] += A[S]
in_deg[v] += A[S]
out_deg[u] += A[S]
vertex = [v for v in range(N) if in_deg[v]+out_deg[v]!=0]
s,g = -1,-1
for v in vertex:
if in_deg[v] == out_deg[v]-1:
if s!=-1:
return 0
else:
s = v
elif in_deg[v] == out_deg[v] + 1:
if g!=-1:
return 0
else:
g = v
elif in_deg[v]!=out_deg[v]:
return 0
#print(s,g)
if s!=-1 and g!=-1:
return solve_fixed_sg(edges)
if s!=-1 and g == -1:
return 0
if s == -1 and g!=-1:
return 0
self_loop_prod = 1
for v in range(N):
loop = edges[v][v]
use_time = in_deg[v] - loop
if use_time!=0:
self_loop_prod *= cmb(loop+use_time-1,use_time-1,mod)
elif loop != 0:
self_loop_prod = 0
res = 0
for s in range(N):
for g in range(N):
tmp_edges = [[edges[i][j] if i!=j else 0 for j in range(N)] for i in range(N)]
if edges[g][s] and s!=g:
tmp_edges[g][s] -= 1
self_loop_prod = 1
for v in range(N):
if v!=s:
loop = edges[v][v]
use_time = in_deg[v] - loop
else:
loop = edges[v][v]
use_time = in_deg[v] - loop + 1
if use_time!=0:
self_loop_prod *= cmb(use_time+loop-1,loop,mod)
elif loop!=0:
self_loop_prod = 0
self_loop_prod %= mod
res += solve_fixed_sg(tmp_edges) * self_loop_prod % mod
res %= mod
return res % mod
A = li()
print(solve(A))
import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log
input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
return (g1[n] * g2[r] % mod) * g2[n-r] % mod
mod = 998244353
N = 2*10**5
g1 = [1]*(N+1)
g2 = [1]*(N+1)
inverse = [1]*(N+1)
for i in range( 2, N + 1 ):
g1[i]=( ( g1[i-1] * i ) % mod )
inverse[i]=( ( -inverse[mod % i] * (mod//i) ) % mod )
g2[i]=( (g2[i-1] * inverse[i]) % mod )
inverse[0]=0
def solve_fixed_sg(edges):
N = 8
in_deg = [0] * N
out_deg = [0] * N
for i in range(N):
for j in range(N):
in_deg[j] += edges[i][j]
out_deg[i] += edges[i][j]
vertex = [v for v in range(N) if in_deg[v]+out_deg[v]!=0]
s,g = -1,-1
for v in vertex:
if in_deg[v] == out_deg[v]-1:
if s!=-1:
return 0
else:
s = v
elif in_deg[v] == out_deg[v] + 1:
if g!=-1:
return 0
else:
g = v
elif in_deg[v]!=out_deg[v]:
return 0
if s == -1 or g == -1:
return 0
edges[g][s] += 1
in_deg[s] += 1
out_deg[g] += 1
assert all(in_deg[v] == out_deg[v] for v in vertex)
deg_prod = 1
for v in vertex:
deg_prod = deg_prod * g1[out_deg[v]-1] % mod
#print(in_deg)
edge_set = [(i,j) for i in range(N) for j in range(N) if edges[i][j]]
#print(edge_set)
E = len(edge_set)
n = len(vertex)
res = 0
#print(edge_set)
for S in range(1<<E):
tmp_edge = [[] for v in range(N)]
deg = [0] * N
tmp_prod = 1
check = []
for i in range(E):
if S>>i & 1:
u,v = edge_set[i]
check.append((u,v))
tmp_edge[v].append(u)
deg[u] += 1
tmp_prod = tmp_prod * edges[u][v] % mod
if sum(deg)!=n-1 or tmp_prod == 0:
continue
visit = [False] * N
st = [s]
visit[s] = True
while st:
v = st.pop()
for nv in tmp_edge[v]:
if not visit[nv]:
visit[nv] = True
st.append(nv)
if any(not visit[v] for v in vertex):
continue
#print("OK",tmp_prod)
#print(s,check)
res += tmp_prod * deg_prod % mod
res %= mod
for i in range(N):
for j in range(N):
if (i,j)!=(g,s):
res *= g2[edges[i][j]]
res %= mod
else:
res *= g2[edges[i][j]-1]
res %= mod
return res
def solve(A):
N = 8
edges = [[0]*N for i in range(N)]
in_deg = [0] * N
out_deg = [0] * N
for S in range(16):
u = S>>1
v = S & 7
if 1:
edges[u][v] += A[S]
in_deg[v] += A[S]
out_deg[u] += A[S]
vertex = [v for v in range(N) if in_deg[v]+out_deg[v]!=0]
s,g = -1,-1
for v in vertex:
if in_deg[v] == out_deg[v]-1:
if s!=-1:
return 0
else:
s = v
elif in_deg[v] == out_deg[v] + 1:
if g!=-1:
return 0
else:
g = v
elif in_deg[v]!=out_deg[v]:
return 0
#print(s,g)
if s!=-1 and g!=-1:
return solve_fixed_sg(edges)
if s!=-1 and g == -1:
return 0
if s == -1 and g!=-1:
return 0
self_loop_prod = 1
for v in range(N):
loop = edges[v][v]
use_time = in_deg[v] - loop
if use_time!=0:
self_loop_prod *= cmb(loop+use_time-1,use_time-1,mod)
elif loop != 0:
self_loop_prod = 0
if len(vertex) == 1:
return 1
res = 0
for s in range(N):
for g in range(N):
tmp_edges = [[edges[i][j] if i!=j else 0 for j in range(N)] for i in range(N)]
if edges[g][s] and s!=g:
tmp_edges[g][s] -= 1
self_loop_prod = 1
for v in range(N):
if v!=s:
loop = edges[v][v]
use_time = in_deg[v] - loop
else:
loop = edges[v][v]
use_time = in_deg[v] - loop + 1
if use_time!=0:
self_loop_prod *= cmb(use_time+loop-1,loop,mod)
elif loop!=0:
self_loop_prod = 0
self_loop_prod %= mod
res += solve_fixed_sg(tmp_edges) * self_loop_prod % mod
res %= mod
return res % mod
A = li()
print(solve(A))
|
ConDefects/ConDefects/Code/abc336_g/Python/49317983
|
condefects-python_data_1756
|
N, M = map(int, input().split())
dict = {}
for i in range(M):
a, b = map(int, input().split())
dict.setdefault(a, []).append(b)
dict.setdefault(b, []).append(a)
# キーで辞書をソート
sortDict = sorted(dict.items(), key=lambda x: x[0])
# キーの値（リスト）をソートして出力
for key, value in sortDict:
print(len(value), end=" ")
print(*sorted(value))
N, M = map(int, input().split())
dict = {}
for i in range(1,N):
dict[i] = []
for i in range(M):
a, b = map(int, input().split())
dict.setdefault(a, []).append(b)
dict.setdefault(b, []).append(a)
# キーで辞書をソート
sortDict = sorted(dict.items(), key=lambda x: x[0])
# キーの値（リスト）をソートして出力
for key, value in sortDict:
print(len(value), end=" ")
print(*sorted(value))
|
ConDefects/ConDefects/Code/abc276_b/Python/45457666
|
condefects-python_data_1757
|
h,w=map(int,input().split())
grid=[['.' for _ in range(w+2)]]
for _ in range(h):
tmp=list(input())
grid.append(['.']+tmp+['.'])
grid.append(['.' for _ in range(w+2)])
if grid[1][1]!='s':
print('No')
else:
bool=[[False for _ in range(w+2)] for __ in range(h+2)]
bool[1][1]=True
box=[(1,1)]
direction=[(-1,0),(1,0),(0,-1),(0,1)]
d=dict()
tmp=['s','n','u','k','e','s']
for i in range(5):
d[tmp[i]]=tmp[i+1]
while len(box)>0:
H,W=box.pop()
for dh, dw in direction:
if bool[H+dh][W+dw]==False and grid[H+dh][W+dw]==d[grid[H][W]]:
bool[H+dh][W+dw]=True
box.append((H+dh,W+dw))
if grid[h][w]:
print('Yes')
else:
print('No')
h,w=map(int,input().split())
grid=[['.' for _ in range(w+2)]]
for _ in range(h):
tmp=list(input())
grid.append(['.']+tmp+['.'])
grid.append(['.' for _ in range(w+2)])
if grid[1][1]!='s':
print('No')
else:
bool=[[False for _ in range(w+2)] for __ in range(h+2)]
bool[1][1]=True
box=[(1,1)]
direction=[(-1,0),(1,0),(0,-1),(0,1)]
d=dict()
tmp=['s','n','u','k','e','s']
for i in range(5):
d[tmp[i]]=tmp[i+1]
while len(box)>0:
H,W=box.pop()
for dh, dw in direction:
if bool[H+dh][W+dw]==False and grid[H+dh][W+dw]==d[grid[H][W]]:
bool[H+dh][W+dw]=True
box.append((H+dh,W+dw))
if bool[h][w]:
print('Yes')
else:
print('No')
|
ConDefects/ConDefects/Code/abc308_d/Python/54718266
|
condefects-python_data_1758
|
from sys import setrecursionlimit
H, W = map(int, input().split())
S = [input() for _ in [0]*H]
dir = [(-1, 0), (1, 0), (0, -1), (0, 1)]
setrecursionlimit(300000)
seen = [[False]*W for _ in [0]*H]
def func(y, x, p):
if y == H-1 and x == W-1:
print("Yes")
exit()
for ay, ax in dir:
ny, nx = y + ay, x + ax
if 0 <= ny < H and 0 <= nx < W:
if seen[ny][nx]: continue
seen[ny][nx] = True
if S[ny][nx] == "snuke"[p]:
func(ny, nx, (p+1)%5)
return
if S[0][0] == "s":
seen[0][0] = True
func(0, 0, 1)
print("No")
from sys import setrecursionlimit
H, W = map(int, input().split())
S = [input() for _ in [0]*H]
dir = [(-1, 0), (1, 0), (0, -1), (0, 1)]
setrecursionlimit(300000)
seen = [[False]*W for _ in [0]*H]
def func(y, x, p):
if y == H-1 and x == W-1:
print("Yes")
exit()
for ay, ax in dir:
ny, nx = y + ay, x + ax
if 0 <= ny < H and 0 <= nx < W:
if seen[ny][nx]: continue
if S[ny][nx] == "snuke"[p]:
seen[ny][nx] = True
func(ny, nx, (p+1)%5)
return
if S[0][0] == "s":
seen[0][0] = True
func(0, 0, 1)
print("No")
|
ConDefects/ConDefects/Code/abc308_d/Python/54535139
|
condefects-python_data_1759
|
#!/usr/bin/env python3
MOD = 998244353
def tri(n):
n %= MOD
return ((n + 1) * n // 2) % MOD
def solve():
a1, a2, a3 = map(int, input().split())
if a1 < a2:
a1, a2 = a2, a1
if not a1 <= a3 <= a1 + 1:
return 0
p1 = pow(10, a1 - 1, MOD)
p2 = pow(10, a2 - 1, MOD)
if a1 == a2:
ans = tri(8 * p1)
else:
ans = (9 * p1 - 10 * p2) * (9 * p2) + tri(9 * p2)
if a3 == a1:
return ans
else:
return (9 * p1) * (9 * p2) - ans
t = int(input())
for _ in range(t):
print(solve())
#!/usr/bin/env python3
MOD = 998244353
def tri(n):
n %= MOD
return ((n + 1) * n // 2) % MOD
def solve():
a1, a2, a3 = map(int, input().split())
if a1 < a2:
a1, a2 = a2, a1
if not a1 <= a3 <= a1 + 1:
return 0
p1 = pow(10, a1 - 1, MOD)
p2 = pow(10, a2 - 1, MOD)
if a1 == a2:
ans = tri(8 * p1)
else:
ans = (9 * p1 - 10 * p2) * (9 * p2) + tri(9 * p2)
if a3 == a1:
return ans
else:
return (9 * p1) * (9 * p2) - ans
t = int(input())
for _ in range(t):
print(solve() % MOD)
|
ConDefects/ConDefects/Code/arc178_b/Python/54290534
|
condefects-python_data_1760
|
import sys
input=sys.stdin.readline
T=int(input())
MOD=998244353
def f(p):
return 9*pow(10,p-1,MOD)
def g(p,q):
if p==q:
retval=(f(a)-pow(10,p-1,MOD))*\
(f(a)-pow(10,p-1,MOD)+1)//2
retval%=MOD
return retval
else:
h=f(a)
s=f(b)-pow(10,a-1,MOD)
t=f(b)-pow(10,a,MOD)+1
retval=(s+t)*h//2
retval%=MOD
return retval
for i in range(T):
a,b,c=map(int,input().split())
if a>b:
a,b=b,a
if b<=c<=b+1:
if a==b and b==c:
ans=g(a,b)
elif a<b and b==c:
ans=g(a,b)
elif b<c:
M=f(b)*f(a)
m=g(a,b)
ans=M-m
ans%=MOD
else:
ans=0
print(ans)
import sys
input=sys.stdin.readline
T=int(input())
MOD=998244353
def f(p):
return 9*pow(10,p-1,MOD)
def g(p,q):
if p==q:
retval=(f(a)-pow(10,p-1,MOD))*\
(f(a)-pow(10,p-1,MOD)+1)//2
retval%=MOD
return retval
else:
h=f(a)
s=f(b)-pow(10,a-1,MOD)
t=f(b)-pow(10,a,MOD)+1
retval=(s+t)*h*pow(2,-1,MOD)
retval%=MOD
return retval
for i in range(T):
a,b,c=map(int,input().split())
if a>b:
a,b=b,a
if b<=c<=b+1:
if a==b and b==c:
ans=g(a,b)
elif a<b and b==c:
ans=g(a,b)
elif b<c:
M=f(b)*f(a)
m=g(a,b)
ans=M-m
ans%=MOD
else:
ans=0
print(ans)
|
ConDefects/ConDefects/Code/arc178_b/Python/54236460
|
condefects-python_data_1761
|
t = int(input())
for _ in range(t):
n = int(input())
ans = 0
if n>=1: ans += 1
cnt = 2
while n>=10**cnt-2*10**(cnt//2):
ans += 1
ans += min(n, 10**cnt+10**(cnt//2)-1) - (10**cnt-10**(cnt//2)-1)
cnt += 2
print(ans)
t = int(input())
for _ in range(t):
n = int(input())
ans = 0
if n>=1: ans += 1
cnt = 2
while n>=10**cnt-2*10**(cnt//2):
ans += 1
ans += max(0, min(n, 10**cnt+10**(cnt//2)-1) - (10**cnt-10**(cnt//2)-1))
cnt += 2
print(ans)
|
ConDefects/ConDefects/Code/arc174_d/Python/51409995
|
condefects-python_data_1762
|
t = int(input())
ins = [(1,1)]
for x in range(2,19,2):
v = pow(10,x)
h = pow(10,x//2)
ins.append((v-h*2,v-h*2))
ins.append((v-h,v+h-1))
print(ins)
for _ in range(t):
n = int(input())
ans = 0
for l,r in ins:
r = min(r,n)
if l <= r:
ans += r-l+1
print(ans)
t = int(input())
ins = [(1,1)]
for x in range(2,19,2):
v = pow(10,x)
h = pow(10,x//2)
ins.append((v-h*2,v-h*2))
ins.append((v-h,v+h-1))
#print(ins)
for _ in range(t):
n = int(input())
ans = 0
for l,r in ins:
r = min(r,n)
if l <= r:
ans += r-l+1
print(ans)
|
ConDefects/ConDefects/Code/arc174_d/Python/51974716
|
condefects-python_data_1763
|
import copy
r, c = map(int, input().split())
b = []
for _ in range(r):
b.append(list(input()))
z = [0] * 10
zz = [0] * (c + 20)
ans = copy.copy(b)
for i in range(r):
for k in range(c):
if (b[i][k] == '1' or
b[i][k] == '2' or
b[i][k] == '3' or
b[i][k] == '4' or
b[i][k] == '5' or
b[i][k] == '6' or
b[i][k] == '7' or
b[i][k] == '8' or
b[i][k] == '9'):
p = int(b[i][k])
for m in range(r):
for n in range(c):
if abs(i - m) + abs(k - n) <= p:
ans[m][n] = '.'
for i in range(r):
for k in range(c):
print(ans[i][k], end='')
print()
import copy
r, c = map(int, input().split())
b = []
for _ in range(r):
b.append(list(input()))
z = [0] * 10
zz = [0] * (c + 20)
ans = copy.deepcopy(b)
for i in range(r):
for k in range(c):
if (b[i][k] == '1' or
b[i][k] == '2' or
b[i][k] == '3' or
b[i][k] == '4' or
b[i][k] == '5' or
b[i][k] == '6' or
b[i][k] == '7' or
b[i][k] == '8' or
b[i][k] == '9'):
p = int(b[i][k])
for m in range(r):
for n in range(c):
if abs(i - m) + abs(k - n) <= p:
ans[m][n] = '.'
for i in range(r):
for k in range(c):
print(ans[i][k], end='')
print()
|
ConDefects/ConDefects/Code/abc295_b/Python/45969944
|
condefects-python_data_1764
|
R, C = map(int, input().split())
# 行列受け取り
B = []
for i in range(R):
row = input()
B.append(row)
# 新しく行列を作成
Q = [['1'] * C for r in range(R)]
for i in range(R):
for j in range(C):
# 数値に変換
# 変換出来たら数値のマンハッタン距離分のマスに"."を入れる
# 変換できなかった場合は、作成した行列が1の場合のみ、受け取った行列の値を入れる
b = B[i][j]
numberCheck = b.isdecimal()
if numberCheck:
num = int(b)
for n in range(-num, num + 1):
for m in range(-(num - abs(n)), num - abs(n) + 1):
if (n + i) >= 0 and (m + j) >= 0 and (n + i) < R and (m + j) < C:
Q[n + i][m + j] = '.'
else :
if Q[i][j] == "1":
Q[i][j] = "#"
for q in Q:
for i in q:
print(i, end="")
print()
R, C = map(int, input().split())
# 行列受け取り
B = []
for i in range(R):
row = input()
B.append(row)
# 新しく行列を作成
Q = [['1'] * C for r in range(R)]
for i in range(R):
for j in range(C):
# 数値に変換
# 変換出来たら数値のマンハッタン距離分のマスに"."を入れる
# 変換できなかった場合は、作成した行列が1の場合のみ、受け取った行列の値を入れる
b = B[i][j]
numberCheck = b.isdecimal()
if numberCheck:
num = int(b)
for n in range(-num, num + 1):
for m in range(-(num - abs(n)), num - abs(n) + 1):
if (n + i) >= 0 and (m + j) >= 0 and (n + i) < R and (m + j) < C:
Q[n + i][m + j] = '.'
else :
if Q[i][j] == "1":
Q[i][j] = b
for q in Q:
for i in q:
print(i, end="")
print()
|
ConDefects/ConDefects/Code/abc295_b/Python/45457264
|
condefects-python_data_1765
|
S = input()
T = input()
if T[-1] == 'X':
T = T[0:2]
T = T.lower()
j = 0
for i in range(len(T)):
while j < len(S):
if T[i] == S[j]:
j += 1
break
j += 1
if j == len(S):
print("No")
else:
print("Yes")
S = input()
T = input()
if T[-1] == 'X':
T = T[0:2]
T = T.lower()
j = 0
for i in range(len(T)):
while j < len(S):
if T[i] == S[j]:
j += 1
break
j += 1
if j == len(S) and S[-1] != T[-1]:
print("No")
else:
print("Yes")
|
ConDefects/ConDefects/Code/abc349_c/Python/54901128
|
condefects-python_data_1766
|
def addstr(a,b,c):
return a+"\n"+str(b)+" "+str(c)
N=int(input())
P=list(map(lambda x: int(x)-1,input().split()))
Q=[-1]*N
for i in range(N):
Q[P[i]]=i
l=0
r=N-1
ans="Yes"
cnt=0
while l<r:
if l==Q[l]:
l+=1
continue
elif r==Q[r]:
r-=1
continue
elif l<Q[l]<=r-1:
ans=addstr(ans,Q[l]+1,l)
cnt+=1
for i in range(l,Q[l]):
Q[P[i]]+=2
P=P[:l]+P[Q[l]:Q[l]+2]+P[l:Q[l]]+P[Q[l]+2:]
Q[P[l]]=l
Q[P[l+1]]=l+1
l+=1
continue
elif l+1<=Q[r]<r:
ans=addstr(ans,Q[r],r-1)
cnt+=1
for i in range(Q[r]+1,r+1):
Q[P[i]]-=2
P=P[:Q[r]-1]+P[Q[r]+1:r+1]+P[Q[r]-1:Q[r]+1]+P[r+1:]
Q[P[r]]=r
Q[P[r-1]]=r-1
r-=1
continue
else:
if r - l <= 2:
print("No")
break
ans=addstr(ans,r,r-2)
cnt+=1
P[r-2],P[r-1],P[r]=P[r-1],P[r],P[r-2]
Q[P[r]]=r
Q[P[r-1]]=r-1
Q[P[r-2]]=r-2
else:
ans=ans[:4]+str(cnt)+"\n"+ans[4:]
print(ans)
def addstr(a,b,c):
return a+"\n"+str(b)+" "+str(c)
N=int(input())
P=list(map(lambda x: int(x)-1,input().split()))
Q=[-1]*N
for i in range(N):
Q[P[i]]=i
l=0
r=N-1
ans="Yes"
cnt=0
while l<r:
if l==Q[l]:
l+=1
continue
elif r==Q[r]:
r-=1
continue
elif l<Q[l]<=r-1:
ans=addstr(ans,Q[l]+1,l)
cnt+=1
for i in range(l,Q[l]):
Q[P[i]]+=2
P=P[:l]+P[Q[l]:Q[l]+2]+P[l:Q[l]]+P[Q[l]+2:]
Q[P[l]]=l
Q[P[l+1]]=l+1
l+=1
continue
elif l+1<=Q[r]<r:
ans=addstr(ans,Q[r],r-1)
cnt+=1
for i in range(Q[r]+1,r+1):
Q[P[i]]-=2
P=P[:Q[r]-1]+P[Q[r]+1:r+1]+P[Q[r]-1:Q[r]+1]+P[r+1:]
Q[P[r]]=r
Q[P[r-1]]=r-1
r-=1
continue
else:
if r - l <= 2:
print("No")
break
ans=addstr(ans,r,r-2)
cnt+=1
P[r-2],P[r-1],P[r]=P[r-1],P[r],P[r-2]
Q[P[r]]=r
Q[P[r-1]]=r-1
Q[P[r-2]]=r-2
else:
ans=ans[:3]+"\n"+str(cnt)+ans[3:]
print(ans)
|
ConDefects/ConDefects/Code/arc162_b/Python/43537557
|
condefects-python_data_1767
|
N = int(input())
P_list = list(map(int, input().split()))
ans = []
for j in range(1, N):
i = P_list.index(j) + 1
if i == N:
ans.append((N-1, N-2))
P_list = P_list[:N-3] + [P_list[N-2], P_list[N-1], P_list[N-3]]
i = N-1
if P_list == list(range(1, N+1)):
break
# print(P_list)
ans.append((i, j-1))
a, b = P_list[i-1], P_list[i]
del P_list[i-1:i+1]
P_list = P_list[:j-1] + [a, b] + P_list[j-1:]
# print(P_list)
if P_list == list(range(1, N+1)):
break
if P_list == list(range(1, N+1)):
print("Yes")
print(len(ans))
for a in ans:
print(*a)
else:
print("No")
N = int(input())
P_list = list(map(int, input().split()))
ans = []
for j in range(1, N):
i = P_list.index(j) + 1
if i == N:
ans.append((N-1, N-3))
P_list = P_list[:N-3] + [P_list[N-2], P_list[N-1], P_list[N-3]]
i = N-1
if P_list == list(range(1, N+1)):
break
# print(P_list)
ans.append((i, j-1))
a, b = P_list[i-1], P_list[i]
del P_list[i-1:i+1]
P_list = P_list[:j-1] + [a, b] + P_list[j-1:]
# print(P_list)
if P_list == list(range(1, N+1)):
break
if P_list == list(range(1, N+1)):
print("Yes")
print(len(ans))
for a in ans:
print(*a)
else:
print("No")
|
ConDefects/ConDefects/Code/arc162_b/Python/45211703
|
condefects-python_data_1768
|
n = int(input())
p = list(map(lambda x:int(x)-1,input().split()))
ans = []
for i in range(n-2):
if p[i] == i:
continue
for j in range(i+1,n):
if p[j] == i:
break
if j != n-1:
ans.append([j+1,i])
p = p[:i]+p[j:j+2]+p[i:j]+p[j+2:]
else:
ans.append([n-1,n-3])
ans.append([n-1,i+1])
p = p[:i]+[p[-1],p[-3]]+p[i:-3]+[p[-2]]
if p[-1] == n-1:
print('Yes')
print(len(ans))
for i in range(len(ans)):
print(*ans[i])
else:
print('No')
n = int(input())
p = list(map(lambda x:int(x)-1,input().split()))
ans = []
for i in range(n-2):
if p[i] == i:
continue
for j in range(i+1,n):
if p[j] == i:
break
if j != n-1:
ans.append([j+1,i])
p = p[:i]+p[j:j+2]+p[i:j]+p[j+2:]
else:
ans.append([n-1,n-3])
ans.append([n-1,i])
p = p[:i]+[p[-1],p[-3]]+p[i:-3]+[p[-2]]
if p[-1] == n-1:
print('Yes')
print(len(ans))
for i in range(len(ans)):
print(*ans[i])
else:
print('No')
|
ConDefects/ConDefects/Code/arc162_b/Python/44215494
|
condefects-python_data_1769
|
N = int(input())
P = list(map(int,input().split()))
res = []
for i in range(1, N):
pos = [-1 for _ in range(N)]
for ind, j in enumerate(P):
if j != i:
continue
if ind == N-1 and i == N-1:
print("No")
exit()
elif ind == N-1 and i != N-1:
P.pop()
P.insert(N-3, i)
ind = N-3
res.append([N-2, N-1])
index1 = ind
index2 = ind+1
value1 = j
value2 = P[index2]
break
P.remove(value2)
P.remove(value1)
P.insert(i-1, value1)
P.insert(i, value2)
res.append([index1+1, i-1])
print("Yes")
print(len(res))
for i in res:
print(*i)
N = int(input())
P = list(map(int,input().split()))
res = []
for i in range(1, N):
pos = [-1 for _ in range(N)]
for ind, j in enumerate(P):
if j != i:
continue
if ind == N-1 and i == N-1:
print("No")
exit()
elif ind == N-1 and i != N-1:
P.pop()
P.insert(N-3, i)
ind = N-3
res.append([N-2, N-2])
index1 = ind
index2 = ind+1
value1 = j
value2 = P[index2]
break
P.remove(value2)
P.remove(value1)
P.insert(i-1, value1)
P.insert(i, value2)
res.append([index1+1, i-1])
print("Yes")
print(len(res))
for i in res:
print(*i)
|
ConDefects/ConDefects/Code/arc162_b/Python/45772251
|
condefects-python_data_1770
|
n = int(input())
p = list(map(int, input().split()))
ans = []
j = 0
while j < n:
if p[j] != j + 1 and j < n - 2:
ind = p.index(j + 1)
if ind == n - 1:
ans.append((n - 1, n - 3))
p = p[: n - 3] + [p[n - 1]] + p[n - 3 : n - 1]
else:
ans.append((ind + 1, j))
p = p[:j] + p[ind : ind + 2] + p[j:ind] + p[ind + 2 :]
j += 1
else:
j += 1
if p[-1] != n:
print("No")
else:
print("Yes")
print(len(ans))
for a in ans:
print(*a)
n = int(input())
p = list(map(int, input().split()))
ans = []
j = 0
while j < n:
if p[j] != j + 1 and j < n - 2:
ind = p.index(j + 1)
if ind == n - 1:
ans.append((n - 2, n - 2))
p = p[: n - 3] + [p[n - 1]] + p[n - 3 : n - 1]
else:
ans.append((ind + 1, j))
p = p[:j] + p[ind : ind + 2] + p[j:ind] + p[ind + 2 :]
j += 1
else:
j += 1
if p[-1] != n:
print("No")
else:
print("Yes")
print(len(ans))
for a in ans:
print(*a)
|
ConDefects/ConDefects/Code/arc162_b/Python/45429889
|
condefects-python_data_1771
|
I=input;R=lambda:[*map(int,I().split())]
def f(a,sign=1,chk=False):
for i in range(1,n,2):
if a[i]*sign>a[i+1]*sign:
if i!=1 and a[i]*sign<a[i-2]*sign or a[i+1]*sign<a[i-1]*sign:
return 0
if chk and (s[a[i]]!='' or s[a[i+1]]!=''):return 0
s[a[i]]='(';s[a[i+1]]=')'
return 1
n=int(I())*2+1;p=[0]+R();q=[0]+R();s=['']*n
x,y=f(p),f(q,-1,True);s=s[1:]
print([-1,''.join(s)][x and y and all(c!='' for c in s)])
I=input;R=lambda:[*map(int,I().split())]
def f(a,sign=1,chk=False):
for i in range(1,n,2):
if a[i]*sign>a[i+1]*sign:
if i!=1 and (a[i]*sign<a[i-2]*sign or a[i+1]*sign<a[i-1]*sign):
return 0
if chk and (s[a[i]]!='' or s[a[i+1]]!=''):return 0
s[a[i]]='(';s[a[i+1]]=')'
return 1
n=int(I())*2+1;p=[0]+R();q=[0]+R();s=['']*n
x,y=f(p),f(q,-1,True);s=s[1:]
print([-1,''.join(s)][x and y and all(c!='' for c in s)])
|
ConDefects/ConDefects/Code/arc141_c/Python/33055837
|
condefects-python_data_1772
|
N=int(input())
p_array=list(map(lambda e: int(e)-1, input().split()))
q_array=list(map(lambda e: int(e)-1, input().split()))
rets=[0]*2*N
# pを先頭からチェック
done=[False]*2*N
now=0
for i in range(N*2):
if p_array[i]==now:
now+=1
for j in range(now,N*2):
if done[j]:
now=j+1
else:
break
else:
rets[p_array[i]]=1
done[p_array[i]]=True
#print(rets)
# pを末尾からチェック
done=[False]*2*N
now=2*N-1
for i in range(N*2-1,-1,-1):
if p_array[i]==now:
now-=1
for j in range(now,-1,-1):
if done[j]:
now=j-1
else:
break
else:
if rets[p_array[i]]==1:
print(-1)
exit()
rets[p_array[i]]=-1
done[p_array[i]]=True
#print(rets)
# qを先頭からチェック
done=[False]*2*N
now=2*N-1
for i in range(N*2):
if q_array[i]==now:
now-=1
for j in range(now,-1,-1):
if done[j]:
now=j-1
else:
break
else:
if rets[q_array[i]]==-1:
print(-1,i,now,q_array,q_array[i],rets[q_array[i]])
exit()
rets[q_array[i]]=1
done[q_array[i]]=True
#print(rets)
# qを末尾からチェック
done=[False]*2*N
now=0
for i in range(N*2-1,-1,-1):
if q_array[i]==now:
now+=1
for j in range(now,N*2):
if done[j]:
now=j+1
else:
break
else:
if rets[q_array[i]]==1:
print(-1)
exit()
rets[q_array[i]]=-1
done[q_array[i]]=True
#print(rets)
if 0 in rets:
print(-1)
exit()
for ret in rets:
if ret>0:
print("(",end="")
else:
print(")",end="")
print()
N=int(input())
p_array=list(map(lambda e: int(e)-1, input().split()))
q_array=list(map(lambda e: int(e)-1, input().split()))
rets=[0]*2*N
# pを先頭からチェック
done=[False]*2*N
now=0
for i in range(N*2):
if p_array[i]==now:
now+=1
for j in range(now,N*2):
if done[j]:
now=j+1
else:
break
else:
rets[p_array[i]]=1
done[p_array[i]]=True
#print(rets)
# pを末尾からチェック
done=[False]*2*N
now=2*N-1
for i in range(N*2-1,-1,-1):
if p_array[i]==now:
now-=1
for j in range(now,-1,-1):
if done[j]:
now=j-1
else:
break
else:
if rets[p_array[i]]==1:
print(-1)
exit()
rets[p_array[i]]=-1
done[p_array[i]]=True
#print(rets)
# qを先頭からチェック
done=[False]*2*N
now=2*N-1
for i in range(N*2):
if q_array[i]==now:
now-=1
for j in range(now,-1,-1):
if done[j]:
now=j-1
else:
break
else:
if rets[q_array[i]]==-1:
print(-1)
exit()
rets[q_array[i]]=1
done[q_array[i]]=True
#print(rets)
# qを末尾からチェック
done=[False]*2*N
now=0
for i in range(N*2-1,-1,-1):
if q_array[i]==now:
now+=1
for j in range(now,N*2):
if done[j]:
now=j+1
else:
break
else:
if rets[q_array[i]]==1:
print(-1)
exit()
rets[q_array[i]]=-1
done[q_array[i]]=True
#print(rets)
if 0 in rets:
print(-1)
exit()
for ret in rets:
if ret>0:
print("(",end="")
else:
print(")",end="")
print()
|
ConDefects/ConDefects/Code/arc141_c/Python/34662508
|
condefects-python_data_1773
|
n = int(input())
p = list(map(int,input().split()))
q = list(map(int,input().split()))
n2 = n*2
ans = [''] * (n2+1)
left = 0
max_pi = 0
max_qi = 0
for i,pi,qi in zip(range(n2), p, q[::-1]):
max_pi = max(max_pi, pi)
max_qi = max(max_qi, qi)
# print(i, max_pi,max_qi)
if i % 2 == 0:
continue
if max_pi != i+1 or max_qi != i+1:
continue
p_cut = p[left:i+1]
q_cut = q[n2-i-1:n2-left]
l = i+1-left
# print(p_cut, q_cut)
p_up = True
for j in range(l-1):
if p_cut[j] + 1 != p_cut[j+1]:
p_up = False
break
if p_up:
check = True
for j in range(l-2):
if q_cut[j] > q_cut[j+2]:
check = False
if check:
for j in range(l):
if j % 2 == 0:
ans[q_cut[j]] = '('
else:
ans[q_cut[j]] = ')'
left = i+1
continue
q_down = True
for j in range(l-1):
if q_cut[j] - 1 != q_cut[j+1]:
q_down = False
break
if q_down:
check = True
for j in range(l-2):
if p_cut[j] > p_cut[j+2]:
check = False
if check:
for j in range(l):
if j % 2 == 0:
ans[p_cut[j]] = '('
else:
ans[p_cut[j]] = ')'
left = i+1
continue
print(-1)
exit()
def check_ans(x, p, q):
lefts = []
rights = []
for i,xi in enumerate(x,1):
if xi == '(':
lefts.append(i)
else:
rights.append(i)
# print(x)
# print(lefts,rights)
p2 = []
i,j = 0,0
plus = 0
while i < n or j < n:
# print(i,j,plus)
if i == n:
p2.append(rights[j])
j += 1
elif j == n:
p2.append(lefts[i])
i += 1
elif plus == 0:
p2.append(lefts[i])
i += 1
plus += 1
elif lefts[i] < rights[j]:
p2.append(lefts[i])
i += 1
plus += 1
else:
p2.append(rights[j])
j += 1
plus -= 1
if p != p2:
return False
q2 = []
i,j = n-1,n-1
plus = 0
while i >= 0 or j >= 0:
if i == -1:
q2.append(rights[j])
j -= 1
elif j == -1:
q2.append(lefts[i])
i -= 1
elif plus == 0:
q2.append(lefts[i])
i -= 1
plus += 1
elif lefts[i] > rights[j]:
q2.append(lefts[i])
i -= 1
plus += 1
else:
q2.append(rights[j])
j -= 1
plus -= 1
if q != q2:
return False
return True
if check_ans(ans[1:], p, q):
print(*ans[1:], sep='')
else:
print(-1)
n = int(input())
p = list(map(int,input().split()))
q = list(map(int,input().split()))
n2 = n*2
ans = [''] * (n2+1)
left = 0
max_pi = 0
max_qi = 0
for i,pi,qi in zip(range(n2), p, q[::-1]):
max_pi = max(max_pi, pi)
max_qi = max(max_qi, qi)
# print(i, max_pi,max_qi)
if i % 2 == 0:
continue
if max_pi != i+1 or max_qi != i+1:
continue
p_cut = p[left:i+1]
q_cut = q[n2-i-1:n2-left]
l = i+1-left
# print(p_cut, q_cut)
p_up = True
for j in range(l-1):
if p_cut[j] + 1 != p_cut[j+1]:
p_up = False
break
if p_up:
check = True
for j in range(l-2):
if q_cut[j] < q_cut[j+2]:
check = False
if check:
for j in range(l):
if j % 2 == 0:
ans[q_cut[j]] = '('
else:
ans[q_cut[j]] = ')'
left = i+1
continue
q_down = True
for j in range(l-1):
if q_cut[j] - 1 != q_cut[j+1]:
q_down = False
break
if q_down:
check = True
for j in range(l-2):
if p_cut[j] > p_cut[j+2]:
check = False
if check:
for j in range(l):
if j % 2 == 0:
ans[p_cut[j]] = '('
else:
ans[p_cut[j]] = ')'
left = i+1
continue
print(-1)
exit()
def check_ans(x, p, q):
lefts = []
rights = []
for i,xi in enumerate(x,1):
if xi == '(':
lefts.append(i)
else:
rights.append(i)
# print(x)
# print(lefts,rights)
p2 = []
i,j = 0,0
plus = 0
while i < n or j < n:
# print(i,j,plus)
if i == n:
p2.append(rights[j])
j += 1
elif j == n:
p2.append(lefts[i])
i += 1
elif plus == 0:
p2.append(lefts[i])
i += 1
plus += 1
elif lefts[i] < rights[j]:
p2.append(lefts[i])
i += 1
plus += 1
else:
p2.append(rights[j])
j += 1
plus -= 1
if p != p2:
return False
q2 = []
i,j = n-1,n-1
plus = 0
while i >= 0 or j >= 0:
if i == -1:
q2.append(rights[j])
j -= 1
elif j == -1:
q2.append(lefts[i])
i -= 1
elif plus == 0:
q2.append(lefts[i])
i -= 1
plus += 1
elif lefts[i] > rights[j]:
q2.append(lefts[i])
i -= 1
plus += 1
else:
q2.append(rights[j])
j -= 1
plus -= 1
if q != q2:
return False
return True
if check_ans(ans[1:], p, q):
print(*ans[1:], sep='')
else:
print(-1)
|
ConDefects/ConDefects/Code/arc141_c/Python/40547162
|
condefects-python_data_1774
|
N,P=map(int,input().split())
A=list(map(int,input().split()))
pr=set()
K=P-1
i=2
while i*i<=P-1:
while K%i==0:
if not(i in set()):
pr.add(i)
K//=i
if i==2:
i+=1
else:
i+=2
div=[]
div2=[]
i=1
while i*i<=P-1:
if (P-1)%i==0:
div.append(i)
div2.append((P-1)//i)
i+=1
if div2[-1]==div[-1]:
div2.pop()
while div2:
div.append(div2.pop())
d=dict()
for i in range(len(div)):
d[div[i]]=i
def n_ord(a):
ans=P-1
for p in pr:
while ans%p==0:
l=ans//p
if pow(a,l,P)==1:
ans=l
else:
break
return d[ans]
B=[0]*len(div)
for a in A:
B[n_ord(a)]+=1
cnt=0
for i in range(len(div)):
for j in range(i,len(div)):
if div[j]%div[i]==0:
cnt+=B[i]*B[j]
print(cnt)
N,P=map(int,input().split())
A=list(map(int,input().split()))
pr=set()
K=P-1
i=2
while i*i<=P-1:
while K%i==0:
if not(i in set()):
pr.add(i)
K//=i
if i==2:
i+=1
else:
i+=2
if K!=1:
pr.add(K)
div=[]
div2=[]
i=1
while i*i<=P-1:
if (P-1)%i==0:
div.append(i)
div2.append((P-1)//i)
i+=1
if div2[-1]==div[-1]:
div2.pop()
while div2:
div.append(div2.pop())
d=dict()
for i in range(len(div)):
d[div[i]]=i
def n_ord(a):
ans=P-1
for p in pr:
while ans%p==0:
l=ans//p
if pow(a,l,P)==1:
ans=l
else:
break
return d[ans]
B=[0]*len(div)
for a in A:
B[n_ord(a)]+=1
cnt=0
for i in range(len(div)):
for j in range(i,len(div)):
if div[j]%div[i]==0:
cnt+=B[i]*B[j]
print(cnt)
|
ConDefects/ConDefects/Code/abc335_g/Python/49224063
|
condefects-python_data_1775
|
def func():
# 入力を取得
N = int(input())
A = list(map(int, input().split()))
P = 0
for n in range(N):
if sum(A[n:]) > 4:
P += 1
print(P)
if __name__ == '__main__':
func()
def func():
# 入力を取得
N = int(input())
A = list(map(int, input().split()))
P = 0
for n in range(N):
if sum(A[n:]) >= 4:
P += 1
print(P)
if __name__ == '__main__':
func()
|
ConDefects/ConDefects/Code/abc256_b/Python/45645329
|
condefects-python_data_1776
|
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
for j in range(i):
a[j]+=a[i]
ans=0
for i in range(n):
ans+= a[i]>=5
print(ans)
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
for j in range(i):
a[j]+=a[i]
ans=0
for i in range(n):
ans+= a[i]>=4
print(ans)
|
ConDefects/ConDefects/Code/abc256_b/Python/44471761
|
condefects-python_data_1777
|
N = int(input())
A = list(map(int, input().split()))
cum_sum = [0] * (N + 1)
for i in range(N):
cum_sum[i + 1] = cum_sum[i] + A[i]
ans = 0
for i in range(N):
if 4 < cum_sum[N] - cum_sum[i]:
ans += 1
else:
break
print(ans)
N = int(input())
A = list(map(int, input().split()))
cum_sum = [0] * (N + 1)
for i in range(N):
cum_sum[i + 1] = cum_sum[i] + A[i]
ans = 0
for i in range(N):
if 3 < cum_sum[N] - cum_sum[i]:
ans += 1
else:
break
print(ans)
|
ConDefects/ConDefects/Code/abc256_b/Python/45997189
|
condefects-python_data_1778
|
from collections import deque
N = int(input())
A = list(map(int, input().split()))
Q = deque()
ans = 0
for a in A:
ans += 1
if len(Q) == 0:
Q.append([a,1])
if Q[-1][0] != a:
Q.append([a,1])
else:
Q[-1][1] += 1
if Q[-1][1] == a:
Q.pop()
ans -= a
print(ans)
from collections import deque
N = int(input())
A = list(map(int, input().split()))
Q = deque()
ans = 0
for a in A:
ans += 1
if len(Q) == 0:
Q.append([a,1])
elif Q[-1][0] != a:
Q.append([a,1])
else:
Q[-1][1] += 1
if Q[-1][1] == a:
Q.pop()
ans -= a
print(ans)
|
ConDefects/ConDefects/Code/abc240_d/Python/45435904
|
condefects-python_data_1779
|
T=int(input())
for o in range(T):
N,K=map(int,input().split())
for i in range(70):
if 2**i+2>N:
k=i
break
result=K
x,y,z=[K-1,K-1],[K,K],[K+1,K+1]
Q=[x,y,z]
if x[0]%(2**k)==1 or x[0]%(2**k)==2**(k-1)+1 or x[0]==2**(k-1)+1:
x[1]+=1
elif x[0]%(2**k)==2 or x[0]%(2**k)==2**(k-1)+2 or x[0]==2**(k-1)+2:
x[1]-=1
if y[0]%(2**k)==1 or y[0]%(2**k)==2**(k-1)+1:
if y[1]<N:
y[1]+=1
elif y[0]%(2**k)==2 or y[0]%(2**k)==2**(k-1)+2 or y[0]==2**(k-1)+2:
y[1]-=1
if z[0]%(2**k)==1 or z[0]%(2**k)==2**(k-1)+1:
if z[1]<N:
z[1]+=1
elif z[0]%(2**k)==2 or z[0]%(2**k)==2**(k-1)+2 or z[0]==2**(k-1)+2:
z[1]-=1
c=2**k
if K>=2**(k-1)+1:
p=2**(k-1)+1
else:
p=1
for i in range(k-1,0,-1):
if (N-2)%(2**i)>=2**(i-1):
w=p+2**(i-1)
if z[0]==w:
z[1]=z[0]+1
if y[0]==w:
y[1],z[1]=z[1],y[1]
if x[0]==w:
x[1],y[1]=y[1],x[1]
if x[0]==w+1:
x[1]=x[0]-1
if y[0]>w:
p=w
if N>=4:
print(y[1])
elif N==2:
v=[2,1]
print(v[K-1])
elif N==3:
v=[2,3,1]
print(v[K-1])
T=int(input())
for o in range(T):
N,K=map(int,input().split())
for i in range(70):
if 2**i+2>N:
k=i
break
result=K
x,y,z=[K-1,K-1],[K,K],[K+1,K+1]
Q=[x,y,z]
if x[0]%(2**k)==1 or x[0]%(2**k)==2**(k-1)+1 or x[0]==2**(k-1)+1:
x[1]+=1
elif x[0]%(2**k)==2 or x[0]%(2**k)==2**(k-1)+2 or x[0]==2**(k-1)+2:
x[1]-=1
if y[0]%(2**k)==1 or y[0]%(2**k)==2**(k-1)+1:
if y[1]<N:
y[1]+=1
elif y[0]%(2**k)==2 or y[0]%(2**k)==2**(k-1)+2 or y[0]==2**(k-1)+2:
y[1]-=1
if z[0]%(2**k)==1 or z[0]%(2**k)==2**(k-1)+1:
if z[1]<N:
z[1]+=1
elif z[0]%(2**k)==2 or z[0]%(2**k)==2**(k-1)+2 or z[0]==2**(k-1)+2:
z[1]-=1
c=2**k
if K>2**(k-1)+1:
p=2**(k-1)+1
else:
p=1
for i in range(k-1,0,-1):
if (N-2)%(2**i)>=2**(i-1):
w=p+2**(i-1)
if z[0]==w:
z[1]=z[0]+1
if y[0]==w:
y[1],z[1]=z[1],y[1]
if x[0]==w:
x[1],y[1]=y[1],x[1]
if x[0]==w+1:
x[1]=x[0]-1
if y[0]>w:
p=w
if N>=4:
print(y[1])
elif N==2:
v=[2,1]
print(v[K-1])
elif N==3:
v=[2,3,1]
print(v[K-1])
|
ConDefects/ConDefects/Code/agc061_a/Python/38853475
|
condefects-python_data_1780
|
def ans(n,k,bit):
b=1<<bit
if n&b==0: return ans(n,k,bit-1)
if n==b:
if k%2==0: return k-1
else: return k+1
elif n==b+1:
if k==1: return 2
elif k==n-1: return n
elif k%2==1: return k-2
else: return k+2
else:
if k<=n-b: return ans(n-b,k,bit-1)
elif k>=b+1: return ans(n-b,k,bit-1)+b
else: return k
T=int(input())
for _ in range(T):
N,K=map(int,input().split())
print(ans(N,K,60))
def ans(n,k,bit):
b=1<<bit
if n&b==0: return ans(n,k,bit-1)
if n==b:
if k%2==0: return k-1
else: return k+1
elif n==b+1:
if k==1: return 2
elif k==n-1: return n
elif k%2==1: return k-2
else: return k+2
else:
if k<=n-b: return ans(n-b,k,bit-1)
elif k>=b+1: return ans(n-b,k-b,bit-1)+b
else: return k
T=int(input())
for _ in range(T):
N,K=map(int,input().split())
print(ans(N,K,60))
|
ConDefects/ConDefects/Code/agc061_a/Python/38921956
|
condefects-python_data_1781
|
T = int(input())
for _ in range(T):
N, K = map(int, input().split())
if N % 2 == 0:
N //= 2
i = K
if i % 2 == 1:
i += 1
i //= 2
if (N - 1) & (i - 1) == i - 1:
if K % 2 == 0:
print(K - 1)
else:
print(K + 1)
else:
print(K)
else:
if K == 1:
print(2)
else:
N -= 1
N //= 2
i = K
if i % 2 == 1:
i += 1
i //= 2
if (N - 1) & (i - 1) == i - 1:
if K % 2 == 0:
if (N - 1) & ((K + 2) // 2 - 1) == (K + 2) // 2 - 1:
print(K + 2)
else:
print(K + 1)
else:
if (N - 1) & ((K - 1) // 2) == (K - 1) // 2:
print(K - 2)
else:
print(K + 1)
else:
if (N - 1) & (K // 2 - 1) == K // 2 - 1:
if K % 2 == 0:
if (N - 1) & ((K + 2) // 2 - 1) == (K + 2) // 2 - 1:
print(K + 2)
else:
print(K + 1)
else:
if (N - 1) & ((K - 1) // 2 - 1) == (K - 1) // 2 - 1:
print(K - 2)
else:
print(K + 1)
else:
print(K)
T = int(input())
for _ in range(T):
N, K = map(int, input().split())
if N % 2 == 0:
N //= 2
i = K
if i % 2 == 1:
i += 1
i //= 2
if (N - 1) & (i - 1) == i - 1:
if K % 2 == 0:
print(K - 1)
else:
print(K + 1)
else:
print(K)
else:
if K == 1:
print(2)
else:
N -= 1
N //= 2
i = K
if i % 2 == 1:
i += 1
i //= 2
if (N - 1) & (i - 1) == i - 1:
if K % 2 == 0:
if (N - 1) & ((K + 2) // 2 - 1) == (K + 2) // 2 - 1:
print(K + 2)
else:
print(K + 1)
else:
if (N - 1) & ((K - 1) // 2 - 1) == (K - 1) // 2 - 1:
print(K - 2)
else:
print(K + 1)
else:
if (N - 1) & (K // 2 - 1) == K // 2 - 1:
if K % 2 == 0:
if (N - 1) & ((K + 2) // 2 - 1) == (K + 2) // 2 - 1:
print(K + 2)
else:
print(K + 1)
else:
if (N - 1) & ((K - 1) // 2 - 1) == (K - 1) // 2 - 1:
print(K - 2)
else:
print(K + 1)
else:
print(K)
|
ConDefects/ConDefects/Code/agc061_a/Python/38852158
|
condefects-python_data_1782
|
import math
import heapq
# import bisect
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
# n,x,y = map(int, input().split())
# a = list(map(int, input().split()))
n = int(input())
cld = [[] for i in range(n)]
s = [0]*n
g = [0]*n
md = []
inf = 1<<63
mx = 0
for i in range(n-1):
p,t,S,G = map(int, input().split())
mx = max(mx,S)
if S==0:
S=inf
s[i+1] = S
g[i+1] = G
cld[p-1].append(i+1)
if t==2:
md.append(i+1)
N = 1<<len(md)
dp = [0]*N
qs = [None]*N
def rep(q,p):
while len(q)>0:
if q[0][0]==inf:
return p
if q[0][0]<=p:
id=heapq.heappop(q)[1]
p+=g[id]
for c in cld[id]:
heapq.heappush(q,[s[c],c])
else:
break
return p
import copy
def sim(p,t,m):
for j,i in enumerate(qs[t]):
if m==i[1]:
qq=copy.deepcopy(qs[t])
p*=g[m]
del qq[j]
for c in cld[m]:
heapq.heappush(qq,[s[c],c])
return True,rep(qq,p),qq
return False,p,qs[t]
from collections import deque
q=deque()
q.append(0)
bq= [[s[c],c] for c in cld[0]]
heapq.heapify(bq)
dp[0] = rep(bq,1)
if mx<=dp[0]:
print("Yes")
exit()
qs[0]=bq
while len(q)>0:
t=q.popleft()
for i in range(len(md)):
if (t>>i)&1==0:
f,x,y=sim(dp[t],t,md[i])
# print(t,md[i],x,y)
if not f:
continue
if mx<=x:
print("Yes")
exit()
nx = t|(1<<i)
if dp[nx]<x:
qs[nx]=y
if dp[nx]==0:
q.append(nx)
dp[nx]=x
print("No")
import math
import heapq
# import bisect
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
# n,x,y = map(int, input().split())
# a = list(map(int, input().split()))
n = int(input())
cld = [[] for i in range(n)]
s = [0]*n
g = [0]*n
md = []
inf = 1<<63
mx = 0
for i in range(n-1):
p,t,S,G = map(int, input().split())
mx = max(mx,S)
if S==0:
S=inf
s[i+1] = S
g[i+1] = G
cld[p-1].append(i+1)
if t==2:
md.append(i+1)
N = 1<<len(md)
dp = [0]*N
qs = [None]*N
def rep(q,p):
while len(q)>0:
if q[0][0]==inf:
return p
if q[0][0]<=p:
id=heapq.heappop(q)[1]
p+=g[id]
for c in cld[id]:
heapq.heappush(q,[s[c],c])
else:
break
return p
import copy
def sim(p,t,m):
for j,i in enumerate(qs[t]):
if m==i[1]:
qq=copy.deepcopy(qs[t])
p*=g[m]
# del qq[j]
for c in cld[m]:
heapq.heappush(qq,[s[c],c])
return True,rep(qq,p),qq
return False,p,qs[t]
from collections import deque
q=deque()
q.append(0)
bq= [[s[c],c] for c in cld[0]]
heapq.heapify(bq)
dp[0] = rep(bq,1)
if mx<=dp[0]:
print("Yes")
exit()
qs[0]=bq
while len(q)>0:
t=q.popleft()
for i in range(len(md)):
if (t>>i)&1==0:
f,x,y=sim(dp[t],t,md[i])
# print(t,md[i],x,y)
if not f:
continue
if mx<=x:
print("Yes")
exit()
nx = t|(1<<i)
if dp[nx]<x:
qs[nx]=y
if dp[nx]==0:
q.append(nx)
dp[nx]=x
print("No")
|
ConDefects/ConDefects/Code/abc319_f/Python/45769357
|
condefects-python_data_1783
|
ir = lambda: int(input()) # 数字の読み込み
lr = lambda: list(map(int, input().split())) # 数字の配列の読み込み
import heapq
N = ir()
P = [[] for _ in range(N)]
S = [0]
G = [0]
potionidx = []
for i in range(1, N):
p, t, s, g = lr()
# 木は親から子の方向だけ持つ
P[p-1].append(i)
S.append(s)
G.append(g)
if t == 2:
# 敵の強さを持つ必要がないので負数で薬であることを表現
# どの薬を使ったかをbitで表現するためindexを保存
S[-1] = ~len(potionidx)
potionidx.append(i)
def go(q, potionbit, power):
# 到達可能な頂点が存在する限り回る
while len(q) > 0 and q[0][0] <= power:
_, vertex = heapq.heappop(q)
power += G[vertex]
# 敵の強さは10**9が上限
power = min(power, 10**9)
for v in P[vertex]:
if S[v] > 0:
heapq.heappush(q, (S[v], v))
else:
# 薬がある場所に到達したことをbitで表現
potionbit |= 1 << ~S[v]
return (q, potionbit, power)
potionnum = len(potionidx)
# 薬の数だけbit全探索
dp = [(0, 0, 0)] * (1<<potionnum)
# 薬を使わずに回った状態が初期値
# [(strength, vertex)], potionbit, power
dp[0] = go([(0, 0)], 0, 1)
for i in range(1<<potionnum):
for k in range(potionnum):
# k番目の薬をまだ使っていない且つその薬に到達可能
if not i & (1<<k) and dp[i][1] & (1<<k):
q, potionbit, power = dp[i]
potion = G[potionidx[k]]
power *= potion
power = min(power, 10**9)
# k番目の薬を強さ0の敵として最初に取得するようにして帳尻を合わせる
power -= potion
# k番目の薬がある頂点から移動し始める
heapq.heappush(q, (0, potionidx[k]))
state = go(q, potionbit, power)
# k番目の薬を使った後のpowerが大きければ更新
if state[2] > dp[i|(1<<k)][2]:
dp[i|(1<<k)] = state
# 敵を倒して上昇する強さは1以上なので最終的な強さは最大の敵の強さより1以上大きくなる
print("Yes" if dp[-1][2] > max(S) else "No")
ir = lambda: int(input()) # 数字の読み込み
lr = lambda: list(map(int, input().split())) # 数字の配列の読み込み
import heapq
N = ir()
P = [[] for _ in range(N)]
# 0は原点
S = [0]
G = [0]
potionidx = []
for i in range(1, N):
p, t, s, g = lr()
# 木は親から子の方向だけ持つ
P[p-1].append(i)
S.append(s)
G.append(g)
if t == 2:
# 敵の強さを持つ必要がないので負数で薬であることを表現
# どの薬を使ったかをbitで表現するためindexを保存
S[-1] = ~len(potionidx)
potionidx.append(i)
def go(q, potionbit, power):
# 到達可能な頂点が存在する限り回る
while len(q) > 0 and q[0][0] <= power:
_, vertex = heapq.heappop(q)
power += G[vertex]
# 敵の強さは10**9が上限
power = min(power, 10**9)
for v in P[vertex]:
if S[v] > 0:
heapq.heappush(q, (S[v], v))
else:
# 薬がある場所に到達したことをbitで表現
potionbit |= 1 << ~S[v]
return (q, potionbit, power)
potionnum = len(potionidx)
# 薬の数だけbit全探索
dp = [(0, 0, 0)] * (1<<potionnum)
# 薬を使わずに回った状態が初期値
# [(strength, vertex)], potionbit, power
dp[0] = go([(0, 0)], 0, 1)
for i in range(1<<potionnum):
for k in range(potionnum):
# k番目の薬をまだ使っていない且つその薬に到達可能
if not i & (1<<k) and dp[i][1] & (1<<k):
q, potionbit, power = dp[i]
q = list(q)
potion = G[potionidx[k]]
power *= potion
power = min(power, 10**9)
# k番目の薬を強さ0の敵として最初に取得するようにして帳尻を合わせる
power -= potion
# k番目の薬がある頂点から移動し始める
heapq.heappush(q, (0, potionidx[k]))
state = go(q, potionbit, power)
# k番目の薬を使った後のpowerが大きければ更新
if state[2] > dp[i|(1<<k)][2]:
dp[i|(1<<k)] = state
# 敵を倒して上昇する強さは1以上なので最終的な強さは最大の敵の強さより1以上大きくなる
print("Yes" if dp[-1][2] > max(S) else "No")
|
ConDefects/ConDefects/Code/abc319_f/Python/45777946
|
condefects-python_data_1784
|
#D - Divide Interval
l, r = map(int, input().split())
#l = 3 の時、(3,4)のみ
#l = 4の時、 (4,5)(4,6)(4,8)があるので(4,8)←4 = 2**2 (2**)
#l = 8の時、(8,9)(8,12)(8,16)
#l = 16の時、(16,17)(16,18)(16,20)(16,24)(16,32)
#l + 0, l + 2**0, l + 2**1, l + 2**3, ...
#lが奇数の時、l + 2**0のみ
#lが偶数の時、
lis = []
if l % 2 == 1:
lis.append([l])
l = l + 1
while l != r:
i = 0
while l % pow(2, i+1) == 0 and l + pow(2, i+1) <= r:
i += 1
lis.append([l, l + pow(2, i)])
l += pow(2, i)
print(len(lis))
for k in range(len(lis)):
print(*(lis[k]))
#D - Divide Interval
l, r = map(int, input().split())
#l = 3 の時、(3,4)のみ
#l = 4の時、 (4,5)(4,6)(4,8)があるので(4,8)←4 = 2**2 (2**)
#l = 8の時、(8,9)(8,12)(8,16)
#l = 16の時、(16,17)(16,18)(16,20)(16,24)(16,32)
#l + 0, l + 2**0, l + 2**1, l + 2**3, ...
#lが奇数の時、l + 2**0のみ
#lが偶数の時、
lis = []
if l % 2 == 1:
lis.append([l, l+1])
l = l + 1
while l != r:
i = 0
while l % pow(2, i+1) == 0 and l + pow(2, i+1) <= r:
i += 1
lis.append([l, l + pow(2, i)])
l += pow(2, i)
print(len(lis))
for k in range(len(lis)):
print(*(lis[k]))
|
ConDefects/ConDefects/Code/abc349_d/Python/54267102
|
condefects-python_data_1785
|
from collections import deque
N,M = map(int,input().split())
G = []
for i in range(N):
G.append([-1]*N)
G[0][0] = 0
Q = deque()
Q.append((0,0))
dir = []
for i in range(M+1):
x,y = i,int((M-i)**0.5)
if x**2 + y**2 == M:
dir.append([x,y])
dir.append([-x,y])
dir.append([x,-y])
dir.append([-x,-y])
while len(Q):
a,b = Q.popleft()
for aa,bb in dir:
nex1,nex2 = a+aa,b+bb
if 0 <= nex1 <= N-1 and 0 <= nex2 <= N-1:
if G[nex1][nex2] == -1:
G[nex1][nex2] = G[a][b]+1
Q.append((nex1,nex2))
elif G[nex1][nex2] > G[a][b]+1:
G[nex1][nex2] = G[a][b]+1
Q.append((nex1,nex2))
for i in G:
print(*i)
from collections import deque
N,M = map(int,input().split())
G = []
for i in range(N):
G.append([-1]*N)
G[0][0] = 0
Q = deque()
Q.append((0,0))
dir = []
for i in range(M+1):
x,y = i,int(abs(M-i**2)**0.5)
if x**2 + y**2 == M:
dir.append([x,y])
dir.append([-x,y])
dir.append([x,-y])
dir.append([-x,-y])
while len(Q):
a,b = Q.popleft()
for aa,bb in dir:
nex1,nex2 = a+aa,b+bb
if 0 <= nex1 <= N-1 and 0 <= nex2 <= N-1:
if G[nex1][nex2] == -1:
G[nex1][nex2] = G[a][b]+1
Q.append((nex1,nex2))
elif G[nex1][nex2] > G[a][b]+1:
G[nex1][nex2] = G[a][b]+1
Q.append((nex1,nex2))
for i in G:
print(*i)
|
ConDefects/ConDefects/Code/abc272_d/Python/45114386
|
condefects-python_data_1786
|
# import系 ---
from collections import deque
# 入力用 ---
INT = lambda: int(input())
MI = lambda: map(int, input().split())
MI_DEC = lambda: map(lambda x: int(x) - 1, input().split())
LI = lambda: list(map(int, input().split()))
LI_DEC = lambda: list(map(lambda x: int(x) - 1, input().split()))
LS = lambda: list(input())
LSS = lambda: input().split()
# コード ---
N, M = MI()
can_go = set()
for i in range(-int(M**(1/2)) - 1, int(M**(1/2)) + 2):
for j in range(-int(M**(1/2)) - 1, int(M**(1/2)) + 2):
if i**2 + j**2 == M:
can_go.add((i, j))
visited = set([(0, 0)])
que = deque([(0, 0, 0)])
ans = [[0]*N for _ in range(N)]
while que:
now_i, now_j, d = que.popleft()
ans[now_i][now_j] = d
for i, j in can_go:
next_i, next_j = now_i + i, now_j + j
if not (0 <= next_i < N and 0 <= next_j < N):
continue
if (next_i, next_j) in visited:
continue
visited.add((next_i, next_j))
que.append((next_i, next_j, d+1))
for a in ans:
print(*a)
# import系 ---
from collections import deque
# 入力用 ---
INT = lambda: int(input())
MI = lambda: map(int, input().split())
MI_DEC = lambda: map(lambda x: int(x) - 1, input().split())
LI = lambda: list(map(int, input().split()))
LI_DEC = lambda: list(map(lambda x: int(x) - 1, input().split()))
LS = lambda: list(input())
LSS = lambda: input().split()
# コード ---
N, M = MI()
can_go = set()
for i in range(-int(M**(1/2)) - 1, int(M**(1/2)) + 2):
for j in range(-int(M**(1/2)) - 1, int(M**(1/2)) + 2):
if i**2 + j**2 == M:
can_go.add((i, j))
visited = set([(0, 0)])
que = deque([(0, 0, 0)])
ans = [[-1]*N for _ in range(N)]
while que:
now_i, now_j, d = que.popleft()
ans[now_i][now_j] = d
for i, j in can_go:
next_i, next_j = now_i + i, now_j + j
if not (0 <= next_i < N and 0 <= next_j < N):
continue
if (next_i, next_j) in visited:
continue
visited.add((next_i, next_j))
que.append((next_i, next_j, d+1))
for a in ans:
print(*a)
|
ConDefects/ConDefects/Code/abc272_d/Python/45575170
|
condefects-python_data_1787
|
# import io
# import sys
# _INPUT = """\
# 3
# 1 2 1
# 1 1 2
# """
# sys.stdin = io.StringIO(_INPUT)
n = int(input())
A = list(map(lambda x:int(x)-1, input().split()))
B = list(map(lambda x:int(x)-1, input().split()))
A_ = [set() for _ in range(n)]
B_ = [set() for _ in range(n)]
for i in range(n):
a, b = A[i], B[i]
A_[a].add(i)
B_[b].add(i)
max_ = 0
for i in range(n):
if len(A_[i])!=len(B_[i]):
print('No')
exit()
max_ = max(0, len(A_[i]))
if max_>=2:
print('Yes')
exit()
import sys
sys.setrecursionlimit(10**8)
# print(A_, B_, C)
def f(a, cnt):
# print(a, cnt)
global st
if not A_[a]:
if cnt%2==0: return False
return True
# done1.add(a)
idx = A_[a].pop()
done.add(idx)
return f(B[idx], cnt+1)
done = set()
# done1 = set()
ans = 0
for i in range(n):
if A[i]!=B[i] and i not in done:
st = A[i]
done.add(i)
if not f(A[i], 0): ans ^= 1
# print(i, ans)
if ans==1:
print('No')
else:
print('Yes')
# import io
# import sys
# _INPUT = """\
# 3
# 1 2 1
# 1 1 2
# """
# sys.stdin = io.StringIO(_INPUT)
n = int(input())
A = list(map(lambda x:int(x)-1, input().split()))
B = list(map(lambda x:int(x)-1, input().split()))
A_ = [set() for _ in range(n)]
B_ = [set() for _ in range(n)]
for i in range(n):
a, b = A[i], B[i]
A_[a].add(i)
B_[b].add(i)
max_ = 0
for i in range(n):
if len(A_[i])!=len(B_[i]):
print('No')
exit()
max_ = max(max_, len(A_[i]))
if max_>=2:
print('Yes')
exit()
import sys
sys.setrecursionlimit(10**8)
# print(A_, B_, C)
def f(a, cnt):
# print(a, cnt)
global st
if not A_[a]:
if cnt%2==0: return False
return True
# done1.add(a)
idx = A_[a].pop()
done.add(idx)
return f(B[idx], cnt+1)
done = set()
# done1 = set()
ans = 0
for i in range(n):
if A[i]!=B[i] and i not in done:
st = A[i]
done.add(i)
if not f(A[i], 0): ans ^= 1
# print(i, ans)
if ans==1:
print('No')
else:
print('Yes')
|
ConDefects/ConDefects/Code/abc296_f/Python/50949566
|
condefects-python_data_1788
|
n = int(input())
a = list(int(c)-1 for c in input().split())
b = list(int(c)-1 for c in input().split())
if sorted(a) != sorted(b):
print('No')
exit()
if len(set(a)) < n:
print('Yes')
exit()
b2i = [0]*n
for i,v in enumerate(b):
b2i[v] = i
p = [0]*n
for i,j in enumerate(a):
p[i] = b2i[j]
visited = [0]*n
cnt = 0
for v0 in range(n):
if visited[v0]:
continue
v = v0
while not visited[v]:
visited[v] = 1
v = p[v]
cnt += 1
print('Yes' if cnt%2 == 0 else 'No')
n = int(input())
a = list(int(c)-1 for c in input().split())
b = list(int(c)-1 for c in input().split())
if sorted(a) != sorted(b):
print('No')
exit()
if len(set(a)) < n:
print('Yes')
exit()
b2i = [0]*n
for i,v in enumerate(b):
b2i[v] = i
p = [0]*n
for i,j in enumerate(a):
p[i] = b2i[j]
visited = [0]*n
cnt = 0
for v0 in range(n):
if visited[v0]:
continue
v = v0
while not visited[v]:
visited[v] = 1
v = p[v]
cnt += 1
print('Yes' if (n-cnt)%2 == 0 else 'No')
|
ConDefects/ConDefects/Code/abc296_f/Python/43917096
|
condefects-python_data_1789
|
import sys
def main():
input = sys.stdin.readline
N = int(input())
*A, = map(int, input().split())
*B, = map(int, input().split())
if sorted(A) != sorted(B):
return False
G = [[] for _ in range(N + 1)]
for i, a in enumerate(A):
G[a].append(i)
for g in G:
s = set(B[i] for i in g)
if len(s) > 1:
return True
I = sorted(range(N), key=lambda i: A[i])
C = [B[i] for i in I]
bit = BinaryIndexedTree(N + 1)
t = 0
for i, c in enumerate(C):
t += i - bit.query(c)
bit.add(c, 1)
return t & 1 == 2
class BinaryIndexedTree:
__slots__ = ('__n', '__d', '__f', '__id')
def __init__(self, n=None, f=lambda x, y: x + y, identity=0, initial_values=None):
assert n or initial_values
self.__f, self.__id, = f, identity
self.__n = len(initial_values) if initial_values else n
self.__d = [identity] * (self.__n + 1)
if initial_values:
for i, v in enumerate(initial_values): self.add(i, v)
def add(self, i, v):
n, f, d = self.__n, self.__f, self.__d
i += 1
while i <= n:
d[i] = f(d[i], v)
i += -i & i
def query(self, r):
res, f, d = self.__id, self.__f, self.__d
r += 1
while r:
res = f(res, d[r])
r -= -r & r
return res
def bisect(self, func):
'''func()がFalseになるもっとも左のindexを探す
'''
n, f, d, v = self.__n, self.__f, self.__d, self.__id
x, i = 0, 1 << (n.bit_length() - 1)
while i > 0:
if x + i <= n and func(f(v, d[x + i])): v, x = f(v, d[x + i]), x + i
i >>= 1
return x
if __name__ == '__main__':
print('Yes' if main() else 'No')
import sys
def main():
input = sys.stdin.readline
N = int(input())
*A, = map(int, input().split())
*B, = map(int, input().split())
if sorted(A) != sorted(B):
return False
G = [[] for _ in range(N + 1)]
for i, a in enumerate(A):
G[a].append(i)
for g in G:
s = set(B[i] for i in g)
if len(s) > 1:
return True
I = sorted(range(N), key=lambda i: A[i])
C = [B[i] for i in I]
bit = BinaryIndexedTree(N + 1)
t = 0
for i, c in enumerate(C):
t += i - bit.query(c)
bit.add(c, 1)
return t & 1 == 0
class BinaryIndexedTree:
__slots__ = ('__n', '__d', '__f', '__id')
def __init__(self, n=None, f=lambda x, y: x + y, identity=0, initial_values=None):
assert n or initial_values
self.__f, self.__id, = f, identity
self.__n = len(initial_values) if initial_values else n
self.__d = [identity] * (self.__n + 1)
if initial_values:
for i, v in enumerate(initial_values): self.add(i, v)
def add(self, i, v):
n, f, d = self.__n, self.__f, self.__d
i += 1
while i <= n:
d[i] = f(d[i], v)
i += -i & i
def query(self, r):
res, f, d = self.__id, self.__f, self.__d
r += 1
while r:
res = f(res, d[r])
r -= -r & r
return res
def bisect(self, func):
'''func()がFalseになるもっとも左のindexを探す
'''
n, f, d, v = self.__n, self.__f, self.__d, self.__id
x, i = 0, 1 << (n.bit_length() - 1)
while i > 0:
if x + i <= n and func(f(v, d[x + i])): v, x = f(v, d[x + i]), x + i
i >>= 1
return x
if __name__ == '__main__':
print('Yes' if main() else 'No')
|
ConDefects/ConDefects/Code/abc296_f/Python/45331429
|
condefects-python_data_1790
|
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):#1インデックス
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.tree[i] += x
i += i & -i
def sum_interval(self, l, r): #l+1～rまでの合計
return self.sum(r) - self.sum(l)
def inversion(a):
a_sorted = sorted(set(a))
d = {ai: i+1 for i, ai in enumerate(a_sorted)}
inv = 0
bit = Bit(len(a_sorted))
for i, ai in enumerate(a):
ai = d[ai]
inv += i - bit.sum(ai)
bit.add(ai, 1)
return inv
########################################################
import bisect, heapq, sys, math, copy, itertools, decimal
from collections import defaultdict, deque
sys.setrecursionlimit(10**7)
def INT(): return int(input())
def MI(): return map(int, input().split())
def MS(): return map(str, input().split())
def LI(): return list(map(int, input().split()))
def LS(): return list(map(str, input().split()))
def pr_line(itr): print(*itr, sep='\n')
def pr_mtx(matrix): [print(*row) for row in matrix]
INF = float('inf')
N = INT()
A = LI()
B = LI()
if sorted(A) != sorted(B):
print('No')
exit()
if len(A) == len(set(A)):
invA = inversion(A)
invB = inversion(B)
if invA + invB % 2 == 0:
print('Yes')
else:
print('No')
else:
print('Yes')
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):#1インデックス
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.tree[i] += x
i += i & -i
def sum_interval(self, l, r): #l+1～rまでの合計
return self.sum(r) - self.sum(l)
def inversion(a):
a_sorted = sorted(set(a))
d = {ai: i+1 for i, ai in enumerate(a_sorted)}
inv = 0
bit = Bit(len(a_sorted))
for i, ai in enumerate(a):
ai = d[ai]
inv += i - bit.sum(ai)
bit.add(ai, 1)
return inv
########################################################
import bisect, heapq, sys, math, copy, itertools, decimal
from collections import defaultdict, deque
sys.setrecursionlimit(10**7)
def INT(): return int(input())
def MI(): return map(int, input().split())
def MS(): return map(str, input().split())
def LI(): return list(map(int, input().split()))
def LS(): return list(map(str, input().split()))
def pr_line(itr): print(*itr, sep='\n')
def pr_mtx(matrix): [print(*row) for row in matrix]
INF = float('inf')
N = INT()
A = LI()
B = LI()
if sorted(A) != sorted(B):
print('No')
exit()
if len(A) == len(set(A)):
invA = inversion(A)
invB = inversion(B)
if (invA + invB) % 2 == 0:
print('Yes')
else:
print('No')
else:
print('Yes')
|
ConDefects/ConDefects/Code/abc296_f/Python/52941375
|
condefects-python_data_1791
|
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from operator import mul
from functools import reduce
sys.setrecursionlimit(2147483647)
INF = 10 ** 10
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 998244353
class UnionFind:
def __init__(self, n):
# 負 : 根であることを示す。絶対値はランクを示す
# 非負: 根でないことを示す。値は親を示す
self.table = [-1] * n
self.size = [1] * n
self.group_num = n
def root(self, x):
if self.table[x] < 0:
return x
else:
self.table[x] = self.root(self.table[x])
return self.table[x]
def get_size(self, x):
r = self.root(x)
return self.size[r]
def is_same(self, x, y):
return self.root(x) == self.root(y)
def union(self, x, y):
r1 = self.root(x)
r2 = self.root(y)
if r1 == r2:
return
# ランクの取得
d1 = self.table[r1]
d2 = self.table[r2]
if d1 <= d2:
self.table[r2] = r1
self.size[r1] += self.size[r2]
if d1 == d2:
self.table[r1] -= 1
else:
self.table[r1] = r2
self.size[r2] += self.size[r1]
self.group_num -= 1
n=I()
A=LI()
B=LI()
U=UnionFind(n)
if sorted(A)!=sorted(B):
print("No")
exit()
if len(set(A))!=A:
print("Yes")
exit()
for i in range(n):
U.union(A[i]-1,B[i]-1)
vis=[0]*n
L=[]
for g in range(n):
if vis[U.root(g)]==0:
vis[U.root(g)]=1
L+=[U.get_size(g)]
LL=[]
for s in L:
if s==1:
continue
elif s>2:
if (s-1)%2:
LL+=[1]
else:
LL+=[1]
if not LL or sum(LL)%2==0:
print("Yes")
else:
print("No")
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from operator import mul
from functools import reduce
sys.setrecursionlimit(2147483647)
INF = 10 ** 10
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 998244353
class UnionFind:
def __init__(self, n):
# 負 : 根であることを示す。絶対値はランクを示す
# 非負: 根でないことを示す。値は親を示す
self.table = [-1] * n
self.size = [1] * n
self.group_num = n
def root(self, x):
if self.table[x] < 0:
return x
else:
self.table[x] = self.root(self.table[x])
return self.table[x]
def get_size(self, x):
r = self.root(x)
return self.size[r]
def is_same(self, x, y):
return self.root(x) == self.root(y)
def union(self, x, y):
r1 = self.root(x)
r2 = self.root(y)
if r1 == r2:
return
# ランクの取得
d1 = self.table[r1]
d2 = self.table[r2]
if d1 <= d2:
self.table[r2] = r1
self.size[r1] += self.size[r2]
if d1 == d2:
self.table[r1] -= 1
else:
self.table[r1] = r2
self.size[r2] += self.size[r1]
self.group_num -= 1
n=I()
A=LI()
B=LI()
U=UnionFind(n)
if sorted(A)!=sorted(B):
print("No")
exit()
if len(set(A))!=len(A):
print("Yes")
exit()
for i in range(n):
U.union(A[i]-1,B[i]-1)
vis=[0]*n
L=[]
for g in range(n):
if vis[U.root(g)]==0:
vis[U.root(g)]=1
L+=[U.get_size(g)]
LL=[]
for s in L:
if s==1:
continue
elif s>2:
if (s-1)%2:
LL+=[1]
else:
LL+=[1]
if not LL or sum(LL)%2==0:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc296_f/Python/45226037
|
condefects-python_data_1792
|
from itertools import takewhile
_ = input()
first, *others = map(int, input().split())
ans = sum(1 for x in takewhile(lambda x: x <= first, others))
print(-1 if ans==0 else ans+1)
from itertools import takewhile
_ = input()
first, *others = map(int, input().split())
ans = sum(1 for x in takewhile(lambda x: x <= first, others))
print(-1 if ans==len(others) else (ans+2))
|
ConDefects/ConDefects/Code/abc353_a/Python/54951286
|
condefects-python_data_1793
|
x=int(input())
cont=0
cad=[int(x) for x in input().split()]
for i in range(1,len(cad)):
if cad[0]<cad[i]:
print(i+1)
break
elif cad[0]>cad[i]:
cont+=1
if len(cad)-1==cont:
print(-1)
x=int(input())
cont=0
cad=[int(x) for x in input().split()]
for i in range(1,len(cad)):
if cad[0]<cad[i]:
print(i+1)
break
elif cad[0]>=cad[i]:
cont+=1
if len(cad)-1==cont:
print(-1)
|
ConDefects/ConDefects/Code/abc353_a/Python/54934846
|
condefects-python_data_1794
|
#int型で受け取るとき
N = int(input())
#list型で取得
l = list(map(int, input().split()))
height = l[0]
for i in range(N):
if height < l[i]:
print(i)
import sys
sys.exit()
print(-1)
#int型で受け取るとき
N = int(input())
#list型で取得
l = list(map(int, input().split()))
height = l[0]
for i in range(N):
if height < l[i]:
print(i+1)
import sys
sys.exit()
print(-1)
|
ConDefects/ConDefects/Code/abc353_a/Python/55035442
|
condefects-python_data_1795
|
input = [list(map(int, input().split())) for i in range(2)]
BuildingNum = input[0]
HeightList = input[1]
print(HeightList)
Height_FirstBuld = HeightList[0]
found = 0
for i in range(len(HeightList)):
if HeightList[i] > Height_FirstBuld:
print(i+1)
found = 1
break
if(found == 0):
print(-1)
input = [list(map(int, input().split())) for i in range(2)]
BuildingNum = input[0]
HeightList = input[1]
#print(HeightList)
Height_FirstBuld = HeightList[0]
found = 0
for i in range(len(HeightList)):
if HeightList[i] > Height_FirstBuld:
print(i+1)
found = 1
break
if(found == 0):
print(-1)
|
ConDefects/ConDefects/Code/abc353_a/Python/55010639
|
condefects-python_data_1796
|
n=int(input())
A=0
B=10**12
for q in range(n):
a,b=map(int,input().split())
A=max(A,a)
B=min(B,b)
print(max(B-A+1,0))
n=int(input())
A=0
B=10**12
for q in range(n):
a,b=map(int,input().split())
A=max(A,a)
B=min(B,b)
print(max((A-B+1)//2,0))
|
ConDefects/ConDefects/Code/arc129_b/Python/36921100
|
condefects-python_data_1797
|
def Main():
n=int(input())
maxl=-1000000000000000000
minr=1000000000000000000
for _ in range(n):
l,r=map(int,input().split())
maxl=max(maxl,l)
minr=min(minr,r)
if maxl<=minr:
print(0)
else:
print((maxl-minr)//2)
Main()
def Main():
n=int(input())
maxl=-1000000000000000000
minr=1000000000000000000
for _ in range(n):
l,r=map(int,input().split())
maxl=max(maxl,l)
minr=min(minr,r)
if maxl<=minr:
print(0)
else:
print(max(maxl-(maxl+minr)//2,(maxl+minr)//2-minr))
Main()
|
ConDefects/ConDefects/Code/arc129_b/Python/38744633
|
condefects-python_data_1798
|
n=int(input())
a=-10**10
b=10**10
for _ in range(n):
l,r=map(int,input().split())
a=max(a,l)
b=min(b,r)
if a<=b:
print(0)
else:
print((a-b)//2)
n=int(input())
a=-10**10
b=10**10
for _ in range(n):
l,r=map(int,input().split())
a=max(a,l)
b=min(b,r)
if a<=b:
print(0)
else:
print((a-b+1)//2)
|
ConDefects/ConDefects/Code/arc129_b/Python/44921969
|
condefects-python_data_1799
|
import sys
sys.setrecursionlimit(10**8)
from sys import stdin
#import numba as nb
#from numba import b1, i4, i8, f8
from collections import defaultdict
from collections import Counter
from collections import deque
import heapq
#import networkx as nx
from itertools import combinations,permutations
from functools import cmp_to_key
import math
import bisect
#import numpy as np
import copy
import random
from collections import defaultdict
class LazSeg:
def __init__(self,n,func,ide,mul,add):
self.sizelog=self.intlog2(n-1)+2
self.size=2**(self.sizelog)-1
self.func=func
self.ide=ide #identity element
self.mul=mul #1 if func==sum, 0 if func==min, max
self.add=add #0 if replacing, 1 if adding
self.lazide= 0 if self.add==1 else None
self.maintree=[self.ide for _ in range(self.size)]
self.subtree=[self.lazide for _ in range(self.size)]
def is2pow(self,x):
return x==2**(self.intlog2(x))
def intlog2(self,x):
return len(bin(x))-3
def ind2seg(self,ind):
segl=2**(self.sizelog-1-self.intlog2(ind+1))
segb=(ind+1-2**(self.intlog2(ind+1)))*segl
return segb,segl
def seg2ind(self,segb,segl):
ind=2**(self.sizelog-1-self.intlog2(segl))+segb//segl-1
return ind
def propagate(self, ind):
if self.subtree[ind]!=self.lazide:
if self.add==1:
self.maintree[ind]+=self.subtree[ind]
else:
self.maintree[ind]=self.subtree[ind]
if 2*ind+2<self.size:
for i in range(2):
if self.add==1:
self.subtree[2*ind+1+i]+=self.subtree[ind]//(2**(self.mul))
else:
self.subtree[2*ind+1+i]=self.subtree[ind]//(2**(self.mul))
self.subtree[ind]=self.lazide
def propagate_root(self,ind):
l=[ind]
z=ind
while z>0:
l.append((z-1)//2)
z=(z-1)//2
while len(l)>0:
q=l.pop()
self.propagate(q)
def segmentize(self,a,b):
v=[]
while b>a:
bb=min(2**self.intlog2(b-a),((b^(b-1))+1)//2)
v.append((b-bb,bb))
b-=bb
return v
def update(self,a,b,x):
v=self.segmentize(a,b)
if len(v)==0:
pass
elif len(v)==1:
ind=self.seg2ind(a,b-a)
self.propagate_root(ind)
self.subtree[ind]=x*((b-a)**self.mul)
while ind>0:
ind=(ind-1)//2
self.maintree[ind]=self.func(self.maintree[ind*2+1]*self.add+self.subtree[ind*2+1],\
self.maintree[ind*2+2]*self.add+self.subtree[ind*2+2])
else:
for vi in v:
self.update(vi[0],vi[0]+vi[1],x)
def query(self,a,b):
v=self.segmentize(a,b)
if len(v)==0:
return self.ide
elif len(v)==1:
ind=self.seg2ind(v[0][0],v[0][1])
self.propagate_root(ind)
return self.maintree[ind]
else:
ind=self.seg2ind(v[0][0],v[0][1])
self.propagate_root(ind)
m=self.maintree[ind]
for vi in v[1:]:
ind=self.seg2ind(vi[0],vi[1])
self.propagate_root(ind)
m=self.func(m,self.maintree[ind])
return m
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
def __str__(self):
return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
def z_alg(s):
l=len(s)
d=[0]*(l+1)
d[0]=l
i=1
while i<l:
j=d[i]
while i+j<l and s[i+j]==s[j]:
j+=1
d[i]=j
k=1
while d[k]<j-k:
d[i+k]=d[k]
k+=1
d[i+k]=max(0,j-k)
i+=k
return d
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.tree[i] += x
i += i & -i
def prime_f(n):
k=2
z=defaultdict(int)
while n>k:
if n%k==0:
z[k]+=1
n//=k
else:
k+=1
if n>1:
z[n]+=1
return z
def pr_fac(n):
counter = Counter()
p=2
while p**2<n:
while n % p == 0:
counter[p] += 1
n //= p
p+=1
if n != 1:
counter[n] += 1
s=[]
for key, value in counter.items():
for i in range(value):
s.append(key)
return s
def base_change(n,nb,ob=10):
n10=int(str(n),ob)
dig="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
q=[]
while n10>0:
q.append(dig[n10%nb])
n10//=nb
return "".join(q[::-1])
mod=998244353
lim=15*10**5
fact=[1,1]
inv=[0,1]
factinv=[1,1]
alp="abcdefghijklmnopqrstuvwxyz"
def factorial():
for i in range(2,lim):
fact.append((fact[-1]*i)%mod)
inv.append((-(mod//i)*inv[mod%i])%mod)
factinv.append((factinv[-1]*inv[-1])%mod)
return
def binom(a,b):
if 0<=b<=a:
return (fact[a]*factinv[b]*factinv[a-b])%mod
else:
return 0
#factorial()
#############
def main(n,t):
d={"+":1,"-":-1,"?":0}
dp=[0]*(2*(n+1)*(2*n+1))
dp[0]=1
for i in range(1,2*n+1):
l=d[t[i-1]]
for j in range(max(0,i-n),min(i,n)+1):
b10=dp[(i-1)*2*(n+1)+(j-1)*2]
b11=dp[(i-1)*2*(n+1)+(j-1)*2+1]
b00=dp[(i-1)*2*(n+1)+(j)*2]
b01=dp[(i-1)*2*(n+1)+(j)*2+1]
if l>=0 and j>0:
dp[i*2*(n+1)+j*2]+=b10
if j>i-j:
dp[i*2*(n+1)+j*2+1]+=(b11-b10*i)%mod
else:
dp[i*2*(n+1)+j*2+1]+=(b11+b10*i)%mod
if l<=0 and j<i:
dp[i*2*(n+1)+j*2]+=b00
if i-j>j:
dp[i*2*(n+1)+j*2+1]+=(b01-b00*i)%mod
else:
dp[i*2*(n+1)+j*2+1]+=(b01+b00*i)%mod
dp[i*2*(n+1)+j*2]%=mod
dp[i*2*(n+1)+j*2+1]%=mod
print(dp[-1])
return
n,=map(int,input().split())
#p=list(map(int,input().split()))
t=input()
#l=list(map(int,input().split()))
#d=list(map(int,input().split()))
#q,=map(int,input().split())
#ab=[]
#for _ in range(n):
# n,k=map(int,input().split())
# s=input()
# main(n,k)
# s.append(input())
# ab.append(list(map(int,input().split())))
# xy.append(list(map(int,input().split())))
# a=list(map(int,input().split()))
# main(n,k,p,a)
#s=[]
#for i in range(h):
# s.append(input())
# uv.append(list(map(int,input().split())))
#k,=map(int,input().split())
#xy=[]
#for i in range(k):
# xy.append(list(map(int,input().split())))
#q,=map(int,input().split())
#pq=[]
#for i in range(q):
# pq.append(list(map(int,input().split())))
#a=list(map(int,input().split()))
#c=list(map(int,input().split()))
#for i in range(m):
# n,=map(int,input().split())
# s=input()
# main(n,k)
#s=input()
#t=input()
#pq=[]
#a=[]
#for _ in range(n):
# si,ai=input().split()
# s.append(si)
# a.append(int(ai))
# pq.append(list(map(int,input().split())))
#an=int(input())
#a=list(map(int,input().split()))
#bn=int(input())
#b=list(map(int,input().split()))
#for i in range(n-1):
# uv.append(list(map(int,input().split())))
# a.append(int(input()))
# s.append(set(map(int,input().split())))
# s.append(input())
#s=input()
n=3000
t="?"*(2*n)
main(n,t)
import sys
sys.setrecursionlimit(10**8)
from sys import stdin
#import numba as nb
#from numba import b1, i4, i8, f8
from collections import defaultdict
from collections import Counter
from collections import deque
import heapq
#import networkx as nx
from itertools import combinations,permutations
from functools import cmp_to_key
import math
import bisect
#import numpy as np
import copy
import random
from collections import defaultdict
class LazSeg:
def __init__(self,n,func,ide,mul,add):
self.sizelog=self.intlog2(n-1)+2
self.size=2**(self.sizelog)-1
self.func=func
self.ide=ide #identity element
self.mul=mul #1 if func==sum, 0 if func==min, max
self.add=add #0 if replacing, 1 if adding
self.lazide= 0 if self.add==1 else None
self.maintree=[self.ide for _ in range(self.size)]
self.subtree=[self.lazide for _ in range(self.size)]
def is2pow(self,x):
return x==2**(self.intlog2(x))
def intlog2(self,x):
return len(bin(x))-3
def ind2seg(self,ind):
segl=2**(self.sizelog-1-self.intlog2(ind+1))
segb=(ind+1-2**(self.intlog2(ind+1)))*segl
return segb,segl
def seg2ind(self,segb,segl):
ind=2**(self.sizelog-1-self.intlog2(segl))+segb//segl-1
return ind
def propagate(self, ind):
if self.subtree[ind]!=self.lazide:
if self.add==1:
self.maintree[ind]+=self.subtree[ind]
else:
self.maintree[ind]=self.subtree[ind]
if 2*ind+2<self.size:
for i in range(2):
if self.add==1:
self.subtree[2*ind+1+i]+=self.subtree[ind]//(2**(self.mul))
else:
self.subtree[2*ind+1+i]=self.subtree[ind]//(2**(self.mul))
self.subtree[ind]=self.lazide
def propagate_root(self,ind):
l=[ind]
z=ind
while z>0:
l.append((z-1)//2)
z=(z-1)//2
while len(l)>0:
q=l.pop()
self.propagate(q)
def segmentize(self,a,b):
v=[]
while b>a:
bb=min(2**self.intlog2(b-a),((b^(b-1))+1)//2)
v.append((b-bb,bb))
b-=bb
return v
def update(self,a,b,x):
v=self.segmentize(a,b)
if len(v)==0:
pass
elif len(v)==1:
ind=self.seg2ind(a,b-a)
self.propagate_root(ind)
self.subtree[ind]=x*((b-a)**self.mul)
while ind>0:
ind=(ind-1)//2
self.maintree[ind]=self.func(self.maintree[ind*2+1]*self.add+self.subtree[ind*2+1],\
self.maintree[ind*2+2]*self.add+self.subtree[ind*2+2])
else:
for vi in v:
self.update(vi[0],vi[0]+vi[1],x)
def query(self,a,b):
v=self.segmentize(a,b)
if len(v)==0:
return self.ide
elif len(v)==1:
ind=self.seg2ind(v[0][0],v[0][1])
self.propagate_root(ind)
return self.maintree[ind]
else:
ind=self.seg2ind(v[0][0],v[0][1])
self.propagate_root(ind)
m=self.maintree[ind]
for vi in v[1:]:
ind=self.seg2ind(vi[0],vi[1])
self.propagate_root(ind)
m=self.func(m,self.maintree[ind])
return m
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
def __str__(self):
return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
def z_alg(s):
l=len(s)
d=[0]*(l+1)
d[0]=l
i=1
while i<l:
j=d[i]
while i+j<l and s[i+j]==s[j]:
j+=1
d[i]=j
k=1
while d[k]<j-k:
d[i+k]=d[k]
k+=1
d[i+k]=max(0,j-k)
i+=k
return d
class Bit:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.tree[i] += x
i += i & -i
def prime_f(n):
k=2
z=defaultdict(int)
while n>k:
if n%k==0:
z[k]+=1
n//=k
else:
k+=1
if n>1:
z[n]+=1
return z
def pr_fac(n):
counter = Counter()
p=2
while p**2<n:
while n % p == 0:
counter[p] += 1
n //= p
p+=1
if n != 1:
counter[n] += 1
s=[]
for key, value in counter.items():
for i in range(value):
s.append(key)
return s
def base_change(n,nb,ob=10):
n10=int(str(n),ob)
dig="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
q=[]
while n10>0:
q.append(dig[n10%nb])
n10//=nb
return "".join(q[::-1])
mod=998244353
lim=15*10**5
fact=[1,1]
inv=[0,1]
factinv=[1,1]
alp="abcdefghijklmnopqrstuvwxyz"
def factorial():
for i in range(2,lim):
fact.append((fact[-1]*i)%mod)
inv.append((-(mod//i)*inv[mod%i])%mod)
factinv.append((factinv[-1]*inv[-1])%mod)
return
def binom(a,b):
if 0<=b<=a:
return (fact[a]*factinv[b]*factinv[a-b])%mod
else:
return 0
#factorial()
#############
def main(n,t):
d={"+":1,"-":-1,"?":0}
dp=[0]*(2*(n+1)*(2*n+1))
dp[0]=1
for i in range(1,2*n+1):
l=d[t[i-1]]
for j in range(max(0,i-n),min(i,n)+1):
b10=dp[(i-1)*2*(n+1)+(j-1)*2]
b11=dp[(i-1)*2*(n+1)+(j-1)*2+1]
b00=dp[(i-1)*2*(n+1)+(j)*2]
b01=dp[(i-1)*2*(n+1)+(j)*2+1]
if l>=0 and j>0:
dp[i*2*(n+1)+j*2]+=b10
if j>i-j:
dp[i*2*(n+1)+j*2+1]+=(b11-b10*i)%mod
else:
dp[i*2*(n+1)+j*2+1]+=(b11+b10*i)%mod
if l<=0 and j<i:
dp[i*2*(n+1)+j*2]+=b00
if i-j>j:
dp[i*2*(n+1)+j*2+1]+=(b01-b00*i)%mod
else:
dp[i*2*(n+1)+j*2+1]+=(b01+b00*i)%mod
dp[i*2*(n+1)+j*2]%=mod
dp[i*2*(n+1)+j*2+1]%=mod
print(dp[-1])
return
n,=map(int,input().split())
#p=list(map(int,input().split()))
t=input()
#l=list(map(int,input().split()))
#d=list(map(int,input().split()))
#q,=map(int,input().split())
#ab=[]
#for _ in range(n):
# n,k=map(int,input().split())
# s=input()
# main(n,k)
# s.append(input())
# ab.append(list(map(int,input().split())))
# xy.append(list(map(int,input().split())))
# a=list(map(int,input().split()))
# main(n,k,p,a)
#s=[]
#for i in range(h):
# s.append(input())
# uv.append(list(map(int,input().split())))
#k,=map(int,input().split())
#xy=[]
#for i in range(k):
# xy.append(list(map(int,input().split())))
#q,=map(int,input().split())
#pq=[]
#for i in range(q):
# pq.append(list(map(int,input().split())))
#a=list(map(int,input().split()))
#c=list(map(int,input().split()))
#for i in range(m):
# n,=map(int,input().split())
# s=input()
# main(n,k)
#s=input()
#t=input()
#pq=[]
#a=[]
#for _ in range(n):
# si,ai=input().split()
# s.append(si)
# a.append(int(ai))
# pq.append(list(map(int,input().split())))
#an=int(input())
#a=list(map(int,input().split()))
#bn=int(input())
#b=list(map(int,input().split()))
#for i in range(n-1):
# uv.append(list(map(int,input().split())))
# a.append(int(input()))
# s.append(set(map(int,input().split())))
# s.append(input())
#s=input()
main(n,t)
|
ConDefects/ConDefects/Code/arc164_d/Python/43435953
|
condefects-python_data_1800
|
#再帰はCpython,その他はpypy
import sys
sys.setrecursionlimit(1000000)
from collections import defaultdict
N, Q = map(int, input().split())
dic = defaultdict(set)
ans = N
for i in range(Q):
query = [*map(int, input().split())]
if query[0] == 2:
if len(dic[1]) == 0:
ans -= 1
for j in dic[query[1]]:
dic[j].remove(query[1])
if len(dic[j]) == 0:
ans += 1
dic[query[1]] = set()
ans += 1
else:
dic[query[1]].add(query[2])
dic[query[2]].add(query[1])
if len(dic[query[1]]) == 1:
ans -= 1
if len(dic[query[2]]) == 1:
ans -= 1
print(ans)
#再帰はCpython,その他はpypy
import sys
sys.setrecursionlimit(1000000)
from collections import defaultdict
N, Q = map(int, input().split())
dic = defaultdict(set)
ans = N
for i in range(Q):
query = [*map(int, input().split())]
if query[0] == 2:
if len(dic[query[1]]) == 0:
ans -= 1
for j in dic[query[1]]:
dic[j].remove(query[1])
if len(dic[j]) == 0:
ans += 1
dic[query[1]] = set()
ans += 1
else:
dic[query[1]].add(query[2])
dic[query[2]].add(query[1])
if len(dic[query[1]]) == 1:
ans -= 1
if len(dic[query[2]]) == 1:
ans -= 1
print(ans)
|
ConDefects/ConDefects/Code/abc302_e/Python/51480791
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.