input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
prev = 1
for i in range(k):
prev *= a[i]
for i in range(k,n):
cur = (prev//a[i-k])*a[i]
print(("Yes" if cur > prev else "No"))
prev = cur | import math as m
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
prev = 1
for i in range(k):
prev += m.log(a[i])
for i in range(k,n):
cur = prev + m.log(a[i])
cur -= m.log(a[i-k])
print(("Yes" if cur > prev else "No"))
prev = cur | p02602 |
N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
s=[]
for j in range(K-1,N):
score=1
for i in range(j-K+1,j+1):
score*=A[i]
s.append(score)
for i in range(len(s)-1):
if s[i]<s[i+1]:
print("Yes")
else:
print("No") | N,K=list(map(int,input().split()))
A=list(map(int,input().split()))
for i in range(N-K):
if A[i]<A[i+K]:
print("Yes")
else:
print("No") | p02602 |
#!/usr/bin/env python3
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
point = [1] * K
point[0] = A[0]
for i in range(1, K):
point[i] = point[i - 1] * A[i]
ans = ['No'] * (N - K)
p = point[K - 1]
for i in range(N - K):
... | #!/usr/bin/env python3
def main():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
ans = ['No'] * (N - K)
for i in range(N - K):
tmp = A[K + i] / A[i]
if 1 < tmp:
ans[i] = 'Yes'
print(("\n".join(ans)))
if __name__ == "__main__"... | p02602 |
sem, per = list(map(int, input().split()))
scores = list(map(int, input().split()))
period_score = []
for i in range(len(scores) - (per - 1)):
period = scores[i:per + i]
temp = period[0]
for j in range(1, per):
temp *= period[j]
period_score.append(temp)
for k in range... | sem, per = list(map(int, input().split()))
scores = list(map(int, input().split()))
for i in range(sem - per):
if scores[i] < scores[i + per] :
print('Yes')
else:
print('No') | p02602 |
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(n):
if i + k >= n:
exit()
a = A[i:i+k]
pre = a[0]
aft = A[i+k]
if pre >= aft:
print('No')
else:
print('Yes')
| n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(n):
if i + k >= n:
exit()
pre = A[i]
aft = A[i+k]
if pre >= aft:
print('No')
else:
print('Yes')
| p02602 |
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(n-k):
if A[i] < A[k+i]:
print("Yes")
else:
print("No")
| n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(n-k):
if A[i] >= A[i+k]:
print("No")
else:
print("Yes")
| p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
s = 1
for i in range(k):
s *= a[i]
# s = sum(a[:k])
pre = s
for i in range(1,n-k+1):
s /= a[i-1]
s *= a[i+k-1]
if s > pre:
print("Yes")
else:
print("No")
pre = s
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
# s = 1
# for i in range(k):
# s *= a[i]
# # s = sum(a[:k])
# pre = s
for i in range(1,n-k+1):
if a[i+k-1]/a[i-1]>1:
print("Yes")
else:
print("No")
| p02602 |
from collections import deque
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
prev = 1
for i in range(k):
prev *= a[i]
a_old = deque(a)
a = deque(a[k:])
for i in range(k, n):
score = prev*a.popleft() / a_old.popleft()
if score <= prev:
print('No')
else:... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n-k):
if a[i+k] <= a[i]:
print('No')
else:
print('Yes')
| p02602 |
import os
import heapq
import sys
import math
import bisect
import operator
from collections import defaultdict
from io import BytesIO, IOBase
def gcd(a,b):
if b==0:
return a
else:
return gcd(b,a%b)
def power(x, p,m):
res = 1
while p:
if p & 1:
res ... | import os
import heapq
import sys
import math
import bisect
import operator
from collections import defaultdict
from io import BytesIO, IOBase
def gcd(a,b):
if b==0:
return a
else:
return gcd(b,a%b)
def power(x, p,m):
res = 1
while p:
if p & 1:
res ... | p02602 |
n,k=map(int,input().split())
a=list(map(int,input().split()))
for i in range(n-k):
print("Yes")if a[k+i]>a[i] else print("No")
| n,k=map(int,input().split())
a=list(map(int,input().split()))
for i in range(n-k):
print("Yes")if a[i]<a[k+i] else print("No")
| p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
hyoten = [1]*(n-k+1)
for i in range(n-k+1):
for j in range(i, i+k):
hyoten[i] *= a[j]
for i in range(n-k):
if hyoten[i+1] > hyoten[i]:
print("Yes")
else:
print("No")
| n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n-k):
if a[i] < a[i+k]:
print("Yes")
elif a[i] >= a[i+k]:
print("No")
| p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
total = 1
for i in range(k - 1, -1, -1):
total *= a[i]
after = total
for i in range(k + 1, n + 1):
before = total
after //= a[i - k - 1]
after *= a[i - 1]
if before < after:
print("Yes")
else:
... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(k + 1, n + 1):
if a[i - k - 1] < a[i - 1]:
print("Yes")
else:
print("No")
| p02602 |
n, k = list(map(int, input().split()))
aas = list(map(int, input().split()))
scores = []
cnt = 0
tmp = 1
for i in range(n):
tmp *= aas[i]
if i >= k-1:
scores.append(tmp)
tmp //= aas[i-(k-1)]
for i in range(1,len(scores)):
if scores[i] > scores[i-1]:
print('Yes')
else... | n, k = list(map(int, input().split()))
aas = list(map(int, input().split()))
scores = []
for i in range(k,n):
if aas[i] > aas[i-k]:
print('Yes')
else:
print('No') | p02602 |
# 2020/07/25
# M-SOLUTIONS プロコンオープン 2020 - C
# Input
n, k = list(map(int,input().split()))
a = list(map(int,input().split()))
# Calc
pt = a[0]
for i in range(1, k):
pt = pt * a[i]
for i in range(k, n):
bef_pt = pt
pt = pt * a[i] // a[i-k]
# Output
if bef_pt < pt:
pri... | # 2020/07/25
# M-SOLUTIONS プロコンオープン 2020 - C
# Input
n, k = list(map(int,input().split()))
a = list(map(int,input().split()))
# Calc
for i in range(k, n):
# Output
if a[i] > a[i-k]:
print('Yes')
else:
print('No')
| p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
now_sum_val = 1
for i in range(K):
now_sum_val *= A[i]
for i in range(K, N):
next_sum_val = now_sum_val // A[i - K] * A[i]
if next_sum_val > now_sum_val:
print('Yes')
else:
print('No')
now_sum_val =... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(K, N):
# next_sum_val = now_sum_val // A[i - K] * A[i]
if A[i] > A[i - K]:
print('Yes')
else:
print('No') | p02602 |
import os
import sys
from io import BytesIO, IOBase
from collections import defaultdict as dd
def main():
n,k=list(map(int,input().split()))
ar=list(map(int,input().split()))
prod=1
for i in range(k):
prod*=ar[i]
for i in range(k,n):
x=prod*ar[i]//ar[i-k]
if x>p... | from math import log2
n,k=list(map(int,input().split()))
ar=list(map(int,input().split()))
for i in range(n):
ar[i]=log2(ar[i])
prod=0
for i in range(k):
prod+=ar[i]
for i in range(k,n):
x=prod+ar[i]-ar[i-k]
if x>prod:
print('Yes')
else:
print('No')
prod=x
| p02602 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
now = 1
for i in range(k):
now *= a[i]
for i in range(k,n):
ima = now * a[i]
ima //= a[i-k]
if ima > now:
print("Yes")
else:
print("No")
now = ima | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
for i in range(k,n):
if a[i]/a[i-k] > 1:
print("Yes")
else:
print("No") | p02602 |
N,K=list(map(int,input().split()))
A = list(map(int,input().split()))
s0=1
for i in range(1,K+1):
s0=s0*A[K-i]
for i in range(N-K):
s1=s0/A[K-K+i]*A[K+i]
if s1>s0:
print('Yes')
else:
print('No')
s0=s1 | N,K=list(map(int,input().split()))
A = list(map(int,input().split()))
s0=A[0]
for i in range(N-K):
s1=A[K+i]
if s1>s0:
print('Yes')
else:
print('No')
s0=A[i+1] | p02602 |
import sys
n, k = list(map(int,input().split()))
As = list(map(int, input().split()))
ans = 1
tmp = -1
for i in range(n-k+1):
for j in range(k):
ans= ans*As[k+i-j-1]
if not tmp==-1:
if tmp<ans:
print('Yes')
else:
print('No')
tmp = ans
ans = 1 | n, k = list(map(int,input().split()))
As = list(map(int, input().split()))
ans = 1
tmp = -1
for i in range(n-k):
if As[k+i]>As[i]:
print('Yes')
else:
print('No') | p02602 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
ref = 1
for i in range(k):
ref *= a[i]
for i in range(n - k):
ref2 = ref*a[i + k]/a[i]
if ref2 > ref:
print("Yes")
else:
print("No")
ref = ref2 | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n - k):
if a[i + k] > a[i]:
print("Yes")
else:
print("No") | p02602 |
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush
def main():
n,k = list(map(int, input().split()))
A = list(map(int, input().split()))
before = 1
for i in range(k):
before *= A[k-1-i]
for i ... | import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush
def main():
n,k = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(k,n):
if A[i-k]<A[i]:
print('Yes')
... | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
num = A[0]
for i in range(1, K):
num *= A[i]
check = num
for i in range(K, N):
num //= A[i-K]
num *= A[i]
if check < num:
print('Yes')
else:
print('No')
check = num | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(K, N):
if A[i-K] < A[i]:
print('Yes')
else:
print('No') | p02602 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
tmp = 1
for i in range(K):
tmp *= A[i]
tmp1 = tmp
idx = 0
for i in range(K, N):
tmp1 *= A[i]
tmp1 = tmp1//A[idx]
if(tmp1 > tmp):
print("Yes")
tmp = tmp1
idx += 1
else:
print("N... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
idx = 0
for i in range(K, N):
if(A[idx] < A[i]):
print("Yes")
else:
print("No")
idx += 1 | p02602 |
#!/usr/bin/env python
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
inip = 1
for i in range(k):
inip *= a[i]
# p = [inip]
p = [-1 for _ in range(n-k+1)]
p[0] = inip
tmp = inip
#print('inip =', inip)
for i in range(k, n):
s = tmp//a[i-k]*a[i]
# p.append... | #!/usr/bin/env python
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(n-k):
if a[i] < a[i+k]:
print('Yes')
else:
print('No')
| p02602 |
#!/usr/bin/env python3
import sys
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 ... | #!/usr/bin/env python3
import sys
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 ... | p03354 |
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):
... | 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):
... | p03354 |
N, M = list(map(int, input().split()))
P = list(map(int, input().split()))
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self... | N, M = list(map(int, input().split()))
p = list(map(int, input().split()))
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self... | p03354 |
import sys
input = sys.stdin.readline
def read_values():
return list(map(int, input().split()))
def read_list():
return list(read_values())
def func(N, mod):
F = [1]
for i in range(1, N + 1):
F.append(F[-1] * i % mod)
return F
INV = {}
def inv(a, mod):
... | import sys
input = sys.stdin.readline
def read_values():
return list(map(int, input().split()))
def read_list():
return list(read_values())
def func(N, mod):
F = [1]
for i in range(1, N + 1):
F.append(F[-1] * i % mod)
return F
INV = {}
def inv(a, mod):
... | p03354 |
N, M = list(map(int, input().split()))
P = list(map(int, input().split()))
P = list(enumerate(P, start=1))
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
self.size = [1] * (n+1)
# 検索
def find(self, x):
if sel... | N, M = list(map(int, input().split()))
P = list(enumerate(map(int, input().split())))
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n)]
self.rank = [0] * n
self.size = [1] * n
# 検索
def find(self, x):
if self.par[x] == x:
retu... | p03354 |
N, M = list(map(int, input().split()))
P = list(enumerate(map(int, input().split())))
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n)]
self.rank = [0] * n
self.size = [1] * n
# 検索
def find(self, x):
if self.par[x] == x:
retu... | N, M = list(map(int, input().split()))
P = list(map(int, input().split()))
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n)]
self.rank = [0] * n
self.size = [1] * n
# 検索
def find(self, x):
if self.par[x] == x:
return x
... | p03354 |
import sys
input = sys.stdin.readline
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 se... | import sys
input = sys.stdin.readline
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 se... | p03354 |
# ABC097D - Equals (ARC097D)
class UnionFind: # O(α(N))
def __init__(self, N): # construct a Union-Find tree (1-idx)
self.parent = [i for i in range(N + 1)]
self.rank = [0] * (N + 1)
def find(self, x): # find the group (root) of a vertex
if self.parent[x] == x:
re... | # ABC097D - Equals (ARC097D)
class UnionFind:
__slots__ = ["_data_size", "_first_index", "_parents"]
def __init__(self, data_size: int, is_zero_indexed: bool = True) -> None:
self._data_size = data_size
self._first_index = 0 if is_zero_indexed else 1
self._parents = [-1] * (data_... | p03354 |
class UnionFind:
def __init__(self,n):
self.n=n
self.parents=[-1]*n
self.rank=[0]*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(se... | class UnionFind:
def __init__(self,n):
self.n=n
self.parents=[-1]*n
self.rank=[0]*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(se... | p03354 |
n,m = list(map(int, input().split()))
p = list(map(int, input().split()))
par = [i for i in range(n)]
rank = [0 for x in range(n)]
def root(x):
tmp = par[x]
if tmp == x:
return x
else:
a = root(tmp)
par[x] = a
return a
def merge(x, y):
x = root(x)
y = root(y)
if x == y:
return
else... | n,m = list(map(int, input().split()))
p = list(map(int, input().split()))
par = [i for i in range(n)]
def root(x):
tmp = par[x]
if tmp == x:
return x
else:
a = root(tmp)
par[x] = a
return a
def merge(x, y):
x = root(x)
y = root(y)
if x != y:
par[x] = y
return
for i in range(m):
... | p03354 |
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
# 要素xの根の値を取得
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 u... | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
# 要素xの根の値を取得
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 u... | p03354 |
#16:00
n,m = list(map(int,input().split()))
a = list([int(x)-1 for x in input().split()])
pre = [i for i in range(n)]
for _ in range(m):
X,Y = list(map(int,input().split()))
X -= 1
Y -= 1
while pre[X] != X:
X = pre[X]
while pre[Y] != Y:
Y = pre[Y]
if X == Y:
continue
elif X < Y:
... | n,m = list(map(int,input().split()))
a = list([int(z)-1 for z in input().split()])
pre = [i for i in range(n)]
for _ in range(m):
x,y = [int(z)-1 for z in input().split()]
while pre[x] != x:
x = pre[x]
while pre[y] != y:
y = pre[y]
if x == y:
continue
elif x < y:
pre[y] = x
else... | p03354 |
from collections import deque
N, M = list(map(int, input().split()))
P = list(map(int, input().split()))
graph = [[] for _ in range(N)]
can = [[] for _ in range(N)]
xy = list()
for i in range(M):
x, y = list(map(int, input().split()))
graph[x-1].append(y-1)
graph[y-1].append(x-1)
for i in range(N):
... | 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]
de... | p03354 |
def solve():
n, m = list(map(int,input().split()))
plst = list(map(int,input().split()))
pare_inds = [i for i in range(n)]
belongs = [[] for i in range(n)]
def get_root(x):
p = pare_inds[x]
if p == x:
return x
a = get_root(p)
pare_inds[x] = a
return a
for i in r... | def solve():
n, m = list(map(int,input().split()))
plst = list(map(int,input().split()))
pare_inds = [i for i in range(n)]
belongs = [[] for i in range(n)]
def get_root(x):
p = pare_inds[x]
if p == x:
return x
a = get_root(p)
pare_inds[x] = a
return a
for i in r... | p03354 |
def solve():
n, m = list(map(int,input().split()))
plst = list(map(int,input().split()))
pare_inds = [i for i in range(n)]
belongs = [[] for i in range(n)]
def get_root(x):
p = pare_inds[x]
if p == x:
return x
a = get_root(p)
pare_inds[x] = a
return a
for i in r... | def solve():
n, m = list(map(int,input().split()))
plst = list(map(int,input().split()))
pare_inds = [i for i in range(n)]
belongs = [[] for i in range(n)]
def get_root(x):
p = pare_inds[x]
if p == x:
return x
a = get_root(p)
pare_inds[x] = a
return a
for i in r... | p03354 |
N,M = list(map(int,input().split()))
class UnionFind:
def __init__(self, n):
#ノード数nの配列を作る
#親の番号を格納する
#-> 自分が根だった場合は、-(その集合のサイズ)とする
#作るときはparentの値を全て-1にする
#こうすると全てバラバラになる
self.parent = [-1 for _ in range(n)]
self.n = n
def root(self, x):
... | N,M = list(map(int,input().split()))
class UnionFind:
def __init__(self, n):
#ノード数nの配列を作る
#親の番号を格納する
#-> 自分が根だった場合は、-(その集合のサイズ)とする
#作るときはparentの値を全て-1にする
#こうすると全てバラバラになる
self.parent = [-1 for _ in range(n)]
self.n = n
def root(self, x):
... | p03354 |
# union-find
n, m = list(map(int, input().split()))
def find_root(x):
if par[x] == x:
return x
else:
par[x] = find_root(par[x])
return par[x]
def unite(x, y):
x = find_root(x)
y = find_root(y)
if(x == y):
return 0
if rank[x] < rank[y]:
... | # union-find
# こういう問題のときにUnion-Findなのか幅優先探索なのか深さ優先探索なのか迷う。
# ちなみに解説PDFはUnion-Findを挙げている。
n, m = list(map(int, input().split()))
def find_root(x):
if par[x] == x:
return x
else:
par[x] = find_root(par[x])
return par[x]
def unite(x, y):
x = find_root(x)
y = find_r... | p03354 |
from collections import deque
n, m = list(map(int, input().split()))
s = list(map(int, input().split()))
g = [[] for i in range(n)]
for _ in range(m):
a, b = list(map(int, input().split()))
a, b = a-1, b-1
g[a].append(b)
g[b].append(a)
q = deque()
chk = [0] * n
res = []
for i in range(... | class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n)]
self.rank = [0] * n
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def unit(self, x, y):
... | p03354 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
n,m = list(map(int,input().split()))
p = list(map(int,input().split()))
xy = [list(map(int,input().split())) for _ in range(m)]
Graph = [[] for _ in range(n)]
for x,y in xy:
Graph[x-1].append(y-1)
Graph[y-1].append(x-1)
check = [F... | #!/usr/bin/env python3
n,m = list(map(int,input().split()))
p = list(map(int,input().split()))
for i in range(n):
p[i] -= 1
#連結成分に属するかどうかを見るときはUnion-Findを用いる
#根(属するクラス)を返す関数
def root(x):
if par[x] == x:
return x
par[x] = root(par[x])
return par[x]
#同じクラスに属するかどうかを返す関数
def same(... | p03354 |
# -*- coding: utf-8 -*-
from collections import deque
from pprint import pprint
N, M = list(map(int, input().split()))
p = list(map(int, input().split()))
xy = [list(map(int, input().split())) for _ in range(M)]
graph = [[0 for _ in range(N)] for _ in range(N)]
visited = [0 for _ in range(N)]
for x,y in xy:... | # -*- coding: utf-8 -*-
from collections import deque, defaultdict
N, M = list(map(int, input().split()))
p = list(map(int, input().split()))
xy = [list(map(int, input().split())) for _ in range(M)]
graph = defaultdict(set)
visited = [False for _ in range(N)]
for x,y in xy:
graph[x-1].add(y-1)
grap... | p03354 |
n,m=list(map(int,input().split()))
p=list(map(int,input().split()))
ans=0
import sys;sys.setrecursionlimit(10**9)
class u():#UnionFind f-根探し u-連結 s-連結? c-要素数
def __init__(self,n):self.n,self.r=[-1]*n,[0]*n
def f(self,x):
if self.n[x]<0:return x
else:self.n[x]=self.f(self.n[x]);return self.n[x]
de... | n,m=list(map(int,input().split()));p=list(map(int,input().split()));z=0;import sys;sys.setrecursionlimit(10**9);f=[i for i in range(n)]
def r(f,x):
if f[x]!=x:f[x]=r(f,f[x])
return f[x]
def u(f,a,b):
x,y=r(f,a),r(f,b)
if x!=y:f[x]=y
for i in range(m):a,b=list(map(int,input().split()));u(f,a-1,b-1)
for i... | p03354 |
from collections import deque
n, m = list(map(int, input().split()))
p = list(map(int, input().split()))
paths = {}
for _ in range(m):
x, y = list(map(int, input().split()))
if not x in list(paths.keys()):
paths[x] = [y]
else:
paths[x].append(y)
if not y in list(paths.keys()):
... | from collections import deque
n, m = list(map(int, input().split()))
p = list(map(int, input().split()))
par = list(range(n+1))
def find(x):
p_ = par[x]
if p_ == x:
return x
a = find(p_)
par[x] = a
return a
for _ in range(m):
x, y = list(map(int, input().split()))
bx... | p03354 |
N,M=list(map(int,input().split()))
P_list=[int(p) for p in input().split()]
Tree=[-1]*N
def find(x):
while Tree[x]>=0:
x=Tree[x]
return x
def unite(x,y):
s1=find(x)
s2=find(y)
if s1==s2:
pass
else:
if Tree[s1]<Tree[s2]:
Tree[s2]=s1
elif Tree[s2]>Tree[s1]:
Tree[s1]... | N,M=list(map(int,input().split()))
P_list=[int(p) for p in input().split()]
Tree=[i for i in range(N)]
def find(x):
if x==Tree[x]:
return x
else:
root=find(Tree[x])
Tree[x]=root
return root
def unite(x,y):
s1=find(x)
s2=find(y)
if s1==s2:
pass
else:
Tree[s1]=s2
for m... | p03354 |
from copy import deepcopy
n, m = [int(i) for i in input().split()]
p = [int(i) for i in input().split()]
x = [[int(i) for i in input().split()] for j in range(m)]
x_ = deepcopy(x)
tree = []
memo = []
try:
for i, y in enumerate(x_):
if y in memo:
continue
tree.append(set(... | n, m = [int(i) for i in input().split()]
p = [int(i) for i in input().split()]
x = [[int(i) for i in input().split()] for j in range(m)]
par = [i for i in range(0, n+1)]
def root(x):
if par[x] == x:
return x
else:
par[x] = root(par[x])
return par[x]
def unite(x, y):
... | p03354 |
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):
... | 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):
... | p03354 |
N,M=list(map(int,input().split()))
P=list(map(int,input().split()))
par=[i for i in range(N)]
rank=[1]*N
ans=0
def root(x):
if par[x]==x:
return x
else:
par[x]=root(par[x])
return par[x]
def same(x,y):
return root(x)==root(y)
def connect(x,y):
if root(x)==... | N,M=list(map(int,input().split()))
P=list(map(int,input().split()))
par=[i for i in range(N)]
ans=0
def root(x):
if x!=par[x]:
par[x]=root(par[x])
return par[x]
def connect(x,y):
if root(x)!=root(y):
par[root(y)]=root(x)
for i in range(M):
x,y=list(map(int,input().split... | p03354 |
class Unionfind:
def __init__(self,n):
self.uf = [-1]*n
def find(self,x):
if self.uf[x] < 0:
return x
else:
self.uf[x] = self.find(self.uf[x])
return self.uf[x]
def same(self,x,y):
return self.find(x) == self.find(y)
... | class Unionfind:
def __init__(self,n):
self.uf = [-1]*n
def find(self,x):
if self.uf[x] < 0:
return x
else:
self.uf[x] = self.find(self.uf[x])
return self.uf[x]
def same(self,x,y):
return self.find(x) == self.find(y)
... | p03354 |
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
class UnionFind():
def __init__(self, n, m = None, read = 0):
self.n = n
self.parents = [-1] * n
if read:
if m is None:
exit(print("Warning: What is M"))
for i in range(m):
... | #!/usr/bin/env python3
import sys
input = sys.stdin.readline
class UnionFind():
def __init__(self, n, m = None, read = 0):
self.n = n
self.parents = [-1] * n
if read:
if m is None:
raise ValueError("What is M")
for i in range(m):
... | p03354 |
n, m = list(map(int, input().split()))
P = tuple([int(x)-1 for x in input().split()])
swaps = [set() for _ in range(n)]
for i in range(m):
x, y = tuple([int(x)-1 for x in input().split()])
swaps[x].add(y)
swaps[y].add(x)
c = 0
from collections import deque
for idx in range(n):
q = deque([idx... | n, m = list(map(int, input().split()))
P = tuple([int(x)-1 for x in input().split()])
par = list(range(n))
size = [1] * n
def find(x):
""" 根のノードの値を見つけて返す """
if x != par[x]:
par[x] = find(par[x])
return par[x]
def unite(x, y):
"""xとyを結合する"""
rootx = find(x)
rooty = find(y)
... | p03354 |
N,M = list(map(int,input().split()))
*P, = list(map(int,input().split()))
XY = [list(map(int,input().split())) for _ in [0]*M]
E = [[] for _ in [0]*N]
for x,y in XY:
E[x-1].append(y-1)
E[y-1].append(x-1)
def dist_bfs(N,E,start):
d = [-1]*N
d[start] = 0
q = [start]
while q:
... | N,M = list(map(int,input().split()))
*P, = list(map(int,input().split()))
XY = [list(map(int,input().split())) for _ in [0]*M]
E = [[] for _ in [0]*N]
for x,y in XY:
E[x-1].append(y-1)
E[y-1].append(x-1)
def connect_bfs(N,E,start):
connect = {start}
q = [start]
while q:
i ... | p03354 |
N,M = list(map(int,input().split()))
*P, = list(map(int,input().split()))
XY = [list(map(int,input().split())) for _ in [0]*M]
E = [[] for _ in [0]*N]
for x,y in XY:
E[x-1].append(y-1)
E[y-1].append(x-1)
def connect_bfs(N,E,start):
connect = {start}
q = [start]
while q:
i ... | N,M = list(map(int,input().split()))
*P, = list(map(int,input().split()))
XY = [list(map(int,input().split())) for _ in [0]*M]
def get_Parent(n):
if Parent[n] == -1:return n
par = get_Parent(Parent[n])
Parent[n] = par
return par
def merge(x,y):
x = get_Parent(x)
y = get_Parent(y)
... | p03354 |
n,m = list(map(int,input().split()))
p = list(map(int,input().split()))
root = [[] for i in range(n)]
for _ in range(m):
a, b = (int(x) for x in input().split())
root[b-1].append(a-1)
root[a-1].append(b-1)
dp = [False]*n
ans = 0
for j in range(n):
if dp[j]:
continue
che... | n,m = list(map(int,input().split()))
p = list(map(int,input().split()))
root = [[] for i in range(n)]
for _ in range(m):
a, b = (int(x) for x in input().split())
root[b-1].append(a-1)
root[a-1].append(b-1)
check = [-1]*n
ans = 0
for j in range(n):
if check[j] != -1:
continue... | p03354 |
class UnionFind():
# 作りたい要素数nで初期化
# 使用するインスタンス変数の初期化
def __init__(self, n):
self.n = n
# root[x]<0ならそのノードが根かつその値が木の要素数
# rootノードでその木の要素数を記録する
self.root = [-1]*(n+1)
# 木をくっつける時にアンバランスにならないように調整する
self.rnk = [0]*(n+1)
# ノードxのrootノードを見つける
def... | class UnionFind():
# 作りたい要素数nで初期化
# 使用するインスタンス変数の初期化
def __init__(self, n):
self.n = n
# root[x]<0ならそのノードが根かつその値が木の要素数
# rootノードでその木の要素数を記録する
self.root = [-1]*(n+1)
# 木をくっつける時にアンバランスにならないように調整する
self.rnk = [0]*(n+1)
# ノードxのrootノードを見つける
def... | p03354 |
n, m = list(map(int, input().split()))
ps = [int(i) - 1 for i in input().split()]
neighbors = {v: [] for v in range(n)}
for _ in range(m):
x, y = list(map(int, input().split()))
neighbors[x - 1] += [y - 1]
neighbors[y - 1] += [x - 1]
visited = [False] * n
def conn(i0):
q = [i0]
c =... | n, m = list(map(int, input().split()))
ps = [int(i) - 1 for i in input().split()]
xy = [list(map(int, input().split())) for _ in range(m)]
dfind = {i: i for i in range(n)}
def find(v):
visit = []
while dfind[v] != v:
visit.append(v)
v = dfind[v]
for i in visit:
dfin... | p03354 |
N,M = list(map(int, input().split()))
P = list(map(int, input().split()))
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.... | N,M = list(map(int, input().split()))
P = list(map(int, input().split()))
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.... | p03354 |
from collections import defaultdict
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n)]
self.rank = [0]*n
def find(self, x):
if self.par[x]==x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def unite(self, x, y)... | class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n)]
self.rank = [0]*n
def find(self, x):
if self.par[x]==x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def unit(self, x, y):
x = self.find(x)
y = self.find(y)
... | p03354 |
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n)]
self.rank = [0]*n
def find(self, x):
if self.par[x]==x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def unit(self, x, y):
x = self.find(x)
y = self.find(y)
... | class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n)]
self.rank = [0]*n
def find(self, x):
if self.par[x]==x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def unit(self, x, y):
x = self.find(x)
y = self.find(y)
... | p03354 |
n,m = list(map(int, input().split()))
P = [0]+list(map(int, input().split()))
XY = list(list(map(int, input().split())) for _ in range(m))
G = [[] for _ in range(n+1)]
for x, y in XY:
G[x].append(y)
G[y].append(x)
# print(n,m)
# print(P)
# print(XY)
# print(G)
# for i in range(len(G)):#########
# ... | from collections import deque
n,m = list(map(int, input().split()))
P = [0]+list(map(int, input().split()))
XY = list(list(map(int, input().split())) for _ in range(m))
G = [[] for _ in range(n+1)]
for x, y in XY:
G[x].append(y)
G[y].append(x)
q = deque()
vis = [False]*(n+1)
ans = 0
for i in rang... | p03354 |
N,M=list(map(int,input().split()))
p=list([int(x)-1 for x in input().split()])
xy=[list([int(x)-1 for x in input().split()]) for _ in [0]*M]
z=[[i,1] for i in range(N)]
def root_find(a):
while(a!=z[a][0]):
a=z[a][0]
return a
def union(a,b):
ra=root_find(a[0])
rb=root_find(b[0])
... | N,M=list(map(int,input().split()))
p=list([int(x)-1 for x in input().split()])
xy=[list([int(x)-1 for x in input().split()]) for _ in [0]*M]
z=[[i,1] for i in range(N)]
def root_find(a):
while(a!=z[a][0]):
a=z[a][0]
return a
def union(a,b):
ra=root_find(a[0])
rb=root_find(b[0])
... | p03354 |
from collections import defaultdict
class UnionFind():
def __init__(self, n):
self.par = [i for i in range(n)]
def find(self, x):
if self.par[x] != x:
self.par[x] = self.find(self.par[x])
return self.par[x]
def unite(self, x, y):
x = self.find(x)
... | from collections import defaultdict
class UnionFind():
def __init__(self, n):
self.par = [i for i in range(n)]
def find(self, x):
if self.par[x] != x:
self.par[x] = self.find(self.par[x])
return self.par[x]
def unite(self, x, y):
x = self.find(x)
... | p03354 |
import sys
input = sys.stdin.buffer.readline
N,M = list(map(int,input().split()))
p = [i-1 for i in map(int,input().split())]
alr = [False for i in range(N)]
xy = [[] for i in range(N)]
for i in range(M):
x,y = list(map(int,input().split()))
x -= 1
y -= 1
xy[x].append(y)
xy[y].append(x)
... | import sys
input = sys.stdin.buffer.readline
N,M = list(map(int,input().split()))
p = [i-1 for i in map(int,input().split())]
alr = [False for i in range(N)]
xy = [[] for i in range(N)]
for i in range(M):
x,y = list(map(int,input().split()))
x -= 1
y -= 1
xy[x].append(y)
xy[y].append(x)
... | p03354 |
N,M = list(map(int,input().split()))
p = [0] + [int(x) for x in input().split()]
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
def find(self, x):
if self.par[x] == x: return x
else:
self.par[x] = sel... | N,M = list(map(int,input().split()))
p = [0] + [int(x) for x in input().split()]
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
def find(self, x):
if self.par[x] == x: return x
else:
self.par[x] = sel... | p03354 |
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):
... | 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):
... | p03354 |
#!/mnt/c/Users/moiki/bash/env/bin/python
N,M = list(map(int, input().split()))
p = list(map(int, input().split()))
swappair= [list(map(int, input().split())) for _ in range(M)]
union_list = [-1 for _ in range(N+1)]
def find(a): # get root
while not union_list[a] == -1:
a = union_list[a]
retu... | #!/mnt/c/Users/moiki/bash/env/bin/python
N,M = list(map(int, input().split()))
p = list(map(int, input().split()))
swappair= [list(map(int, input().split())) for _ in range(M)]
union_list = [-1 for _ in range(N+1)]
def find(a): # get root
while not union_list[a] == -1:
a = union_list[a]
retu... | p03354 |
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):
... | 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):
... | p03354 |
class DisjointSet:
def __init__(self,size):
self.rank=[0]*size
self.p=[0]*size
for i in range(size):
self.makeSet(i)
def makeSet(self,i):
self.p[i]=i
self.rank[i]=0
def same(self,x,y):
return self.findSet(x) == self.findSet(y)... | class DisjointSet:
def __init__(self,size):
self.rank=[0]*size
self.p=[0]*size
for i in range(size):
self.makeSet(i)
def makeSet(self,i):
self.p[i]=i
self.rank[i]=0
def same(self,x,y):
return self.findSet(x) == self.findSet(y)... | p03354 |
n, m = list(map(int, input().split()))
ps = [int(p)-1 for p in input().split()]
xys = [tuple(int(x)-1 for x in input().split()) for _ in range(m)]
nodes = list(range(n))
union = {node:node for node in nodes}
def root(node):
if union[node] == node:
return node
union[node] = root(union[node])
... | n, m = list(map(int, input().split()))
ps = [int(p)-1 for p in input().split()]
xys = [tuple(int(x)-1 for x in input().split()) for _ in range(m)]
union = {node:node for node in range(n)}
def root(node):
if union[node] == node:
return node
union[node] = root(union[node])
return union[nod... | p03354 |
n, m = list(map(int, input().split()))
ps = [int(p)-1 for p in input().split()]
xys = [tuple(int(x)-1 for x in input().split()) for _ in range(m)]
union = {node:(node, 0) for node in range(n)}
def root(node):
if union[node][0] == node:
return union[node]
union[node] = root(union[node][0])
... | n, m = list(map(int, input().split()))
ps = [int(p)-1 for p in input().split()]
xys = [tuple(int(x)-1 for x in input().split()) for _ in range(m)]
union = {node:node for node in range(n)}
depth = {node:0 for node in range(n)}
def root(node):
if union[node] == node:
return union[node]
union[n... | p03354 |
N, M = list(map(int, input().split()))
sigma = list(map(int, input().split()))
gokans = []
for i in range(M):
pair = tuple(map(int, input().split()))
gokans.append(pair)
def connected(i, j, paths):
if [pair for pair in paths if i in pair] and [pair for pair in paths if j in pair]:
new_ch... | n,m = list(map(int, input().split()))
p = list(map(int, input().split()))
par = [i for i in range(n)]
#rootの計算量は、parが最初の状態に近いほど値は小さくて、高々O(n)
def root(x):
tmp = par[x]
if tmp == x:
return x
else:
a = root(tmp)
par[x] = a
return a
def merge(x, y):
x = root(x)
y = root(y)
if x != y:
par... | p03354 |
import sys
input = sys.stdin.readline
n, m = [int(x) for x in input().split()]
p = [int(x) for x in input().split()]
from collections import deque
def bfs(u):
d = [-1] * n
queue = deque([u])
d[u] = 0
while queue:
v = queue.popleft()
for i in g[v]:
if d[i] < ... | import sys
input = sys.stdin.readline
n, m = [int(x) for x in input().split()]
p = [int(x) for x in input().split()]
#xの根を求める
def find(x):
if par[x] < 0:
return x
else:
par[x] = find(par[x])
return par[x]
#xとyの属する集合の併合
def unite(x,y):
x = find(x)
y = find(y)
... | p03354 |
N,M=list(map(int,input().split()))
p=list(map(int,input().split()))
p=[0]+p
par=[i for i in range(N+1)]
size=[1 for i in range(N+1)]
def find(x):
if par[x]==x:
return x
else:
return find(par[x])
def union(x,y):
if size[x]>size[y]:
size[x]+=size[y]
par[y]=fi... | N,M=list(map(int,input().split()))
p=list(map(int,input().split()))
p=[0]+p
par=[i for i in range(N+1)]
size=[1 for i in range(N+1)]
def find(x):
if par[x]==x:
return x
else:
return find(par[x])
def union(x,y):
if size[x]>size[y]:
size[x]+=size[y]
par[y]=fi... | p03354 |
from operator import itemgetter
#import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = ... | # import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial, gcd
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10 ** 7)
enu = enumerate
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.re... | p03354 |
from collections import deque
q = deque([])
def get_root(i):
while True:
if parent[i] == -1:
return i
i = parent[i]
def bfs(i):
global l
c = 0
q.append(i)
while True:
if len(q) == 0:
break
p = q.popleft()
l.append(p)
... | def get_root(s):
if s != root[s]:
root[s] = get_root(root[s])
return root[s]
return s
def unite(s, t):
root_s = get_root(s)
root_t = get_root(t)
if not root_s == root_t:
if rank[s] == rank[t]:
root[root_t] = root_s
rank[root_s] += 1
... | p03354 |
class unionFind():
def __init__(self,n):
self.tree=[-1]*n
def find(self,x):
if self.tree[x]<0:
return x
else:
return self.find(self.tree[x])
def union(self,x,y):
xr=self.find(x)
yr=self.find(y)
if xr!=yr:
if self.tree[xr]<self.tree[yr]:
self.tree[yr]=xr
elif self.tree[xr]>se... | class unionFind():
def __init__(self,n):
self.tree=[-1]*n
def find(self,x):
if self.tree[x]<0:
return x
else:
return self.find(self.tree[x])
def union(self,x,y):
xr=self.find(x)
yr=self.find(y)
if xr!=yr:
if self.tree[xr]<self.tree[yr]:
self.tree[yr]=xr
elif self.tree[xr]>se... | p03354 |
class unionFind():
def __init__(self,n):
self.tree=[-1]*n
def find(self,x):
if self.tree[x]<0:
return x
else:
return self.find(self.tree[x])
def union(self,x,y):
xr=self.find(x)
yr=self.find(y)
if xr!=yr:
if self.tree[xr]<self.tree[yr]:
self.tree[yr]=xr
elif self.tree[xr]>se... | class unionFind():
def __init__(self,n):
self.tree=[-1]*n
def find(self,x):
if self.tree[x]<0:
return x
else:
self.tree[x]=self.find(self.tree[x])
return self.tree[x]
def union(self,x,y):
xr=self.find(x)
yr=self.find(y)
if xr!=yr:
if self.tree[xr]<self.tree[yr]:
self.tree[yr... | p03354 |
import sys
sys.setrecursionlimit(2000000000)
class Node:
def __init__(self, index):
self.index = index
self.connected_indices = set()
def __repr__(self):
return '{}: {}'.format(self.index, self.connected_indices)
def build_graph(nodes, curr_index, connected_indices, r... | import sys
sys.setrecursionlimit(2000000000)
class Node:
def __init__(self, index):
self.index = index
self.connected_indices = set()
def build_graph(nodes, curr_index, connected_indices, reached_indices):
# already reached
if curr_index in connected_indices or curr_index i... | p03354 |
from collections import deque
n,m = list(map(int,input().split()))
ps = [0] + list(map(int,input().split()))
memo = [[] for _ in range(n+1)]
connect = [[] for _ in range(n+1)]
visited = [0]*(n+1)
for i in range(m):
x,y = list(map(int,input().split()))
memo[x].append(y)
memo[y].append(x)
fo... | class UnionFind:
def __init__(self,n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
def find(self,x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def same_c... | p03354 |
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 ... | 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 ... | p03354 |
N,M=list(map(int,input().split()))
e=[int(x)-1 for x in input().split()]
p=[i for i in range(N)]
r=[0]*N
def find(x):
if p[x]!=x:
p[x]=find(p[x])
return p[x]
def unite(x,y):
x=find(x)
y=find(y)
if x==y:
return
if r[x]<r[y]:
p[x]=y
else:
p[y]=x
if r[x]==r[y]:
r[x]+=1
def sa... | N,M=list(map(int,input().split()))
e=[int(x)-1 for x in input().split()]
p=[i for i in range(N)]
r=[0]*N
def find(x):
if p[x]!=x:
p[x]=find(p[x])
return p[x]
def unite(x,y):
x=find(x)
y=find(y)
if x==y:
return
if r[x]<r[y]:
p[x]=y
else:
p[y]=x
if r[x]==r[y]:
r[x]+=1
def sa... | p03354 |
N, M = list(map(int,input().split()))
P=list(map(int,input().split()))
Group=[i for i in range(N+1)]
Swap=[None]*M
for i in range(M):
Swap[i]=sorted(map(int,input().split()))
def find(x):
while Group[x] != x:
x=Group[x]
return x
for i in range(M):
if find(Swap[i][1]) != find... | N,M = list(map(int,input().split()))
P = list(map(int,input().split()))
S = [list(map(int,input().split())) for i in range(M)]
class Union_find():
def __init__(self, N):
self.Group = [i for i in range(N)]
def find(self,x):# find(a)=find(b)のとき同じグループ
while self.Group[x] != x:
... | p03354 |
n, m = list(map(int, input().split()))
p = list([int(x) - 1 for x in input().split()])
xy = [list([int(x) - 1 for x in input().split()]) for _ in range(m)]
par = [i for i in range(n)]
rank = [0 for _ in range(n)]
def root(x):
if par[x] == x:
return par[x]
par[x] = root(par[x])
return ... | n, m = list(map(int, input().split()))
p = list([int(x) - 1 for x in input().split()])
xy = [list([int(x) - 1 for x in input().split()]) for _ in range(m)]
par = [i for i in range(n)]
rank = [0 for _ in range(n)]
def root(x):
if par[x] == x:
return x
par[x] = root(par[x])
return par[x... | p03354 |
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
def main():
N,M=map(int,input().... | # -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1
def main():
N,M=map(int,input().... | p03354 |
#coding:utf-8
n,m = list(map(int,input().split()))
List = list(map(int,input().split()))
forest = [i for i in range(n+1)]
rank = [0 for i in range(n+1)]
def unite(x,y):
while forest[x] != x:
x = forest[x]
a = rank[x]
while forest[y] != y:
y = forest[y]
b = rank[y]
... | #coding:utf-8
n,m = list(map(int,input().split()))
List = list(map(int,input().split()))
forest = [i for i in range(n+1)]
rank = [0 for i in range(n+1)]
def unite(x,y):
x = Find(x)
y = Find(y)
a = rank[x]
b = rank[y]
forest[x] = y
def Find(x):
if forest[x] != x:
ra... | p03354 |
class UnionFind():
def __init__(self,size):
self.table=[-1for _ in range(size)]
def root(self,x):
while self.table[x]>=0:
x=self.table[x]
return x
def unite(self,x,y):
s1=self.root(x)
s2=self.root(y)
if s1!=s2:
if self.table[s1]!=self.table[s2]:
if self.tabl... | I=lambda:list(map(int,input().split()));n,m=I();p=I();l=[i for i in range(n+1)]
def u(x):
if l[x]!=x:l[x]=u(l[x])
return l[x]
for _ in[0]*m:x,y=I();l[u(x)]=u(y)
print((sum(u(i)==u(j)for i,j in enumerate(p,1)))) | p03354 |
from copy import deepcopy
n,m = (int(i) for i in input().split())
p = [int(i) for i in input().split()]
x = [[int(i) for i in input().split()] for i in range(m)]
c,d,e = [[] for i in range(n+1)],[True for i in range(n+1)],[]
d[0],ans = False,0
for i,j in x:
c[i].append(j)
c[j].append(i)
while sum(d)!=0:
fo... | n,m = (int(i) for i in input().split())
par,rank = [i for i in range(n+1)],[0 for i in range(n+1)]
def root(x):
if par[x]!=x: par[x] = root(par[x])
return par[x]
def unite(x,y):
x2,y2 = root(x),root(y)
if x2!=y2:
if rank[x2]<rank[y2]: par[x2] = y2
else: par[y2] = x2
if rank[x2]==rank[y2]: rank[x2]+=... | p03354 |
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):
... | 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):
... | p03354 |
n, m = list(map(int, input().split()))
pp = list(map(int, input().split()))
xyxy = [list(map(int, input().split())) for _ in range(m)]
class UnionFind(list) :
def __init__(self, n) :
super().__init__(list(range(n)))
def find(self, i) :
if self[i] == i : return i
self[i] = sel... | n, m = list(map(int, input().split()))
pp = list(map(int, input().split()))
xyxy = [list(map(int, input().split())) for _ in range(m)]
class UnionFind(list) :
def __init__(self, n) :
super().__init__(list(range(n)))
def find(self, i) :
if self[i] == i : return i
self[i] = sel... | p03354 |
n,m = list(map(int,input().split()))
p = list(map(int,input().split()))
info = [list(map(int,input().split())) for _ in range(m)]
par =[i for i in range(n+1)]
rank=[0]*(n+1)
# xの根を見つける
def root(x):
if par[x] == x:
return x
else:
par[x] = root(par[x])
return par[x]
# x,yの根が同じかどうかを返す（... | n,m = list(map(int,input().split()))
p = list(map(int,input().split()))
info = [list(map(int,input().split())) for _ in range(m)]
par =[i for i in range(n+1)]
rank=[0]*(n+1)
# xの根を見つける
def root(x):
if par[x] == x:
return x
else:
par[x] = root(par[x])
return par[x]
# x,yの根が同じかどうかを返す（... | p03354 |
import sys
n, m = [int(i) for i in input().split(" ")]
p = [0] + [int(i) for i in input().split(" ")]
par = [i for i in range(0, n + 1)]
id_set = [[i] for i in range(0, n + 1)]
p_set = [[p[i]] for i in range(0, n + 1)]
sys.setrecursionlimit(10**6)
def root(x):
if par[x] == x:
return x
... | import sys
n, m = [int(i) for i in input().split(" ")]
p = [0] + [int(i) for i in input().split(" ")]
par = [i for i in range(0, n + 1)]
id_set = [[] for i in range(0, n + 1)]
p_set = [[] for i in range(0, n + 1)]
sys.setrecursionlimit(10**6)
def root(x):
if par[x] == x:
return x
else:... | p03354 |
n,m=list(map(int,input().split()))
p=list([int(x)-1 for x in input().split()])
l=[list([int(x)-1 for x in input().split()]) for _ in [0]*m]
s=[0]*n
i=1
for x in l:
if s[x[0]]==s[x[1]]==0:
s[x[0]]=i
s[x[1]]=i
i+=1
elif s[x[0]]==s[x[1]]>0:
pass
elif s[x[0]]==0:
... | n,m=list(map(int,input().split()))
p=list(map(int,input().split()))
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(... | p03354 |
n,m = list(map(int,input().split()))
f = lambda x : int(x) - 1
p = list(map(f,input().split()))
par = [i for i in range(n)]
def root(x):
if par[x] == x:
return x
else:
par[x] = root(par[x])
return par[x]
def unite(x,y):
if root(x) == root(y):
return
else:... | n,m = list(map(int,input().split()))
f = lambda x : int(x) - 1
p = list(map(f,input().split()))
par = [i for i in range(n)]
def root(x):
if par[x] == x:
return x
else:
par[x] = root(par[x])
return par[x]
def unite(x,y):
rx = root(x)
ry = root(y)
if rx != ry:
... | p03354 |
class UnionFind():
def __init__(self,n):
self.par=[i for i in range(n)]
def root(self, x):
if self.par[x]==x:
return x
else:
self.par[x]=self.root(self.par[x])
return self.par[x]
def same(self,x,y):
return self.root(x)==self.root(... | class UnionFind():
def __init__(self,n):
self.par=[i for i in range(n)]
def root(self, x):
if self.par[x]==x:
return x
else:
self.par[x]=self.root(self.par[x])
return self.par[x]
def same(self,x,y):
return self.root(x)==self.root(... | p03354 |
class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
def Find_Root(self, x):
if(self.root[x] < 0):
return x
else:
self.root[x] = self.Find_Root(self.root[x])
return self.root[x]
... | import sys
input = sys.stdin.readline
class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
def Find_Root(self, x):
if(self.root[x] < 0):
return x
else:
self.root[x] = self.Find_Root(self.root... | p03354 |
I=lambda:[int(i) for i in input().split()]
n, m = I()
P = I()
D = {i:i for i in range(n+1)}
def U(x):
if D[x] != x:
D[x] = U(D[x])
return D[x]
for _ in range(m):
x, y = I()
D[U(x)] = U(y)
print((sum(U(i)==U(p) for i, p in enumerate(P,1)))) | I=lambda:[int(i)for i in input().split()]
n,m=I()
P=I()
D={i:i for i in range(n+1)}
def U(x):
if D[x]!=x:D[x]=U(D[x])
return D[x]
for _ in [0]*m:
x,y=I();D[U(x)]=U(y)
print((sum(U(i)==U(p)for i,p in enumerate(P,1)))) | p03354 |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
fr... | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
fr... | p03354 |
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):
... | 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):
... | p03354 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.