id
stringlengths 24
27
| content
stringlengths 37
384k
| max_stars_repo_path
stringlengths 51
51
|
|---|---|---|
condefects-python_data_1501
|
N, K = map(int, input().split())
P = list(map(int, input().split()))
C = [-1 for _ in range(N)]
for i, p in enumerate(P):
C[p-1] = i+1
ans = 100000000000
from sortedcontainers import SortedList
s = SortedList(sorted(C[:K]))
for i in range(N-K):
s.remove(C[i])
s.add(C[i+K])
ans = min(ans, s[-1]-s[0])
print(ans)
N, K = map(int, input().split())
P = list(map(int, input().split()))
C = [-1 for _ in range(N)]
for i, p in enumerate(P):
C[p-1] = i+1
from sortedcontainers import SortedList
s = SortedList(sorted(C[:K]))
ans = s[-1] - s[0]
for i in range(N-K):
s.remove(C[i])
s.add(C[i+K])
ans = min(ans, s[-1]-s[0])
print(ans)
|
ConDefects/ConDefects/Code/abc352_d/Python/54463118
|
condefects-python_data_1502
|
N = int(input())
A = list(map(int, input().split()))
ex = []
for _ in range(N-1):
s,t = map(int, input().split())
ex.append([s,t])
# print(ex)
# ex_sorted = sorted(ex, key=lambda x:x[1], reverse=True)
# ex_sorted2 = sorted(ex_sorted, key = lambda x: x[0])
# print(ex_sorted2)
for i in range(N-1):
s = ex[i][0]
t = ex[i][1]
temp = A[i]//s
A[i] -= temp * s
A[i+1] += temp * t
print(A)
print(A[N-1])
N = int(input())
A = list(map(int, input().split()))
ex = []
for _ in range(N-1):
s,t = map(int, input().split())
ex.append([s,t])
# print(ex)
# ex_sorted = sorted(ex, key=lambda x:x[1], reverse=True)
# ex_sorted2 = sorted(ex_sorted, key = lambda x: x[0])
# print(ex_sorted2)
for i in range(N-1):
s = ex[i][0]
t = ex[i][1]
temp = A[i]//s
A[i] -= temp * s
A[i+1] += temp * t
# print(A)
print(A[N-1])
|
ConDefects/ConDefects/Code/abc341_b/Python/54459998
|
condefects-python_data_1503
|
n = int(input())
a = list(map(int,input().split()))
for i in range(n-1):
s,t = map(int,input().split())
a[i+1] = t*(a[i]//s)
print(a[-1])
n = int(input())
a = list(map(int,input().split()))
for i in range(n-1):
s,t = map(int,input().split())
a[i+1] += t*(a[i]//s)
print(a[-1])
|
ConDefects/ConDefects/Code/abc341_b/Python/54862743
|
condefects-python_data_1504
|
import sys
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
from collections import defaultdict
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
def __str__(self):
return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
n, m = na()
e = []
for i in range(m):
u,v = na()
u-=1
v-=1
e.append((u,v))
k = ni()
x = [i-1 for i in na()]
xx = [0] * m
for i in range(k):
xx[x[i]] = 1
uf = UnionFind(n)
deg = [0] * n
for i in range(m):
u,v = e[i]
if xx[i] ^ 1:
uf.union(u,v)
else:
deg[u]^=1
deg[v]^=1
d = uf.all_group_members()
ans = 0
for i in d:
r = 0
for j in d[i]:
r ^= deg[i]
#print(d[i], r)
ans += r
if ans <= 2:
Yes()
else:
No()
import sys
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
from collections import defaultdict
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
def __str__(self):
return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
n, m = na()
e = []
for i in range(m):
u,v = na()
u-=1
v-=1
e.append((u,v))
k = ni()
x = [i-1 for i in na()]
xx = [0] * m
for i in range(k):
xx[x[i]] = 1
uf = UnionFind(n)
deg = [0] * n
for i in range(m):
u,v = e[i]
if xx[i] ^ 1:
uf.union(u,v)
else:
deg[u]^=1
deg[v]^=1
d = uf.all_group_members()
ans = 0
for i in d:
r = 0
for j in d[i]:
r ^= deg[j]
#print(d[i], r)
ans += r
if ans <= 2:
Yes()
else:
No()
|
ConDefects/ConDefects/Code/abc286_g/Python/38690639
|
condefects-python_data_1505
|
class Unionfind:#根っこ参照で付け直し、デカイ木にちっさい木をつける
def __init__(self,n):
self.parent=[i for i in range(n)]#自分の親頂点の番号
self.num=[1]*n#自分を根とする部分木の頂点の個数
self.rank=[1]*n#自分を根とする部分木の高さ
def find(self,i):
if self.parent[i]==i:
return i
else:
self.parent[i]=self.find(self.parent[i])
return self.parent[i]
def union(self,i,j):
a=self.find(i)
b=self.find(j)
if self.rank[a]>self.rank[b]:
self.parent[b]=a
self.num[a]+=self.num[b]
elif self.rank[a]<self.rank[b]:
self.parent[a]=b
self.num[b]+=self.num[a]
else:
if a!=b:
self.rank[a]+=1
self.parent[b]=a
self.num[a]+=self.num[b]
def numb(self,i):#その頂点を含む連結成分の点の個数
j=self.find(i)
return self.num[j]
from collections import defaultdict
#いい問題、教育的
N,M=map(int,input().split())
graph=[[] for _ in range(N)]
graph_after=[[] for _ in range(N)]
edge=[]
for i in range(M):
u,v=map(int,input().split())
u-=1
v-=1
edge.append((u,v,i))
K=int(input())
e=list(map(int,input().split()))
s_e=set(e)
for i in range(K):
e[i]-=1
U=Unionfind(N)
for u,v,i in edge:
if i not in s_e:
U.union(u,v)
graph_ans=defaultdict(int)
for u,v,i in edge:
if i in s_e:
graph_ans[U.find(u)]+=1
graph_ans[U.find(v)]+=1
cnt=0
for v in graph_ans:
if graph_ans[v]%2==1:
cnt+=1
if cnt==0 or cnt==2:
print('Yes')
else:
print('No')
class Unionfind:#根っこ参照で付け直し、デカイ木にちっさい木をつける
def __init__(self,n):
self.parent=[i for i in range(n)]#自分の親頂点の番号
self.num=[1]*n#自分を根とする部分木の頂点の個数
self.rank=[1]*n#自分を根とする部分木の高さ
def find(self,i):
if self.parent[i]==i:
return i
else:
self.parent[i]=self.find(self.parent[i])
return self.parent[i]
def union(self,i,j):
a=self.find(i)
b=self.find(j)
if self.rank[a]>self.rank[b]:
self.parent[b]=a
self.num[a]+=self.num[b]
elif self.rank[a]<self.rank[b]:
self.parent[a]=b
self.num[b]+=self.num[a]
else:
if a!=b:
self.rank[a]+=1
self.parent[b]=a
self.num[a]+=self.num[b]
def numb(self,i):#その頂点を含む連結成分の点の個数
j=self.find(i)
return self.num[j]
from collections import defaultdict
#いい問題、教育的
N,M=map(int,input().split())
graph=[[] for _ in range(N)]
graph_after=[[] for _ in range(N)]
edge=[]
for i in range(M):
u,v=map(int,input().split())
u-=1
v-=1
edge.append((u,v,i))
K=int(input())
e=list(map(int,input().split()))
for i in range(K):
e[i]-=1
s_e=set(e)
U=Unionfind(N)
for u,v,i in edge:
if i not in s_e:
U.union(u,v)
graph_ans=defaultdict(int)
for u,v,i in edge:
if i in s_e:
graph_ans[U.find(u)]+=1
graph_ans[U.find(v)]+=1
cnt=0
for v in graph_ans:
if graph_ans[v]%2==1:
cnt+=1
if cnt==0 or cnt==2:
print('Yes')
else:
print('No')
|
ConDefects/ConDefects/Code/abc286_g/Python/41126621
|
condefects-python_data_1506
|
import sys
def root(x):
if parents[x] < 0:
return x
else:
parents[x] = root(parents[x])
return parents[x]
def unite(x, y):
x = root(x)
y = root(y)
if x == y:
return
if parents[x] > parents[y]:
x, y = y, x
parents[x] += parents[y]
parents[y] = x
def same(x, y):
return root(x) == root(y)
sys.setrecursionlimit(10**9)
N, M = map(int, input().split())
parents = [-1] * N
G = [[] for _ in range(N)]
E = []
for _ in range(M):
u, v = map(int, input().split())
u, v = u - 1, v - 1
E.append((u, v))
K = int(input())
X = set(map(lambda x: int(x) - 1, input().split()))
for i in range(M):
if i in X:
continue
u, v = E[i]
unite(u, v)
V = {root(i): 0 for i in range(N)}
for i in range(M):
if i not in X:
continue
u, v = E[i]
u, v = root(u), root(v)
V[u] += 1
V[v] += 1
odd_cnt = 0
for key, val in V.items():
odd_cnt += val % 2
if odd_cnt == 2:
print("Yes")
else:
print("No")
import sys
def root(x):
if parents[x] < 0:
return x
else:
parents[x] = root(parents[x])
return parents[x]
def unite(x, y):
x = root(x)
y = root(y)
if x == y:
return
if parents[x] > parents[y]:
x, y = y, x
parents[x] += parents[y]
parents[y] = x
def same(x, y):
return root(x) == root(y)
sys.setrecursionlimit(10**9)
N, M = map(int, input().split())
parents = [-1] * N
G = [[] for _ in range(N)]
E = []
for _ in range(M):
u, v = map(int, input().split())
u, v = u - 1, v - 1
E.append((u, v))
K = int(input())
X = set(map(lambda x: int(x) - 1, input().split()))
for i in range(M):
if i in X:
continue
u, v = E[i]
unite(u, v)
V = {root(i): 0 for i in range(N)}
for i in range(M):
if i not in X:
continue
u, v = E[i]
u, v = root(u), root(v)
V[u] += 1
V[v] += 1
odd_cnt = 0
for key, val in V.items():
odd_cnt += val % 2
if odd_cnt <= 2:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc286_g/Python/38302356
|
condefects-python_data_1507
|
n=int(input())
i=1
L=[]
while i<n:
if i&n:
L+=[i]
i*=2
ans=[]
def f(i):
add=[i]
for k in ans:
add+=[i+k]
return add
for i in L:
ans+=f(i)
print(0,*ans,sep="\n")
n=int(input())
i=1
L=[]
while i<=n:
if i&n:
L+=[i]
i*=2
ans=[]
def f(i):
add=[i]
for k in ans:
add+=[i+k]
return add
for i in L:
ans+=f(i)
print(0,*ans,sep="\n")
|
ConDefects/ConDefects/Code/abc269_c/Python/45092563
|
condefects-python_data_1508
|
MOD=998244353
n,m=map(int,input().split())
graph=[[] for _ in range(n)]
for _ in range(m):
u,v=map(lambda x:int(x)-1,input().split())
graph[u].append(v)
graph[v].append(u)
visited=[0]*n
from collections import deque
def dfs(s):
if visited[s]:
return []
visited[s]=1
q=deque([s])
link=[s]
while q:
v=q.popleft()
for u in graph[v]:
if visited[u]:
continue
visited[u]=1
q.append(u)
link.append(u)
return link
ans=1
for i in range(n):
link=dfs(i)
num_edge=0
if len(link)<2:
continue
for l in link:
num_edge+=len(graph[l])
if num_edge==len(link)*2:
ans*=2
ans%=MOD
else:
ans=0
print(ans)
MOD=998244353
n,m=map(int,input().split())
graph=[[] for _ in range(n)]
for _ in range(m):
u,v=map(lambda x:int(x)-1,input().split())
graph[u].append(v)
graph[v].append(u)
visited=[0]*n
from collections import deque
def dfs(s):
if visited[s]:
return []
visited[s]=1
q=deque([s])
link=[s]
while q:
v=q.popleft()
for u in graph[v]:
if visited[u]:
continue
visited[u]=1
q.append(u)
link.append(u)
return link
ans=1
for i in range(n):
link=dfs(i)
num_edge=0
if len(link)<1:
continue
for l in link:
num_edge+=len(graph[l])
if num_edge==len(link)*2:
ans*=2
ans%=MOD
else:
ans=0
print(ans)
|
ConDefects/ConDefects/Code/abc226_e/Python/53676492
|
condefects-python_data_1509
|
from collections import defaultdict
from sys import stdin
class FastIO:
def __init__(self):
self.random_seed = 0
self.flush = False
self.inf = 1 << 32
return
@staticmethod
def read_int():
return int(stdin.readline().rstrip())
@staticmethod
def read_float():
return float(stdin.readline().rstrip())
@staticmethod
def read_list_ints():
return list(map(int, stdin.readline().rstrip().split()))
@staticmethod
def read_list_ints_minus_one():
return list(map(lambda x: int(x) - 1, stdin.readline().rstrip().split()))
@staticmethod
def read_str():
return stdin.readline().rstrip()
@staticmethod
def read_list_strs():
return stdin.readline().rstrip().split()
def get_random_seed(self):
import random
self.random_seed = random.randint(0, 10 ** 9 + 7)
return
def st(self, x):
return print(x, flush=self.flush)
def yes(self, s=None):
self.st("Yes" if not s else s)
return
def no(self, s=None):
self.st("No" if not s else s)
return
def lst(self, x):
return print(*x, flush=self.flush)
def flatten(self, lst):
self.st("\n".join(str(x) for x in lst))
return
@staticmethod
def max(a, b):
return a if a > b else b
@staticmethod
def min(a, b):
return a if a < b else b
@staticmethod
def ceil(a, b):
return a // b + int(a % b != 0)
@staticmethod
def accumulate(nums):
n = len(nums)
pre = [0] * (n + 1)
for i in range(n):
pre[i + 1] = pre[i] + nums[i]
return pre
class UnionFind:
def __init__(self, n: int) -> None:
self.root_or_size = [-1] * n
self.part = n
self.n = n
return
def initialize(self):
for i in range(self.n):
self.root_or_size[i] = -1
self.part = self.n
return
def find(self, x):
y = x
while self.root_or_size[x] >= 0:
# range_merge_to_disjoint to the direct root node after query
x = self.root_or_size[x]
while y != x:
self.root_or_size[y], y = x, self.root_or_size[y]
return x
def union(self, x, y):
root_x = self.find(x)
root_y = self.find(y)
if root_x == root_y:
return False
if self.root_or_size[root_x] < self.root_or_size[root_y]:
root_x, root_y = root_y, root_x
self.root_or_size[root_y] += self.root_or_size[root_x]
self.root_or_size[root_x] = root_y
self.part -= 1
return True
def union_left(self, x, y):
root_x = self.find(x)
root_y = self.find(y)
if root_x == root_y:
return False
self.root_or_size[root_x] += self.root_or_size[root_y]
self.root_or_size[root_y] = root_x
self.part -= 1
return True
def union_right(self, x, y):
root_x = self.find(x)
root_y = self.find(y)
if root_x == root_y:
return False
self.root_or_size[root_y] += self.root_or_size[root_x]
self.root_or_size[root_x] = root_y
self.part -= 1
return True
def union_max(self, x, y):
root_x = self.find(x)
root_y = self.find(y)
if root_x == root_y:
return False
if root_x > root_y:
root_x, root_y = root_y, root_x
self.root_or_size[root_y] += self.root_or_size[root_x]
self.root_or_size[root_x] = root_y
self.part -= 1
return
def union_min(self, x, y):
root_x = self.find(x)
root_y = self.find(y)
if root_x == root_y:
return False
if root_x < root_y:
root_x, root_y = root_y, root_x
self.root_or_size[root_y] += self.root_or_size[root_x]
self.root_or_size[root_x] = root_y
self.part -= 1
return
def is_connected(self, x, y):
return self.find(x) == self.find(y)
def size(self, x):
return -self.root_or_size[self.find(x)]
def get_root_part(self):
# get the nodes list of every root
part = defaultdict(list)
n = len(self.root_or_size)
for i in range(n):
part[self.find(i)].append(i)
return part
def get_root_size(self):
# get the size of every root
size = defaultdict(int)
n = len(self.root_or_size)
for i in range(n):
if self.find(i) == i:
size[i] = -self.root_or_size[i]
return size
class Solution:
def __init__(self):
return
@staticmethod
def main(ac=FastIO()):
"""
url: url of the problem
tag: algorithm tag
"""
n, m = ac.read_list_ints()
uf = UnionFind(n)
mod = 998244353
ans = 0
edges = []
for _ in range(m):
i, j = ac.read_list_ints_minus_one()
uf.union(i, j)
edges.append((i, j))
group = uf.get_root_part()
degree = defaultdict(int)
for i, j in edges:
degree[uf.find(i)] += 1
ans = 0
for g in group:
if len(group[g]) == degree[g] + 1:
ac.st(0)
return
ans += 1
ac.st(pow(2, ans, mod))
return
Solution().main()
from collections import defaultdict
from sys import stdin
class FastIO:
def __init__(self):
self.random_seed = 0
self.flush = False
self.inf = 1 << 32
return
@staticmethod
def read_int():
return int(stdin.readline().rstrip())
@staticmethod
def read_float():
return float(stdin.readline().rstrip())
@staticmethod
def read_list_ints():
return list(map(int, stdin.readline().rstrip().split()))
@staticmethod
def read_list_ints_minus_one():
return list(map(lambda x: int(x) - 1, stdin.readline().rstrip().split()))
@staticmethod
def read_str():
return stdin.readline().rstrip()
@staticmethod
def read_list_strs():
return stdin.readline().rstrip().split()
def get_random_seed(self):
import random
self.random_seed = random.randint(0, 10 ** 9 + 7)
return
def st(self, x):
return print(x, flush=self.flush)
def yes(self, s=None):
self.st("Yes" if not s else s)
return
def no(self, s=None):
self.st("No" if not s else s)
return
def lst(self, x):
return print(*x, flush=self.flush)
def flatten(self, lst):
self.st("\n".join(str(x) for x in lst))
return
@staticmethod
def max(a, b):
return a if a > b else b
@staticmethod
def min(a, b):
return a if a < b else b
@staticmethod
def ceil(a, b):
return a // b + int(a % b != 0)
@staticmethod
def accumulate(nums):
n = len(nums)
pre = [0] * (n + 1)
for i in range(n):
pre[i + 1] = pre[i] + nums[i]
return pre
class UnionFind:
def __init__(self, n: int) -> None:
self.root_or_size = [-1] * n
self.part = n
self.n = n
return
def initialize(self):
for i in range(self.n):
self.root_or_size[i] = -1
self.part = self.n
return
def find(self, x):
y = x
while self.root_or_size[x] >= 0:
# range_merge_to_disjoint to the direct root node after query
x = self.root_or_size[x]
while y != x:
self.root_or_size[y], y = x, self.root_or_size[y]
return x
def union(self, x, y):
root_x = self.find(x)
root_y = self.find(y)
if root_x == root_y:
return False
if self.root_or_size[root_x] < self.root_or_size[root_y]:
root_x, root_y = root_y, root_x
self.root_or_size[root_y] += self.root_or_size[root_x]
self.root_or_size[root_x] = root_y
self.part -= 1
return True
def union_left(self, x, y):
root_x = self.find(x)
root_y = self.find(y)
if root_x == root_y:
return False
self.root_or_size[root_x] += self.root_or_size[root_y]
self.root_or_size[root_y] = root_x
self.part -= 1
return True
def union_right(self, x, y):
root_x = self.find(x)
root_y = self.find(y)
if root_x == root_y:
return False
self.root_or_size[root_y] += self.root_or_size[root_x]
self.root_or_size[root_x] = root_y
self.part -= 1
return True
def union_max(self, x, y):
root_x = self.find(x)
root_y = self.find(y)
if root_x == root_y:
return False
if root_x > root_y:
root_x, root_y = root_y, root_x
self.root_or_size[root_y] += self.root_or_size[root_x]
self.root_or_size[root_x] = root_y
self.part -= 1
return
def union_min(self, x, y):
root_x = self.find(x)
root_y = self.find(y)
if root_x == root_y:
return False
if root_x < root_y:
root_x, root_y = root_y, root_x
self.root_or_size[root_y] += self.root_or_size[root_x]
self.root_or_size[root_x] = root_y
self.part -= 1
return
def is_connected(self, x, y):
return self.find(x) == self.find(y)
def size(self, x):
return -self.root_or_size[self.find(x)]
def get_root_part(self):
# get the nodes list of every root
part = defaultdict(list)
n = len(self.root_or_size)
for i in range(n):
part[self.find(i)].append(i)
return part
def get_root_size(self):
# get the size of every root
size = defaultdict(int)
n = len(self.root_or_size)
for i in range(n):
if self.find(i) == i:
size[i] = -self.root_or_size[i]
return size
class Solution:
def __init__(self):
return
@staticmethod
def main(ac=FastIO()):
"""
url: url of the problem
tag: algorithm tag
"""
n, m = ac.read_list_ints()
uf = UnionFind(n)
mod = 998244353
ans = 0
edges = []
for _ in range(m):
i, j = ac.read_list_ints_minus_one()
uf.union(i, j)
edges.append((i, j))
group = uf.get_root_part()
degree = defaultdict(int)
for i, j in edges:
degree[uf.find(i)] += 1
ans = 0
for g in group:
if len(group[g]) != degree[g]:
ac.st(0)
return
ans += 1
ac.st(pow(2, ans, mod))
return
Solution().main()
|
ConDefects/ConDefects/Code/abc226_e/Python/53053125
|
condefects-python_data_1510
|
# Idea: For each connected component, there need to be an equal number of edges and vertices.
# In this case, there are 2 ways to orient the edges per component. Otherwise the answer is 0.
from atcoder.dsu import DSU
from collections import defaultdict
n, m = map(int, input().split())
edges_in_comp = defaultdict(int)
one_per_edge = []
comps = n
dsu = DSU(n+1)
for _ in range(m):
u, v = map(int, input().split())
one_per_edge.append(u)
if not dsu.same(u, v):
dsu.merge(u, v)
comps -= 1
for v in one_per_edge:
edges_in_comp[dsu.leader(v)] += 1
for c in dsu.groups():
if dsu.leader(c[0]) != len(c):
print(0)
break
else:
print(pow(2, comps, 998244353))
# Idea: For each connected component, there need to be an equal number of edges and vertices.
# In this case, there are 2 ways to orient the edges per component. Otherwise the answer is 0.
from atcoder.dsu import DSU
from collections import defaultdict
n, m = map(int, input().split())
edges_in_comp = defaultdict(int)
one_per_edge = []
comps = n
dsu = DSU(n+1)
for _ in range(m):
u, v = map(int, input().split())
one_per_edge.append(u)
if not dsu.same(u, v):
dsu.merge(u, v)
comps -= 1
for v in one_per_edge:
edges_in_comp[dsu.leader(v)] += 1
for c in dsu.groups():
if c != [0] and edges_in_comp[dsu.leader(c[0])] != len(c):
print(0)
break
else:
print(pow(2, comps, 998244353))
|
ConDefects/ConDefects/Code/abc226_e/Python/52234913
|
condefects-python_data_1511
|
import collections
from collections import defaultdict
class UnionFind():
def __init__(self):
'''
unionfind経路圧縮あり,要素にtupleや文字列可,始めに要素数指定なし
'''
self.parents = dict() # {子要素:親ID,}
self.members_set = collections.defaultdict(lambda : set()) # keyが根でvalueが根に属する要素要素(tupleや文字列可)
self.roots_set = set() # 根の集合(tupleや文字列可)
self.key_ID = dict() # 各要素にIDを割り振る
self.ID_key = dict() # IDから要素名を復元する
self.cnt = 0 # IDのカウンター
def dictf(self,x): # 要素名とIDをやり取りするところ
if x in self.key_ID:
return self.key_ID[x]
else:
self.cnt += 1
self.key_ID[x] = self.cnt
self.parents[x] = self.cnt
self.ID_key[self.cnt] = x
self.members_set[x].add(x)
self.roots_set.add(x)
return self.key_ID[x]
def find(self, x):
ID_x = self.dictf(x)
if self.parents[x] == ID_x:
return x
else:
self.parents[x] = self.key_ID[self.find(self.ID_key[self.parents[x]])]
return self.ID_key[self.parents[x]]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if self.parents[x] > self.parents[y]:
x, y = y, x
if x == y:
return
for i in self.members_set[y]:
self.members_set[x].add(i)
self.members_set[y] = set()
self.roots_set.remove(y)
self.parents[y] = self.key_ID[x]
def size(self, x):#xが含まれる集合の要素数
return len(self.members_set[self.find(x)])
def same(self, x, y):#同じ集合に属するかの判定
return self.find(x) == self.find(y)
def members(self, x):#xを含む集合の要素
return self.members_set[self.find(x)]
def roots(self):#根の要素
return self.roots_set
def group_count(self):#根の数
return len(self.roots_set)
def all_group_members(self):#根とその要素
return {r: self.members_set[r] for r in self.roots_set}
N, M = map(int, input().split())
edges = set([])
uf = UnionFind()
MOD = 998244353
for i in range(M):
a, b = map(int, input().split())
uf.union(a, b)
edges.add((a, b))
cnt = defaultdict(int)
for i, j in edges:
cnt[uf.find(i)] += 1
for i in uf.roots():
if cnt[uf.find(i)] != uf.size(i):
print(0)
exit()
print(pow(2, uf.group_count(), MOD))
import collections
from collections import defaultdict
class UnionFind():
def __init__(self):
'''
unionfind経路圧縮あり,要素にtupleや文字列可,始めに要素数指定なし
'''
self.parents = dict() # {子要素:親ID,}
self.members_set = collections.defaultdict(lambda : set()) # keyが根でvalueが根に属する要素要素(tupleや文字列可)
self.roots_set = set() # 根の集合(tupleや文字列可)
self.key_ID = dict() # 各要素にIDを割り振る
self.ID_key = dict() # IDから要素名を復元する
self.cnt = 0 # IDのカウンター
def dictf(self,x): # 要素名とIDをやり取りするところ
if x in self.key_ID:
return self.key_ID[x]
else:
self.cnt += 1
self.key_ID[x] = self.cnt
self.parents[x] = self.cnt
self.ID_key[self.cnt] = x
self.members_set[x].add(x)
self.roots_set.add(x)
return self.key_ID[x]
def find(self, x):
ID_x = self.dictf(x)
if self.parents[x] == ID_x:
return x
else:
self.parents[x] = self.key_ID[self.find(self.ID_key[self.parents[x]])]
return self.ID_key[self.parents[x]]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if self.parents[x] > self.parents[y]:
x, y = y, x
if x == y:
return
for i in self.members_set[y]:
self.members_set[x].add(i)
self.members_set[y] = set()
self.roots_set.remove(y)
self.parents[y] = self.key_ID[x]
def size(self, x):#xが含まれる集合の要素数
return len(self.members_set[self.find(x)])
def same(self, x, y):#同じ集合に属するかの判定
return self.find(x) == self.find(y)
def members(self, x):#xを含む集合の要素
return self.members_set[self.find(x)]
def roots(self):#根の要素
return self.roots_set
def group_count(self):#根の数
return len(self.roots_set)
def all_group_members(self):#根とその要素
return {r: self.members_set[r] for r in self.roots_set}
N, M = map(int, input().split())
edges = set([])
uf = UnionFind()
MOD = 998244353
for i in range(M):
a, b = map(int, input().split())
uf.union(a, b)
edges.add((a, b))
cnt = defaultdict(int)
for i, j in edges:
cnt[uf.find(i)] += 1
for i in uf.roots():
if cnt[uf.find(i)] != uf.size(i) or N != uf.cnt:
print(0)
exit()
print(pow(2, uf.group_count(), MOD))
|
ConDefects/ConDefects/Code/abc226_e/Python/53796243
|
condefects-python_data_1512
|
n,d=map(int,input().split())
t=list(map(int,input().split()))
for i in range(n-1):
if t[i+1]-t[i]<=d:
print(t[i])
break
else:
print(-1)
n,d=map(int,input().split())
t=list(map(int,input().split()))
for i in range(n-1):
if t[i+1]-t[i]<=d:
print(t[i+1])
break
else:
print(-1)
|
ConDefects/ConDefects/Code/abc297_a/Python/45496094
|
condefects-python_data_1513
|
n,d=map(int,input().split())
data=list(map(int,input().split()))
for i in range(n-1):
if data[i+1]-data[i]<=d:
print(data[i])
quit()
print(-1)
n,d=map(int,input().split())
data=list(map(int,input().split()))
for i in range(n-1):
if data[i+1]-data[i]<=d:
print(data[i+1])
quit()
print(-1)
|
ConDefects/ConDefects/Code/abc297_a/Python/45500749
|
condefects-python_data_1514
|
n,d = map(int,input().split())
t = list(map(int,input().split()))
ret = -1
p = -d-1
for i in t:
if i-p<d:
ret = i
break
p=i
print(ret)
n,d = map(int,input().split())
t = list(map(int,input().split()))
ret = -1
p = -d-1
for i in t:
if i-p<=d:
ret = i
break
p=i
print(ret)
|
ConDefects/ConDefects/Code/abc297_a/Python/46055159
|
condefects-python_data_1515
|
n,d = map(int,input().split())
t = list(map(int,input().split()))
for i in range(n-1):
if t[i+1]-t[i]<=d:
print(t[i+1])
break
print(-1)
n,d = map(int,input().split())
t = list(map(int,input().split()))
for i in range(n-1):
if t[i+1]-t[i]<=d:
print(t[i+1])
exit()
print(-1)
|
ConDefects/ConDefects/Code/abc297_a/Python/45281375
|
condefects-python_data_1516
|
n, d =map(int, input().split())
t = list(map(int, input().split()))
ans = -1
for i in range(1, len(t)):
if t[i] - t[i-1] < d:
ans = t[i]
break
print(ans)
n, d =map(int, input().split())
t = list(map(int, input().split()))
ans = -1
for i in range(1, len(t)):
if t[i] - t[i-1] <= d:
ans = t[i]
break
print(ans)
|
ConDefects/ConDefects/Code/abc297_a/Python/45477733
|
condefects-python_data_1517
|
n,d = map(int,input().split())
l = []
l =list(map(int,input().split()))
s = 0
h = 0
for i in range(n-1):
s = l[i+1]-l[i]
if s < d:
print(l[i+1])
h += 1
break
if h == 0:
print("-1")
n,d = map(int,input().split())
l = []
l =list(map(int,input().split()))
s = 0
h = 0
for i in range(n-1):
s = l[i+1]-l[i]
if s <= d:
print(l[i+1])
h += 1
break
if h == 0:
print("-1")
|
ConDefects/ConDefects/Code/abc297_a/Python/46009520
|
condefects-python_data_1518
|
N, D = map(int, input().split())
T = list(map(int, input().split()))
s = -10000
for t in T:
if t-s<=D:
print(t)
break
else:
s = t
else: print(-1)
N, D = map(int, input().split())
T = list(map(int, input().split()))
s = -1e10
for t in T:
if t-s<=D:
print(t)
break
else:
s = t
else: print(-1)
|
ConDefects/ConDefects/Code/abc297_a/Python/45577188
|
condefects-python_data_1519
|
import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#n = int(input())
#alist = list(map(int,input().split()))
#alist = []
#s = input()
x,y,a,b,c = map(int,input().split())
def judge(x,y,a,b,c):
y -= (a // x) + (1 if a % x != 0 else 0)
if y <= 0:
return False
z = (b // y) + (1 if b % y != 0 else 0) + (c // y) + (1 if c % y != 0 else 0)
if z <= x:
return True
else:
return False
ans = False
for i,j in [[x,y],[y,x]]:
for k in itertools.permutations([a,b,c]):
ans |= judge(i,j,k[0],k[1],k[2])
print('Yes' if ans else 'No')
import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#n = int(input())
#alist = list(map(int,input().split()))
#alist = []
#s = input()
x,y,a,b,c = map(int,input().split())
def judge(x,y,a,b,c):
if (a // x) + (1 if a % x != 0 else 0) + (b // x) + (1 if b % x != 0 else 0) + (c // x) + (1 if c % x != 0 else 0) <= y:
return True
y -= (a // x) + (1 if a % x != 0 else 0)
if y <= 0:
return False
z = (b // y) + (1 if b % y != 0 else 0) + (c // y) + (1 if c % y != 0 else 0)
if z <= x:
return True
else:
return False
ans = False
for i,j in [[x,y],[y,x]]:
for k in itertools.permutations([a,b,c]):
ans |= judge(i,j,k[0],k[1],k[2])
print('Yes' if ans else 'No')
|
ConDefects/ConDefects/Code/abc223_e/Python/54247228
|
condefects-python_data_1520
|
#長方形の設置の仕方は川か仁の2つ
import itertools
X,Y,A,B,C = map(int,input().split())
for i in range(2):
jls = list(itertools.permutations([A,B,C]))
#仁の字型チェック
for a,b,c in jls:
x1 = (a-1)//Y +1
if x1 < X:
y1 = (b-1)//(X-x1) +1
if y1 >= Y:
if (X-x1)*(Y-y1) >= c:
print("Yes")
exit()
#川の字型チェック
for a,b,c in jls:
x1 = (a-1)//Y +1
x2 = (b-1)//Y +1
x3 = (c-1)//Y +1
if x1+x2+x3 <= X:
print("Yes")
exit()
X,Y = Y,X
print("No")
#長方形の設置の仕方は川か仁の2つ
import itertools
X,Y,A,B,C = map(int,input().split())
for i in range(2):
jls = list(itertools.permutations([A,B,C]))
#仁の字型チェック
for a,b,c in jls:
x1 = (a-1)//Y +1
if x1 < X:
y1 = (b-1)//(X-x1) +1
if y1 < Y:
if (X-x1)*(Y-y1) >= c:
print("Yes")
exit()
#川の字型チェック
for a,b,c in jls:
x1 = (a-1)//Y +1
x2 = (b-1)//Y +1
x3 = (c-1)//Y +1
if x1+x2+x3 <= X:
print("Yes")
exit()
X,Y = Y,X
print("No")
|
ConDefects/ConDefects/Code/abc223_e/Python/49036505
|
condefects-python_data_1521
|
from itertools import permutations
from sys import stdin
class FastIO:
def __init__(self):
self.random_seed = 0
self.flush = False
self.inf = 1 << 32
return
@staticmethod
def read_int():
return int(stdin.readline().rstrip())
@staticmethod
def read_float():
return float(stdin.readline().rstrip())
@staticmethod
def read_list_ints():
return list(map(int, stdin.readline().rstrip().split()))
@staticmethod
def read_list_ints_minus_one():
return list(map(lambda x: int(x) - 1, stdin.readline().rstrip().split()))
@staticmethod
def read_str():
return stdin.readline().rstrip()
@staticmethod
def read_list_strs():
return stdin.readline().rstrip().split()
def get_random_seed(self):
import random
self.random_seed = random.randint(0, 10 ** 9 + 7)
return
def st(self, x):
return print(x, flush=self.flush)
def yes(self, s=None):
self.st("Yes" if not s else s)
return
def no(self, s=None):
self.st("No" if not s else s)
return
def lst(self, x):
return print(*x, flush=self.flush)
def flatten(self, lst):
self.st("\n".join(str(x) for x in lst))
return
@staticmethod
def max(a, b):
return a if a > b else b
@staticmethod
def min(a, b):
return a if a < b else b
@staticmethod
def ceil(a, b):
return a // b + int(a % b != 0)
@staticmethod
def accumulate(nums):
n = len(nums)
pre = [0] * (n + 1)
for i in range(n):
pre[i + 1] = pre[i] + nums[i]
return pre
class Solution:
def __init__(self):
return
@staticmethod
def main(ac=FastIO()):
"""
url: url of the problem
tag: algorithm tag
"""
def ceil(xxx, yyy):
return xxx / yyy + int(xxx % yyy != 0)
x, y, a, b, c = ac.read_list_ints()
for perm in permutations([a, b, c], 3):
aa, bb, cc = perm
yy = ceil(aa, x)
rest = y - yy
if rest > 0 and ceil(bb, rest) + ceil(cc, rest) <= x:
ac.yes()
return
if ceil(aa, x) + ceil(bb, x) + ceil(cc, x) <= y:
ac.yes()
return
if ceil(aa, y) + ceil(bb, y) + ceil(cc, y) <= x:
ac.yes()
return
xx = ceil(aa, y)
rest = x - xx
if rest > 0 and ceil(bb, rest) + ceil(cc, rest) <= y:
ac.yes()
return
ac.no()
return
Solution().main()
from itertools import permutations
from sys import stdin
class FastIO:
def __init__(self):
self.random_seed = 0
self.flush = False
self.inf = 1 << 32
return
@staticmethod
def read_int():
return int(stdin.readline().rstrip())
@staticmethod
def read_float():
return float(stdin.readline().rstrip())
@staticmethod
def read_list_ints():
return list(map(int, stdin.readline().rstrip().split()))
@staticmethod
def read_list_ints_minus_one():
return list(map(lambda x: int(x) - 1, stdin.readline().rstrip().split()))
@staticmethod
def read_str():
return stdin.readline().rstrip()
@staticmethod
def read_list_strs():
return stdin.readline().rstrip().split()
def get_random_seed(self):
import random
self.random_seed = random.randint(0, 10 ** 9 + 7)
return
def st(self, x):
return print(x, flush=self.flush)
def yes(self, s=None):
self.st("Yes" if not s else s)
return
def no(self, s=None):
self.st("No" if not s else s)
return
def lst(self, x):
return print(*x, flush=self.flush)
def flatten(self, lst):
self.st("\n".join(str(x) for x in lst))
return
@staticmethod
def max(a, b):
return a if a > b else b
@staticmethod
def min(a, b):
return a if a < b else b
@staticmethod
def ceil(a, b):
return a // b + int(a % b != 0)
@staticmethod
def accumulate(nums):
n = len(nums)
pre = [0] * (n + 1)
for i in range(n):
pre[i + 1] = pre[i] + nums[i]
return pre
class Solution:
def __init__(self):
return
@staticmethod
def main(ac=FastIO()):
"""
url: url of the problem
tag: algorithm tag
"""
def ceil(xxx, yyy):
return xxx // yyy + int(xxx % yyy != 0)
x, y, a, b, c = ac.read_list_ints()
for perm in permutations([a, b, c], 3):
aa, bb, cc = perm
yy = ceil(aa, x)
rest = y - yy
if rest > 0 and ceil(bb, rest) + ceil(cc, rest) <= x:
ac.yes()
return
if ceil(aa, x) + ceil(bb, x) + ceil(cc, x) <= y:
ac.yes()
return
if ceil(aa, y) + ceil(bb, y) + ceil(cc, y) <= x:
ac.yes()
return
xx = ceil(aa, y)
rest = x - xx
if rest > 0 and ceil(bb, rest) + ceil(cc, rest) <= y:
ac.yes()
return
ac.no()
return
Solution().main()
|
ConDefects/ConDefects/Code/abc223_e/Python/53250614
|
condefects-python_data_1522
|
x, y, a, b, c = map(int, input().split())
def solve_two(x, y, a, b):
if x==0 or y==0:
return False
res = ((a+x-1)//x+(b+x-1)//x <= y) or ((a+y-1)//y+(b+y-1)//y <= x)
return res
def solve_three(x, y, a, b, c):
case1 = solve_two(x, y-(a+x-1)//x, b, c)
case2 = solve_two(x-(a+y-1)//y, y, b, c)
case3 = solve_two(x, y-(b+x-1)//x, a, c)
case4 = solve_two(x-(b+y-1)//y, y, a, c)
case5 = solve_two(x, y-(c+x-1)//x, a, b)
case6 = solve_two(x-(c+y-1)//y, y, a, b)
return case1 or case2 or case3 or case4 or case5 or case6
ans = solve_three(x, y, a, b, c)
print('Yes' if ans else 'No')
x, y, a, b, c = map(int, input().split())
def solve_two(x, y, a, b):
if x<=0 or y<=0:
return False
res = ((a+x-1)//x+(b+x-1)//x <= y) or ((a+y-1)//y+(b+y-1)//y <= x)
return res
def solve_three(x, y, a, b, c):
case1 = solve_two(x, y-(a+x-1)//x, b, c)
case2 = solve_two(x-(a+y-1)//y, y, b, c)
case3 = solve_two(x, y-(b+x-1)//x, a, c)
case4 = solve_two(x-(b+y-1)//y, y, a, c)
case5 = solve_two(x, y-(c+x-1)//x, a, b)
case6 = solve_two(x-(c+y-1)//y, y, a, b)
return case1 or case2 or case3 or case4 or case5 or case6
ans = solve_three(x, y, a, b, c)
print('Yes' if ans else 'No')
|
ConDefects/ConDefects/Code/abc223_e/Python/54491597
|
condefects-python_data_1523
|
from itertools import permutations
X, Y, A, B, C = map(int, input().split())
def func1(x, y):
cnt = 0
cnt += (A+x-1)//x
cnt += (B+x-1)//x
cnt += (C+x-1)//x
return cnt <= y
if func1(X, Y) or func1(Y, X):
exit(print("Yes"))
def func2(a, b, c, x, y):
y -= (a+x-1)//x
if y <= 0:
return False
x, y = y, x
cnt = 0
cnt += (b+x-1)//x
cnt += (c+x-1)//x
return cnt <= x
for perm1 in permutations([X, Y]):
x, y = perm1
for perm2 in permutations([A, B, C]):
a, b, c = perm2
if func2(a, b, c, x, y):
exit(print("Yes"))
print("No")
from itertools import permutations
X, Y, A, B, C = map(int, input().split())
def func1(x, y):
cnt = 0
cnt += (A+x-1)//x
cnt += (B+x-1)//x
cnt += (C+x-1)//x
return cnt <= y
if func1(X, Y) or func1(Y, X):
exit(print("Yes"))
def func2(a, b, c, x, y):
y -= (a+x-1)//x
if y <= 0:
return False
x, y = y, x
cnt = 0
cnt += (b+x-1)//x
cnt += (c+x-1)//x
return cnt <= y
for perm1 in permutations([X, Y]):
x, y = perm1
for perm2 in permutations([A, B, C]):
a, b, c = perm2
if func2(a, b, c, x, y):
exit(print("Yes"))
print("No")
|
ConDefects/ConDefects/Code/abc223_e/Python/53648866
|
condefects-python_data_1524
|
def check_size(length, side, area):
other = 1 - side
need = (area + length[other] - 1) // length[other]
return length[side] - need
def rec(length, rem):
for i in range(3):
if not rem & 1 << i:
continue
n_rem = rem ^ 1 << i
for side in range(2):
nxt_length = check_size(length, side, area[i])
if nxt_length == 0 and n_rem:
return 0
if nxt_length >= 0:
if not n_rem:
return 1
pre_length = length[side]
length[side] = nxt_length
if rec(length, n_rem):
return 1
length[side] = pre_length
return 0
x, y, *area = map(int, input().split())
print("Yes" if rec([x, y], (1 << 3) - 1) else "No")
def check_size(length, side, area):
other = 1 - side
need = (area + length[other] - 1) // length[other]
return length[side] - need
def rec(length, rem):
for i in range(3):
if not rem & 1 << i:
continue
n_rem = rem ^ 1 << i
for side in range(2):
nxt_length = check_size(length, side, area[i])
if nxt_length == 0 and n_rem:
continue
if nxt_length >= 0:
if not n_rem:
return 1
pre_length = length[side]
length[side] = nxt_length
if rec(length, n_rem):
return 1
length[side] = pre_length
return 0
x, y, *area = map(int, input().split())
print("Yes" if rec([x, y], (1 << 3) - 1) else "No")
|
ConDefects/ConDefects/Code/abc223_e/Python/52933845
|
condefects-python_data_1525
|
n=int(input())
s=list(map(int,input().split()))
mn=[0]*3
d=[0]*3
for i in range(n-1):
d[i%3]=s[i+1]-s[i]
mn[i%3]=min(mn[i%3],d[i%3])
# print(mn)
if -sum(mn)>s[0]:
print("No")
exit()
a=[-mn[0],-mn[1]]
for i in range(n):
a.append(s[i]-a[-1]-a[-2])
print("Yes")
print(*a)
n=int(input())
s=list(map(int,input().split()))
mn=[0]*3
d=[0]*3
for i in range(n-1):
d[i%3]=s[i+1]-s[i]+d[i%3]
mn[i%3]=min(mn[i%3],d[i%3])
# print(mn)
if -sum(mn)>s[0]:
print("No")
exit()
a=[-mn[0],-mn[1]]
for i in range(n):
a.append(s[i]-a[-1]-a[-2])
print("Yes")
print(*a)
|
ConDefects/ConDefects/Code/arc135_b/Python/43508289
|
condefects-python_data_1526
|
n = int(input())
s = list(map(int,input().split()))
m0 = []
m1 = []
m2 = []
for i in range(n-1):
if i%3 == 0:
m0.append(s[i+1]-s[i])
if i%3 == 1:
m1.append(s[i+1]-s[i])
if i%3 == 2:
m2.append(s[i+1]-s[i])
r0 = [0]
r1 = [0]
r2 = [0]
for i in m0:
r0.append(r0[-1]+i)
for i in m1:
r1.append(r1[-1]+i)
for i in m2:
r2.append(r2[-1]+i)
mi0 = min(r0)
mi1 = min(r1)
mi2 = min(r2)
if mi0+mi1+mi2 < -s[0]:
print("No")
exit()
print("Yes")
ans = [0]*(n+2)
ans[0] = -mi0
ans[1] = -mi1
ans[2] = s[0]+mi0+mi1+mi2
for i in range(3,n+2):
if i%3 == 0:
ans[i] = ans[i-3]+m0[i//3-1]
if i%3 == 1:
ans[i] = ans[i-3]+m1[i//3-1]
if i%3 == 2:
ans[i] = ans[i-3]+m2[i//3-1]
print(*ans,sep=" ")
n = int(input())
s = list(map(int,input().split()))
m0 = []
m1 = []
m2 = []
for i in range(n-1):
if i%3 == 0:
m0.append(s[i+1]-s[i])
if i%3 == 1:
m1.append(s[i+1]-s[i])
if i%3 == 2:
m2.append(s[i+1]-s[i])
r0 = [0]
r1 = [0]
r2 = [0]
for i in m0:
r0.append(r0[-1]+i)
for i in m1:
r1.append(r1[-1]+i)
for i in m2:
r2.append(r2[-1]+i)
mi0 = min(r0)
mi1 = min(r1)
mi2 = min(r2)
if mi0+mi1+mi2 < -s[0]:
print("No")
exit()
print("Yes")
ans = [0]*(n+2)
ans[0] = -mi0
ans[1] = -mi1
ans[2] = s[0]+mi0+mi1
for i in range(3,n+2):
if i%3 == 0:
ans[i] = ans[i-3]+m0[i//3-1]
if i%3 == 1:
ans[i] = ans[i-3]+m1[i//3-1]
if i%3 == 2:
ans[i] = ans[i-3]+m2[i//3-1]
print(*ans,sep=" ")
|
ConDefects/ConDefects/Code/arc135_b/Python/40764615
|
condefects-python_data_1527
|
def main():
from math import sqrt,sin,cos,tan,ceil,radians,floor,gcd,exp,log,log10,log2,factorial,fsum
from heapq import heapify, heappop, heappush
from bisect import bisect_left, bisect_right
from copy import deepcopy
import copy
import random
from collections import deque,Counter,defaultdict
from itertools import permutations,combinations
from decimal import Decimal,ROUND_HALF_UP
#tmp = Decimal(mid).quantize(Decimal('0'), rounding=ROUND_HALF_UP)
from functools import lru_cache, reduce
#@lru_cache(maxsize=None)
from operator import add,sub,mul,xor,and_,or_,itemgetter
INF = 10**18
mod1 = 10**9+7
mod2 = 998244353
#DecimalならPython
'''
'''
N = int(input())
S = list(map(int, input().split()))
X = [0]*(N+2)
# X[i+3] = X[i]+S[i+1]-S[i]
for i in range(N-1):
X[i+3] = X[i]+S[i+1]-S[i]
#マイナスになってるやつを調べる
a = 0
b = 0
c = 0
for i in range(N+2):
if i%3 == 0:
a = min(a, X[i])
elif i%3 == 1:
b = min(b,X[i])
else:
c = min(c,X[i])
for i in range(N+2):
if i%3 == 0:
X[i] += -a
elif i%3 == 1:
X[i] += -b
else:
X[i] += -c
if X[0]+X[1]+X[2]<=S[0]:
ab = S[0]-X[1]-X[2]
for i in range(0,N+2,3):
X[i] += ab
print('Yes')
print(*X)
else:
print('No')
if __name__ == '__main__':
main()
def main():
from math import sqrt,sin,cos,tan,ceil,radians,floor,gcd,exp,log,log10,log2,factorial,fsum
from heapq import heapify, heappop, heappush
from bisect import bisect_left, bisect_right
from copy import deepcopy
import copy
import random
from collections import deque,Counter,defaultdict
from itertools import permutations,combinations
from decimal import Decimal,ROUND_HALF_UP
#tmp = Decimal(mid).quantize(Decimal('0'), rounding=ROUND_HALF_UP)
from functools import lru_cache, reduce
#@lru_cache(maxsize=None)
from operator import add,sub,mul,xor,and_,or_,itemgetter
INF = 10**18
mod1 = 10**9+7
mod2 = 998244353
#DecimalならPython
'''
'''
N = int(input())
S = list(map(int, input().split()))
X = [0]*(N+2)
# X[i+3] = X[i]+S[i+1]-S[i]
for i in range(N-1):
X[i+3] = X[i]+S[i+1]-S[i]
#マイナスになってるやつを調べる
a = 0
b = 0
c = 0
for i in range(N+2):
if i%3 == 0:
a = min(a, X[i])
elif i%3 == 1:
b = min(b,X[i])
else:
c = min(c,X[i])
for i in range(N+2):
if i%3 == 0:
X[i] += -a
elif i%3 == 1:
X[i] += -b
else:
X[i] += -c
if X[0]+X[1]+X[2]<=S[0]:
ab = S[0]-X[1]-X[2]-X[0]
for i in range(0,N+2,3):
X[i] += ab
print('Yes')
print(*X)
else:
print('No')
if __name__ == '__main__':
main()
|
ConDefects/ConDefects/Code/arc135_b/Python/39932705
|
condefects-python_data_1528
|
N=int(input())
S=list(map(int,input().split()))
a=[0]*(N+2)
mini=0
minj=0
mink=0
for i in range(3,N+2):
a[i]=a[i-3]+S[i-2]-S[i-3]
if i%3==0:
if mini>a[i]:
mini=a[i]
elif i%3==1:
if minj>a[i]:
minj=a[i]
else:
if mink>a[i]:
mink=a[i]
if -mini-minj-mink<=S[0]:
print("Yes")
mini=-mini
minj=-minj
mink=-mink+(S[0]-mini-minj-mink)
for i in range(N+2):
if i%3==0:
print(mini+a[i],end=" ")
elif i%3==1:
print(minj+a[i],end=" ")
else:
print(mink+a[i],end=" ")
else:
print("No")
N=int(input())
S=list(map(int,input().split()))
a=[0]*(N+2)
mini=0
minj=0
mink=0
for i in range(3,N+2):
a[i]=a[i-3]+S[i-2]-S[i-3]
if i%3==0:
if mini>a[i]:
mini=a[i]
elif i%3==1:
if minj>a[i]:
minj=a[i]
else:
if mink>a[i]:
mink=a[i]
if -mini-minj-mink<=S[0]:
print("Yes")
mini=-mini
minj=-minj
mink=S[0]-mini-minj
for i in range(N+2):
if i%3==0:
print(mini+a[i],end=" ")
elif i%3==1:
print(minj+a[i],end=" ")
else:
print(mink+a[i],end=" ")
else:
print("No")
|
ConDefects/ConDefects/Code/arc135_b/Python/41266489
|
condefects-python_data_1529
|
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
N, *S = map(int, read().split())
L = [0, 0, 0]
mi = [0, 0, 0]
for i in range(N - 1):
d = S[i + 1] - S[i]
L.append(L[-3] + d)
mi[i % 3] = min(mi[i % 3], L[-1])
for i in range(N + 2):
L[i] -= mi[i % 3]
for i in range(N):
S[i] -= sum(L[i:i+3])
if len(set(S)) != 1 or len(set(S)) == 1 and S[0] < 0:
print(-1)
else:
print('Yes')
num = S[0]
for i in range(N + 2):
if i % 3 == 0:
L[i] += num
print(*L)
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
N, *S = map(int, read().split())
L = [0, 0, 0]
mi = [0, 0, 0]
for i in range(N - 1):
d = S[i + 1] - S[i]
L.append(L[-3] + d)
mi[i % 3] = min(mi[i % 3], L[-1])
for i in range(N + 2):
L[i] -= mi[i % 3]
for i in range(N):
S[i] -= sum(L[i:i+3])
if len(set(S)) != 1 or len(set(S)) == 1 and S[0] < 0:
print('No')
else:
print('Yes')
num = S[0]
for i in range(N + 2):
if i % 3 == 0:
L[i] += num
print(*L)
|
ConDefects/ConDefects/Code/arc135_b/Python/45786471
|
condefects-python_data_1530
|
(h,w,C,q),*z=[[*map(int,t.split())]for t in open(0)]
a=[0]*C;s=u=set()
for t,n,c in z[::-1]:
if t==1 and n not in s:a[c-1]+=w;s|={n};h-=1
elif t==2 and n not in u:a[c-1]+=h;u|={n};w-=1
print(*a)
(h,w,C,q),*z=[[*map(int,t.split())]for t in open(0)]
a,s,u=[0]*C,set(),set()
for t,n,c in z[::-1]:
if t==1 and n not in s:a[c-1]+=w;s|={n};h-=1
elif t==2 and n not in u:a[c-1]+=h;u|={n};w-=1
print(*a)
|
ConDefects/ConDefects/Code/arc130_b/Python/37079672
|
condefects-python_data_1531
|
h, w, c, q = map(int, input().split())
dv = set()
db = set()
ans = [0] * c
queries = [list(map(lambda x: int(x)-1, input().split())) for _ in range(q)]
for t, n, c in reversed(queries):
if t == 2:
if n not in db:
ans[c] += w - len(dv)
db.add(n)
else:
if n not in dv:
ans[c] += h - len(db)
dv.add(n)
print(*ans)
h, w, c, q = map(int, input().split())
dv = set()
db = set()
ans = [0] * c
queries = [list(map(lambda x: int(x)-1, input().split())) for _ in range(q)]
for t, n, c in reversed(queries):
if t == 0:
if n not in db:
ans[c] += w - len(dv)
db.add(n)
else:
if n not in dv:
ans[c] += h - len(db)
dv.add(n)
print(*ans)
|
ConDefects/ConDefects/Code/arc130_b/Python/40982417
|
condefects-python_data_1532
|
import os,sys,random,threading
from random import randint
from copy import deepcopy
from io import BytesIO, IOBase
from types import GeneratorType
from functools import lru_cache, reduce
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from itertools import accumulate, combinations, permutations
from heapq import heapify, heappop, heappush
from typing import Generic, Iterable, Iterator, TypeVar, Union, List
from string import ascii_lowercase, ascii_uppercase
from math import ceil, floor, sqrt, pi, factorial, gcd, log, log10, log2, inf
from decimal import Decimal, getcontext
BUFSIZE = 4096
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin = IOWrapper(sys.stdin)
sys.stdout = IOWrapper(sys.stdout)
mod = int(1e9 + 7) #998244353
inf = int(1e20)
input = lambda: sys.stdin.readline().rstrip("\r\n")
MI = lambda :map(int,input().split())
li = lambda :list(MI())
ii = lambda :int(input())
py = lambda :print("YES")
pn = lambda :print("NO")
DIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)] # 右下左上
DIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),(-1, 1)] # →↘↓↙←↖↑↗
class BIT1:
"""单点修改,区间和查询"""
__slots__ = "size", "bit", "tree"
def __init__(self, n: int):
self.size = n
self.bit = n.bit_length()
self.tree = [0]*(n+1)
def add(self, index: int, delta: int) -> None:
# index 必须大于0
while index <= self.size:
self.tree[index]+=delta
index += index & -index
def _query(self, index: int) -> int:
res = 0
while index > 0:
res += self.tree[index]
index -= index & -index
return res
n,p=li() #n个人选p个的方案数
a=li()
b=li()
arr=sorted(zip(a,b))
mod=998244353
#f[i][j][k]前i个人里，选j个人，没选的人里b序号最小为k的方案数
f=[[0]*(n+5) for _ in range(n+5)]
f[0][n+1]=1
for a,b in arr:
nf=[[0]*(n+5) for _ in range(n+5)]
for j in range(n+1):
for k in range(1,n+2):
if k>b:
nf[j+1][k]=(nf[j+1][k]+f[j][k])%mod
nf[j][min(k,b)]=(nf[j][min(k,b)]+f[j][k])%mod
f=nf
res=0
for k in range(1,n+1):
res=(res+f[p][k])%mod
print(res)
#print(f)
import os,sys,random,threading
from random import randint
from copy import deepcopy
from io import BytesIO, IOBase
from types import GeneratorType
from functools import lru_cache, reduce
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from itertools import accumulate, combinations, permutations
from heapq import heapify, heappop, heappush
from typing import Generic, Iterable, Iterator, TypeVar, Union, List
from string import ascii_lowercase, ascii_uppercase
from math import ceil, floor, sqrt, pi, factorial, gcd, log, log10, log2, inf
from decimal import Decimal, getcontext
BUFSIZE = 4096
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin = IOWrapper(sys.stdin)
sys.stdout = IOWrapper(sys.stdout)
mod = int(1e9 + 7) #998244353
inf = int(1e20)
input = lambda: sys.stdin.readline().rstrip("\r\n")
MI = lambda :map(int,input().split())
li = lambda :list(MI())
ii = lambda :int(input())
py = lambda :print("YES")
pn = lambda :print("NO")
DIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)] # 右下左上
DIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),(-1, 1)] # →↘↓↙←↖↑↗
class BIT1:
"""单点修改,区间和查询"""
__slots__ = "size", "bit", "tree"
def __init__(self, n: int):
self.size = n
self.bit = n.bit_length()
self.tree = [0]*(n+1)
def add(self, index: int, delta: int) -> None:
# index 必须大于0
while index <= self.size:
self.tree[index]+=delta
index += index & -index
def _query(self, index: int) -> int:
res = 0
while index > 0:
res += self.tree[index]
index -= index & -index
return res
n,p=li() #n个人选p个的方案数
a=li()
b=li()
arr=sorted(zip(a,b))
mod=998244353
#f[i][j][k]前i个人里，选j个人，没选的人里b序号最小为k的方案数
f=[[0]*(n+5) for _ in range(n+5)]
f[0][n+1]=1
for a,b in arr:
nf=[[0]*(n+5) for _ in range(n+5)]
for j in range(n+1):
for k in range(1,n+2):
if k>b:
nf[j+1][k]=(nf[j+1][k]+f[j][k])%mod
nf[j][min(k,b)]=(nf[j][min(k,b)]+f[j][k])%mod
f=nf
res=0
for k in range(1,n+2):
res=(res+f[p][k])%mod
print(res)
#print(f)
|
ConDefects/ConDefects/Code/abc238_f/Python/48523335
|
condefects-python_data_1533
|
n,k = map(int,input().split())
p = list(map(int,input().split()))
q = list(map(int,input().split()))
mod = 998244353
a = [0]*(n)
for i in range(n):
a[p[i]-1] = q[i]-1
dp = [[0]*(n+1) for i in range(k+1)]
dp[0][n] = 1
for i in range(n):
ai = a[i]
new = [[0]*(n+1) for i in range(k+1)]
for j in range(k+1):
for mini in range(1, n+1):
if mini >= ai and j >= 1:
new[j][mini] += dp[j-1][mini]
if mini >= ai:
new[j][ai] += dp[j][mini]
else:
new[j][mini] += dp[j][mini]
new[j][mini] %= mod
new[j][ai] %= mod
dp = new
print(sum(dp[-1])%mod)
n,k = map(int,input().split())
p = list(map(int,input().split()))
q = list(map(int,input().split()))
mod = 998244353
a = [0]*(n)
for i in range(n):
a[p[i]-1] = q[i]-1
dp = [[0]*(n+1) for i in range(k+1)]
dp[0][n] = 1
for i in range(n):
ai = a[i]
new = [[0]*(n+1) for i in range(k+1)]
for j in range(k+1):
for mini in range(n+1):
if mini >= ai and j >= 1:
new[j][mini] += dp[j-1][mini]
if mini >= ai:
new[j][ai] += dp[j][mini]
else:
new[j][mini] += dp[j][mini]
new[j][mini] %= mod
new[j][ai] %= mod
dp = new
print(sum(dp[-1])%mod)
|
ConDefects/ConDefects/Code/abc238_f/Python/39396735
|
condefects-python_data_1534
|
n,k = map(int, input().split())
pq = []
p = list(map(int, input().split()))
q = list(map(int, input().split()))
for i in range(n):
pq.append((p[i], q[i]))
pq.sort()
a = []
for i in range(n):
a.append(pq[i][1])
#dp[i][j][m] = 数列のi番目まで考えて、今後jより大の数字はNGとなるようなもので数字をm個選んでいるような選び方
dp = [[[0]*(n+1) for _ in range(n+2)] for _ in range(n)]
mod = 998244353
for i in range(n):
x = a[i]
if i == 0:
dp[i][n+1][1] = 1
dp[i][x][0] = 1
else:
#xを採用する場合
for j in range(x+1,n+2):
for m in range(n):
dp[i][j][m+1] += dp[i-1][j][m]
dp[i][j][m+1] %= mod
#xを採用しない場合
for j in range(n+2):
for m in range(n+1):
dp[i][min(x,j)][m] += dp[i-1][j][m]
dp[i][min(x,j)][m] %= mod
ans = 0
for j in range(n+1):
ans += dp[-1][j][k]
ans %= mod
print(ans)
n,k = map(int, input().split())
pq = []
p = list(map(int, input().split()))
q = list(map(int, input().split()))
for i in range(n):
pq.append((p[i], q[i]))
pq.sort()
a = []
for i in range(n):
a.append(pq[i][1])
#dp[i][j][m] = 数列のi番目まで考えて、今後jより大の数字はNGとなるようなもので数字をm個選んでいるような選び方
dp = [[[0]*(n+1) for _ in range(n+2)] for _ in range(n)]
mod = 998244353
for i in range(n):
x = a[i]
if i == 0:
dp[i][n+1][1] = 1
dp[i][x][0] = 1
else:
#xを採用する場合
for j in range(x+1,n+2):
for m in range(n):
dp[i][j][m+1] += dp[i-1][j][m]
dp[i][j][m+1] %= mod
#xを採用しない場合
for j in range(n+2):
for m in range(n+1):
dp[i][min(x,j)][m] += dp[i-1][j][m]
dp[i][min(x,j)][m] %= mod
ans = 0
for j in range(n+2):
ans += dp[-1][j][k]
ans %= mod
print(ans)
|
ConDefects/ConDefects/Code/abc238_f/Python/41446414
|
condefects-python_data_1535
|
''' F - Two Exams
https://atcoder.jp/contests/abc238/tasks/abc238_f
'''
import io, os, sys
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline # decode().strip() if str
output = sys.stdout.write
DEBUG = os.environ.get('debug') not in [None, '0']
if DEBUG:
from inspect import currentframe, getframeinfo
from re import search
def debug(*args):
if not DEBUG: return
frame = currentframe().f_back
s = getframeinfo(frame).code_context[0]
r = search(r"\((.*)\)", s).group(1)
vnames = r.split(', ')
var_and_vals = [f'{var}={val}' for var, val in zip(vnames, args)]
prefix = f'{currentframe().f_back.f_lineno:02d}: '
print(f'{prefix}{", ".join(var_and_vals)}')
INF = float('inf')
# -----------------------------------------
MOD = 998244353
def solve(N, K, P, Q):
# R[i] = round 2 rank for round 1 rank-i player
R = [0] * N
for i, r in enumerate(P):
R[r - 1] = Q[i] - 1
# dp[i][j][k] = num ways to choose
# * i = consider first i players
# * j = min rank of a previous excluded player
# * k = chosen k players already
dp = [[[0] * (K+1) for _ in range(N+1)] for _ in range(N+1)]
dp[0][N][0] = 1
for i in range(1, N+1):
r = R[i-1]
for j in range(N+1):
for k in range(K+1):
# include i
if r < j and k < K: dp[i][j][k+1] = (dp[i][j][k+1] + dp[i-1][j][k]) % MOD
# exclude i
dp[i][min(r, j)][k] = (dp[i][min(r, j)][k] + dp[i-1][j][k]) % MOD
return sum(dp[N][j][K] for j in range(N)) % MOD
def main():
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
out = solve(N, K, P, Q)
print(out)
if __name__ == '__main__':
main()
''' F - Two Exams
https://atcoder.jp/contests/abc238/tasks/abc238_f
'''
import io, os, sys
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline # decode().strip() if str
output = sys.stdout.write
DEBUG = os.environ.get('debug') not in [None, '0']
if DEBUG:
from inspect import currentframe, getframeinfo
from re import search
def debug(*args):
if not DEBUG: return
frame = currentframe().f_back
s = getframeinfo(frame).code_context[0]
r = search(r"\((.*)\)", s).group(1)
vnames = r.split(', ')
var_and_vals = [f'{var}={val}' for var, val in zip(vnames, args)]
prefix = f'{currentframe().f_back.f_lineno:02d}: '
print(f'{prefix}{", ".join(var_and_vals)}')
INF = float('inf')
# -----------------------------------------
MOD = 998244353
def solve(N, K, P, Q):
# R[i] = round 2 rank for round 1 rank-i player
R = [0] * N
for i, r in enumerate(P):
R[r - 1] = Q[i] - 1
# dp[i][j][k] = num ways to choose
# * i = consider first i players
# * j = min rank of a previous excluded player
# * k = chosen k players already
dp = [[[0] * (K+1) for _ in range(N+1)] for _ in range(N+1)]
dp[0][N][0] = 1
for i in range(1, N+1):
r = R[i-1]
for j in range(N+1):
for k in range(K+1):
# include i
if r < j and k < K: dp[i][j][k+1] = (dp[i][j][k+1] + dp[i-1][j][k]) % MOD
# exclude i
dp[i][min(r, j)][k] = (dp[i][min(r, j)][k] + dp[i-1][j][k]) % MOD
return sum(dp[N][j][K] for j in range(N+1)) % MOD
def main():
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
Q = list(map(int, input().split()))
out = solve(N, K, P, Q)
print(out)
if __name__ == '__main__':
main()
|
ConDefects/ConDefects/Code/abc238_f/Python/30171666
|
condefects-python_data_1536
|
N = int(input())
starts = [0] * N
ends = [0] * N
for i in range(N):
start, end = map(int, input().split())
starts[i] = start
ends[i] = end
starts.sort(reverse = True)
ends.sort(reverse = True)
n_active_intervals = 0
n_overlaps = 0
while starts:
if starts[-1] <= ends[-1]:
# print(f"start at {starts[-1]}, {n_active_intervals} active")
starts.pop()
n_overlaps += n_active_intervals
n_active_intervals += 1
else:
# print(f"end at {ends[-1]}, {n_active_intervals-1} active")
ends.pop()
n_active_intervals -= 1
print(n_active_intervals)
N = int(input())
starts = [0] * N
ends = [0] * N
for i in range(N):
start, end = map(int, input().split())
starts[i] = start
ends[i] = end
starts.sort(reverse = True)
ends.sort(reverse = True)
n_active_intervals = 0
n_overlaps = 0
while starts:
if starts[-1] <= ends[-1]:
# print(f"start at {starts[-1]}, {n_active_intervals} active")
starts.pop()
n_overlaps += n_active_intervals
n_active_intervals += 1
else:
# print(f"end at {ends[-1]}, {n_active_intervals-1} active")
ends.pop()
n_active_intervals -= 1
print(n_overlaps)
|
ConDefects/ConDefects/Code/abc355_d/Python/54769975
|
condefects-python_data_1537
|
import bisect
N=int(input())
A=[]
left=[]
for i in range(N):
l,r=map(int,input().split())
A.append((l,r))
A.sort()
for l,r in A:
left.append(l)
res=0
for i in range(N):
j=bisect.bisect_right(left,A[i][1])
res+=j-1-1
print(res)
import bisect
N=int(input())
A=[]
left=[]
for i in range(N):
l,r=map(int,input().split())
A.append((l,r))
A.sort()
for l,r in A:
left.append(l)
res=0
for i in range(N):
j=bisect.bisect_right(left,A[i][1])
res+=j-1-i
print(res)
|
ConDefects/ConDefects/Code/abc355_d/Python/54962724
|
condefects-python_data_1538
|
from collections import deque
import sys
import math
import heapq
import random
import itertools
from functools import cmp_to_key
from fractions import Fraction
def gs():
return sys.stdin.readline().split()[0]
def gd():
return float(sys.stdin.readline())
def gi():
return int(sys.stdin.readline())
def gia():
return list(map(int,sys.stdin.readline().split()))
def gsa():
return sys.stdin.readline().split()
def readGraph(N,M, idx=0, hasDirect=False, hasCost=False):
G=[]
if(hasCost):
G=Graph(N)
else:
for i in range(N):
G.append([])
for i in range(M):
E=gia()
if(not hasCost):
u=E[0]-(1-idx)
v=E[1]-(1-idx)
G[u].append(v)
if(not hasDirect):
G[v].append(u)
else:
u=E[0]-(1-idx)
v=E[1]-(1-idx)
c=E[2]
G.addEdge(u,v,c)
if(not hasDirect):
G.addEdge(v,u,c)
return G
def ceil_pow2(n):
x=0
while((1<<x)<n):
x+=1
return x
def uclid(m, n):
if(n==0):
return m
else:
return uclid(n, m%n)
#拡張ユークリッドの互除法
def invGcd(a, b):
a%=b
if a==0: return b,0
s, t=b, a
m0, m1=0,1
while(t):
u=s//t
s-=t*u
m0-=m1*u
s,t=t,s
m0,m1=m1,m0
if m0<0: m0+=b//s
return s,m0
# 逆元を求める。存在しないときは-1を返す
def invMod(x, m):
z=invGcd(x,m)
if(z[0]!=1):return -1
return z[1]
#約数取得
def yakusu(n):
l=[]
for i in range(1, n+1):
if(i*i>n):
break;
if(n%i==0):
l.append(i)
if(n/i!=i):
l.append(n//i)
return l
def insuB(n):
l=[]
i=2
while(i*i<=n):
if(n%i==0):
l.append(i)
n=n//i
else:
i+=1
if(n!=1):
l.append(n)
return l
def insuBm(n):
m=dict()
for i in range(2, n):
if(i*i>n):break
while(n%i==0):
if(not(i in m)):
m[i]=1
else:
m[i]+=1
n=n//i
if(n!=1):
if(not(n in m)):
m[n]=1
else:
m[n]+=1
return m
KAIJO_DP=[0]*4000000
def kaijo(n, mod):
if(n<=1):
return 1
if(KAIJO_DP[n]!=0):
return KAIJO_DP[n]
ans=n*kaijo(n-1, mod)
ans%=mod
KAIJO_DP[n]=ans
return ans
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
def beforeCmb(num,mod):
for i in range( 2, num + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
def isP(n):
if(n==1):
return False
for i in range(2, math.floor(math.sqrt(n))+1):
if(n%i==0):
return False
return True
def nextCombination(sub):
x=sub & (-sub)
y=sub+x
return (((sub & ~y) // x) >> 1) | y
class FenwickTree:
def __init__(self, n):
self.N = n
self.data = [0] * n
def add(self, p, x):
if(p<0 or p >= self.N):
return None
p+=1
while(p<=self.N):
self.data[p-1]+=x
p+=p&-p;
def get(self, l, r):
if(l<0 or l>r or r>self.N):
return -(1<<64)
return self._innerSum(r) - self._innerSum(l)
def _innerSum(self, r):
s=0
while(r>0):
s+=self.data[r-1]
r-=r&-r
return s
class FenwickTreeImos:
def __init__(self, n):
self.fw = FenwickTree(n+1)
def add(self, s, t, x):
self.fw.add(s, x)
self.fw.add(t, -x)
def get(self, i):
return self[i]
def __getitem__(self, key):
return self.fw.get(0, key+1)
class Edge:
def __init__(self, f, t, c):
self._from=f
self._to=t
self._cost=c
def getStart(self):
return self._from
def getEnd(self):
return self._to
def getDistance(self):
return self._cost
def setDistance(self, c):
self._cost =c
class Graph:
def __init__(self, n):
self.gla=[]
self.prev=[-1]*n
for i in range(n):
self.gla.append([])
def addEdge(self, u, v, l):
e=Edge(u, v, l)
self.gla[u].append(e)
def removeEdge(self, u, v):
l=self.gla[u]
for edge in l:
if(edge.getStart() == u and edge.getEnd()==v):
l.remove(edge)
def changeLength(self, u, v, d):
l=self.gla[u]
for edge in l:
if(edge.getStart() == u and edge.getEnd()==v):
edge.setDistance(d)
break
def getVertexNum(self):
return len(self.gla)
def getEdgeLength(self, u, v):
l=self.gla[u]
for edge in l:
if(edge.getStart() == u and edge.getEnd()==v):
return edge.getDistance()
return 1<<64
def dijkstra(self, start):
d=[1<<64] * self.getVertexNum()
d[start]=0
q=[]
heapq.heappush(q, (0, start))
self.prev[start]=-1
while(len(q)!=0):
p=heapq.heappop(q)
if(p[0]>d[p[1]]):
continue
el=self.gla[p[1]]
for edge in el:
to=edge.getEnd()
fr=edge.getStart()
cost=edge.getDistance()
if(d[to]>d[fr]+cost):
d[to]=d[fr]+cost
self.prev[to]=fr
heapq.heappush(q, (d[to], to))
return d
def getPath(self, v):
path=[]
while(v!=-1):
path.append(v)
v=self.prev[v]
path.reverse()
return path
class SegTree:
def __init__(self, v, op, e):
self.n=len(v)
self.log=ceil_pow2(self.n)
self.size=1<<self.log
self.op=op
self.e=e
self.d=[e]*(2*self.size)
for i in range(self.n):
self.d[self.size+i]=v[i]
for i in range(self.size-1, 0, -1):
self._update(i)
def setVal(self, p, x):
p+=self.size
self.d[p]=x
for i in range(1, self.log+1):
self._update(p>>i)
def getVal(self, p):
return self.d[p+self.size]
def prod(self, l, r):
sml=self.e
smr=self.e
l+=self.size
r+=self.size
while(l<r):
if(l&1 != 0):
sml=self.op(sml, self.d[l])
l+=1
if(r&1 != 0):
r-=1
smr=self.op(self.d[r], smr)
l>>=1
r>>=1
return self.op(sml,smr)
def allProd(self):
return self.d[1]
def maxRight(self, l, f):
if(l==self.n):return self.n
l+=self.size
sm=self.e
while True:
while(l%2==0):
l>>=1
if(not f(self.op(sm,self.d[l]))):
while(l<self.size):
l=2*l
if(f(self.op(sm, self.d[l]))):
sm=self.op(sm, self.d[l])
l+=1
return l-self.size
sm=self.op(sm, self.d[l])
l+=1
if((l & -l) == l):break
return self.n
def minLeft(self, r, f):
if(r==0):return 0
r+=self.size
sm=self.e
while(True):
r-=1
while(r>1 and r%2==1):
r>>=1
if(not f(self.op(self.d[r], sm))):
while(r<self.size):
r=2*r+1
if(f(self.op(self.d[r],sm))):
sm=self.op(self.d[r],sm)
r-=1
return r+1-self.size
sm=self.op(self.d[r], sm)
if((r&-r)==r):break
return 0
def _update(self, k):
self.d[k]=self.op(self.d[2*k], self.d[2*k+1])
def g(s,K):
fi=-1
li=-1
for i in range(len(s)):
if(s[i]=='1'):
if(fi==-1):
fi=i
li=i
flg=True
if(fi==-1):
flg=False
if(len(s)<K):
return (0,flg)
if(li-fi+1>K):
return (0,flg)
if(li-fi+1==K or len(s)==K):
return (1,flg)
if(fi==0 or li==len(s)-1):
return (1,flg)
return (2,flg)
def f():
N,K=gia()
S=gs()
sa=S.split('0')
ans=0
tc=0
for i in range(len(sa)):
s=sa[i]
c,flg=g(s,K)
if(flg==True and c==0):
return "No"
if(c>1 and flg==True):
return "No"
ans+=c
if(flg):
tc+=1
if(tc>1):
return "No"
if(ans==1):
return "Yes"
if(ans==0):
return "No"
if(tc==1):
return"Yes"
return "No"
def main_():
T=gi()
for i in range(T):
ans=f()
print(ans)
main_()
from collections import deque
import sys
import math
import heapq
import random
import itertools
from functools import cmp_to_key
from fractions import Fraction
def gs():
return sys.stdin.readline().split()[0]
def gd():
return float(sys.stdin.readline())
def gi():
return int(sys.stdin.readline())
def gia():
return list(map(int,sys.stdin.readline().split()))
def gsa():
return sys.stdin.readline().split()
def readGraph(N,M, idx=0, hasDirect=False, hasCost=False):
G=[]
if(hasCost):
G=Graph(N)
else:
for i in range(N):
G.append([])
for i in range(M):
E=gia()
if(not hasCost):
u=E[0]-(1-idx)
v=E[1]-(1-idx)
G[u].append(v)
if(not hasDirect):
G[v].append(u)
else:
u=E[0]-(1-idx)
v=E[1]-(1-idx)
c=E[2]
G.addEdge(u,v,c)
if(not hasDirect):
G.addEdge(v,u,c)
return G
def ceil_pow2(n):
x=0
while((1<<x)<n):
x+=1
return x
def uclid(m, n):
if(n==0):
return m
else:
return uclid(n, m%n)
#拡張ユークリッドの互除法
def invGcd(a, b):
a%=b
if a==0: return b,0
s, t=b, a
m0, m1=0,1
while(t):
u=s//t
s-=t*u
m0-=m1*u
s,t=t,s
m0,m1=m1,m0
if m0<0: m0+=b//s
return s,m0
# 逆元を求める。存在しないときは-1を返す
def invMod(x, m):
z=invGcd(x,m)
if(z[0]!=1):return -1
return z[1]
#約数取得
def yakusu(n):
l=[]
for i in range(1, n+1):
if(i*i>n):
break;
if(n%i==0):
l.append(i)
if(n/i!=i):
l.append(n//i)
return l
def insuB(n):
l=[]
i=2
while(i*i<=n):
if(n%i==0):
l.append(i)
n=n//i
else:
i+=1
if(n!=1):
l.append(n)
return l
def insuBm(n):
m=dict()
for i in range(2, n):
if(i*i>n):break
while(n%i==0):
if(not(i in m)):
m[i]=1
else:
m[i]+=1
n=n//i
if(n!=1):
if(not(n in m)):
m[n]=1
else:
m[n]+=1
return m
KAIJO_DP=[0]*4000000
def kaijo(n, mod):
if(n<=1):
return 1
if(KAIJO_DP[n]!=0):
return KAIJO_DP[n]
ans=n*kaijo(n-1, mod)
ans%=mod
KAIJO_DP[n]=ans
return ans
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
def beforeCmb(num,mod):
for i in range( 2, num + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
def isP(n):
if(n==1):
return False
for i in range(2, math.floor(math.sqrt(n))+1):
if(n%i==0):
return False
return True
def nextCombination(sub):
x=sub & (-sub)
y=sub+x
return (((sub & ~y) // x) >> 1) | y
class FenwickTree:
def __init__(self, n):
self.N = n
self.data = [0] * n
def add(self, p, x):
if(p<0 or p >= self.N):
return None
p+=1
while(p<=self.N):
self.data[p-1]+=x
p+=p&-p;
def get(self, l, r):
if(l<0 or l>r or r>self.N):
return -(1<<64)
return self._innerSum(r) - self._innerSum(l)
def _innerSum(self, r):
s=0
while(r>0):
s+=self.data[r-1]
r-=r&-r
return s
class FenwickTreeImos:
def __init__(self, n):
self.fw = FenwickTree(n+1)
def add(self, s, t, x):
self.fw.add(s, x)
self.fw.add(t, -x)
def get(self, i):
return self[i]
def __getitem__(self, key):
return self.fw.get(0, key+1)
class Edge:
def __init__(self, f, t, c):
self._from=f
self._to=t
self._cost=c
def getStart(self):
return self._from
def getEnd(self):
return self._to
def getDistance(self):
return self._cost
def setDistance(self, c):
self._cost =c
class Graph:
def __init__(self, n):
self.gla=[]
self.prev=[-1]*n
for i in range(n):
self.gla.append([])
def addEdge(self, u, v, l):
e=Edge(u, v, l)
self.gla[u].append(e)
def removeEdge(self, u, v):
l=self.gla[u]
for edge in l:
if(edge.getStart() == u and edge.getEnd()==v):
l.remove(edge)
def changeLength(self, u, v, d):
l=self.gla[u]
for edge in l:
if(edge.getStart() == u and edge.getEnd()==v):
edge.setDistance(d)
break
def getVertexNum(self):
return len(self.gla)
def getEdgeLength(self, u, v):
l=self.gla[u]
for edge in l:
if(edge.getStart() == u and edge.getEnd()==v):
return edge.getDistance()
return 1<<64
def dijkstra(self, start):
d=[1<<64] * self.getVertexNum()
d[start]=0
q=[]
heapq.heappush(q, (0, start))
self.prev[start]=-1
while(len(q)!=0):
p=heapq.heappop(q)
if(p[0]>d[p[1]]):
continue
el=self.gla[p[1]]
for edge in el:
to=edge.getEnd()
fr=edge.getStart()
cost=edge.getDistance()
if(d[to]>d[fr]+cost):
d[to]=d[fr]+cost
self.prev[to]=fr
heapq.heappush(q, (d[to], to))
return d
def getPath(self, v):
path=[]
while(v!=-1):
path.append(v)
v=self.prev[v]
path.reverse()
return path
class SegTree:
def __init__(self, v, op, e):
self.n=len(v)
self.log=ceil_pow2(self.n)
self.size=1<<self.log
self.op=op
self.e=e
self.d=[e]*(2*self.size)
for i in range(self.n):
self.d[self.size+i]=v[i]
for i in range(self.size-1, 0, -1):
self._update(i)
def setVal(self, p, x):
p+=self.size
self.d[p]=x
for i in range(1, self.log+1):
self._update(p>>i)
def getVal(self, p):
return self.d[p+self.size]
def prod(self, l, r):
sml=self.e
smr=self.e
l+=self.size
r+=self.size
while(l<r):
if(l&1 != 0):
sml=self.op(sml, self.d[l])
l+=1
if(r&1 != 0):
r-=1
smr=self.op(self.d[r], smr)
l>>=1
r>>=1
return self.op(sml,smr)
def allProd(self):
return self.d[1]
def maxRight(self, l, f):
if(l==self.n):return self.n
l+=self.size
sm=self.e
while True:
while(l%2==0):
l>>=1
if(not f(self.op(sm,self.d[l]))):
while(l<self.size):
l=2*l
if(f(self.op(sm, self.d[l]))):
sm=self.op(sm, self.d[l])
l+=1
return l-self.size
sm=self.op(sm, self.d[l])
l+=1
if((l & -l) == l):break
return self.n
def minLeft(self, r, f):
if(r==0):return 0
r+=self.size
sm=self.e
while(True):
r-=1
while(r>1 and r%2==1):
r>>=1
if(not f(self.op(self.d[r], sm))):
while(r<self.size):
r=2*r+1
if(f(self.op(self.d[r],sm))):
sm=self.op(self.d[r],sm)
r-=1
return r+1-self.size
sm=self.op(self.d[r], sm)
if((r&-r)==r):break
return 0
def _update(self, k):
self.d[k]=self.op(self.d[2*k], self.d[2*k+1])
def g(s,K):
fi=-1
li=-1
for i in range(len(s)):
if(s[i]=='1'):
if(fi==-1):
fi=i
li=i
flg=True
if(fi==-1):
flg=False
if(len(s)<K):
return (0,flg)
if(li-fi+1>K):
return (0,flg)
if((li-fi+1==K and flg) or len(s)==K):
return (1,flg)
if(fi==0 or li==len(s)-1):
return (1,flg)
return (2,flg)
def f():
N,K=gia()
S=gs()
sa=S.split('0')
ans=0
tc=0
for i in range(len(sa)):
s=sa[i]
c,flg=g(s,K)
if(flg==True and c==0):
return "No"
if(c>1 and flg==True):
return "No"
ans+=c
if(flg):
tc+=1
if(tc>1):
return "No"
if(ans==1):
return "Yes"
if(ans==0):
return "No"
if(tc==1):
return"Yes"
return "No"
def main_():
T=gi()
for i in range(T):
ans=f()
print(ans)
main_()
|
ConDefects/ConDefects/Code/arc150_a/Python/42959730
|
condefects-python_data_1539
|
t=int(input())
for i in range(t):
n, k = map(int, input().split())
s=list(input())
b1 = s.count("1")
tz = [0]
tq=[0]
cz=0
cq=0
ac=0
for j in range(n):
cz+=int(s[j]=="0")
tz.append(cz)
cq+=int(s[j]=="?")
tq.append(cq)
for j in range(0,n-k):
if tz[j+k]-tz[j]==0 and tq[j+k]-tq[j]==k-b1 :
ac+=1
if ac==1:
print("Yes")
else:
print("No")
t=int(input())
for i in range(t):
n, k = map(int, input().split())
s=list(input())
b1 = s.count("1")
tz = [0]
tq=[0]
cz=0
cq=0
ac=0
for j in range(n):
cz+=int(s[j]=="0")
tz.append(cz)
cq+=int(s[j]=="?")
tq.append(cq)
for j in range(0,n-k+1):
if tz[j+k]-tz[j]==0 and tq[j+k]-tq[j]==k-b1 :
ac+=1
if ac==1:
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/arc150_a/Python/46041187
|
condefects-python_data_1540
|
import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
T = int(readline())
for _ in range(T):
N, K = map(int, readline().split())
S = readline().rstrip()
S += '*'
cnt_one = S.count('1')
C = Counter(S[:K])
cnt = 0
for i in range(N - K):
if C['1'] == cnt_one and C['0'] == 0:
cnt += 1
C[S[i]] -= 1
C[S[i + K]] += 1
if cnt == 1:
print('Yes')
else:
print('No')
import sys
from collections import Counter
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
T = int(readline())
for _ in range(T):
N, K = map(int, readline().split())
S = readline().rstrip()
S += '*'
cnt_one = S.count('1')
C = Counter(S[:K])
cnt = 0
for i in range(N - K + 1):
if C['1'] == cnt_one and C['0'] == 0:
cnt += 1
C[S[i]] -= 1
C[S[i + K]] += 1
if cnt == 1:
print('Yes')
else:
print('No')
|
ConDefects/ConDefects/Code/arc150_a/Python/42990587
|
condefects-python_data_1541
|
T = int(input())
for t in range(T):
N,K = map(int,input().split())
S = "2" + input() + "2"
S = list(S)
C = S.count("1")
if C >= 2:
st = 0
ed = -1
ng = 0
for i in range(len(S)):
if S[i] == "1":
ed = i
if st == 0:
st = i
for i in range(len(S)):
if S[i] == "?" and st < i and i < ed:
S[i] = "?"
elif S[i] == "0" and st < i and i < ed:
ng = 1
f = 0
e = 0
for i in range(1,st):
if S[st-i] == "?":
f += 1
else:
break
for i in range(1 ,len(S)):
if S[ed+i] == "?":
e += 1
else:
break
#print(st,ed,e)
if f and e:
if f + e + (ed-st+1) == K or ed-st+1 == K:
pass
else:
ng = 1
elif f == 0 and e == 0:
if ed-st+1 != K:
ng = 1
else:
if f + e + (ed-st+1) < K:
ng = 1
if ed-st+1 > K:
ng = 1
#print(st,ed,f,e)
elif C == 1:
ng = 0
if K == 1:
pass
else:
p = 0
ng = 0
for i in range(len(S)):
if S[i] == "1":
p = i
f = 0
e = 0
for i in range(1,len(S)):
if S[p-i] == "?":
f += 1
else:
break
for i in range(1,len(S)):
if S[p+i] == "?":
e += 1
else:
break
if f and e:
if f+e+1 != K:
ng = 1
else:
if f+e+1 < K:
ng = 1
else:
ng = 0
Box = 0
cnt = 0
if S.count("?") < K:
ng = 1
for i in range(len(S)):
if S[i] == "?":
cnt += 1
else:
if cnt > K:
ng = 1
elif cnt == K:
if Box:
ng = 1
else:
Box=1
cnt = 0
else:
cnt = 0
if ng:
print("No")
else:
print("Yes")
T = int(input())
for t in range(T):
N,K = map(int,input().split())
S = "2" + input() + "2"
S = list(S)
C = S.count("1")
if C >= 2:
st = 0
ed = -1
ng = 0
for i in range(len(S)):
if S[i] == "1":
ed = i
if st == 0:
st = i
for i in range(len(S)):
if S[i] == "?" and st < i and i < ed:
S[i] = "?"
elif S[i] == "0" and st < i and i < ed:
ng = 1
f = 0
e = 0
for i in range(1,st):
if S[st-i] == "?":
f += 1
else:
break
for i in range(1 ,len(S)):
if S[ed+i] == "?":
e += 1
else:
break
#print(st,ed,e)
if f and e:
if f + e + (ed-st+1) == K or ed-st+1 == K:
pass
else:
ng = 1
elif f == 0 and e == 0:
if ed-st+1 != K:
ng = 1
else:
if f + e + (ed-st+1) < K:
ng = 1
if ed-st+1 > K:
ng = 1
#print(st,ed,f,e)
elif C == 1:
ng = 0
if K == 1:
pass
else:
p = 0
ng = 0
for i in range(len(S)):
if S[i] == "1":
p = i
f = 0
e = 0
for i in range(1,len(S)):
if S[p-i] == "?":
f += 1
else:
break
for i in range(1,len(S)):
if S[p+i] == "?":
e += 1
else:
break
if f and e:
if f+e+1 != K:
ng = 1
else:
if f+e+1 < K:
ng = 1
else:
ng = 0
Box = 0
cnt = 0
if S.count("?") < K:
ng = 1
for i in range(len(S)):
if S[i] == "?":
cnt += 1
else:
if cnt > K:
ng = 1
elif cnt == K:
if Box:
ng = 1
else:
Box=1
cnt = 0
else:
cnt = 0
if Box == 0:
ng = 1
if ng:
print("No")
else:
print("Yes")
|
ConDefects/ConDefects/Code/arc150_a/Python/42081272
|
condefects-python_data_1542
|
N = int(input())
A = [list(map(int, input().split())) for _ in range(2*N-1)]
lst = [True]*(2*N)
ans = 0
c = 0
def dfs(lst, score):
global ans
global c
key = -1
for i in range(2*N):
if lst[i]:
key = i
lst[key] = False
break
if key == -1:
ans = max(ans, score)
c += 1
for i in range(key+1, 2*N):
if lst[i]:
lst[i] = False
s_tmp = A[key][i-key-1]
score ^= s_tmp
dfs(lst, score)
score ^= s_tmp
lst[i] = True
lst[key] = True
dfs(lst, 0)
print(ans)
# print('c:', c)
'''
2
5 0 1
5 3
0
'''
N = int(input())
A = [list(map(int, input().split())) for _ in range(2*N-1)]
lst = [True]*(2*N)
ans = 0
c = 0
def dfs(lst, score):
global ans
global c
key = -1
for i in range(2*N):
if lst[i]:
key = i
lst[key] = False
break
if key == -1:
ans = max(ans, score)
c += 1
return
for i in range(key+1, 2*N):
if lst[i]:
lst[i] = False
s_tmp = A[key][i-key-1]
score ^= s_tmp
dfs(lst, score)
score ^= s_tmp
lst[i] = True
lst[key] = True
dfs(lst, 0)
print(ans)
# print('c:', c)
# print('lst:', lst)
'''
2
5 0 1
5 3
0
'''
|
ConDefects/ConDefects/Code/abc236_d/Python/54275288
|
condefects-python_data_1543
|
n,k,q=map(int,input().split())
a=list(map(int,input().split()))
l=list(map(int,input().split()))
masu=[ 0 for _ in range(n)]
for i in range(k):
masu[a[i] -1] = 1
print(masu)
for i in range(q):
c=0
for j in range(n):
if masu[j] == 1:
c+=1
if c==l[i]:
if j+1>=n:
continue
if masu[j+1]==0:
masu[j+1]=masu[j]
masu[j]=0
continue
for i in range(n):
if masu[i] ==1:
print(i+1 , end=' ')
n,k,q=map(int,input().split())
a=list(map(int,input().split()))
l=list(map(int,input().split()))
masu=[ 0 for _ in range(n)]
for i in range(k):
masu[a[i] -1] = 1
#print(masu)
for i in range(q):
c=0
for j in range(n):
if masu[j] == 1:
c+=1
if c==l[i]:
if j+1>=n:
continue
if masu[j+1]==0:
masu[j+1]=masu[j]
masu[j]=0
continue
for i in range(n):
if masu[i] ==1:
print(i+1 , end=' ')
|
ConDefects/ConDefects/Code/abc257_b/Python/45964870
|
condefects-python_data_1544
|
n=int(input())
s=input()
a=[]
T=False
b=1
for i in range(n-1):
if s[i]=='>':
b+=1
else:
if b!=1:
a.append(b)
b=1
if b!=1:
a.append(b)
c=0
for i in a:
c+=(n*(n-1))//2
print(c)
n=int(input())
s=input()
a=[]
T=False
b=1
for i in range(n-1):
if s[i]=='>':
b+=1
else:
if b!=1:
a.append(b)
b=1
if b!=1:
a.append(b)
c=0
for i in a:
c+=(i*(i-1))//2
print(c)
|
ConDefects/ConDefects/Code/arc168_a/Python/49215452
|
condefects-python_data_1545
|
from functools import lru_cache
@lru_cache
def f(maxi, no):
if maxi < 10:
return maxi - (0 < no <= maxi)
q = maxi // 10
r = maxi % 10
ans = 0
for x in range(10):
if x == no:
continue
if x <= r:
ans += f(q, x) + (x != 0)
else:
ans += f(q - 1, x) + (x != 0)
return ans
def g(maxi):
if maxi < 10:
return maxi
q = maxi // 10
r = maxi % 10
ans = 0
for x in range(10):
if x <= r:
ans += f(q, x) + (x != 0)
else:
ans += f(q - 1, x) + (x != 0)
return ans
T = int(input())
for _ in range(T):
k = int(input())
lo = 0
hi = 10**12
# f(lo) < k
while lo < hi - 1:
m = (lo + hi) // 2
s = g(m)
if s < k:
lo = m
else:
hi = m
print(hi)
from functools import lru_cache
@lru_cache
def f(maxi, no):
if maxi < 10:
return maxi - (0 < no <= maxi)
q = maxi // 10
r = maxi % 10
ans = 0
for x in range(10):
if x == no:
continue
if x <= r:
ans += f(q, x) + (x != 0)
else:
ans += f(q - 1, x) + (x != 0)
return ans
def g(maxi):
if maxi < 10:
return maxi
q = maxi // 10
r = maxi % 10
ans = 0
for x in range(10):
if x <= r:
ans += f(q, x) + (x != 0)
else:
ans += f(q - 1, x) + (x != 0)
return ans
T = int(input())
for _ in range(T):
k = int(input())
lo = 0
hi = 10**15
# f(lo) < k
while lo < hi - 1:
m = (lo + hi) // 2
s = g(m)
if s < k:
lo = m
else:
hi = m
print(hi)
|
ConDefects/ConDefects/Code/arc173_a/Python/53255887
|
condefects-python_data_1546
|
def neq(x):
n = len(x)
ans = 0
if n==1:
return int(x)
for i in range(n):
if i==0:
ans += (int(x[i])-1)*(9**(n-1))+neq('9'*(n-1))
elif i==n-1:
if int(x[i-1])<=int(x[i]):
return ans+int(x[i])
else:
return ans+int(x[i])+1
elif int(x[i-1])<int(x[i]):
ans += (int(x[i])-1)*(9**(n-1-i))
elif x[i-1]==x[i]:
ans += int(x[i])*(9**(n-1-i))
return ans
else:
ans += (int(x[i]))*(9**(n-1-i))
T = int(input())
for _ in range(T):
k = int(input())
M = k*10
s,l = k,M
while True:
m = (s+l)//2
x = neq(str(m))
if x<k:
s=m
elif x>k:
l=m
else:
m=str(m)
while True:
for j in range(0,len(m)-1):
if m[j]==m[j+1]:
if j+2<len(m)-1:
m = str(int(m[:j+2])-1)+'9'*(len(m)-1-j-2)
else:
m = str(int(m)-1)
break
else:
print(int(m))
break
break
def neq(x):
n = len(x)
ans = 0
if n==1:
return int(x)
for i in range(n):
if i==0:
ans += (int(x[i])-1)*(9**(n-1))+neq('9'*(n-1))
elif i==n-1:
if int(x[i-1])<=int(x[i]):
return ans+int(x[i])
else:
return ans+int(x[i])+1
elif int(x[i-1])<int(x[i]):
ans += (int(x[i])-1)*(9**(n-1-i))
elif x[i-1]==x[i]:
ans += int(x[i])*(9**(n-1-i))
return ans
else:
ans += (int(x[i]))*(9**(n-1-i))
T = int(input())
for _ in range(T):
k = int(input())
M = k*10
s,l = k,M
while True:
m = (s+l)//2
x = neq(str(m))
if x<k:
s=m
elif x>k:
l=m
else:
m=str(m)
while True:
for j in range(0,len(m)-1):
if m[j]==m[j+1]:
if j+2<len(m)-1:
m = str(int(m[:j+2])-1)+'9'*(len(m)-j-2)
else:
m = str(int(m)-1)
break
else:
print(int(m))
break
break
|
ConDefects/ConDefects/Code/arc173_a/Python/53665831
|
condefects-python_data_1547
|
from itertools import accumulate
from bisect import bisect_left
def solve(N):
p = str(N)
M = len(str(N))
dp = [[[0] * 10 for _ in range(2)] for _ in range(M + 1)]
dp[0][0][0] = 1
for i in range(M):
di = int(p[i])
for smaller in range(2):
Lim = 10 if smaller else di + 1
for j in range(10):
for x in range(Lim):
if j == x:
continue
dp[i + 1][smaller | (x < di)][x] += dp[i][smaller][j]
s = sum(dp[M][0]) + sum(dp[M][1])
return s
nines = []
nines_val = []
tmp = 0
for i in range(13):
tmp *= 10
tmp += 9
nines.append(tmp)
nines_val.append(solve(tmp))
cum = list(accumulate(nines_val, initial=0))
def check(p):
idx = bisect_left(nines, p)
res = cum[idx]
res += solve(p)
return res
def solve_Test(K):
l = 1
r = 1 << 60
while r - l > 1:
mid = (l + r) // 2
if check(mid) >= K:
r = mid
else:
l = mid
return r
T = int(input())
ans = []
for _ in range(T):
ans.append(solve_Test(int(input())))
print(*ans, sep="\n")
from itertools import accumulate
from bisect import bisect_left
def solve(N):
p = str(N)
M = len(str(N))
dp = [[[0] * 10 for _ in range(2)] for _ in range(M + 1)]
dp[0][0][0] = 1
for i in range(M):
di = int(p[i])
for smaller in range(2):
Lim = 10 if smaller else di + 1
for j in range(10):
for x in range(Lim):
if j == x:
continue
dp[i + 1][smaller | (x < di)][x] += dp[i][smaller][j]
s = sum(dp[M][0]) + sum(dp[M][1])
return s
nines = []
nines_val = []
tmp = 0
for i in range(13):
tmp *= 10
tmp += 9
nines.append(tmp)
nines_val.append(solve(tmp))
cum = list(accumulate(nines_val, initial=0))
def check(p):
idx = bisect_left(nines, p)
res = cum[idx]
res += solve(p)
return res
def solve_Test(K):
l = 0
r = 1 << 60
while r - l > 1:
mid = (l + r) // 2
if check(mid) >= K:
r = mid
else:
l = mid
return r
T = int(input())
ans = []
for _ in range(T):
ans.append(solve_Test(int(input())))
print(*ans, sep="\n")
|
ConDefects/ConDefects/Code/arc173_a/Python/51750768
|
condefects-python_data_1548
|
n = int(input())
def calc(num):
moji = str(num)
keta = len(moji)
ret = 0
for i in range(keta):
p = int(moji[i])
if i == 0:
d = max(p - 1, 0)
ret = ret + d * 9 ** (keta - i - 1)
else:
d = p + 1
if d-1 > int(moji[i - 1]):
d = d - 1
elif d-1 == int(moji[i - 1]):
ret = ret + (d-1) * 9 ** (keta - i - 1)
for i in range(1, keta):
ret += 9 ** i
return ret
d = max(d - 1, 0)
ret = ret + d * 9 ** (keta - i - 1)
for i in range(1, keta):
ret += 9 ** i
return ret + 1
for _ in range(n):
num = int(input())
l = 0
r = 10 ** 12
md = (l + r) // 2
while l + 1 < r:
ret = calc(md)
if ret >= num:
r = md
else:
l = md
md = (l + r) // 2
print(r)
n = int(input())
def calc(num):
moji = str(num)
keta = len(moji)
ret = 0
for i in range(keta):
p = int(moji[i])
if i == 0:
d = max(p - 1, 0)
ret = ret + d * 9 ** (keta - i - 1)
else:
d = p + 1
if d-1 > int(moji[i - 1]):
d = d - 1
elif d-1 == int(moji[i - 1]):
ret = ret + (d-1) * 9 ** (keta - i - 1)
for i in range(1, keta):
ret += 9 ** i
return ret
d = max(d - 1, 0)
ret = ret + d * 9 ** (keta - i - 1)
for i in range(1, keta):
ret += 9 ** i
return ret + 1
for _ in range(n):
num = int(input())
l = 0
r = 10 ** 16
md = (l + r) // 2
while l + 1 < r:
ret = calc(md)
if ret >= num:
r = md
else:
l = md
md = (l + r) // 2
print(r)
|
ConDefects/ConDefects/Code/arc173_a/Python/53784013
|
condefects-python_data_1549
|
T = int(input())
for _ in range(T):
K = int(input())
left = 1
right = 10**18
while right - left > 1:
mid = (left+right)//2
ans = 0
mid_s = str(mid)
N = len(mid_s)
for i in range(N):
ans += pow(9,i)
ans += (int(mid_s[0])-1)*pow(9,N-1)
bef = int(mid_s[0])
TF = True
for i in range(1,N):
if int(mid_s[i]) > bef:
ans += (int(mid_s[i])-1)*pow(9,N-1-i)
elif int(mid_s[i]) == bef:
ans += int(mid_s[i])*pow(9,N-1-i)-1
TF = False
break
else:
ans += int(mid_s[i])*pow(9,N-1-i)
bef = int(mid_s[i])
if TF and N >= 2 and mid_s[-1] == mid_s[-2]:
ans -= 1
if ans < K:
left = mid
else:
right = mid
print(right)
T = int(input())
for _ in range(T):
K = int(input())
left = 0
right = 10**18
while right - left > 1:
mid = (left+right)//2
ans = 0
mid_s = str(mid)
N = len(mid_s)
for i in range(N):
ans += pow(9,i)
ans += (int(mid_s[0])-1)*pow(9,N-1)
bef = int(mid_s[0])
TF = True
for i in range(1,N):
if int(mid_s[i]) > bef:
ans += (int(mid_s[i])-1)*pow(9,N-1-i)
elif int(mid_s[i]) == bef:
ans += int(mid_s[i])*pow(9,N-1-i)-1
TF = False
break
else:
ans += int(mid_s[i])*pow(9,N-1-i)
bef = int(mid_s[i])
if TF and N >= 2 and mid_s[-1] == mid_s[-2]:
ans -= 1
if ans < K:
left = mid
else:
right = mid
print(right)
|
ConDefects/ConDefects/Code/arc173_a/Python/54010856
|
condefects-python_data_1550
|
import sys, random
input = lambda : sys.stdin.readline().rstrip()
write = lambda x: sys.stdout.write(x+"\n"); writef = lambda x: print("{:.12f}".format(x))
debug = lambda x: sys.stderr.write(x+"\n")
YES="Yes"; NO="No"; pans = lambda v: print(YES if v else NO); INF=10**18
LI = lambda : list(map(int, input().split())); II=lambda : int(input()); SI=lambda : [ord(c)-ord("a") for c in input()]
def debug(_l_):
for s in _l_.split():
print(f"{s}={eval(s)}", end=" ")
print()
def dlist(*l, fill=0):
if len(l)==1:
return [fill]*l[0]
ll = l[1:]
return [dlist(*ll, fill=fill) for _ in range(l[0])]
n,k = list(map(int, input().split()))
s = input()
# s = "RLRRRLLLLLLLLRRRLLRLRRR"*200
# k = 1
# n = len(s)
def main(n,k,s):
# if 1:
if s.count("R")<s.count("L"):
s = "".join([("L" if c=="R" else "R") for c in s])
s = s[::-1]
cum = [0]
vs = []
c = 0
ind = -1
v0 = []
v1 = []
for i in range(n):
if s[i]=="L":
c -= 1
vs.append(-1)
v0.append((c,i))
else:
c += 1
vs.append(1)
v1.append((c,i))
cum.append(c)
if c>0 and ind==-1:
ind = i
v0.sort()
v1.sort()
v0orig = v0[:]
v1orig = v1[:]
val0 = val1 = 0
res0 = res1 = 0
# print(len(v0), len(v1))
for i in range(k):
val = c*(k-i)
while v1 and v1[-1][0]>val:
val1 += 1
v1.pop()
while v0 and v0[-1][0]>=-c*i:
val0 += 1
v0.pop()
res1 += val1
res0 += val0
ans = res0 + res1
# print(ans)
# print(ans)
if ind>=0:
v0 = v0orig[:]
v1 = v1orig[:]
tmp0 = tmp1 = 0
for v,ii in v1:
if c==0:
val = k if v>c*k else 0
else:
val = max(0, min((v-1)//c, k))
if val==k and ii<ind:
val -= 1
tmp1 += val
# for j in range(k):
# val = v + j*c
# if val>c*k and (j>0 or ii>=ind):
# tmp1 += 1
for v,ii in v0:
if c==0:
val = k if v<0 else 0
else:
val = max(0, min((-v+c-1)//c, k))
if val>0 and ii<ind:
val -= 1
tmp0 += val
# for j in range(k):
# val = v + j*c
# if val<0 and (j>0 or ii>=ind):
# tmp0 += 1
ans += tmp0 + tmp1
# tmp = []
# cc = 0
# for i in range(n):
# if vs[i]==1:
# cc += 1
# else:
# cc -= 1
# if (vs[i]==-1 and cc<0) or (vs[i]==1 and cc>c*k):
# tmp.append(1)
# else:
# tmp.append(0)
# if ind>=0:
# ans += sum(tmp[ind:])
# ans += sum(tmp)*(k-1)
M = 998244353
ans %= M
return (ans%M)
def main2(n,k,s):
return main(n*k, 1, s*k)
ans = main(n,k,s)
print(ans)
import sys, random
input = lambda : sys.stdin.readline().rstrip()
write = lambda x: sys.stdout.write(x+"\n"); writef = lambda x: print("{:.12f}".format(x))
debug = lambda x: sys.stderr.write(x+"\n")
YES="Yes"; NO="No"; pans = lambda v: print(YES if v else NO); INF=10**18
LI = lambda : list(map(int, input().split())); II=lambda : int(input()); SI=lambda : [ord(c)-ord("a") for c in input()]
def debug(_l_):
for s in _l_.split():
print(f"{s}={eval(s)}", end=" ")
print()
def dlist(*l, fill=0):
if len(l)==1:
return [fill]*l[0]
ll = l[1:]
return [dlist(*ll, fill=fill) for _ in range(l[0])]
n,k = list(map(int, input().split()))
s = input()
# s = "RLRRRLLLLLLLLRRRLLRLRRR"*200
# k = 1
# n = len(s)
def main(n,k,s):
# if 1:
if s.count("R")<s.count("L"):
s = "".join([("L" if c=="R" else "R") for c in s])
s = s[::-1]
cum = [0]
vs = []
c = 0
ind = -1
v0 = []
v1 = []
for i in range(n):
if s[i]=="L":
c -= 1
vs.append(-1)
v0.append((c,i))
else:
c += 1
vs.append(1)
v1.append((c,i))
cum.append(c)
if c>0 and ind==-1:
ind = i
v0.sort()
v1.sort()
v0orig = v0[:]
v1orig = v1[:]
val0 = val1 = 0
res0 = res1 = 0
# print(len(v0), len(v1))
for i in range(k):
val = c*(k-i)
while v1 and v1[-1][0]>val:
val1 += 1
v1.pop()
while v0 and v0[-1][0]>=-c*i:
val0 += 1
v0.pop()
res1 += val1
res0 += val0
ans = res0 + res1
# print(ans)
# print(ans)
if c>0:
v0 = v0orig[:]
v1 = v1orig[:]
tmp0 = tmp1 = 0
for v,ii in v1:
if c==0:
val = k if v>c*k else 0
else:
val = max(0, min((v-1)//c, k))
if val==k and ii<ind:
val -= 1
tmp1 += val
# for j in range(k):
# val = v + j*c
# if val>c*k and (j>0 or ii>=ind):
# tmp1 += 1
for v,ii in v0:
if c==0:
val = k if v<0 else 0
else:
val = max(0, min((-v+c-1)//c, k))
if val>0 and ii<ind:
val -= 1
tmp0 += val
# for j in range(k):
# val = v + j*c
# if val<0 and (j>0 or ii>=ind):
# tmp0 += 1
ans += tmp0 + tmp1
# tmp = []
# cc = 0
# for i in range(n):
# if vs[i]==1:
# cc += 1
# else:
# cc -= 1
# if (vs[i]==-1 and cc<0) or (vs[i]==1 and cc>c*k):
# tmp.append(1)
# else:
# tmp.append(0)
# if ind>=0:
# ans += sum(tmp[ind:])
# ans += sum(tmp)*(k-1)
M = 998244353
ans %= M
return (ans%M)
def main2(n,k,s):
return main(n*k, 1, s*k)
ans = main(n,k,s)
print(ans)
|
ConDefects/ConDefects/Code/arc150_e/Python/37666166
|
condefects-python_data_1551
|
mod=998244353
inv=pow(100,mod-2,mod)
N,P=map(int,input().split())
dp=[0,1]
for i in range(N-1):
dp.append(1+dp[-1]*(100-P)*inv+dp[-2]*P*inv)
dp[-1]%=mod
print(dp[-1])
print(dp)
mod=998244353
inv=pow(100,mod-2,mod)
N,P=map(int,input().split())
dp=[0,1]
for i in range(N-1):
dp.append(1+dp[-1]*(100-P)*inv+dp[-2]*P*inv)
dp[-1]%=mod
print(dp[-1])
#print(dp)
|
ConDefects/ConDefects/Code/abc280_e/Python/45489025
|
condefects-python_data_1552
|
from functools import lru_cache
S_x = lambda : input()
N_x = lambda : int(input())
N_more = lambda : map(int, input().split())
A_L = lambda : list(map(int, input().split()))
N = N_x()
@lru_cache
def n_split(x):
if x == 1:
return 1
else:
if x % 2 == 0:
return n_split(x//2) + n_split(x//2) + x
else:
return n_split(x//2) + n_split(x//2+1) + x
ans = n_split(N)+N
print(ans)
from functools import lru_cache
S_x = lambda : input()
N_x = lambda : int(input())
N_more = lambda : map(int, input().split())
A_L = lambda : list(map(int, input().split()))
N = N_x()
@lru_cache
def n_split(x):
if x == 1:
return 1
else:
if x % 2 == 0:
return n_split(x//2) + n_split(x//2) + x
else:
return n_split(x//2) + n_split(x//2+1) + x
ans = n_split(N)-N
print(ans)
|
ConDefects/ConDefects/Code/abc340_c/Python/54788831
|
condefects-python_data_1553
|
import math
import functools
n = int(input())
@functools.cache
def calc(m):
if m < 2:
return 0
return m + calc(int(m / 2)) + calc(int((m + 1) / 2))
print(calc(n))
import math
import functools
n = int(input())
@functools.cache
def calc(m):
if m < 2:
return 0
return m + calc(m // 2) + calc((m + 1) // 2)
print(calc(n))
|
ConDefects/ConDefects/Code/abc340_c/Python/54883033
|
condefects-python_data_1554
|
import sys
input = sys.stdin.readline
from functools import lru_cache
@lru_cache(maxsize=None)
def grundy(N,L):
if N<L:
return 0
SET={grundy(N-L,L)}
x=N-L
for i in range(N-L):
SET.add(grundy(i,L)^grundy(x-i,L))
for i in range(10**9):
if i in SET:
pass
else:
return i
N,L,R=map(int,input().split())
flag=0
if N%2==0:
for i in range(L,R+1):
if i%2==0:
print("First",flush=True)
x=(1+N)//2+1-i//2
print(x,i,flush=True)
flag=1
break
while flag==1:
a,b=map(int,input().split())
if a==b==0:
break
if a==b==-1:
break
r=[a,a+b-1]
gyaku=1+N-(a+b-1)
print(gyaku,b,flush=True)
else:
for i in range(L,R+1):
if i%2==1:
print("First",flush=True)
x=(1+N)//2-i//2
print(x,i,flush=True)
flag=1
break
while flag==1:
a,b=map(int,input().split())
if a==b==0:
break
if a==b==-1:
break
r=[a,a+b-1]
gyaku=1+N-(a+b-1)
print(gyaku,b,flush=True)
A=[0]*N
if flag==0:
assert (L==R)
gr=grundy(N,L)
if gr!=0:
print("First",flush=True)
while True:
X=[]
S=[]
now=0
for i in range(N):
if A[i]==0:
if now==0:
S.append(i)
now+=1
else:
if now>0:
X.append(now)
now=0
if now>0:
X.append(now)
XOR=0
for x in X:
XOR^=grundy(x,L)
for i in range(len(X)):
k=XOR^grundy(X[i],L)
if grundy(X[i],L)>k:
ind=i
target_g=k
rest=-1
for i in range(X[ind]):
if grundy(X[ind]-i-L,L)^grundy(i,L)==target_g:
rest=i
break
if rest!=-1:
break
print(S[ind]+rest+1,L,flush=True)
for i in range(S[ind]+rest,S[ind]+rest+L):
A[i]=1
a,b=map(int,input().split())
if a==b==0:
break
if a==b==-1:
break
for i in range(a-1,a+b-1):
A[i]=1
else:
print("Second",flush=True)
while True:
a,b=map(int,input().split())
if a==b==0:
break
if a==b==-1:
break
for i in range(a-1,a+b-1):
A[i]=1
X=[]
S=[]
now=0
for i in range(N):
if A[i]==0:
if now==0:
S.append(i)
now+=1
else:
if now>0:
X.append(now)
now=0
if now>0:
X.append(now)
XOR=0
for x in X:
XOR^=grundy(x,L)
for i in range(len(X)):
k=XOR^grundy(X[i],L)
if grundy(X[i],L)>k:
ind=i
target_g=k
rest=-1
for i in range(X[ind]):
if grundy(X[ind]-i-L,L)^grundy(i,L)==target_g:
rest=i
break
if rest!=-1:
break
print(S[ind]+rest+1,L,flush=True)
for i in range(S[ind]+rest,S[ind]+rest+L):
A[i]=1
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from functools import lru_cache
@lru_cache(maxsize=None)
def grundy(N,L):
if N<L:
return 0
SET={grundy(N-L,L)}
x=N-L
for i in range(N-L):
SET.add(grundy(i,L)^grundy(x-i,L))
for i in range(10**9):
if i in SET:
pass
else:
return i
N,L,R=map(int,input().split())
flag=0
if N%2==0:
for i in range(L,R+1):
if i%2==0:
print("First",flush=True)
x=(1+N)//2+1-i//2
print(x,i,flush=True)
flag=1
break
while flag==1:
a,b=map(int,input().split())
if a==b==0:
break
if a==b==-1:
break
r=[a,a+b-1]
gyaku=1+N-(a+b-1)
print(gyaku,b,flush=True)
else:
for i in range(L,R+1):
if i%2==1:
print("First",flush=True)
x=(1+N)//2-i//2
print(x,i,flush=True)
flag=1
break
while flag==1:
a,b=map(int,input().split())
if a==b==0:
break
if a==b==-1:
break
r=[a,a+b-1]
gyaku=1+N-(a+b-1)
print(gyaku,b,flush=True)
A=[0]*N
if flag==0:
gr=grundy(N,L)
if gr!=0:
print("First",flush=True)
while True:
X=[]
S=[]
now=0
for i in range(N):
if A[i]==0:
if now==0:
S.append(i)
now+=1
else:
if now>0:
X.append(now)
now=0
if now>0:
X.append(now)
XOR=0
for x in X:
XOR^=grundy(x,L)
for i in range(len(X)):
k=XOR^grundy(X[i],L)
if grundy(X[i],L)>k:
ind=i
target_g=k
rest=-1
for i in range(X[ind]):
if grundy(X[ind]-i-L,L)^grundy(i,L)==target_g:
rest=i
break
if rest!=-1:
break
print(S[ind]+rest+1,L,flush=True)
for i in range(S[ind]+rest,S[ind]+rest+L):
A[i]=1
a,b=map(int,input().split())
if a==b==0:
break
if a==b==-1:
break
for i in range(a-1,a+b-1):
A[i]=1
else:
print("Second",flush=True)
while True:
a,b=map(int,input().split())
if a==b==0:
break
if a==b==-1:
break
for i in range(a-1,a+b-1):
A[i]=1
X=[]
S=[]
now=0
for i in range(N):
if A[i]==0:
if now==0:
S.append(i)
now+=1
else:
if now>0:
X.append(now)
now=0
if now>0:
X.append(now)
XOR=0
for x in X:
XOR^=grundy(x,L)
for i in range(len(X)):
k=XOR^grundy(X[i],L)
if grundy(X[i],L)>k:
ind=i
target_g=k
rest=-1
for i in range(X[ind]):
if grundy(X[ind]-i-L,L)^grundy(i,L)==target_g:
rest=i
break
if rest!=-1:
break
print(S[ind]+rest+1,L,flush=True)
for i in range(S[ind]+rest,S[ind]+rest+L):
A[i]=1
|
ConDefects/ConDefects/Code/abc278_g/Python/36887453
|
condefects-python_data_1555
|
def check(arg, case):
if case == 1:
# 平均値をargにできるか
B = [a - arg for a in A]
else:
if arg not in A:
return False
# 中央値をargにできるか
B = [1 if a >= arg else -1 for a in A]
# dp[i][j]:= i番目まで見て、i+1番目を 選ぶ / 選ばない（1 / 0）ときの総和の最大値
dp = [[0] * 2 for _ in range(n + 1)]
for i, b in enumerate(B):
dp[i + 1][0] = dp[i][1]
dp[i + 1][1] = max(dp[i][0], dp[i][1]) + b
return max(dp[-1]) > 0
n = int(input())
A = list(map(int, input().split()))
# 平均値の最大化
ok = 0
ng = 10**10
while abs(ok - ng) > 0.0001:
mid = (ok + ng) / 2
if check(mid, 1):
ok = mid
else:
ng = mid
print(ok)
ok = 0
ng = 10**16
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if check(mid, 2):
ok = mid
else:
ng = mid
print(ok)
def check(arg, case):
if case == 1:
# 平均値をargにできるか
B = [a - arg for a in A]
else:
# 中央値をargにできるか
B = [1 if a >= arg else -1 for a in A]
# dp[i][j]:= i番目まで見て、i+1番目を 選ぶ / 選ばない（1 / 0）ときの総和の最大値
dp = [[0] * 2 for _ in range(n + 1)]
for i, b in enumerate(B):
dp[i + 1][0] = dp[i][1]
dp[i + 1][1] = max(dp[i][0], dp[i][1]) + b
return max(dp[-1]) > 0
n = int(input())
A = list(map(int, input().split()))
# 平均値の最大化
ok = 0
ng = 10**10
while abs(ok - ng) > 0.0001:
mid = (ok + ng) / 2
if check(mid, 1):
ok = mid
else:
ng = mid
print(ok)
ok = 0
ng = 10**16
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if check(mid, 2):
ok = mid
else:
ng = mid
print(ok)
|
ConDefects/ConDefects/Code/abc236_e/Python/45576293
|
condefects-python_data_1556
|
from time import time
st_time = time()
N = int(input())
A = list(map(int,input().split()))
def calc_divs(n):
divs = set()
m = 1
while m*m <= n:
if n%m==0:
divs.add(m)
divs.add(n//m)
m += 1
return divs
from collections import Counter
end = set()
from random import sample
while time() - st_time < 1.8:
i,j = sample(range(N), 2)
n = abs(A[i]-A[j])
if n in end: continue
end.add(n)
for d in calc_divs(n):
if d <= 2: continue
c = Counter([a%d for a in A])
v = c.most_common()[0][1]
if v+v >= N:
exit(print(d))
print(-1)
from time import time
st_time = time()
N = int(input())
A = list(map(int,input().split()))
def calc_divs(n):
divs = set()
m = 1
while m*m <= n:
if n%m==0:
divs.add(m)
divs.add(n//m)
m += 1
return divs
from collections import Counter
end = set()
from random import sample
while time() - st_time < 1.8:
i,j = sample(range(N), 2)
n = abs(A[i]-A[j])
if n in end: continue
end.add(n)
for d in calc_divs(n):
if d <= 2: continue
c = Counter([a%d for a in A])
v = c.most_common()[0][1]
if v+v > N:
exit(print(d))
print(-1)
|
ConDefects/ConDefects/Code/abc272_g/Python/48246740
|
condefects-python_data_1557
|
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append(i)
if temp!=1:
arr.append(temp)
if arr==[]:
arr.append(n)
return arr
N = int(input())
n = N // 2 + 1
A = list(map(int,input().split()))
M = -1
for i in range(N):
d = abs(A[i] - A[(i+1)%N])
P = factorization(d)
for p in P:
if p == 2:
x = 4
if d % 4 != 0:
continue
else:
x = p
r = A[i] % x
s = 0
for a in A:
if a % x == r:
s += 1
if s >= n:
M = x
print(M)
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append(i)
if temp!=1:
arr.append(temp)
if arr==[]:
arr.append(n)
return arr
N = int(input())
n = N // 2 + 1
A = list(map(int,input().split()))
M = -1
for i in range(N):
d = abs(A[i] - A[(i+1)%N])
if d == 1:
continue
P = factorization(d)
for p in P:
if p == 2:
x = 4
if d % 4 != 0:
continue
else:
x = p
r = A[i] % x
s = 0
for a in A:
if a % x == r:
s += 1
if s >= n:
M = x
print(M)
|
ConDefects/ConDefects/Code/abc272_g/Python/48872899
|
condefects-python_data_1558
|
import math
from heapq import heapify, heappop, heappush
# import bisect
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
def ipt(num=0):
if num==1:return input().rstrip()
return list(map(int, input().split()))
mod = 998244353
# d = [[0]*s2 for t in range(s1)]
# for i in range():
n=ipt()[0]
a=ipt()
h=(n+1)//2
import random
for i in range(30):
s=random.randint(0,n-1)
t=random.randint(0,n-1)
u=abs(a[s]-a[t])
x=1
while x*x<=u:
if u%x==0:
c=0
if x>=3:
for t in range(n):
if abs(a[s]-a[t])%x==0:
c+=1
if c>=h:print(x);exit()
c=0
if u//x>=3:
d=u//x
for t in range(n):
if abs(a[s]-a[t])%d==0:
c+=1
if c>=h:print(d);exit()
x+=1
print(-1)
import math
from heapq import heapify, heappop, heappush
# import bisect
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
def ipt(num=0):
if num==1:return input().rstrip()
return list(map(int, input().split()))
mod = 998244353
# d = [[0]*s2 for t in range(s1)]
# for i in range():
n=ipt()[0]
a=ipt()
h=(n+2)//2
import random
for i in range(30):
s=random.randint(0,n-1)
t=random.randint(0,n-1)
u=abs(a[s]-a[t])
x=1
while x*x<=u:
if u%x==0:
c=0
if x>=3:
for t in range(n):
if abs(a[s]-a[t])%x==0:
c+=1
if c>=h:print(x);exit()
c=0
if u//x>=3:
d=u//x
for t in range(n):
if abs(a[s]-a[t])%d==0:
c+=1
if c>=h:print(d);exit()
x+=1
print(-1)
|
ConDefects/ConDefects/Code/abc272_g/Python/47192828
|
condefects-python_data_1559
|
def Divisors(N):
divisors=[]
for i in range(1,N+1):
if i**2>=N:
break
elif N%i==0:
divisors.append(i)
if i**2==N:
divisors+=[i]+[N//i for i in divisors[::-1]]
else:
divisors+=[N//i for i in divisors[::-1]]
return divisors
import random
N=int(input())
A=list(map(int,input().split()))
ans=-1
for _ in range(100):
i=random.randint(0,N-1)
j=random.randint(0,N-1)
if i==j:
continue
for M in Divisors(abs(A[i]-A[j])):
if M<=2:
continue
B=[a%M for a in A]
B.sort()
bound=[0]
for i in range(1,N):
if B[i-1]!=B[i]:
bound.append(i)
bound.append(N)
for l,r in zip(bound,bound[1:]):
if (r-l)*2>=N:
ans=M
if ans!=-1:
break
print(ans)
def Divisors(N):
divisors=[]
for i in range(1,N+1):
if i**2>=N:
break
elif N%i==0:
divisors.append(i)
if i**2==N:
divisors+=[i]+[N//i for i in divisors[::-1]]
else:
divisors+=[N//i for i in divisors[::-1]]
return divisors
import random
N=int(input())
A=list(map(int,input().split()))
ans=-1
for _ in range(100):
i=random.randint(0,N-1)
j=random.randint(0,N-1)
if i==j:
continue
for M in Divisors(abs(A[i]-A[j])):
if M<=2:
continue
B=[a%M for a in A]
B.sort()
bound=[0]
for i in range(1,N):
if B[i-1]!=B[i]:
bound.append(i)
bound.append(N)
for l,r in zip(bound,bound[1:]):
if (r-l)*2>N:
ans=M
if ans!=-1:
break
print(ans)
|
ConDefects/ConDefects/Code/abc272_g/Python/54704821
|
condefects-python_data_1560
|
import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
def gcd(a, b):
while a:
a, b = b%a, a
return b
def is_prime(n):
if n == 2:
return 1
if n == 1 or n%2 == 0:
return 0
m = n - 1
lsb = m & -m
s = lsb.bit_length()-1
d = m // lsb
test_numbers = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]
for a in test_numbers:
if a == n:
continue
x = pow(a,d,n)
r = 0
if x == 1:
continue
while x != m:
x = pow(x,2,n)
r += 1
if x == 1 or r == s:
return 0
return 1
def find_prime_factor(n):
if n%2 == 0:
return 2
m = int(n**0.125)+1
for c in range(1,n):
f = lambda a: (pow(a,2,n)+c)%n
y = 0
g = q = r = 1
k = 0
while g == 1:
x = y
while k < 3*r//4:
y = f(y)
k += 1
while k < r and g == 1:
ys = y
for _ in range(min(m, r-k)):
y = f(y)
q = q*abs(x-y)%n
g = gcd(q,n)
k += m
k = r
r *= 2
if g == n:
g = 1
y = ys
while g == 1:
y = f(y)
g = gcd(abs(x-y),n)
if g == n:
continue
if is_prime(g):
return g
elif is_prime(n//g):
return n//g
else:
return find_prime_factor(g)
def factorize(n):
res = {}
while not is_prime(n) and n > 1: # nが合成数である間nの素因数の探索を繰り返す
p = find_prime_factor(n)
s = 0
while n%p == 0: # nが素因数pで割れる間割り続け、出力に追加
n //= p
s += 1
res[p] = s
if n > 1: # n>1であればnは素数なので出力に追加
res[n] = 1
return res
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
#input = sys.stdin.readline
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
n = int(input())
m = n//2 + (n%2)
alist = list(map(int,input().split()))
t = time.time()
s = set([2,1])
while time.time() - t < 1.75:
i,j = random.randint(0,n-1),random.randint(0,n-1)
if i == j:
continue
z = abs(alist[i] - alist[j])
for x in make_divisors(z):
if x in s:
continue
s.add(x)
if max(collections.Counter([alist[l]%x for l in range(n)]).values()) >= m:
if 3 <= x <= 10**9:
print(x)
exit()
print(-1)
import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
def gcd(a, b):
while a:
a, b = b%a, a
return b
def is_prime(n):
if n == 2:
return 1
if n == 1 or n%2 == 0:
return 0
m = n - 1
lsb = m & -m
s = lsb.bit_length()-1
d = m // lsb
test_numbers = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]
for a in test_numbers:
if a == n:
continue
x = pow(a,d,n)
r = 0
if x == 1:
continue
while x != m:
x = pow(x,2,n)
r += 1
if x == 1 or r == s:
return 0
return 1
def find_prime_factor(n):
if n%2 == 0:
return 2
m = int(n**0.125)+1
for c in range(1,n):
f = lambda a: (pow(a,2,n)+c)%n
y = 0
g = q = r = 1
k = 0
while g == 1:
x = y
while k < 3*r//4:
y = f(y)
k += 1
while k < r and g == 1:
ys = y
for _ in range(min(m, r-k)):
y = f(y)
q = q*abs(x-y)%n
g = gcd(q,n)
k += m
k = r
r *= 2
if g == n:
g = 1
y = ys
while g == 1:
y = f(y)
g = gcd(abs(x-y),n)
if g == n:
continue
if is_prime(g):
return g
elif is_prime(n//g):
return n//g
else:
return find_prime_factor(g)
def factorize(n):
res = {}
while not is_prime(n) and n > 1: # nが合成数である間nの素因数の探索を繰り返す
p = find_prime_factor(n)
s = 0
while n%p == 0: # nが素因数pで割れる間割り続け、出力に追加
n //= p
s += 1
res[p] = s
if n > 1: # n>1であればnは素数なので出力に追加
res[n] = 1
return res
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
#input = sys.stdin.readline
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
n = int(input())
m = n//2 + 1
alist = list(map(int,input().split()))
t = time.time()
s = set([2,1])
while time.time() - t < 1.75:
i,j = random.randint(0,n-1),random.randint(0,n-1)
if i == j:
continue
z = abs(alist[i] - alist[j])
for x in make_divisors(z):
if x in s:
continue
s.add(x)
if max(collections.Counter([alist[l]%x for l in range(n)]).values()) >= m:
if 3 <= x <= 10**9:
print(x)
exit()
print(-1)
|
ConDefects/ConDefects/Code/abc272_g/Python/53473806
|
condefects-python_data_1561
|
import math
import random
from collections import Counter
from sys import stdin
class FastIO:
def __init__(self):
self.random_seed = 0
self.flush = False
self.inf = 1 << 32
return
@staticmethod
def read_int():
return int(stdin.readline().rstrip())
@staticmethod
def read_float():
return float(stdin.readline().rstrip())
@staticmethod
def read_list_ints():
return list(map(int, stdin.readline().rstrip().split()))
@staticmethod
def read_list_ints_minus_one():
return list(map(lambda x: int(x) - 1, stdin.readline().rstrip().split()))
@staticmethod
def read_str():
return stdin.readline().rstrip()
@staticmethod
def read_list_strs():
return stdin.readline().rstrip().split()
def get_random_seed(self):
import random
self.random_seed = random.randint(0, 10 ** 9 + 7)
return
def st(self, x):
return print(x, flush=self.flush)
def lst(self, x):
return print(*x, flush=self.flush)
def flatten(self, lst):
self.st("\n".join(str(x) for x in lst))
return
@staticmethod
def max(a, b):
return a if a > b else b
@staticmethod
def min(a, b):
return a if a < b else b
@staticmethod
def ceil(a, b):
return a // b + int(a % b != 0)
@staticmethod
def accumulate(nums):
n = len(nums)
pre = [0] * (n + 1)
for i in range(n):
pre[i + 1] = pre[i] + nums[i]
return pre
class NumFactor:
def __init__(self):
return
@staticmethod
def get_all_factor(num): # faster when 1 <= num <= 10**6!
"""Obtain all factors of an integer, including 1 and itself"""
assert num >= 1
factor = set()
for i in range(1, int(math.sqrt(num)) + 1):
if num % i == 0:
factor.add(i)
factor.add(num // i)
return sorted(list(factor))
class Solution:
def __init__(self):
return
@staticmethod
def main(ac=FastIO()):
"""
url: https://atcoder.jp/contests/abc272/tasks/abc272_g
tag: random_guess|brute_force|num_factor|classical
"""
n = ac.read_int()
nums = ac.read_list_ints()
ceil = 10 ** 9
nf = NumFactor()
for _ in range(10):
i, j = random.randint(0, n - 1), random.randint(0, n - 1)
while i == j:
j = random.randint(0, n - 1)
lst = nf.get_all_factor(abs(nums[i] - nums[j]))
for m in lst:
if 3 <= m <= ceil:
cur = [num % m for num in nums]
if max(Counter(cur).values()) * 2 > n:
ac.st(m)
return
ac.st(-1)
return
Solution().main()
import math
import random
from collections import Counter
from sys import stdin
class FastIO:
def __init__(self):
self.random_seed = 0
self.flush = False
self.inf = 1 << 32
return
@staticmethod
def read_int():
return int(stdin.readline().rstrip())
@staticmethod
def read_float():
return float(stdin.readline().rstrip())
@staticmethod
def read_list_ints():
return list(map(int, stdin.readline().rstrip().split()))
@staticmethod
def read_list_ints_minus_one():
return list(map(lambda x: int(x) - 1, stdin.readline().rstrip().split()))
@staticmethod
def read_str():
return stdin.readline().rstrip()
@staticmethod
def read_list_strs():
return stdin.readline().rstrip().split()
def get_random_seed(self):
import random
self.random_seed = random.randint(0, 10 ** 9 + 7)
return
def st(self, x):
return print(x, flush=self.flush)
def lst(self, x):
return print(*x, flush=self.flush)
def flatten(self, lst):
self.st("\n".join(str(x) for x in lst))
return
@staticmethod
def max(a, b):
return a if a > b else b
@staticmethod
def min(a, b):
return a if a < b else b
@staticmethod
def ceil(a, b):
return a // b + int(a % b != 0)
@staticmethod
def accumulate(nums):
n = len(nums)
pre = [0] * (n + 1)
for i in range(n):
pre[i + 1] = pre[i] + nums[i]
return pre
class NumFactor:
def __init__(self):
return
@staticmethod
def get_all_factor(num): # faster when 1 <= num <= 10**6!
"""Obtain all factors of an integer, including 1 and itself"""
assert num >= 1
factor = set()
for i in range(1, int(math.sqrt(num)) + 1):
if num % i == 0:
factor.add(i)
factor.add(num // i)
return sorted(list(factor))
class Solution:
def __init__(self):
return
@staticmethod
def main(ac=FastIO()):
"""
url: https://atcoder.jp/contests/abc272/tasks/abc272_g
tag: random_guess|brute_force|num_factor|classical
"""
n = ac.read_int()
nums = ac.read_list_ints()
ceil = 10 ** 9
nf = NumFactor()
for _ in range(100):
i, j = random.randint(0, n - 1), random.randint(0, n - 1)
while i == j:
j = random.randint(0, n - 1)
lst = nf.get_all_factor(abs(nums[i] - nums[j]))
for m in lst:
if 3 <= m <= ceil:
cur = [num % m for num in nums]
if max(Counter(cur).values()) * 2 > n:
ac.st(m)
return
ac.st(-1)
return
Solution().main()
|
ConDefects/ConDefects/Code/abc272_g/Python/52009362
|
condefects-python_data_1562
|
P=[1]*10**6
for i in range(2,10**6):
if P[i]:
for j in range(i+i,10**6,i):
P[j]=0
P=[i for i in range(2,10**6) if P[i]]
n=int(input())
a=list(map(int,input().split()))
from random import randint
for _ in range(500):
i=randint(0,n-1)
j=randint(0,n-2)
j+=j<=i
A=abs(a[i]-a[j])
p=[]
for v in P:
if v*v>A:
break
if A%v==0:
if v==2:
if A%4==0:
p+=[4]
else:
p+=[v]
while A%v==0:
A//=v
if A>2:
p+=[A]
for m in p:
x=-1
y=1
for v in a:
if x==v%m:
y+=1
else:
y-=1
if y==0:
x=v%m
y=1
if sum(v%m==x for v in a)*2>n:
print(m)
exit()
print(-1)
P=[1]*10**6
for i in range(2,10**6):
if P[i]:
for j in range(i+i,10**6,i):
P[j]=0
P=[i for i in range(2,10**6) if P[i]]
n=int(input())
a=list(map(int,input().split()))
from random import randint
for _ in range(500):
i=randint(0,n-1)
j=randint(0,n-2)
j+=i<=j
A=abs(a[i]-a[j])
p=[]
for v in P:
if v*v>A:
break
if A%v==0:
if v==2:
if A%4==0:
p+=[4]
else:
p+=[v]
while A%v==0:
A//=v
if A>2:
p+=[A]
for m in p:
x=-1
y=1
for v in a:
if x==v%m:
y+=1
else:
y-=1
if y==0:
x=v%m
y=1
if sum(v%m==x for v in a)*2>n:
print(m)
exit()
print(-1)
|
ConDefects/ConDefects/Code/abc272_g/Python/48974864
|
condefects-python_data_1563
|
from math import gcd
k = int(input())
for i in range(2, 1000001):
d = gcd(k, i)
if d > 1:
k //= d
if k == 1:
print(i)
exit()
print(k)
from math import gcd
k = int(input())
for i in range(2, 2000001):
d = gcd(k, i)
if d > 1:
k //= d
if k == 1:
print(i)
exit()
print(k)
|
ConDefects/ConDefects/Code/abc280_d/Python/46198307
|
condefects-python_data_1564
|
import math
k=int(input())
for i in range(2,10**6+2):
k//=math.gcd(k,i)
if k==1:
print(i)
exit()
print(k)
import math
k=int(input())
for i in range(2,5*10**6):
k//=math.gcd(k,i)
if k==1:
print(i)
exit()
print(k)
|
ConDefects/ConDefects/Code/abc280_d/Python/45204785
|
condefects-python_data_1565
|
n=int(input())
f=[]
y=n
for i in range(2,int(y**0.5)+1):
while n%i==0:
f.append(i)
n//=i
if n!=1:
f.append(n)
if max(f)>int(y**0.5)+1:
print(y)
else:
import math
x=2
while True:
y//=math.gcd(y,x)
if y==1:
print(x)
exit()
else:
x+=1
n=int(input())
f=[]
y=n
for i in range(2,int(y**0.5)+1):
while n%i==0:
f.append(i)
n//=i
if n!=1:
f.append(n)
if max(f)>int(y**0.5)+1:
print(max(f))
else:
import math
x=2
while True:
y//=math.gcd(y,x)
if y==1:
print(x)
exit()
else:
x+=1
|
ConDefects/ConDefects/Code/abc280_d/Python/46193678
|
condefects-python_data_1566
|
import math
K = int(input())
for i in range(2,10**6):
tmp=math.gcd(K,i)
if tmp!=1:
K//=tmp
if K==1:
print(i)
exit()
print(K)
import math
K = int(input())
for i in range(2,(10**6)*5):
tmp=math.gcd(K,i)
if tmp!=1:
K//=tmp
if K==1:
print(i)
exit()
print(K)
|
ConDefects/ConDefects/Code/abc280_d/Python/46199363
|
condefects-python_data_1567
|
n,m=map(int,input().split())
if not m:
if n&1:
print('Takahashi')
else:
print('Aoki')
exit()
xy = [tuple(map(int,input().split())) for _ in range(m)]
g = (xy[0][0]-1)^(n-xy[-1][0])
for i in range(m-1):
x1,y1 = xy[i]
x2,y2 = xy[i+1]
d = x2-x1-1
if d==0:
continue
g^=y1^y2
if g:
print('Takahashi')
else:
print('Aoki')
n,m=map(int,input().split())
if not m:
if n&1:
print('Takahashi')
else:
print('Aoki')
exit()
xy = [tuple(map(int,input().split())) for _ in range(m)]
g = (xy[0][0]-1)^(n-xy[-1][0])
for i in range(m-1):
x1,y1 = xy[i]
x2,y2 = xy[i+1]
d = x2-x1-1
if d==0:
continue
g^=y1^y2^1
if g:
print('Takahashi')
else:
print('Aoki')
|
ConDefects/ConDefects/Code/arc151_c/Python/43507594
|
condefects-python_data_1568
|
N, M = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(M)]
if M == 0:
print('Takahashi' if N % 2 else 'Aoki')
exit()
state = 0
for i in range(M-1):
a, b = A[i]
c, d = A[i+1]
state ^= ((c-a-1) % 2) ^ b ^ d
state ^= A[0][0]-1
state ^= N-A[-1][0]
print('Takahashi' if state else 'Aoki')
N, M = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(M)]
if M == 0:
print('Takahashi' if N % 2 else 'Aoki')
exit()
state = 0
for i in range(M-1):
a, b = A[i]
c, d = A[i+1]
state ^= b ^ d ^ 1
state ^= A[0][0]-1
state ^= N-A[-1][0]
print('Takahashi' if state else 'Aoki')
|
ConDefects/ConDefects/Code/arc151_c/Python/38957887
|
condefects-python_data_1569
|
n,m = map(int,input().split())
if m == 0:
print("Takahashi" if n % 2 else "Aoki")
exit()
li = [list(map(int,input().split())) for _ in range(m)]
sg = (n - li[-1][0])^(li[0][1] - 1)
for i in range(m - 1):
sg ^= int(li[i + 1][1] == li[i][1])
print('Takahashi' if sg else 'Aoki')
n,m = map(int,input().split())
if m == 0:
print("Takahashi" if n % 2 else "Aoki")
exit()
li = [list(map(int,input().split())) for _ in range(m)]
sg = (n - li[-1][0])^(li[0][0] - 1)
for i in range(m - 1):
sg ^= int(li[i + 1][1] == li[i][1])
print('Takahashi' if sg else 'Aoki')
|
ConDefects/ConDefects/Code/arc151_c/Python/40405027
|
condefects-python_data_1570
|
n, m = map(int, input().split())
before_x = -1
before_y = -1
grundy = 0
for _ in range(m):
x, y = map(int, input().split())
if before_x == -1:
grundy ^= x - 1
else:
grundy ^= (x - before_x + 1 - (before_y ^ y)) % 2
before_x, before_y = x, y
if before_x == -1:
grundy ^= n % 2
else:
grundy ^= n - before_x
if grundy:
print("Takahashi")
else:
print("Aoki")
n, m = map(int, input().split())
before_x = -1
before_y = -1
grundy = 0
for _ in range(m):
x, y = map(int, input().split())
if before_x == -1:
grundy ^= x - 1
else:
grundy ^= (before_y ^ y + 1) % 2
before_x, before_y = x, y
if before_x == -1:
grundy ^= n % 2
else:
grundy ^= n - before_x
if grundy:
print("Takahashi")
else:
print("Aoki")
|
ConDefects/ConDefects/Code/arc151_c/Python/36321896
|
condefects-python_data_1571
|
import sys
read = sys.stdin.buffer.read
N,M,*XY = map(int,read().split())
if M==0 :
if N % 2 == 1:
g = 1
else:
g = 0
else:
it = iter(XY)
XY = [[xi,yi] for xi,yi in zip(it,it)]
g = 0
if XY[0][0] != 1:
g ^= XY[0][0] - 1
if XY[-1][0] != 1:
g ^= N - XY[-1][0]
for i in range(M-1):
xi,yi = XY[i]
xj,yj = XY[i+1]
if yi == yj and xj-xi > 1:
g ^= 1
if g == 0:
print('Aoki')
else:
print('Takahashi')
import sys
read = sys.stdin.buffer.read
N,M,*XY = map(int,read().split())
if M==0 :
if N % 2 == 1:
g = 1
else:
g = 0
else:
it = iter(XY)
XY = [[xi,yi] for xi,yi in zip(it,it)]
g = 0
if XY[0][0] != 1:
g ^= XY[0][0] - 1
if XY[-1][0] != N:
g ^= N - XY[-1][0]
for i in range(M-1):
xi,yi = XY[i]
xj,yj = XY[i+1]
if yi == yj and xj-xi > 1:
g ^= 1
if g == 0:
print('Aoki')
else:
print('Takahashi')
|
ConDefects/ConDefects/Code/arc151_c/Python/41930310
|
condefects-python_data_1572
|
import bisect, collections, copy, heapq, itertools, math, sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
# P = 10**9+7
P = 998244353
N, M = map(int, input().split())
S = list(list(map(int, input().split())) for _ in range(M))
ans = 0
if M == 0:
ans ^= N%2
if M > 0:
ans ^= S[0][0]-1
ans ^= N-S[-1][0]
for i in range(M-1):
if S[i][0]+1 == S[i+1][0]:
continue
if S[i][1] == S[i+1][1]:
continue
else:
ans ^= 1
if ans != 0:
print("Takahashi")
else:
print("Aoki")
import bisect, collections, copy, heapq, itertools, math, sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
# P = 10**9+7
P = 998244353
N, M = map(int, input().split())
S = list(list(map(int, input().split())) for _ in range(M))
ans = 0
if M == 0:
ans ^= N%2
if M > 0:
ans ^= S[0][0]-1
ans ^= N-S[-1][0]
for i in range(M-1):
if S[i][0]+1 == S[i+1][0]:
continue
if S[i][1] == S[i+1][1]:
ans ^= 1
if ans != 0:
print("Takahashi")
else:
print("Aoki")
|
ConDefects/ConDefects/Code/arc151_c/Python/38433732
|
condefects-python_data_1573
|
from sys import stdin
n,m = map(int,input().split())
l = []
for i in range(m):
x,y = map(int,stdin.readline().split())
l.append([x-1,y])
l.sort()
if m == 0:
ans = n % 2
else:
ans = l[0][0] ^ (n - l[-1][0] - 1)
for i in range(1,len(l) - 1):
if l[i][1] == l[i-1][1]:
ans ^= 1
if ans != 0:
print("Takahashi")
else:
print("Aoki")
from sys import stdin
n,m = map(int,input().split())
l = []
for i in range(m):
x,y = map(int,stdin.readline().split())
l.append([x-1,y])
l.sort()
if m == 0:
ans = n % 2
else:
ans = l[0][0] ^ (n - l[-1][0] - 1)
for i in range(1,len(l)):
if l[i][1] == l[i-1][1]:
ans ^= 1
if ans != 0:
print("Takahashi")
else:
print("Aoki")
|
ConDefects/ConDefects/Code/arc151_c/Python/37458250
|
condefects-python_data_1574
|
n,m = map(int,input().split())
xy = [list(map(int,input().split())) for i in range(m)]
g = 0
if m == 0:
if n%2:
print("Takahashi")
else:
print("Aoki")
exit()
for i in range(m+1):
if i == 0:
x,y = xy[i]
g ^= x-1
elif i == m:
x,y = xy[i-1]
g ^= n-x
else:
x,y = xy[i]
px,py = xy[i-1]
if y != py:
continue
g ^= x-px-2
if g:
print("Takahashi")
else:
print("Aoki")
n,m = map(int,input().split())
xy = [list(map(int,input().split())) for i in range(m)]
g = 0
if m == 0:
if n%2:
print("Takahashi")
else:
print("Aoki")
exit()
for i in range(m+1):
if i == 0:
x,y = xy[i]
g ^= x-1
elif i == m:
x,y = xy[i-1]
g ^= n-x
else:
x,y = xy[i]
px,py = xy[i-1]
if y != py:
continue
g ^= 1
if g:
print("Takahashi")
else:
print("Aoki")
|
ConDefects/ConDefects/Code/arc151_c/Python/36785462
|
condefects-python_data_1575
|
def solve(N):
if N == 1:
return [1]
if N == 2:
return None
ans = [2]
used = set([3, 6])
for _ in range(N - 3):
for v in list(used):
if v + 1 not in used and v * (v + 1) not in used:
used.discard(v)
used.add(v + 1)
used.add(v * v + v)
break
return [2] + list(used)
def main():
T = int(input())
for t in range(T):
N = int(input())
ans = solve(N)
if ans is None:
print("No")
else:
print("Yes")
print(*ans)
main()
def solve(N):
if N == 1:
return [1]
if N == 2:
return None
ans = [2]
used = set([3, 6])
for _ in range(N - 3):
for v in list(used):
if v + 1 not in used and v * (v + 1) not in used and v * (v + 1) <= 10**9:
used.discard(v)
used.add(v + 1)
used.add(v * v + v)
break
return [2] + list(used)
def main():
T = int(input())
for t in range(T):
N = int(input())
ans = solve(N)
if ans is None:
print("No")
else:
print("Yes")
print(*ans)
main()
|
ConDefects/ConDefects/Code/arc163_c/Python/45533123
|
condefects-python_data_1576
|
from sys import stdin
from collections import deque
T = int(stdin.readline())
for tc in range(T):
n = int(stdin.readline())
if n == 1:
print('Yes')
print(1)
elif n == 2:
print('No')
st = {2,3,6}
a = deque([2,3,6])
fin = []
while len(a) + len(fin) < n:
cur = a.popleft()
if (cur+1 in st) or (cur*(cur+1) in st) or (cur*(cur+1) > 1000000000):
fin.append(cur)
st.remove(cur)
continue
a.append(cur+1)
a.append(cur*(cur+1))
st.add(cur+1)
st.add(cur*(cur+1))
ans = fin + list(a)
print('Yes')
for i in ans:
print(i, end=' ')
print()
from sys import stdin
from collections import deque
T = int(stdin.readline())
for tc in range(T):
n = int(stdin.readline())
if n == 1:
print('Yes')
print(1)
continue
elif n == 2:
print('No')
continue
st = {2,3,6}
a = deque([2,3,6])
fin = []
while len(a) + len(fin) < n:
cur = a.popleft()
if (cur+1 in st) or (cur*(cur+1) in st) or (cur*(cur+1) > 1000000000):
fin.append(cur)
st.remove(cur)
continue
a.append(cur+1)
a.append(cur*(cur+1))
st.add(cur+1)
st.add(cur*(cur+1))
ans = fin + list(a)
print('Yes')
for i in ans:
print(i, end=' ')
print()
|
ConDefects/ConDefects/Code/arc163_c/Python/43286713
|
condefects-python_data_1577
|
# coding: utf-8
from random import randint
from functools import partial
import sys
try:
dummy = src
rl = partial(src.pop, 0)
except NameError:
rl = sys.stdin.readline
def ints():
return list(map(int, rl().rstrip().split(' ')))
def int1():
return int(rl().rstrip())
#@psecs
def main():
n, m = ints()
aa = ints()
# print(locals())
if False:
n = 2 * 10 ** 5
m = randint(1, n)
aa = [randint(-2 * 10 ** 5, 2 * 10 ** 5) for _ in range(n)]
bb = [0] * n
s = 0
for i in range(n):
s += aa[i]
bb[i] = s
sm_max = 0
for i in range(n - m + 1):
# pr('i')
if i == 0:
sm = sum(a * b for a, b in zip(aa[i: i+m], range(1, m+1)))
else:
sm = sm - aa[i-1] + m * aa[i+m-1] - (bb[i+m-2] - bb[i-1])
# pr('sm')
if sm_max < sm:
sm_max = sm
print(sm_max)
if __name__ == '__main__':
main()
# coding: utf-8
from random import randint
from functools import partial
import sys
try:
dummy = src
rl = partial(src.pop, 0)
except NameError:
rl = sys.stdin.readline
def ints():
return list(map(int, rl().rstrip().split(' ')))
def int1():
return int(rl().rstrip())
#@psecs
def main():
n, m = ints()
aa = ints()
# print(locals())
if False:
n = 2 * 10 ** 5
m = randint(1, n)
aa = [randint(-2 * 10 ** 5, 2 * 10 ** 5) for _ in range(n)]
bb = [0] * n
s = 0
for i in range(n):
s += aa[i]
bb[i] = s
sm_max = float('-inf')
for i in range(n - m + 1):
# pr('i')
if i == 0:
sm = sum(a * b for a, b in zip(aa[i: i+m], range(1, m+1)))
else:
sm = sm - aa[i-1] + m * aa[i+m-1] - (bb[i+m-2] - bb[i-1])
# pr('sm')
if sm_max < sm:
sm_max = sm
print(sm_max)
if __name__ == '__main__':
main()
|
ConDefects/ConDefects/Code/abc267_c/Python/45068144
|
condefects-python_data_1578
|
# Python3/Pypy3テンプレート集
#ライブラリ-------------------------------------------------------------------
from bisect import *
import heapq
import collections
from collections import deque
from queue import Queue
from itertools import groupby
import itertools
import math
import array
import string
import copy
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from functools import reduce
from operator import and_, or_, xor
#便利スクリプト---------------------------------------------------------------
INF = 10**20
mod = 998244353
MOD = 10**9+7
def YesNo(b): print("Yes") if b else print("No")
def YESNO(b): print("YES") if b else print("NO")
#標準入力---------------------------------------------------------------------
import sys
sys.setrecursionlimit(10 ** 5 + 10000)
input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LIS(): return list(map(int, SI()))
def LA(f): return list(map(f, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return input().strip('\n')
def MS(): return input().split()
def LS(): return list(input().strip('\n'))
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def LMS(rows_number): return [MS() for _ in range(rows_number)]
#関数------------------------------------------------------------------------
###標準ライブラリ###
def ceil(a,b): #切り捨て
return (a+b-1)//b
def inv(a,p): #aのpを法とする逆元(aとpは互いに素)
return pow(a,p-2,p)%p
def transpose(A): #二次元配列の転置
A_t = []
for i in range(len(A[0])) :
tmp = []
for v in A :
tmp.append(v[i])
A_t.append(tmp)
return A_t
def rotate_matrix(A): #グリッドを時計回りに90度回転
return transpose(A[::-1])
def removeDuplicates_2D(A): #二次元配列の重複削除
return list(map(list, set(map(tuple, A))))
def convert(S,c): # グリッドをの 黒 マスの点集合に変換する | S: グリッド c:黒マスがなにか(ex #,1)
s = set()
h = len(S)
w = len(S[0])
for i in range(h):
for j in range(w):
if S[i][j] == c:
s.add((i, j))
return s
def normalize(s): # グリッドの # マスの点集合を与えると最小の x 座標と最小の y 座標がともに 0 となるように平行移動して返す
mi = min(i for (i, j) in s)
mj = min(j for (i, j) in s)
return set((i - mi, j - mj) for (i, j) in s)
def cumulativeSum_1D(A): #配列Aの累積和
return list(itertools.accumulate(A))
def cumulativeSum_2D(S): #二次元配列Sの累積和 => 二次元リスト
h = len(S)
w = len(S[0])
CS = [[0 for _ in range(w)]for _ in range(h)]
CCS = [[0 for _ in range(w)]for _ in range(h)]
for i in range(h):
for j in range(w):
if(j==0):
CS[i][0] = S[i][0]
else:
CS[i][j] = CS[i][j-1] + S[i][j]
for i in range(h):
for j in range(w):
if(i==0):
CCS[0][j] = CS[0][j]
else:
CCS[i][j] = CCS[i-1][j] + CS[i][j]
return CCS
def string_to_runLength(S: str): #文字列/リストからラングレス圧縮
grouped = groupby(S)
res = []
for k, v in grouped:
res.append((k, int(len(list(v)))))
return res
def runLength_to_string(L: "list[tuple]"): #ラングレス圧縮から文字列 => 文字だけ
res = ""
for c, n in L:
res += c * int(n)
return res
def bfs(i,G): # i:始点
n = len(G)
dist = [-1] * n
pre = [-1] * n
que = deque()
dist[i] = 0
que.append(i)
while not len(que)==0:
v = que.popleft()
for next_v in G[v]:
if dist[next_v] != -1:
continue
dist[next_v] = dist[v] + 1
pre[next_v] = v
que.append(next_v)
return dist,pre
def bfs01(s, G): # i:始点 => dist
N = len(G)
dist = [INF] * N
S = deque([s])
T = deque()
dist[s] = 0
d = 0
while S:
while S:
v = S.popleft()
for c, w in G[v]:
if d+c < dist[w]:
dist[w] = d+c
if c:
T.append(w)
else:
S.append(w)
S, T = T, S
d += 1
return dist
def dijkstra(s,G): #s:始点 => cost,pre | G:タプルの中身(コスト,行先)
n = len(G)
hq = [(0, s)]
heapq.heapify(hq)
cost = [INF]*n
cost[s]= 0
pre = [-1] * n
while hq:
c,v = heapq.heappop(hq)
if c > cost[v]:
continue
for d,u in G[v]:
tmp = d+cost[v]
if tmp < cost[u]:
cost[u] = tmp
pre[u] = v
heapq.heappush(hq,(tmp,u))
return cost, pre
def coordinates(A): # 変換表(元の値 : 座標圧縮の値),変換表2(座標圧縮の値: 元の値), 圧縮後配列
B = sorted(set(A))
C = { v: i for i, v in enumerate(B) }
D = { i: v for i, v in enumerate(B) }
E = list(map(lambda v: C[v], A))
return C, D, E
def eng_L(): return list(string.ascii_lowercase)
def ENG_L(): return list(string.ascii_uppercase)
def bit_len(n): #bit長
return n.bit_length()
def bit_cnt(n): # bitにしたときの1の数
cnt = 0
for i in range(bit_len(n)+1):
cnt += n>>i & 1
return cnt
def idx_le(A, x): # x 以下の最大の要素位置 / なければ "No"
return bisect_right(A, x)-1 if bisect_right(A, x)-1 != -1 else "No"
def idx_lt(A, x): # x 未満の最大の要素位置 / なければ "No"
return bisect_left(A, x)-1 if bisect_right(A, x)-1 != -1 else "No"
def idx_ge(A, x): # x 以上の最小の要素位置 / なければ "No"
return bisect_left(A, x) if bisect_left(A, x) != len(A) else "No"
def idx_gt(A, x): # x 超過の最小の要素位置 / なければ "No"
return bisect_right(A, x) if bisect_right(A, x) != len(A) else "No"
def cnt_le(A, x): # x 以下の要素の個数
if(idx_le(A, x) == "No"): return 0
return idx_le(A, x) + 1
def cnt_lt(A, x): # x 未満の要素の個数
if(idx_lt(A, x) == "No"): return 0
return idx_lt(A, x) + 1
def cnt_ge(A, x): # x 以上の要素の個数
return len(A) - cnt_lt(A, x)
def cnt_gt(A, x): # x 超過の要素の個数
return len(A) - cnt_le(A, x)
###数学ライブラリ###
def allAND(A): # 配列Aの総AND
return reduce(and_, A)
def allOR(A): # 配列Aの総OR
return reduce(or_, A)
def allXOR(A): # 配列Aの総XOR
return reduce(xor, A)
def allGCD(A): # 配列Aの総GCD
if(len(A)==1):
return A[0]
g = math.gcd(A[0],A[1])
for i in range(1,len(A)):
g = math.gcd(g, A[i])
return g
def mex(A): #配列Aのmexを求める
B = set()
for a in A:
if(a>=0):
B.add(a)
B = list(B)
B.sort()
if(len(B)==0):
return 0
if(B[0]!=0):
return 0
m = 0
for i in range(1,len(B)):
if(B[i]==B[i-1]+1):
m +=1
else:
break
return m +1
def gcd(a,b): #aとbの最大公約数を求める
return math.gcd(a,b)
def lcm(a,b): #aとbの最小公倍数を求める
return a*b//gcd(a,b)
def extgcd(a, b): # a,b =>ax+by=gcd(a,b)を満たす(g,x,y) a,bが互いに素のとき、xはaのbを法とする逆元
if b:
d, y, x = extgcd(b, a % b)
y -= (a // b)*x
return d, x, y
return a, 1, 0
def fact_L(n,mod): # [0!, 1! ..., n!] を返す
fact = [1]
p = 1
for i in range(1,n+1):
p *= i
p %= mod
fact.append(p)
return fact
def bitCount_L(n): # n以下のそれぞれのbitカウントを返す
bitcount = [0] * (n+1)
for i in range(1,n+1):
bitcount[i] = bitcount[i//2] + i%2
return bitcount
def factorial(n, m=0): #nの階乗 | m:mod(デフォなし)
if(n<0):
return -1
elif(n==0):
return 1
P = 1
for i in range(1,n+1):
P *= i
if(m==0):
continue
P %= m
return P
def nPr(n, r, m=0): #順列nPr
if(n<=0 or r<0 or n<r):
return -1
if(r==0):
return 1
P = 1
for i in range(n,n-r,-1):
P *= i
if(m==0):
continue
P %= m
return P
def nCr(n, r, m=0): #組み合わせnCr
if(n<r):
return 0
if(n==r):
return 1
if(n<=0 or r<0 or n<r):
return -1
N = 1
for i in range(r):
N *= n-i
if(m==0):
continue
N %= m
R = factorial(r)
return N//R
def nCrm(n,r,m=mod): #逆元を用いた組み合わせnCr%mod
if(n<r):
return 0
if(n==r):
return 1
if(n<=0 or r<0 or n<r):
return -1
over=1
for i in range(n-r+1,n+1):
over *= i
over %= m
under=1
for i in range(1,r+1):
under *= i
under %= m
return over*pow(under,m-2,m)%m
def is_prime(n): #素数判定 => True/False
if n == 2:
return 1
if n == 1 or n%2 == 0:
return 0
m = n - 1
lsb = m & -m
s = lsb.bit_length()-1
d = m // lsb
test_numbers = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]
for a in test_numbers:
if a == n:
continue
x = pow(a,d,n)
r = 0
if x == 1:
continue
while x != m:
x = pow(x,2,n)
r += 1
if x == 1 or r == s:
return 0
return 1
def prime_L(n): #n以下の素数のリスト
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
def find_prime_factor(n):
if n%2 == 0:
return 2
m = int(n**0.125)+1
for c in range(1,n):
f = lambda a: (pow(a,2,n)+c)%n
y = 0
g = q = r = 1
k = 0
while g == 1:
x = y
while k < 3*r//4:
y = f(y)
k += 1
while k < r and g == 1:
ys = y
for _ in range(min(m, r-k)):
y = f(y)
q = q*abs(x-y)%n
g = math.gcd(q,n)
k += m
k = r
r *= 2
if g == n:
g = 1
y = ys
while g == 1:
y = f(y)
g = math.gcd(abs(x-y),n)
if g == n:
continue
if is_prime(g):
return g
elif is_prime(n//g):
return n//g
else:
return find_prime_factor(g)
def primeFactorization_2L(n): #2以上の整数n => [[素因数, 指数], ...]の2次元リスト
if(n<=10**6):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
else:
res = {}
while not is_prime(n) and n > 1:
p = find_prime_factor(n)
s = 0
while n%p == 0:
n //= p
s += 1
res[p] = s
if n > 1:
res[n] = 1
R = []
for r in res:
R.append([r,res[r]])
R.sort()
return R
def divisor_L(n): #nまでの約数のリスト
if(n==1):
return [1]
if(n<=10**6):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
else:
L = primeFactorization_2L(n)
E = [[]for i in range(len(L))]
for i in range(len(L)):
for j in range(L[i][1]+1):
E[i].append(L[i][0]**j)
D = []
for p in list(itertools.product(*E)):
s = 1
for v in p:
s *= v
D.append(s)
D.sort()
return D
def floorsqrt(n): # N => ⌊√N⌋
# only for n <= 10 ** 18
ok = 10 ** 9 + 10
ng = 0
while ok - ng > 1:
t = (ok + ng) // 2
if t * t > n: ok = t
else: ng = t
return ng
def decimal_to_nAry(num_10,n): #10進数からn進数へ変換する(n<=36) |int型 => str型
str_n = []
while num_10:
if num_10%n >= 10:
str_n.append(chr(num_10%n+55))
else:
str_n.append(str(num_10%n))
num_10 //= n
return "".join(str_n[::-1])
def nAry_to_decimal(X,n): #n進数から10進数へ変換する(n<=36) | str型 => int型
num = 0
X = X.upper()
X = list(X)
for i in range(len(X)):
if(("0"<=X[i]<="9")==False):
X[i] = str(ord(X[i]) - 55)
for i in range(1,len(X)+1):
num += int(X[-i]) * pow(n, (i-1))
return num
def roundOff(x,d): #四捨五入する x:対象の数字, d:四捨五入する位(正|負) => float型の数値
return float(Decimal(x).quantize(Decimal(f"1E{d}"), rounding=ROUND_HALF_UP))
###幾何ライブラリ###
def dsin(d): #度数法でsinを計算する
return math.sin(math.radians(d))
def dcos(d): #度数法でcosを計算する
return math.cos(math.radians(d))
def rotate(x,y,d,cx=0,cy=0): #P(x,y)をA(cx,cy)を中心としてに反時計回りにd°回転 => [x,y]
nx = (x-cx)*dcos(d)-(y-cy)*dsin(d)
ny = (x-cx)*dsin(d)+(y-cy)*dcos(d)
return [nx+cx,ny+cy]
def findAngle(O,A,B): #∠AOBを求める(弧度法)
s = [A[0]-O[0],A[1]-O[1]]
t = [B[0]-O[0],B[1]-O[1]]
u = s[0]*t[0]+s[1]*t[1]
l = (s[0]**2+s[1]**2)**(1/2) * (t[0]**2+t[1]**2)**(1/2)
v = u/l
t = math.degrees(math.acos(v))
return t
def outerProduct(Av,Bv): #二次元ベクトルの外積(=符号付面積)を求める(a×b)
return Av[0]*Bv[1] - Bv[0]*Av[1]
def CCW(O,A,B): #Oを中心として、Aから見たAとBの位置関係を求める。
# -1: 時計回り, 0: 一直線上, 1: 反時計回り
s = [A[0]-O[0],A[1]-O[1]]
t = [B[0]-O[0],B[1]-O[1]]
op = outerProduct(s,t)
if(op > 0): return 1
if(op < 0): return -1
if(op == 0): return 0
def matrixMultiplication_2D(a,b,m): #行列の掛け算(a×b) m:mod
I,J,K,L = len(a),len(b[0]),len(b),len(a[0])
if(L!=K):
return -1
c = [[0] * J for _ in range(I)]
for i in range(I) :
for j in range(J) :
for k in range(K) :
c[i][j] += a[i][k] * b[k][j]
c[i][j] %= m
return c
def matrixExponentiation_2D(x,n,m): #行列の累乗 (x^n) m:mod
y = [[0] * len(x) for _ in range(len(x))]
for i in range(len(x)):
y[i][i] = 1
while n > 0:
if n & 1:
y = matrixMultiplication_2D(x,y,m)
x = matrixMultiplication_2D(x,x,m)
n >>= 1
return y
def twoCircles(A,B): #二つの円の半径の位置関係 | 引数はそれぞれ[x,y(=座標),r(=半径)]
# 1 : 一方の円が他方の円を完全に含み、2 つの円は接していない
# 2 : 一方の円が他方の円を完全に含み、2 つの円は接している
# 3 : 2 つの円が互いに交差する
# 4 : 2 つの円の内部に共通部分は存在しないが、2 つの円は接している
# 5 : 2 つの円の内部に共通部分は存在せず、2 つの円は接していない
x1 = A[0]
x2 = B[0]
y1 = A[1]
y2 = B[1]
r1 = A[2]
r2 = B[2]
d = abs((x1-x2)+1j*(y1-y2))
if(abs(r2-r1)>d):
return 1
elif(abs(r2-r1)==d):
return 2
elif(r1+r2>d):
return 3
elif(r1+r2==d):
return 4
elif(r1+r2<d):
return 5
###デバッグ用ライブラリ###
def TS(_str): #変数/リストに格納されている値を確認
print('{}: {}'.format(_str, eval(_str)))
def T2d(A): #二次元配列の確認用
for a in A:
print(*a)
def T3d(A): #三次元配列の確認用
for a in A:
T2d(a)
BR()
def BR(): #横線で区切りを入れる
print("---")
#クラス----------------------------------------------------------------------
#カンニングペーパー-----------------------------------------------------------
'''
###標準ライブラリ###
ceil(a,b): #切り捨て
inv(a,p): #xのpを法とする逆元
transpose(A): #二次元配列の転置
rotate_matrix(A): #グリッドを時計回りに90度回転
removeDuplicates_2D(A): #二次元配列の重複削除
convert(S, c): # グリッドをの 黒 マスの点集合に変換する | S: グリッド c:黒マスがなにか(ex #,1)
normalize(s): # グリッドの # マスの点集合を与えると最小の x 座標と最小の y 座標がともに 0 となるように平行移動して返す
例)normalize(convert(h,w,A))
cumulativeSum_1D(A) #配列Aの累積和
cumulativeSum_2D(S): #二次元配列Sの累積和 => 二次元リスト
string_to_runLength(S: str) #文字列/リストからラングレス圧縮 => [(文字,個数), ...]の二次元リスト
runLength_to_string(L: "list[tuple]") #ラングレス圧縮 => 文字列
bfs(i,G) # i:始点 => dist,pre
bfs01(i,G) # i:始点 => dist
dijkstra(s,G): #s:始点 => cost,pre | G:タプルの中身(コスト,行先)
coordinates(A) # 変換表(元の値 : 座標圧縮の値),変換表2(座標圧縮の値: 元の値), 圧縮後配列
eng_L() #英小文字のリスト
ENG_L() #英大文字のリスト
bit_len(n): #bit長
bit_cnt(n): # bitにしたときの1の数
idx_le(A, x) # x 以下の最大の要素位置 / なければ "No"
idx_lt(A, x) # x 未満の最大の要素位置 / なければ "No"
idx_ge(A, x) # x 以上の最小の要素位置 / なければ "No"
idx_gt(A, x) # x 超過の最小の要素位置 / なければ "No"
cnt_le(A, x) # x 以下の要素の個数
cnt_lt(A, x) # x 未満の要素の個数
cnt_ge(A, x) # x 以上の要素の個数
cnt_gt(A, x) # x 超過の要素の個数
###数学ライブラリ###
allAND(A): # 配列Aの総AND
allOR(A): # 配列Aの総OR
allXOR(A): # 配列Aの総XOR
allGCD(A): # 配列Aの総GCD
mex(A) #配列Aのmexを求める
gcd(a,b) #aとbの最大公約数を求める
lcm(a,b) #aとbの最小公倍数を求める
extgcd(a, b): # a,b =>ax+by=gcd(a,b)を満たす(g,x,y) a,bが互いに素のとき、xはaのbを法とする逆元
fact_L(n,mod): # [0!, 1! ..., n!] を返す
bitCount_L(n): # n以下のそれぞれのbitカウントを返す
factorial(n,m) #nの階乗 | m:mod(デフォなし)
nPr(n,r,m) #順列nPr | m:mod(デフォなし)
nCr(n,r,m) #組み合わせ,nCr | m:mod(デフォなし)
nCrm(n,r,m) #逆元を用いた組み合わせnCr%mod
divisor_L(n) #nの約数のリスト
is_prime(n) #素数判定 => True/False
prime_L(n) #nまでの素数のリスト
primeFactorization_2L(n) #2以上の整数n => [[素因数, 指数], ...]の2次元リスト
floorsqrt(n): # N => ⌊√N⌋
decimal_to_nAry(num_10,n) #10進数からn進数へ変換する(n<=36) |int型 => str型
nAry_to_decimal(num_n,n) #n進数から10進数へ変換する(n<=36) | str型 => int型
roundOff(x,d): #四捨五入する x:対象の数字, d:四捨五入する位(正|負) => float型の数値
###幾何ライブラリ###
dsin(d): #度数法でsinを計算する
dcos(d): #度数法でcosを計算する
rotate(x,y,d,cx,cy): #P(x,y)をA(cx,cy)を中心としてに反時計回りにd°回転(デフォ原点) => [x,y]
findAngle(O,A,B) #∠AOBを求める(弧度法) | 引数はそれぞれ[x,y(=座標)]
outerProduct(Av,Bv) #二次元ベクトルの外積(=符号付面積)を求める(a×b) | 引数はそれぞれ[x,y(=座標)]
CCW(O,A,B) #Oを中心として、Aから見たAとBの位置関係
=> -1:時計回り, 0:一直線上, 1:反時計回り | 引数はそれぞれ[x,y(=座標)]
matrixMultiplication_2D(a,b,m) #行列の掛け算(a×b) m:mod | 引数は二次元リスト
matrixExponentiation_2D(x,n m)#行列の累乗 (x^n) m:mod | 引数は二次元リスト
twoCircles(A,B): #二つの円の半径の位置関係 | 引数はそれぞれ[x,y(=座標),r(=半径)]
=> 1, 2, 3, 4, 5 各数字に対応する位置関係の説明は上記参照
###デバッグ用ライブラリ###
TS(_str) # 変数/リストに格納されている値を確認 => 〇〇:××
T2d(A): # 二次元配列の確認用
T3d(A): # 三次元配列の確認用
BR() # 横線で区切りを入れる
###文法チートシート###
|S|<x => "0"*(x-|S|) + S : str(n).zfill(x)
全部大文字に変換：str.upper()
全部小文字に変換：str.lower()
先頭のみ大文字に変換：str.capitalize()
各単語の先頭のみ大文字に変換（タイトルケース）:str.title()
大文字と小文字を入れ替える：str.swapcase()
文字 → ASCIIコード ord(s)
ASCIIコード → 文字 chr(x)
ASCII表
65:A ~ 90:Z
97:a ~ 122:z
'''
#PyPyで再帰関数を用いる場合はコメントを外す----------------------------------
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
#----------------------------------------------------------------------------
n,m = MI()
A = LI()
CA = [0] + cumulativeSum_1D(A)
B = []
for i in range(n):
B.append(A[i]*(i+1))
CB = [0] + cumulativeSum_1D(B)
# print(CA)
# print(CB)
ans = 0
for i in range(n-m+1):
ans = max(ans,CB[i+m] - CB[i] - (CA[i+m] - CA[i]) * i)
print(ans)
# Python3/Pypy3テンプレート集
#ライブラリ-------------------------------------------------------------------
from bisect import *
import heapq
import collections
from collections import deque
from queue import Queue
from itertools import groupby
import itertools
import math
import array
import string
import copy
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from functools import reduce
from operator import and_, or_, xor
#便利スクリプト---------------------------------------------------------------
INF = 10**20
mod = 998244353
MOD = 10**9+7
def YesNo(b): print("Yes") if b else print("No")
def YESNO(b): print("YES") if b else print("NO")
#標準入力---------------------------------------------------------------------
import sys
sys.setrecursionlimit(10 ** 5 + 10000)
input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LIS(): return list(map(int, SI()))
def LA(f): return list(map(f, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return input().strip('\n')
def MS(): return input().split()
def LS(): return list(input().strip('\n'))
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def LMS(rows_number): return [MS() for _ in range(rows_number)]
#関数------------------------------------------------------------------------
###標準ライブラリ###
def ceil(a,b): #切り捨て
return (a+b-1)//b
def inv(a,p): #aのpを法とする逆元(aとpは互いに素)
return pow(a,p-2,p)%p
def transpose(A): #二次元配列の転置
A_t = []
for i in range(len(A[0])) :
tmp = []
for v in A :
tmp.append(v[i])
A_t.append(tmp)
return A_t
def rotate_matrix(A): #グリッドを時計回りに90度回転
return transpose(A[::-1])
def removeDuplicates_2D(A): #二次元配列の重複削除
return list(map(list, set(map(tuple, A))))
def convert(S,c): # グリッドをの 黒 マスの点集合に変換する | S: グリッド c:黒マスがなにか(ex #,1)
s = set()
h = len(S)
w = len(S[0])
for i in range(h):
for j in range(w):
if S[i][j] == c:
s.add((i, j))
return s
def normalize(s): # グリッドの # マスの点集合を与えると最小の x 座標と最小の y 座標がともに 0 となるように平行移動して返す
mi = min(i for (i, j) in s)
mj = min(j for (i, j) in s)
return set((i - mi, j - mj) for (i, j) in s)
def cumulativeSum_1D(A): #配列Aの累積和
return list(itertools.accumulate(A))
def cumulativeSum_2D(S): #二次元配列Sの累積和 => 二次元リスト
h = len(S)
w = len(S[0])
CS = [[0 for _ in range(w)]for _ in range(h)]
CCS = [[0 for _ in range(w)]for _ in range(h)]
for i in range(h):
for j in range(w):
if(j==0):
CS[i][0] = S[i][0]
else:
CS[i][j] = CS[i][j-1] + S[i][j]
for i in range(h):
for j in range(w):
if(i==0):
CCS[0][j] = CS[0][j]
else:
CCS[i][j] = CCS[i-1][j] + CS[i][j]
return CCS
def string_to_runLength(S: str): #文字列/リストからラングレス圧縮
grouped = groupby(S)
res = []
for k, v in grouped:
res.append((k, int(len(list(v)))))
return res
def runLength_to_string(L: "list[tuple]"): #ラングレス圧縮から文字列 => 文字だけ
res = ""
for c, n in L:
res += c * int(n)
return res
def bfs(i,G): # i:始点
n = len(G)
dist = [-1] * n
pre = [-1] * n
que = deque()
dist[i] = 0
que.append(i)
while not len(que)==0:
v = que.popleft()
for next_v in G[v]:
if dist[next_v] != -1:
continue
dist[next_v] = dist[v] + 1
pre[next_v] = v
que.append(next_v)
return dist,pre
def bfs01(s, G): # i:始点 => dist
N = len(G)
dist = [INF] * N
S = deque([s])
T = deque()
dist[s] = 0
d = 0
while S:
while S:
v = S.popleft()
for c, w in G[v]:
if d+c < dist[w]:
dist[w] = d+c
if c:
T.append(w)
else:
S.append(w)
S, T = T, S
d += 1
return dist
def dijkstra(s,G): #s:始点 => cost,pre | G:タプルの中身(コスト,行先)
n = len(G)
hq = [(0, s)]
heapq.heapify(hq)
cost = [INF]*n
cost[s]= 0
pre = [-1] * n
while hq:
c,v = heapq.heappop(hq)
if c > cost[v]:
continue
for d,u in G[v]:
tmp = d+cost[v]
if tmp < cost[u]:
cost[u] = tmp
pre[u] = v
heapq.heappush(hq,(tmp,u))
return cost, pre
def coordinates(A): # 変換表(元の値 : 座標圧縮の値),変換表2(座標圧縮の値: 元の値), 圧縮後配列
B = sorted(set(A))
C = { v: i for i, v in enumerate(B) }
D = { i: v for i, v in enumerate(B) }
E = list(map(lambda v: C[v], A))
return C, D, E
def eng_L(): return list(string.ascii_lowercase)
def ENG_L(): return list(string.ascii_uppercase)
def bit_len(n): #bit長
return n.bit_length()
def bit_cnt(n): # bitにしたときの1の数
cnt = 0
for i in range(bit_len(n)+1):
cnt += n>>i & 1
return cnt
def idx_le(A, x): # x 以下の最大の要素位置 / なければ "No"
return bisect_right(A, x)-1 if bisect_right(A, x)-1 != -1 else "No"
def idx_lt(A, x): # x 未満の最大の要素位置 / なければ "No"
return bisect_left(A, x)-1 if bisect_right(A, x)-1 != -1 else "No"
def idx_ge(A, x): # x 以上の最小の要素位置 / なければ "No"
return bisect_left(A, x) if bisect_left(A, x) != len(A) else "No"
def idx_gt(A, x): # x 超過の最小の要素位置 / なければ "No"
return bisect_right(A, x) if bisect_right(A, x) != len(A) else "No"
def cnt_le(A, x): # x 以下の要素の個数
if(idx_le(A, x) == "No"): return 0
return idx_le(A, x) + 1
def cnt_lt(A, x): # x 未満の要素の個数
if(idx_lt(A, x) == "No"): return 0
return idx_lt(A, x) + 1
def cnt_ge(A, x): # x 以上の要素の個数
return len(A) - cnt_lt(A, x)
def cnt_gt(A, x): # x 超過の要素の個数
return len(A) - cnt_le(A, x)
###数学ライブラリ###
def allAND(A): # 配列Aの総AND
return reduce(and_, A)
def allOR(A): # 配列Aの総OR
return reduce(or_, A)
def allXOR(A): # 配列Aの総XOR
return reduce(xor, A)
def allGCD(A): # 配列Aの総GCD
if(len(A)==1):
return A[0]
g = math.gcd(A[0],A[1])
for i in range(1,len(A)):
g = math.gcd(g, A[i])
return g
def mex(A): #配列Aのmexを求める
B = set()
for a in A:
if(a>=0):
B.add(a)
B = list(B)
B.sort()
if(len(B)==0):
return 0
if(B[0]!=0):
return 0
m = 0
for i in range(1,len(B)):
if(B[i]==B[i-1]+1):
m +=1
else:
break
return m +1
def gcd(a,b): #aとbの最大公約数を求める
return math.gcd(a,b)
def lcm(a,b): #aとbの最小公倍数を求める
return a*b//gcd(a,b)
def extgcd(a, b): # a,b =>ax+by=gcd(a,b)を満たす(g,x,y) a,bが互いに素のとき、xはaのbを法とする逆元
if b:
d, y, x = extgcd(b, a % b)
y -= (a // b)*x
return d, x, y
return a, 1, 0
def fact_L(n,mod): # [0!, 1! ..., n!] を返す
fact = [1]
p = 1
for i in range(1,n+1):
p *= i
p %= mod
fact.append(p)
return fact
def bitCount_L(n): # n以下のそれぞれのbitカウントを返す
bitcount = [0] * (n+1)
for i in range(1,n+1):
bitcount[i] = bitcount[i//2] + i%2
return bitcount
def factorial(n, m=0): #nの階乗 | m:mod(デフォなし)
if(n<0):
return -1
elif(n==0):
return 1
P = 1
for i in range(1,n+1):
P *= i
if(m==0):
continue
P %= m
return P
def nPr(n, r, m=0): #順列nPr
if(n<=0 or r<0 or n<r):
return -1
if(r==0):
return 1
P = 1
for i in range(n,n-r,-1):
P *= i
if(m==0):
continue
P %= m
return P
def nCr(n, r, m=0): #組み合わせnCr
if(n<r):
return 0
if(n==r):
return 1
if(n<=0 or r<0 or n<r):
return -1
N = 1
for i in range(r):
N *= n-i
if(m==0):
continue
N %= m
R = factorial(r)
return N//R
def nCrm(n,r,m=mod): #逆元を用いた組み合わせnCr%mod
if(n<r):
return 0
if(n==r):
return 1
if(n<=0 or r<0 or n<r):
return -1
over=1
for i in range(n-r+1,n+1):
over *= i
over %= m
under=1
for i in range(1,r+1):
under *= i
under %= m
return over*pow(under,m-2,m)%m
def is_prime(n): #素数判定 => True/False
if n == 2:
return 1
if n == 1 or n%2 == 0:
return 0
m = n - 1
lsb = m & -m
s = lsb.bit_length()-1
d = m // lsb
test_numbers = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]
for a in test_numbers:
if a == n:
continue
x = pow(a,d,n)
r = 0
if x == 1:
continue
while x != m:
x = pow(x,2,n)
r += 1
if x == 1 or r == s:
return 0
return 1
def prime_L(n): #n以下の素数のリスト
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
def find_prime_factor(n):
if n%2 == 0:
return 2
m = int(n**0.125)+1
for c in range(1,n):
f = lambda a: (pow(a,2,n)+c)%n
y = 0
g = q = r = 1
k = 0
while g == 1:
x = y
while k < 3*r//4:
y = f(y)
k += 1
while k < r and g == 1:
ys = y
for _ in range(min(m, r-k)):
y = f(y)
q = q*abs(x-y)%n
g = math.gcd(q,n)
k += m
k = r
r *= 2
if g == n:
g = 1
y = ys
while g == 1:
y = f(y)
g = math.gcd(abs(x-y),n)
if g == n:
continue
if is_prime(g):
return g
elif is_prime(n//g):
return n//g
else:
return find_prime_factor(g)
def primeFactorization_2L(n): #2以上の整数n => [[素因数, 指数], ...]の2次元リスト
if(n<=10**6):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
else:
res = {}
while not is_prime(n) and n > 1:
p = find_prime_factor(n)
s = 0
while n%p == 0:
n //= p
s += 1
res[p] = s
if n > 1:
res[n] = 1
R = []
for r in res:
R.append([r,res[r]])
R.sort()
return R
def divisor_L(n): #nまでの約数のリスト
if(n==1):
return [1]
if(n<=10**6):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
else:
L = primeFactorization_2L(n)
E = [[]for i in range(len(L))]
for i in range(len(L)):
for j in range(L[i][1]+1):
E[i].append(L[i][0]**j)
D = []
for p in list(itertools.product(*E)):
s = 1
for v in p:
s *= v
D.append(s)
D.sort()
return D
def floorsqrt(n): # N => ⌊√N⌋
# only for n <= 10 ** 18
ok = 10 ** 9 + 10
ng = 0
while ok - ng > 1:
t = (ok + ng) // 2
if t * t > n: ok = t
else: ng = t
return ng
def decimal_to_nAry(num_10,n): #10進数からn進数へ変換する(n<=36) |int型 => str型
str_n = []
while num_10:
if num_10%n >= 10:
str_n.append(chr(num_10%n+55))
else:
str_n.append(str(num_10%n))
num_10 //= n
return "".join(str_n[::-1])
def nAry_to_decimal(X,n): #n進数から10進数へ変換する(n<=36) | str型 => int型
num = 0
X = X.upper()
X = list(X)
for i in range(len(X)):
if(("0"<=X[i]<="9")==False):
X[i] = str(ord(X[i]) - 55)
for i in range(1,len(X)+1):
num += int(X[-i]) * pow(n, (i-1))
return num
def roundOff(x,d): #四捨五入する x:対象の数字, d:四捨五入する位(正|負) => float型の数値
return float(Decimal(x).quantize(Decimal(f"1E{d}"), rounding=ROUND_HALF_UP))
###幾何ライブラリ###
def dsin(d): #度数法でsinを計算する
return math.sin(math.radians(d))
def dcos(d): #度数法でcosを計算する
return math.cos(math.radians(d))
def rotate(x,y,d,cx=0,cy=0): #P(x,y)をA(cx,cy)を中心としてに反時計回りにd°回転 => [x,y]
nx = (x-cx)*dcos(d)-(y-cy)*dsin(d)
ny = (x-cx)*dsin(d)+(y-cy)*dcos(d)
return [nx+cx,ny+cy]
def findAngle(O,A,B): #∠AOBを求める(弧度法)
s = [A[0]-O[0],A[1]-O[1]]
t = [B[0]-O[0],B[1]-O[1]]
u = s[0]*t[0]+s[1]*t[1]
l = (s[0]**2+s[1]**2)**(1/2) * (t[0]**2+t[1]**2)**(1/2)
v = u/l
t = math.degrees(math.acos(v))
return t
def outerProduct(Av,Bv): #二次元ベクトルの外積(=符号付面積)を求める(a×b)
return Av[0]*Bv[1] - Bv[0]*Av[1]
def CCW(O,A,B): #Oを中心として、Aから見たAとBの位置関係を求める。
# -1: 時計回り, 0: 一直線上, 1: 反時計回り
s = [A[0]-O[0],A[1]-O[1]]
t = [B[0]-O[0],B[1]-O[1]]
op = outerProduct(s,t)
if(op > 0): return 1
if(op < 0): return -1
if(op == 0): return 0
def matrixMultiplication_2D(a,b,m): #行列の掛け算(a×b) m:mod
I,J,K,L = len(a),len(b[0]),len(b),len(a[0])
if(L!=K):
return -1
c = [[0] * J for _ in range(I)]
for i in range(I) :
for j in range(J) :
for k in range(K) :
c[i][j] += a[i][k] * b[k][j]
c[i][j] %= m
return c
def matrixExponentiation_2D(x,n,m): #行列の累乗 (x^n) m:mod
y = [[0] * len(x) for _ in range(len(x))]
for i in range(len(x)):
y[i][i] = 1
while n > 0:
if n & 1:
y = matrixMultiplication_2D(x,y,m)
x = matrixMultiplication_2D(x,x,m)
n >>= 1
return y
def twoCircles(A,B): #二つの円の半径の位置関係 | 引数はそれぞれ[x,y(=座標),r(=半径)]
# 1 : 一方の円が他方の円を完全に含み、2 つの円は接していない
# 2 : 一方の円が他方の円を完全に含み、2 つの円は接している
# 3 : 2 つの円が互いに交差する
# 4 : 2 つの円の内部に共通部分は存在しないが、2 つの円は接している
# 5 : 2 つの円の内部に共通部分は存在せず、2 つの円は接していない
x1 = A[0]
x2 = B[0]
y1 = A[1]
y2 = B[1]
r1 = A[2]
r2 = B[2]
d = abs((x1-x2)+1j*(y1-y2))
if(abs(r2-r1)>d):
return 1
elif(abs(r2-r1)==d):
return 2
elif(r1+r2>d):
return 3
elif(r1+r2==d):
return 4
elif(r1+r2<d):
return 5
###デバッグ用ライブラリ###
def TS(_str): #変数/リストに格納されている値を確認
print('{}: {}'.format(_str, eval(_str)))
def T2d(A): #二次元配列の確認用
for a in A:
print(*a)
def T3d(A): #三次元配列の確認用
for a in A:
T2d(a)
BR()
def BR(): #横線で区切りを入れる
print("---")
#クラス----------------------------------------------------------------------
#カンニングペーパー-----------------------------------------------------------
'''
###標準ライブラリ###
ceil(a,b): #切り捨て
inv(a,p): #xのpを法とする逆元
transpose(A): #二次元配列の転置
rotate_matrix(A): #グリッドを時計回りに90度回転
removeDuplicates_2D(A): #二次元配列の重複削除
convert(S, c): # グリッドをの 黒 マスの点集合に変換する | S: グリッド c:黒マスがなにか(ex #,1)
normalize(s): # グリッドの # マスの点集合を与えると最小の x 座標と最小の y 座標がともに 0 となるように平行移動して返す
例)normalize(convert(h,w,A))
cumulativeSum_1D(A) #配列Aの累積和
cumulativeSum_2D(S): #二次元配列Sの累積和 => 二次元リスト
string_to_runLength(S: str) #文字列/リストからラングレス圧縮 => [(文字,個数), ...]の二次元リスト
runLength_to_string(L: "list[tuple]") #ラングレス圧縮 => 文字列
bfs(i,G) # i:始点 => dist,pre
bfs01(i,G) # i:始点 => dist
dijkstra(s,G): #s:始点 => cost,pre | G:タプルの中身(コスト,行先)
coordinates(A) # 変換表(元の値 : 座標圧縮の値),変換表2(座標圧縮の値: 元の値), 圧縮後配列
eng_L() #英小文字のリスト
ENG_L() #英大文字のリスト
bit_len(n): #bit長
bit_cnt(n): # bitにしたときの1の数
idx_le(A, x) # x 以下の最大の要素位置 / なければ "No"
idx_lt(A, x) # x 未満の最大の要素位置 / なければ "No"
idx_ge(A, x) # x 以上の最小の要素位置 / なければ "No"
idx_gt(A, x) # x 超過の最小の要素位置 / なければ "No"
cnt_le(A, x) # x 以下の要素の個数
cnt_lt(A, x) # x 未満の要素の個数
cnt_ge(A, x) # x 以上の要素の個数
cnt_gt(A, x) # x 超過の要素の個数
###数学ライブラリ###
allAND(A): # 配列Aの総AND
allOR(A): # 配列Aの総OR
allXOR(A): # 配列Aの総XOR
allGCD(A): # 配列Aの総GCD
mex(A) #配列Aのmexを求める
gcd(a,b) #aとbの最大公約数を求める
lcm(a,b) #aとbの最小公倍数を求める
extgcd(a, b): # a,b =>ax+by=gcd(a,b)を満たす(g,x,y) a,bが互いに素のとき、xはaのbを法とする逆元
fact_L(n,mod): # [0!, 1! ..., n!] を返す
bitCount_L(n): # n以下のそれぞれのbitカウントを返す
factorial(n,m) #nの階乗 | m:mod(デフォなし)
nPr(n,r,m) #順列nPr | m:mod(デフォなし)
nCr(n,r,m) #組み合わせ,nCr | m:mod(デフォなし)
nCrm(n,r,m) #逆元を用いた組み合わせnCr%mod
divisor_L(n) #nの約数のリスト
is_prime(n) #素数判定 => True/False
prime_L(n) #nまでの素数のリスト
primeFactorization_2L(n) #2以上の整数n => [[素因数, 指数], ...]の2次元リスト
floorsqrt(n): # N => ⌊√N⌋
decimal_to_nAry(num_10,n) #10進数からn進数へ変換する(n<=36) |int型 => str型
nAry_to_decimal(num_n,n) #n進数から10進数へ変換する(n<=36) | str型 => int型
roundOff(x,d): #四捨五入する x:対象の数字, d:四捨五入する位(正|負) => float型の数値
###幾何ライブラリ###
dsin(d): #度数法でsinを計算する
dcos(d): #度数法でcosを計算する
rotate(x,y,d,cx,cy): #P(x,y)をA(cx,cy)を中心としてに反時計回りにd°回転(デフォ原点) => [x,y]
findAngle(O,A,B) #∠AOBを求める(弧度法) | 引数はそれぞれ[x,y(=座標)]
outerProduct(Av,Bv) #二次元ベクトルの外積(=符号付面積)を求める(a×b) | 引数はそれぞれ[x,y(=座標)]
CCW(O,A,B) #Oを中心として、Aから見たAとBの位置関係
=> -1:時計回り, 0:一直線上, 1:反時計回り | 引数はそれぞれ[x,y(=座標)]
matrixMultiplication_2D(a,b,m) #行列の掛け算(a×b) m:mod | 引数は二次元リスト
matrixExponentiation_2D(x,n m)#行列の累乗 (x^n) m:mod | 引数は二次元リスト
twoCircles(A,B): #二つの円の半径の位置関係 | 引数はそれぞれ[x,y(=座標),r(=半径)]
=> 1, 2, 3, 4, 5 各数字に対応する位置関係の説明は上記参照
###デバッグ用ライブラリ###
TS(_str) # 変数/リストに格納されている値を確認 => 〇〇:××
T2d(A): # 二次元配列の確認用
T3d(A): # 三次元配列の確認用
BR() # 横線で区切りを入れる
###文法チートシート###
|S|<x => "0"*(x-|S|) + S : str(n).zfill(x)
全部大文字に変換：str.upper()
全部小文字に変換：str.lower()
先頭のみ大文字に変換：str.capitalize()
各単語の先頭のみ大文字に変換（タイトルケース）:str.title()
大文字と小文字を入れ替える：str.swapcase()
文字 → ASCIIコード ord(s)
ASCIIコード → 文字 chr(x)
ASCII表
65:A ~ 90:Z
97:a ~ 122:z
'''
#PyPyで再帰関数を用いる場合はコメントを外す----------------------------------
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
#----------------------------------------------------------------------------
n,m = MI()
A = LI()
CA = [0] + cumulativeSum_1D(A)
B = []
for i in range(n):
B.append(A[i]*(i+1))
CB = [0] + cumulativeSum_1D(B)
# print(CA)
# print(CB)
ans = -INF
for i in range(n-m+1):
ans = max(ans,CB[i+m] - CB[i] - (CA[i+m] - CA[i]) * i)
print(ans)
|
ConDefects/ConDefects/Code/abc267_c/Python/45118455
|
condefects-python_data_1579
|
from collections import deque
N, M = map(int, input().split())
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
res = 0
que = deque()
A = A[::-1]
idx = 0
for l in range(N):
while A and len(que) < M:
n = A.pop()
que.append(n)
res += n * len(que)
if len(que) < M:
break
ans = max(ans, res)
que.popleft()
res -= cum_sum[idx + M] - cum_sum[idx]
idx += 1
print(ans)
from collections import deque
N, M = map(int, input().split())
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 = -(1 << 60)
res = 0
que = deque()
A = A[::-1]
idx = 0
for l in range(N):
while A and len(que) < M:
n = A.pop()
que.append(n)
res += n * len(que)
if len(que) < M:
break
ans = max(ans, res)
que.popleft()
res -= cum_sum[idx + M] - cum_sum[idx]
idx += 1
print(ans)
|
ConDefects/ConDefects/Code/abc267_c/Python/45076867
|
condefects-python_data_1580
|
# -*- coding: utf-8 -*-
def match(sub: list[str]) -> bool:
if len(sub) != len(t):
return False
for e1, e2 in zip(sub, t):
if e1 != e2 and e1 != "#":
return False
return True
n, m = map(int, input().split())
s = list(input())
t = input()
que: list[int] = []
for i in range(n):
if match(s[i : i + m]):
s[i : i + m] = ["#"] * m
que.append(i)
checked = [False] * n
for i in que:
if checked[i]:
continue
checked[i] = True
# left side
for j in range(1, m + 1):
if i - j < 0:
break
if checked[i - j]:
continue
if match(s[i - i : i - j + m]):
s[i - j : i - j + m] = ["#"] * m
que.append(i - j)
# right side
for j in range(1, m + 1):
if i + j >= n:
break
if checked[i + j]:
continue
if match(s[i + j : i + j + m]):
s[i + j : i + j + m] = ["#"] * m
que.append(i + j)
checked[i + j] = True
if all(e == "#" for e in s):
print("Yes")
else:
print("No")
# -*- coding: utf-8 -*-
def match(sub: list[str]) -> bool:
if len(sub) != len(t):
return False
for e1, e2 in zip(sub, t):
if e1 != e2 and e1 != "#":
return False
return True
n, m = map(int, input().split())
s = list(input())
t = input()
que: list[int] = []
for i in range(n):
if match(s[i : i + m]):
s[i : i + m] = ["#"] * m
que.append(i)
checked = [False] * n
for i in que:
if checked[i]:
continue
checked[i] = True
# left side
for j in range(1, m + 1):
if i - j < 0:
break
if checked[i - j]:
continue
if match(s[i - j : i - j + m]):
s[i - j : i - j + m] = ["#"] * m
que.append(i - j)
# right side
for j in range(1, m + 1):
if i + j >= n:
break
if checked[i + j]:
continue
if match(s[i + j : i + j + m]):
s[i + j : i + j + m] = ["#"] * m
que.append(i + j)
checked[i + j] = True
if all(e == "#" for e in s):
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc329_e/Python/51958155
|
condefects-python_data_1581
|
n,m=map(int,input().split())
s=input()
t=input()
dp=[[False]*(m+1) for i in range(n+1)]
dp[0][0]=True
for i in range(n):
if dp[i][0]:
for k in range(m):
tl=t[k:]
if i-k<0 or i+(m-k)>n:
continue
for j in range(1,len(tl)+1):
if s[i:i+j]==tl[:j]:
dp[i+j][len(tl)-j]=True
if i+m>n:
break
for j in range(1,m+1):
if dp[i][j]:
for k in range(1,m+1):
if s[i:i+k]==t[:k]:
dp[i+k][m-k]=True
print('Yes' if dp[-1][0] else 'No')
n,m=map(int,input().split())
s=input()
t=input()
dp=[[False]*(m+1) for i in range(n+1)]
dp[0][0]=True
for i in range(n):
if dp[i][0]:
for k in range(m):
tl=t[k:]
if i-k<0 or i+(m-k)>n:
continue
for j in range(1,len(tl)+1):
if s[i:i+j]==tl[:j]:
dp[i+j][len(tl)-j]=True
if i+m>n:
continue
for j in range(1,m+1):
if dp[i][j]:
for k in range(1,m+1):
if s[i:i+k]==t[:k]:
dp[i+k][m-k]=True
print('Yes' if dp[-1][0] else 'No')
|
ConDefects/ConDefects/Code/abc329_e/Python/54232904
|
condefects-python_data_1582
|
# coding: utf-8
# Your code here!
n,m=map(int,input().split())
s=input()
t=input()
dp=[[[False]for _ in range(m+1)]for _ in range(n+1)]
dp[0][0]=True
for i in range(n):
if i+m<=n:
for j in range(m+1):
if dp[i][j]:
dp[i][0]=True
if dp[i][m]:
for j in range(m+1):
dp[i][j]=True
for j in range(m):
if dp[i][j] and s[i]==t[j]:
dp[i+1][j+1]=True
print("Yes" if dp[n][m] else "No")
# coding: utf-8
# Your code here!
n,m=map(int,input().split())
s=input()
t=input()
dp=[[False for i in range(m+1)] for j in range(n+1)]
dp[0][0]=True
for i in range(n):
if i+m<=n:
for j in range(m+1):
if dp[i][j]:
dp[i][0]=True
if dp[i][m]:
for j in range(m+1):
dp[i][j]=True
for j in range(m):
if dp[i][j] and s[i]==t[j]:
dp[i+1][j+1]=True
print("Yes" if dp[n][m] else "No")
|
ConDefects/ConDefects/Code/abc329_e/Python/50998625
|
condefects-python_data_1583
|
N, M = map(int,input().split())
S = list(input())
T = input()
from collections import deque
q = deque([])
for i in range(N-M+1) :
if "".join(S[i:i+M]) == T :
q.append(i)
def chk(s_,t) :
rtn = False
for i, ch in enumerate(t) :
if s_[i] == "#" : continue
if s_[i] != ch : return False
rtn = True
return rtn
while q :
idx = q.popleft()
for j in range(M) :
if idx+j >= N : break
S[idx+j] = "#"
# print(S)
l = max(0,idx-M)
r = min(N-M,idx+M)
for k in range(l,r) :
if chk(S[k:k+M],T) :
q.append(k)
if set(S) == {"#"} :
print("Yes")
else :
print("No")
N, M = map(int,input().split())
S = list(input())
T = input()
from collections import deque
q = deque([])
for i in range(N-M+1) :
if "".join(S[i:i+M]) == T :
q.append(i)
def chk(s_,t) :
rtn = False
for i, ch in enumerate(t) :
if s_[i] == "#" : continue
if s_[i] != ch : return False
rtn = True
return rtn
while q :
idx = q.popleft()
for j in range(M) :
if idx+j >= N : break
S[idx+j] = "#"
# print(S)
l = max(0,idx-M)
r = min(N-M+1,idx+M)
for k in range(l,r) :
if chk(S[k:k+M],T) :
q.append(k)
if set(S) == {"#"} :
print("Yes")
else :
print("No")
|
ConDefects/ConDefects/Code/abc329_e/Python/52726801
|
condefects-python_data_1584
|
N,M = map(int,input().split())
S = input()
T = input()
arr = [[0,0]]
for i in range(N-M+1):
if T == S[i:i+M]:
arr.append([i,i+M])
arr.append([N,N])
if not arr:
exit(print('No'))
for j,(l,r) in enumerate(arr):
if j==0 or j==len(arr)-1: continue
ll = arr[j-1][1]
rr = arr[j+1][0]
ok = {l}
minx = l
for x in range(l-1,ll-1,-1):
for i in range(1,M):
if x+i in ok and T[:i] == S[x:x+i]:
ok.add(x)
minx = x
arr[j][0] = minx
ok = {r}
maxx = r
for x in range(r+1,rr+1):
for i in range(1,M):
if x-i in ok and T[-i:] == S[x-i:x]:
ok.add(x)
maxx = x
arr[j][1] = maxx
for (_,l),(r,_) in zip(arr,arr[1:]):
if S[l:r] not in T:
exit(print('No'))
print('Yes')
N,M = map(int,input().split())
S = input()
T = input()
arr = [[0,0]]
for i in range(N-M+1):
if T == S[i:i+M]:
arr.append([i,i+M])
arr.append([N,N])
if not arr:
exit(print('No'))
for j,(l,r) in enumerate(arr):
if j==0 or j==len(arr)-1: continue
ll = arr[j-1][1]
rr = arr[j+1][0]
ok = {l}
minx = l
for x in range(l-1,ll-1,-1):
for i in range(1,M):
if x+i in ok and T[:i] == S[x:x+i]:
ok.add(x)
minx = x
arr[j][0] = minx
ok = {r}
maxx = r
for x in range(r+1,rr+1):
for i in range(1,M):
if x-i in ok and T[-i:] == S[x-i:x]:
ok.add(x)
maxx = x
arr[j][1] = maxx
if arr[1][0] != 0 or arr[-2][1] != N:
exit(print('No'))
for (_,l),(r,_) in zip(arr,arr[1:]):
if S[l:r] not in T:
exit(print('No'))
print('Yes')
|
ConDefects/ConDefects/Code/abc329_e/Python/52260983
|
condefects-python_data_1585
|
from itertools import combinations
N, M, K = map(int, input().split())
edge = []
for _ in range(M):
u, v, w = map(int, input().split())
edge.append([u - 1, v - 1, w])
def find(x):
if R[x] < 0:
return x
else:
R[x] = find(R[x])
return R[x]
def unite(root_a, root_b):
if root_a != root_b:
if R[root_a] > R[root_b]:
R[root_a] = root_b
elif R[root_b] > R[root_a]:
R[root_b] = root_a
elif R[root_a] == R[root_b]:
R[root_b] = root_a
R[root_a] -= 1
def group_size(R):
count = 0
for r in R:
if r < 0:
count += 1
return count
ans = 10**10
for edges in combinations(edge, N - 1): # 辺の数はN-1本でいい
R = [-1]*N
cost = 0
for edge in edges:
u, v, w = edge
root_u = find(u)
root_v = find(v)
unite(root_u, root_v)
cost += w
if group_size(R) == 1:
ans = min(cost%K, ans)
print(ans)
from itertools import combinations
N, M, K = map(int, input().split())
edge = []
for _ in range(M):
u, v, w = map(int, input().split())
edge.append([u - 1, v - 1, w])
def find(x):
if R[x] < 0:
return x
else:
R[x] = find(R[x])
return R[x]
def unite(root_a, root_b):
if root_a != root_b:
if R[root_a] > R[root_b]:
R[root_a] = root_b
elif R[root_b] > R[root_a]:
R[root_b] = root_a
elif R[root_a] == R[root_b]:
R[root_b] = root_a
R[root_a] -= 1
def group_size(R):
count = 0
for r in R:
if r < 0:
count += 1
return count
ans = 1 << 70
for edges in combinations(edge, N - 1): # 辺の数はN-1本でいい
R = [-1]*N
cost = 0
for edge in edges:
u, v, w = edge
root_u = find(u)
root_v = find(v)
unite(root_u, root_v)
cost += w
if group_size(R) == 1:
ans = min(cost%K, ans)
print(ans)
|
ConDefects/ConDefects/Code/abc328_e/Python/51767048
|
condefects-python_data_1586
|
import sys
sys.setrecursionlimit(10**8)
H, W = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
def perm(n):
rt = []
def iter(s, acc):
if not s:
rt.append(acc[:])
for i in range(len(s)):
v = s[i]
s.remove(v)
acc.append(v)
iter(s, acc)
acc.pop()
s.insert(i, v)
iter(list(range(n)), [])
return rt
def tp(tbl):
H = len(tbl)
W = len(tbl[0])
t = [['' for _ in range(H)] for _ in range(W)]
for i in range(H):
for j in range(W):
t[j][i] = tbl[i][j]
return t
def f(s):
n = 0
for i in range(len(s)):
for j in range(i):
if s[j] > s[i]:
n += 1
return n
ans = float('inf')
for p in perm(W):
tbl = []
for i in range(H):
t = []
for j in p:
t.append(A[i][j])
tbl.append(t)
if sorted(tbl) == sorted(B):
At = tp(tbl)
Bt = tp(B)
for q in perm(H):
tbl = []
for i in range(W):
t = []
for j in q:
t.append(At[i][j])
tbl.append(t)
if sorted(tbl) == sorted(Bt):
ans = min(ans, f(p) + f(q))
if ans == float('inf'):
ans = -1
print(ans)
import sys
sys.setrecursionlimit(10**8)
H, W = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(H)]
B = [list(map(int, input().split())) for _ in range(H)]
def perm(n):
rt = []
def iter(s, acc):
if not s:
rt.append(acc[:])
for i in range(len(s)):
v = s[i]
s.remove(v)
acc.append(v)
iter(s, acc)
acc.pop()
s.insert(i, v)
iter(list(range(n)), [])
return rt
def tp(tbl):
H = len(tbl)
W = len(tbl[0])
t = [['' for _ in range(H)] for _ in range(W)]
for i in range(H):
for j in range(W):
t[j][i] = tbl[i][j]
return t
def f(s):
n = 0
for i in range(len(s)):
for j in range(i):
if s[j] > s[i]:
n += 1
return n
ans = float('inf')
for p in perm(W):
tbl = []
for i in range(H):
t = []
for j in p:
t.append(A[i][j])
tbl.append(t)
if sorted(tbl) == sorted(B):
At = tp(tbl)
Bt = tp(B)
for q in perm(H):
tbl = []
for i in range(W):
t = []
for j in q:
t.append(At[i][j])
tbl.append(t)
if tbl == Bt:
ans = min(ans, f(p) + f(q))
if ans == float('inf'):
ans = -1
print(ans)
|
ConDefects/ConDefects/Code/abc332_d/Python/53758957
|
condefects-python_data_1587
|
from collections import defaultdict
H,W,N=map(int,input().split())
sx,sy=map(int,input().split())
gx,gy=map(int,input().split())
from collections import deque
import bisect
def bfs(s):
dq=deque()
dq.append([s,0])
high=defaultdict(lambda:-1)
high[s]=0
while len(dq)!=0:
p,h=dq.popleft()
x,y=p
go=[]
l=bisect.bisect_left(xs[x],y)
if 0<=l-1:
go.append((x,xs[x][l-1]+1))
if l<len(xs[x]):
go.append((y,xs[x][l]-1))
l=bisect.bisect_left(ys[y],x)
if 0<=l-1:
go.append((ys[y][l-1]+1,y))
if l<len(ys[y]):
go.append((ys[y][l]-1,y))
for g in go:
if high[g]==-1:
high[g]=h+1
dq.append([g,h+1])
return high
xs=defaultdict(list)
ys=defaultdict(list)
for _ in range(N):
x,y=map(int,input().split())
xs[x].append(y)
ys[y].append(x)
for k in xs.keys():
xs[k].sort()
for k in ys.keys():
ys[k].sort()
print(bfs((sx,sy))[(gx,gy)])
from collections import defaultdict
H,W,N=map(int,input().split())
sx,sy=map(int,input().split())
gx,gy=map(int,input().split())
from collections import deque
import bisect
def bfs(s):
dq=deque()
dq.append([s,0])
high=defaultdict(lambda:-1)
high[s]=0
while len(dq)!=0:
p,h=dq.popleft()
x,y=p
go=[]
l=bisect.bisect_left(xs[x],y)
if 0<=l-1:
go.append((x,xs[x][l-1]+1))
if l<len(xs[x]):
go.append((x,xs[x][l]-1))
l=bisect.bisect_left(ys[y],x)
if 0<=l-1:
go.append((ys[y][l-1]+1,y))
if l<len(ys[y]):
go.append((ys[y][l]-1,y))
for g in go:
if high[g]==-1:
high[g]=h+1
dq.append([g,h+1])
return high
xs=defaultdict(list)
ys=defaultdict(list)
for _ in range(N):
x,y=map(int,input().split())
xs[x].append(y)
ys[y].append(x)
for k in xs.keys():
xs[k].sort()
for k in ys.keys():
ys[k].sort()
print(bfs((sx,sy))[(gx,gy)])
|
ConDefects/ConDefects/Code/abc241_f/Python/41657280
|
condefects-python_data_1588
|
# begin template
# begin import
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
# import sys
# sys.setrecursionlimit(10**7)
import sys
from collections import deque
from collections import defaultdict
from collections import Counter
from copy import copy, deepcopy
from functools import cmp_to_key as cmpk
# end import
# begin io
def input():
return sys.stdin.readline().rstrip("\r\n")
def ii(): return int(input())
def gl(): return list(map(int, input().split()))
def gs(): return input().split()
def glm(h, w):
a = []
for i in range(h):
a.append(gl())
return a
def gsm(h):
a = []
for i in range(h):
a.append(input().split())
return a
def pyn(con, yes = 'Yes', no = 'No'):
if con: print('Yes')
else: print('No')
def perr(*l):
print(l, file = sys.stderr)
# end io
# unionfind
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
return dict(group_members)
def __str__(self):
return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
# end unionfind
# begin utils
def rev(a):
a = a[:]
return list(reversed(a))
def drev(d):
newd = {}
for k in rev(list(d.keys())):
newd[k] = d[k]
return newd
def dvsort(d):
return dict(sorted(d.items(), key = lambda x: x[1]))
def dksort(d):
return dict(sorted(d.items()))
def yn(con, yes = 'Yes', no = 'No'):
if con:
return yes
else:
return no
def kiriage(n, r):
if n % r == 0:
return n // r
else:
return (n // r) + 1
def ketawa(n):
ans = 0
s = str(n)
for i in s:
ans += int(i)
return ans
def sinhen(n, l):
if n < l:
return [n]
else:
return sinhen(n // l, l) + [n % l]
# end utils
# begin SortedSet
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedSet(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] < a[i + 1] for i in range(len(a) - 1)):
a = sorted(set(a))
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedSet" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]: break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def add(self, x: T) -> bool:
"Add an element and return True if added. / O(鬯ｩ蛹・ｽｽ・ｶ髣包ｽｳ隶壹・・ｽ・ｨ郢晢ｽｻ"
if self.size == 0:
self.a = [[x]]
self.size = 1
return True
a, i = self._position(x)
if i != len(a) and a[i] == x: return False
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
return True
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(鬯ｩ蛹・ｽｽ・ｶ髣包ｽｳ隶壹・・ｽ・ｨ郢晢ｽｻ"
if self.size == 0: return False
a, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return self._pop(a, i)
else:
for a in self.a:
if i < len(a): return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedMultiset(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
a = sorted(a)
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedMultiset" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]: break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def count(self, x: T) -> int:
"count the number of x."
return self.index_right(x) - self.index(x)
def add(self, x: T) -> None:
"Add an element. / O(鬯ｩ蛹・ｽｽ・ｶ髣包ｽｳ隶壹・・ｽ・ｨ郢晢ｽｻ"
if self.size == 0:
self.a = [[x]]
self.size = 1
return
a, i = self._position(x)
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(鬯ｩ蛹・ｽｽ・ｶ髣包ｽｳ隶壹・・ｽ・ｨ郢晢ｽｻ"
if self.size == 0: return False
a, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return self._pop(a, i)
else:
for a in self.a:
if i < len(a): return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
# end SortedSet
# begin heapq
# https://stackoverflow.com/questions/2501457/what-do-i-use-for-a-max-heap-implementation-in-python#answer-40455775
from heapq import heappop, heappush, heapify
class Heapq():
# def __init__(self, arr = []):
# self.hq = arr
# heapify(self.hq)
def __init__(self, arr = None):
if arr == None:
arr = []
self.hq = arr
heapify(self.hq)
def pop(self): return heappop(self.hq)
def append(self, a): heappush(self.hq, a)
def __len__(self): return len(self.hq)
def __getitem__(self, idx): return self.hq[idx]
class _MaxHeapObj(object):
def __init__(self, val): self.val = val
def __lt__(self, other): return self.val > other.val
def __eq__(self, other): return self.val == other.val
def __str__(self): return str(self.val)
class Maxheapq():
def __init__(self, arr = []):
self.hq = [_MaxHeapObj(e) for e in arr]
heapify(self.hq)
def pop(self): return heappop(self.hq).val
def append(self, a): heappush(self.hq, _MaxHeapObj(a))
def __len__(self): return len(self.hq)
def __getitem__(self, idx): return self.hq[idx].val
# end heapq
# begin const
al = "abcdefghijklmnopqrstuvwxyz"
au = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
yes='Yes'
no='No'
v4 = [[-1, 0], [0, -1], [0, 1], [1, 0]]
inf = float('inf')
ans = inf
cnt=0
_log = True
# end const
# end template
#main
h, w, n = gl()
sy, sx = gl()
sy -= 1
sx -= 1
gy, gx = gl()
gy -= 1
gx -= 1
ds = set()
dx = {}
dy = {}
for i in range(n):
y, x = gl()
y -= 1
x -= 1
ds.add((y, x))
if not y in dy.keys(): dy[y] = SortedSet()
dy[y].add(x)
if not x in dx.keys(): dx[x] = SortedSet()
dx[x].add(y)
vi = set()
q = deque()
q.append((0, sy, sx, None, None))
for v in v4:
ny = sy + v[0]
nx = sx + v[1]
if 0 <= ny < h and 0 <= nx < w and (ny, nx) in vi:
vi.add(y, x, v[0], v[1])
while len(q) != 0:
(now, y, x, vy, vx) = q.popleft()
if y == gy and x == gx:
print(now)
exit()
print(y, x)
if y in dy.keys() and (left := dy[y].le(x)) != None and (not (y, left+1, 0, -1) in vi):
q.append((now + 1, y, left + 1, 0, -1))
vi.add((y, left + 1, 0, -1))
if y in dy.keys() and (right := dy[y].ge(x)) != None and (not (y, right- 1, 0, 1) in vi):
q.append((now + 1, y, right - 1, 0, 1))
vi.add((y, right - 1, 0, 1))
if x in dx.keys() and (up := dx[x].le(y)) != None and (not (up + 1, x, -1, 0) in vi):
q.append((now + 1, up + 1, x, -1, 0))
vi.add((up + 1, x, -1, 0))
if x in dx.keys() and (down := dx[x].ge(y)) != None and (not (down - 1, x, 1, 0) in vi):
q.append((now + 1, down - 1, x, 1, 0))
vi.add((down - 1, x, 1, 0))
print(-1)
# begin template
# begin import
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
# import sys
# sys.setrecursionlimit(10**7)
import sys
from collections import deque
from collections import defaultdict
from collections import Counter
from copy import copy, deepcopy
from functools import cmp_to_key as cmpk
# end import
# begin io
def input():
return sys.stdin.readline().rstrip("\r\n")
def ii(): return int(input())
def gl(): return list(map(int, input().split()))
def gs(): return input().split()
def glm(h, w):
a = []
for i in range(h):
a.append(gl())
return a
def gsm(h):
a = []
for i in range(h):
a.append(input().split())
return a
def pyn(con, yes = 'Yes', no = 'No'):
if con: print('Yes')
else: print('No')
def perr(*l):
print(l, file = sys.stderr)
# end io
# unionfind
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
return dict(group_members)
def __str__(self):
return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())
# end unionfind
# begin utils
def rev(a):
a = a[:]
return list(reversed(a))
def drev(d):
newd = {}
for k in rev(list(d.keys())):
newd[k] = d[k]
return newd
def dvsort(d):
return dict(sorted(d.items(), key = lambda x: x[1]))
def dksort(d):
return dict(sorted(d.items()))
def yn(con, yes = 'Yes', no = 'No'):
if con:
return yes
else:
return no
def kiriage(n, r):
if n % r == 0:
return n // r
else:
return (n // r) + 1
def ketawa(n):
ans = 0
s = str(n)
for i in s:
ans += int(i)
return ans
def sinhen(n, l):
if n < l:
return [n]
else:
return sinhen(n // l, l) + [n % l]
# end utils
# begin SortedSet
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedSet(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedSet from iterable. / O(N) if sorted and unique / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] < a[i + 1] for i in range(len(a) - 1)):
a = sorted(set(a))
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedSet" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]: break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def add(self, x: T) -> bool:
"Add an element and return True if added. / O(鬯ｩ蛹・ｽｽ・ｶ髣包ｽｳ隶壹・・ｽ・ｨ郢晢ｽｻ"
if self.size == 0:
self.a = [[x]]
self.size = 1
return True
a, i = self._position(x)
if i != len(a) and a[i] == x: return False
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
return True
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(鬯ｩ蛹・ｽｽ・ｶ髣包ｽｳ隶壹・・ｽ・ｨ郢晢ｽｻ"
if self.size == 0: return False
a, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return self._pop(a, i)
else:
for a in self.a:
if i < len(a): return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedMultiset(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a: Optional[List[T]] = None) -> None:
"Evenly divide `a` into buckets."
if a is None: a = list(self)
size = len(a)
bucket_size = int(math.ceil(math.sqrt(size / self.BUCKET_RATIO)))
self.a = [a[size * i // bucket_size : size * (i + 1) // bucket_size] for i in range(bucket_size)]
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(a)
self.size = len(a)
if not all(a[i] <= a[i + 1] for i in range(len(a) - 1)):
a = sorted(a)
self._build(a)
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedMultiset" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int]:
"Find the bucket and position which x should be inserted. self must not be empty."
for a in self.a:
if x <= a[-1]: break
return (a, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, i = self._position(x)
return i != len(a) and a[i] == x
def count(self, x: T) -> int:
"count the number of x."
return self.index_right(x) - self.index(x)
def add(self, x: T) -> None:
"Add an element. / O(鬯ｩ蛹・ｽｽ・ｶ髣包ｽｳ隶壹・・ｽ・ｨ郢晢ｽｻ"
if self.size == 0:
self.a = [[x]]
self.size = 1
return
a, i = self._position(x)
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.REBUILD_RATIO:
self._build()
def _pop(self, a: List[T], i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: self._build()
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(鬯ｩ蛹・ｽｽ・ｶ髣包ｽｳ隶壹・・ｽ・ｨ郢晢ｽｻ"
if self.size == 0: return False
a, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return self._pop(a, i)
else:
for a in self.a:
if i < len(a): return self._pop(a, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
# end SortedSet
# begin heapq
# https://stackoverflow.com/questions/2501457/what-do-i-use-for-a-max-heap-implementation-in-python#answer-40455775
from heapq import heappop, heappush, heapify
class Heapq():
# def __init__(self, arr = []):
# self.hq = arr
# heapify(self.hq)
def __init__(self, arr = None):
if arr == None:
arr = []
self.hq = arr
heapify(self.hq)
def pop(self): return heappop(self.hq)
def append(self, a): heappush(self.hq, a)
def __len__(self): return len(self.hq)
def __getitem__(self, idx): return self.hq[idx]
class _MaxHeapObj(object):
def __init__(self, val): self.val = val
def __lt__(self, other): return self.val > other.val
def __eq__(self, other): return self.val == other.val
def __str__(self): return str(self.val)
class Maxheapq():
def __init__(self, arr = []):
self.hq = [_MaxHeapObj(e) for e in arr]
heapify(self.hq)
def pop(self): return heappop(self.hq).val
def append(self, a): heappush(self.hq, _MaxHeapObj(a))
def __len__(self): return len(self.hq)
def __getitem__(self, idx): return self.hq[idx].val
# end heapq
# begin const
al = "abcdefghijklmnopqrstuvwxyz"
au = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
yes='Yes'
no='No'
v4 = [[-1, 0], [0, -1], [0, 1], [1, 0]]
inf = float('inf')
ans = inf
cnt=0
_log = True
# end const
# end template
#main
h, w, n = gl()
sy, sx = gl()
sy -= 1
sx -= 1
gy, gx = gl()
gy -= 1
gx -= 1
ds = set()
dx = {}
dy = {}
for i in range(n):
y, x = gl()
y -= 1
x -= 1
ds.add((y, x))
if not y in dy.keys(): dy[y] = SortedSet()
dy[y].add(x)
if not x in dx.keys(): dx[x] = SortedSet()
dx[x].add(y)
vi = set()
q = deque()
q.append((0, sy, sx, None, None))
for v in v4:
ny = sy + v[0]
nx = sx + v[1]
if 0 <= ny < h and 0 <= nx < w and (ny, nx) in vi:
vi.add(y, x, v[0], v[1])
while len(q) != 0:
(now, y, x, vy, vx) = q.popleft()
if y == gy and x == gx:
print(now)
exit()
# print(y, x)
if y in dy.keys() and (left := dy[y].le(x)) != None and (not (y, left+1, 0, -1) in vi):
q.append((now + 1, y, left + 1, 0, -1))
vi.add((y, left + 1, 0, -1))
if y in dy.keys() and (right := dy[y].ge(x)) != None and (not (y, right- 1, 0, 1) in vi):
q.append((now + 1, y, right - 1, 0, 1))
vi.add((y, right - 1, 0, 1))
if x in dx.keys() and (up := dx[x].le(y)) != None and (not (up + 1, x, -1, 0) in vi):
q.append((now + 1, up + 1, x, -1, 0))
vi.add((up + 1, x, -1, 0))
if x in dx.keys() and (down := dx[x].ge(y)) != None and (not (down - 1, x, 1, 0) in vi):
q.append((now + 1, down - 1, x, 1, 0))
vi.add((down - 1, x, 1, 0))
print(-1)
|
ConDefects/ConDefects/Code/abc241_f/Python/51143333
|
condefects-python_data_1589
|
n=int(input())
k=set([])
for i in range(n):
s=input()
S=[]
for i in range(len(s)):
S.append(s[i])
t=""
for i in range(len(s)):
t+=S[len(s)-1-i]
if not s in k:
if len(s)==1:
k.add(s)
k.add(s+str(1))
else:
k.add(s)
k.add(t)
print(int(len(k)/2))
n=int(input())
k=set([])
for i in range(n):
s=input()
S=[]
for i in range(len(s)):
S.append(s[i])
t=""
for i in range(len(s)):
t+=S[len(s)-1-i]
if not s in k:
if s==t:
k.add(s)
k.add(s+str(1))
else:
k.add(s)
k.add(t)
print(int(len(k)/2))
|
ConDefects/ConDefects/Code/abc310_c/Python/45695385
|
condefects-python_data_1590
|
N = int(input())
Z = set()
count = 0
for i in range(N):
S = input()
if S in Z:
count += 1
Z.add(S)
Z.add(S[::-1])
print(count)
N = int(input())
Z = set()
count = 0
for i in range(N):
S = input()
if S not in Z:
count += 1
Z.add(S)
Z.add(S[::-1])
print(count)
|
ConDefects/ConDefects/Code/abc310_c/Python/45952581
|
condefects-python_data_1591
|
from collections import defaultdict
class UnionFind():
"""
Union Find木クラス
Attributes
--------------------
n : int
要素数
root : list
木の要素数
0未満であればそのノードが根であり、添字の値が要素数
rank : list
木の深さ
"""
def __init__(self, n):
"""
Parameters
---------------------
n : int
要素数
"""
self.n = n
self.root = [-1]*(n+1)
self.rank = [0]*(n+1)
def find(self, x):
"""
ノードxの根を見つける
Parameters
---------------------
x : int
見つけるノード
Returns
---------------------
root : int
根のノード
"""
if(self.root[x] < 0):
return x
else:
self.root[x] = self.find(self.root[x])
return self.root[x]
def unite(self, x, y):
"""
木の併合
Parameters
---------------------
x : int
併合したノード
y : int
併合したノード
"""
x = self.find(x)
y = self.find(y)
if(x == y):
return
elif(self.rank[x] > self.rank[y]):
self.root[x] += self.root[y]
self.root[y] = x
else:
self.root[y] += self.root[x]
self.root[x] = y
if(self.rank[x] == self.rank[y]):
self.rank[y] += 1
def same(self, x, y):
"""
同じグループに属するか判定
Parameters
---------------------
x : int
判定したノード
y : int
判定したノード
Returns
---------------------
ans : bool
同じグループに属しているか
"""
return self.find(x) == self.find(y)
def size(self, x):
"""
木のサイズを計算
Parameters
---------------------
x : int
計算したい木のノード
Returns
---------------------
size : int
木のサイズ
"""
return -self.root[self.find(x)]
def roots(self):
"""
根のノードを取得
Returns
---------------------
roots : list
根のノード
"""
return [i for i, x in enumerate(self.root) if x < 0]
def group_size(self):
"""
グループ数を取得
Returns
---------------------
size : int
グループ数
"""
return len(self.roots())
def group_members(self):
"""
全てのグループごとのノードを取得
Returns
---------------------
group_members : defaultdict
根をキーとしたノードのリスト
"""
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
def check_circle_line(x, y, r, sx, sy):
return (x-sx)**2 + (y-sy)**2 == r**2
def main():
N = ini()
uf = UnionFind(N)
sx, sy, tx, ty = mapint()
st = []
end = []
circles = []
for i in range(N):
x, y, r = mapint()
circles.append((x, y, r))
if check_circle_line(x, y, r, sx, sy):
st.append(i)
if check_circle_line(x, y, r, tx, ty):
end.append(i)
for i in range(N - 1):
for j in range(i+1, N):
x1, y1, r1 = circles[i]
x2, y2, r2 = circles[j]
# 円1の外側か
if (x1-x2)**2 + (y1-y2)**2 >= r1**2:
if (x1-x2)**2 + (y1-y2)**2 <= (r1+r2)**2:
uf.unite(i, j)
else:
if r1 < r2:
r1, r2 = r2, r1
if (x1-x2)**2 + (y1-y2)**2 + r2**2 >= r1**2:
uf.unite(i, j)
if uf.same(st[0], end[0]):
print("Yes")
return
print("No")
def ini(): return int(input())
def mapint(): return map(int, input().split())
def mapint0(): return map(lambda x: int(x)-1, input().split())
def mapstr(): return input().split()
def lint(): return list(map(int, input().split()))
def lint0(): return list(map(lambda x: int(x)-1, input().split()))
def lstr(): return list(input().rstrip())
def errprint(*x): return None if atcenv else print(*x, file=sys.stderr)
if __name__=="__main__":
import sys, os
input = sys.stdin.readline
atcenv = os.environ.get("ATCODER", 0)
main()
from collections import defaultdict
class UnionFind():
"""
Union Find木クラス
Attributes
--------------------
n : int
要素数
root : list
木の要素数
0未満であればそのノードが根であり、添字の値が要素数
rank : list
木の深さ
"""
def __init__(self, n):
"""
Parameters
---------------------
n : int
要素数
"""
self.n = n
self.root = [-1]*(n+1)
self.rank = [0]*(n+1)
def find(self, x):
"""
ノードxの根を見つける
Parameters
---------------------
x : int
見つけるノード
Returns
---------------------
root : int
根のノード
"""
if(self.root[x] < 0):
return x
else:
self.root[x] = self.find(self.root[x])
return self.root[x]
def unite(self, x, y):
"""
木の併合
Parameters
---------------------
x : int
併合したノード
y : int
併合したノード
"""
x = self.find(x)
y = self.find(y)
if(x == y):
return
elif(self.rank[x] > self.rank[y]):
self.root[x] += self.root[y]
self.root[y] = x
else:
self.root[y] += self.root[x]
self.root[x] = y
if(self.rank[x] == self.rank[y]):
self.rank[y] += 1
def same(self, x, y):
"""
同じグループに属するか判定
Parameters
---------------------
x : int
判定したノード
y : int
判定したノード
Returns
---------------------
ans : bool
同じグループに属しているか
"""
return self.find(x) == self.find(y)
def size(self, x):
"""
木のサイズを計算
Parameters
---------------------
x : int
計算したい木のノード
Returns
---------------------
size : int
木のサイズ
"""
return -self.root[self.find(x)]
def roots(self):
"""
根のノードを取得
Returns
---------------------
roots : list
根のノード
"""
return [i for i, x in enumerate(self.root) if x < 0]
def group_size(self):
"""
グループ数を取得
Returns
---------------------
size : int
グループ数
"""
return len(self.roots())
def group_members(self):
"""
全てのグループごとのノードを取得
Returns
---------------------
group_members : defaultdict
根をキーとしたノードのリスト
"""
group_members = defaultdict(list)
for member in range(self.n):
group_members[self.find(member)].append(member)
return group_members
def check_circle_line(x, y, r, sx, sy):
return (x-sx)**2 + (y-sy)**2 == r**2
def main():
N = ini()
uf = UnionFind(N)
sx, sy, tx, ty = mapint()
st = []
end = []
circles = []
for i in range(N):
x, y, r = mapint()
circles.append((x, y, r))
if check_circle_line(x, y, r, sx, sy):
st.append(i)
if check_circle_line(x, y, r, tx, ty):
end.append(i)
for i in range(N - 1):
for j in range(i+1, N):
x1, y1, r1 = circles[i]
x2, y2, r2 = circles[j]
# 円1の外側か
if (x1-x2)**2 + (y1-y2)**2 >= r1**2:
if (x1-x2)**2 + (y1-y2)**2 <= (r1+r2)**2:
uf.unite(i, j)
else:
if r1 < r2:
r1, r2 = r2, r1
if (x1-x2)**2 + (y1-y2)**2 >= (r1-r2)**2:
uf.unite(i, j)
if uf.same(st[0], end[0]):
print("Yes")
return
print("No")
def ini(): return int(input())
def mapint(): return map(int, input().split())
def mapint0(): return map(lambda x: int(x)-1, input().split())
def mapstr(): return input().split()
def lint(): return list(map(int, input().split()))
def lint0(): return list(map(lambda x: int(x)-1, input().split()))
def lstr(): return list(input().rstrip())
def errprint(*x): return None if atcenv else print(*x, file=sys.stderr)
if __name__=="__main__":
import sys, os
input = sys.stdin.readline
atcenv = os.environ.get("ATCODER", 0)
main()
|
ConDefects/ConDefects/Code/abc259_d/Python/53573512
|
condefects-python_data_1592
|
class UnionFind:
def __init__(self, n:int) -> None:
self.parents = list(range(n))
self.rank = [0] * n
def find(self, x:int) -> int:
if self.parents[x] == x:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x:int, y:int) -> None:
root_x, root_y = self.find(x), self.find(y)
if root_x == root_y:
return
if self.rank[root_x] < self.rank[root_y]:
root_x, root_y = root_y, root_x
self.parents[root_y] = root_x
if self.rank[root_x] == self.rank[root_y]:
self.rank[root_x] += 1
def same(self, x:int, y:int) -> bool:
return self.find(x) == self.find(y)
def diff(x, y, v, w):
return (x-v)**2+(v-w)**2
N = int(input())
uf = UnionFind(N+2)
ma = {}
radius = [0 for i in range(N+2)]
sx, sy, tx, ty = map(int, input().split())
for i in range(N):
x, y, r = map(int, input().split())
radius[i] = r
ma[(x, y)] = i
ma[(sx, sy)] = N
ma[(tx, ty)] = N+1
for x, y in ma.keys():
for v, w in ma.keys():
numxy = ma[(x, y)]
numvw = ma[(v, w)]
if x == v and y == w:
continue
d2 = diff(x, y, v, w)
if (radius[numxy]-radius[numvw])**2 <= d2 <= (radius[numxy]+radius[numvw])**2:
uf.union(numxy, numvw)
if uf.same(ma[(sx, sy)], ma[(tx, ty)]):
print("Yes")
else:
print("No")
class UnionFind:
def __init__(self, n:int) -> None:
self.parents = list(range(n))
self.rank = [0] * n
def find(self, x:int) -> int:
if self.parents[x] == x:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x:int, y:int) -> None:
root_x, root_y = self.find(x), self.find(y)
if root_x == root_y:
return
if self.rank[root_x] < self.rank[root_y]:
root_x, root_y = root_y, root_x
self.parents[root_y] = root_x
if self.rank[root_x] == self.rank[root_y]:
self.rank[root_x] += 1
def same(self, x:int, y:int) -> bool:
return self.find(x) == self.find(y)
def diff(x, y, v, w):
return (x-v)**2+(y-w)**2
N = int(input())
uf = UnionFind(N+2)
ma = {}
radius = [0 for i in range(N+2)]
sx, sy, tx, ty = map(int, input().split())
for i in range(N):
x, y, r = map(int, input().split())
radius[i] = r
ma[(x, y)] = i
ma[(sx, sy)] = N
ma[(tx, ty)] = N+1
for x, y in ma.keys():
for v, w in ma.keys():
numxy = ma[(x, y)]
numvw = ma[(v, w)]
if x == v and y == w:
continue
d2 = diff(x, y, v, w)
if (radius[numxy]-radius[numvw])**2 <= d2 <= (radius[numxy]+radius[numvw])**2:
uf.union(numxy, numvw)
if uf.same(ma[(sx, sy)], ma[(tx, ty)]):
print("Yes")
else:
print("No")
|
ConDefects/ConDefects/Code/abc259_d/Python/52382935
|
condefects-python_data_1593
|
from collections import defaultdict
import sys
sys.setrecursionlimit(10**5)
N = int(input())
sx,sy,tx,ty = list(map(int,input().split()))
circles = []
for i in range(N):
x,y,r = list(map(int,input().split()))
circles.append((x,y,r))
s_maru = -1
t_maru = -1
for i in range(N):
x,y,r = circles[i]
if((sx-x)**2+(sy-y)**2 == r**2):
s_maru = i
if((tx-x)**2+(ty-y)**2 == r**2):
t_maru = i
if(s_maru == t_maru):
print("Yes")
exit()
edge = defaultdict(set)
for i in range(N):
for j in range(N):
if(i == j):continue
x1,y1,r1 = circles[i]
x2,y2,r2 = circles[j]
if((r1-r2)**2 <= (x2-x1)**2+(y2-y1)**2 <= (r1+r2)**2):
edge[i].add(j)
edge[j].add(i)
used = [False for _ in range(N)]
def dfs(n):
used[n] = True
for i in edge[n]:
if(i == t_maru):
print("Yes")
exit()
if(not used[i]):
dfs(i)
dfs(s_maru)
print("No")
from collections import defaultdict
import sys
sys.setrecursionlimit(10**5)
N = int(input())
sx,sy,tx,ty = list(map(int,input().split()))
circles = []
for i in range(N):
x,y,r = list(map(int,input().split()))
circles.append((x,y,r))
s_maru = -1
t_maru = -1
for i in range(N):
x,y,r = circles[i]
if((sx-x)**2+(sy-y)**2 == r**2):
s_maru = i
if((tx-x)**2+(ty-y)**2 == r**2):
t_maru = i
if(s_maru == t_maru and s_maru != -1):
print("Yes")
exit()
edge = defaultdict(set)
for i in range(N):
for j in range(N):
if(i == j):continue
x1,y1,r1 = circles[i]
x2,y2,r2 = circles[j]
if((r1-r2)**2 <= (x2-x1)**2+(y2-y1)**2 <= (r1+r2)**2):
edge[i].add(j)
edge[j].add(i)
used = [False for _ in range(N)]
def dfs(n):
used[n] = True
for i in edge[n]:
if(i == t_maru):
print("Yes")
exit()
if(not used[i]):
dfs(i)
dfs(s_maru)
print("No")
|
ConDefects/ConDefects/Code/abc259_d/Python/54723545
|
condefects-python_data_1594
|
import sys, itertools, functools, collections, bisect, math
from math import factorial as fact
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rmi = lambda: map(int, input().split())
ra = lambda: [int(x) for x in input().split()]
INF = 10**18
MOD = 10**9+7
def solve():
ans = 0
for mask in range(1 << m):
cur = 0
for i in range(m):
if mask & 1 << i:
for val in tmp[i]:
cur |= 1 << val
if bin(cur).count('1') == m:
ans += 1
return ans
test_case = 1
for _ in range(test_case):
n, m = rmi()
#for mask in range(1 << m):
tmp = []
for _ in range(m):
c = ri()
tmp.append(ra())
print(solve())
import sys, itertools, functools, collections, bisect, math
from math import factorial as fact
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rmi = lambda: map(int, input().split())
ra = lambda: [int(x) for x in input().split()]
INF = 10**18
MOD = 10**9+7
def solve():
ans = 0
for mask in range(1 << m):
cur = 0
for i in range(m):
if mask & 1 << i:
for val in tmp[i]:
cur |= 1 << val
if bin(cur).count('1') == n:
ans += 1
return ans
test_case = 1
for _ in range(test_case):
n, m = rmi()
#for mask in range(1 << m):
tmp = []
for _ in range(m):
c = ri()
tmp.append(ra())
print(solve())
|
ConDefects/ConDefects/Code/abc289_c/Python/45332649
|
condefects-python_data_1595
|
import itertools
n,m = map(int,input().split())
l = []
for i in range(m):
c = int(input())
a = list(map(int,input().split()))
l.append(a)
ans = 0
for i in range(1,n+1):
for j in itertools.combinations(l,i):
s = set([])
for k in j:
s = s | set(k)
if len(s) == n:
ans += 1
print(ans)
import itertools
n,m = map(int,input().split())
l = []
for i in range(m):
c = int(input())
a = list(map(int,input().split()))
l.append(a)
ans = 0
for i in range(1,m+1):
for j in itertools.combinations(l,i):
s = set([])
for k in j:
s = s | set(k)
if len(s) == n:
ans += 1
print(ans)
|
ConDefects/ConDefects/Code/abc289_c/Python/45901971
|
condefects-python_data_1596
|
N = int(input())
A = list(map(int,input().split()))
check = [[] for _ in range(N+1)]
for i in range(N):
check[A[i]].append(i)
ans = 0
for i in check:
tmp = []
for j in range(len(i)-1):
tmp.append(i[j+1]-i[j]-1)
for j in range(len(tmp)):
ans += tmp[j]*(len(tmp)-j)
print(ans)
N = int(input())
A = list(map(int,input().split()))
check = [[] for _ in range(N+1)]
for i in range(N):
check[A[i]].append(i)
ans = 0
for i in check:
tmp = []
for j in range(len(i)-1):
tmp.append(i[j+1]-i[j]-1)
for j in range(len(tmp)):
ans += tmp[j]*((j+1)*(len(tmp)-j))
print(ans)
|
ConDefects/ConDefects/Code/abc318_e/Python/45971987
|
condefects-python_data_1597
|
N=int(input())
A = list(map(int, input().split()))
l = [[] for i in range(3*10**5+1)]
for i,j in enumerate(A):
l[j].append(i)
#print(l[1])
ans=0
for i in range(1,300001):
now = l[i]
cnt = 0
M = len(now)-1
for j in range(len(now)-1):
space = now[j+1]-now[j]-1
cnt += M-j
ans += cnt * space
cnt-=1
print(ans)
N=int(input())
A = list(map(int, input().split()))
l = [[] for i in range(3*10**5+1)]
for i,j in enumerate(A):
l[j].append(i)
#print(l[1])
ans=0
for i in range(1,300001):
now = l[i]
cnt = 0
M = len(now)-1
for j in range(len(now)-1):
space = now[j+1]-now[j]-1
cnt += M-j
ans += cnt * space
cnt-=(j+1)
print(ans)
|
ConDefects/ConDefects/Code/abc318_e/Python/45983420
|
condefects-python_data_1598
|
import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
#input = sys.stdin.readline
mod = 998344353
n = int(input())
#https://qiita.com/Kiri8128/items/cbaa021dbcb07b5fdb92#非再帰-bfs
edge = [[] for i in range(n)]
for i in range(n-1):
u,v = map(int,input().split())
u-=1
v-=1
edge[u].append(v)
edge[v].append(u)
plist = [-1 for i in range(n)]
d = collections.deque()
r = []
d.append(0)
while d:
now = d.popleft()
r.append(now)
for i in edge[now]:
plist[i] = now
d.append(i)
edge[i].remove(now)
dp = [[[0 for j in range(2)] for gwfingrwin in range(2)] for i in range(n)]
for i in range(n):
dp[i][1][1] = 1
dp[i][0][0] = 1
for i in r[::-1]:
for k in range(len(edge[i])):
l = edge[i][k]
jdp = [[0 for j in range(len(dp[i][0]) + len(dp[l][0]) - 1)] for frfi in range(2)]
for x in range(len(dp[l][0])):
for y in range(len(dp[i][0])):
jdp[0][x+y] += dp[i][0][y] * dp[l][0][x]
jdp[0][x+y] += dp[i][0][y] * dp[l][1][x]
jdp[1][x+y] += dp[i][1][y] * dp[l][0][x]
if x+y != 0:
jdp[1][x+y-1] += dp[i][1][y] * dp[l][1][x]
jdp[1][x+y-1] %= mod
jdp[0][x+y] %= mod
jdp[1][x+y] %= mod
dp[i][0] = jdp[0][:]
dp[i][1] = jdp[1][:]
for i in range(1,n+1):
print((dp[0][0][i] + dp[0][1][i]) % mod)
import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
#input = sys.stdin.readline
mod = 998244353
n = int(input())
#https://qiita.com/Kiri8128/items/cbaa021dbcb07b5fdb92#非再帰-bfs
edge = [[] for i in range(n)]
for i in range(n-1):
u,v = map(int,input().split())
u-=1
v-=1
edge[u].append(v)
edge[v].append(u)
plist = [-1 for i in range(n)]
d = collections.deque()
r = []
d.append(0)
while d:
now = d.popleft()
r.append(now)
for i in edge[now]:
plist[i] = now
d.append(i)
edge[i].remove(now)
dp = [[[0 for j in range(2)] for gwfingrwin in range(2)] for i in range(n)]
for i in range(n):
dp[i][1][1] = 1
dp[i][0][0] = 1
for i in r[::-1]:
for k in range(len(edge[i])):
l = edge[i][k]
jdp = [[0 for j in range(len(dp[i][0]) + len(dp[l][0]) - 1)] for frfi in range(2)]
for x in range(len(dp[l][0])):
for y in range(len(dp[i][0])):
jdp[0][x+y] += dp[i][0][y] * dp[l][0][x]
jdp[0][x+y] += dp[i][0][y] * dp[l][1][x]
jdp[1][x+y] += dp[i][1][y] * dp[l][0][x]
if x+y != 0:
jdp[1][x+y-1] += dp[i][1][y] * dp[l][1][x]
jdp[1][x+y-1] %= mod
jdp[0][x+y] %= mod
jdp[1][x+y] %= mod
dp[i][0] = jdp[0][:]
dp[i][1] = jdp[1][:]
for i in range(1,n+1):
print((dp[0][0][i] + dp[0][1][i]) % mod)
|
ConDefects/ConDefects/Code/abc287_f/Python/51238563
|
condefects-python_data_1599
|
n, m = map(int, input().split())
p = []
c = []
f = []
for i in range(n):
l = list(map(int, input().split()))
p.append(l[0])
c.append(l[1])
f.append(set(l[2:]))
for i in range(n):
for j in range(n):
if p[i] >= p[j]:
if f[j].issuperset(f[i]):
print("Yes")
exit(0)
print("No")
n, m = map(int, input().split())
p = []
c = []
f = []
for i in range(n):
l = list(map(int, input().split()))
p.append(l[0])
c.append(l[1])
f.append(set(l[2:]))
for i in range(n):
for j in range(n):
if p[i] >= p[j]:
if f[j].issuperset(f[i]) and (p[i] > p[j] or len(f[j]) > len(f[i])):
print("Yes")
exit(0)
print("No")
|
ConDefects/ConDefects/Code/abc310_b/Python/45545558
|
condefects-python_data_1600
|
N, M = map(int, input().split())
product = [list(map(int, input().split())) for _ in range(N)]
product.sort(reverse=True)
answer = False
for i in range(N):
for j in range(i+1, N):
Pi = product[i][0]
Pj = product[j][0]
Fi = set(product[i][2:])
Fj = set(product[j][2:])
if Fi <= Fj and (Pi > Pj or Fi < Fj):
answer = True
print("Yes" if answer else "No")
N, M = map(int, input().split())
product = [list(map(int, input().split())) for _ in range(N)]
product.sort(reverse=True)
answer = False
for i in range(N):
for j in range(i+1, N):
Pi = product[i][0]
Pj = product[j][0]
Fi = set(product[i][2:])
Fj = set(product[j][2:])
if Fi <= Fj and (Pi > Pj or Fi < Fj):
answer = True
if Pi == Pj and (Fi < Fj or Fi > Fj):
answer = True
print("Yes" if answer else "No")
|
ConDefects/ConDefects/Code/abc310_b/Python/46023032
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.