input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
n,m=list(map(int,input().split()))
z=n*(n-1)//2
l=[-1]*n
a=[1]*n
b=[input().split() for _ in range(m)]
c=[0]*m+[z]
def r(s):
t=l[s]
return s if t<0 else r(t)
def f(s):
return r(int(s)-1)
for i in range(m-1,-1,-1):
x,y=list(map(f,... | import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
n,m=list(map(int,input().split()))
z=n*(n-1)//2
l=[-1]*n
a=[1]*n
b=[input().split() for _ in range(m)]
c=[0]*m+[z]
d=[i for i in range(n)]
def r(s):
t=l[s]
if t<0:
return s
else:
l[s]=r(t)
return l[s]
def f(s):
ret... | p03108 |
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
n,m=list(map(int,input().split()))
z=n*(n-1)//2
l=[-1]*n
a=[1]*n
b=[input().split() for _ in range(m)]
c=[0]*m+[z]
d=[i for i in range(n)]
def r(s):
t=l[s]
if t<0:
return s
else:
l[s]=r(t)
return l[s]
def f(s):
ret... | import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
n,m=list(map(int,input().split()))
z=n*(n-1)//2
l=[-1]*n
a=[1]*n
b=[input().split() for _ in range(m)]
c=[0]*m+[z]
def r(s):
t=l[s]
if t<0:
return s
else:
l[s]=r(t)
return l[s]
def f(s):
return r(int(s)-1)
for i in... | p03108 |
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
n,m=list(map(int,input().split()))
z=n*(n-1)//2
l=[-1]*n
a=[1]*n
b=[input().split() for _ in range(m)]
c=[0]*m+[z]
def r(s):
t=l[s]
if t<0:
return s
else:
l[s]=r(t)
return l[s]
for i in range(m-1,-1,-1):
x,y=[r(int(... | import sys
sys.setrecursionlimit(100000)
input=sys.stdin.readline
n,m=list(map(int,input().split()))
z=n*(n-1)//2
l=[-1]*n
a=[1]*n
b=[input().split() for _ in range(m)]
c=[0]*m+[z]
def r(s):
t=l[s]
if t<0:
return s
else:
l[s]=r(t)
return l[s]
def f(s):
return r(int(s)-1)
for i in r... | p03108 |
n,m=list(map(int,input().split()))
l=[-1]*n
b=[input().split() for _ in range(m)]
c=[0]*m+[n*(n-1)//2]
def r(s):
t=l[s]
if t<0:
return s
else:
l[s]=r(t)
return l[s]
def f(s):
return r(int(s)-1)
for i in range(m-1,-1,-1):
x,y=list(map(f,b[i]))
s,t=0,0
if x!=y:
s,t=l[x],l[y]... | import sys
n,m=list(map(int,input().split()))
l=[-1]*n
b=[sys.stdin.readline().split() for _ in range(m)]
c=[0]*m+[n*(n-1)//2]
def r(s):
t=l[s]
if t<0:
return s
else:
l[s]=r(t)
return l[s]
def f(s):
return r(int(s)-1)
for i in range(m-1,-1,-1):
x,y=list(map(f,b[i]))
s,t=0,0
if... | p03108 |
import sys
n,m=list(map(int,input().split()))
l=[-1]*n
b=[sys.stdin.readline().split() for _ in range(m)]
c=[0]*m+[n*(n-1)//2]
def r(s):
t=l[s]
if t<0:
return s
else:
l[s]=r(t)
return l[s]
def f(s):
return r(int(s)-1)
for i in range(m-1,-1,-1):
x,y=list(map(f,b[i]))
s,t=0,0
if... | import sys
input=sys.stdin.readline
n,m=list(map(int,input().split()))
l=[-1]*n
z=n*(n-1)//2
b=[input().split() for _ in range(m)]
c=[0]*m+[z]
def r(s):
t=l[s]
if t<0:
return s
else:
l[s]=r(t)
return l[s]
def f(s):
return r(int(s)-1)
for i in range(m)[::-1]:
x,y=list(map(f,b[i]))
... | p03108 |
import sys
input=sys.stdin.readline
n,m=list(map(int,input().split()))
l=[-1]*n
z=n*(n-1)//2
b=[input().split() for _ in range(m)]
c=[0]*(m-1)+[z]
def r(s):
t=l[s]
if t<0:
return s
else:
l[s]=r(t)
return l[s]
def f(s):
return r(int(s)-1)
for i in range(m-1,0,-1):
x,y=list(map(f,b[... | import sys
input=sys.stdin.readline
n,m=list(map(int,input().split()))
l=[-1]*n
z=n*(n-1)//2
b=[input().split() for _ in range(m)]
c=[0]*(m-1)+[z]
def r(s):
t=l[s]
if t<0:
return s
else:
l[s]=r(t)
return l[s]
def f(s):
return r(int(s)-1)
for i in range(m-1,0,-1):
x,y=list(map(f,b[... | p03108 |
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):
... | p03108 |
#!/usr/bin/python3
# -*- coding:utf-8 -*-
class UnionFindTree:
def __init__(self, n):
self.nodes = [-1]*n
def find(self, x):
parents = []
while True:
parent = self.nodes[x]
if parent < 0:
for p in parents:
self.nodes[p] = x
return x
else:
... | #!/usr/bin/python3
# -*- coding:utf-8 -*-
class UnionFindTree:
def __init__(self, n):
self.nodes = [-1]*n
def find(self, x):
parent = self.nodes[x]
if parent < 0:
return x
else:
self.nodes[x] = self.find(self.nodes[x])
return self.nodes[x]
def ... | p03108 |
n,m=list(map(int,input().split()))
par=[-1]*n
def find(n):
if par[n]<0:
return n
else:
par[n]=find(par[n])
return par[n]
def union(x,y):
x,y=find(x),find(y)
if x!=y:
if x>y:
x,y=y,x
par[x]+=par[y]
par[y]=x
M=[]
for i in range(m... | n,m=list(map(int,input().split()))
par=[-1]*n
def find(n):
if par[n]<0:
return n
else:
par[n]=find(par[n])
return par[n]
def union(x,y,s):
x,y=find(x),find(y)
if x!=y:
if x>y:
x,y=y,x
s-=par[x]*par[y]
par[x]+=par[y]
par[... | p03108 |
class Unionfind(): # 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]
... | class Unionfind(): # 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]
... | p03108 |
N,M=[int(x) for x in input().split()]
I=[[] for n in range(N)]
ans = int(N * (N-1) / 2)
E=[]
result=[]
def visit(i,V):
if(V[i]==0):
V[i]=1
total=1;
for n in I[i]:
if(V[n]==0):
total+=visit(n,V)
return total
else:
return 0
for... | N,M=[int(x) for x in input().split()]
G=[-1] * N
W=[0] * N
E=[]
result=[]
ans = int(N * (N-1) / 2)
def union(i,j):
gi=find(i)
gj=find(j)
if(gi!=gj):
if W[gi] > W[gj]:
G[gi]+=G[gj]
G[gj]=gi
else:
G[gj]+=G[gi]
G[gi]=gj
... | p03108 |
n, m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(m)]
ans = [n*(n-1)//2]
remains = set(range(1, n+1))
sets = []
for i in range(m-1):
a, b = ab[-(i+1)]
if a in remains and b in remains:
sets.append(set([a, b]))
remains.remove(a)
remain... | import sys
sys.setrecursionlimit(100000)
n, m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(m)][::-1]
par, sizes = [-1]*(n+1), [1]*(n+1)
def find(i):
if par[i] < 0:
return i
else:
par[i] = find(par[i])
return par[i]
ans = [n*(n-1)... | p03108 |
from collections import Counter
maxn = 100000
n , m = list(map(int, input().split()))
par = [0] * n
rank = [0] * n
#初期化
for i in range(n):
par[i] = i
rank[i] = 0
#判定(一番上野根を求める)
def find(x):
if par[x] == x:
return x
else:
par[x] = find(par[x])
return par[x... | maxn = 100000
n , m = list(map(int, input().split()))
par = [0] * n
rank = [0] * n
siz = [1] * n
#初期化
for i in range(n):
par[i] = i
rank[i] = 0
#判定(一番上野根を求める)
def find(x):
if par[x] == x:
return x
else:
par[x] = find(par[x])
return par[x]
#結合
def un... | p03108 |
N,M=list(map(int,input().split()))
tree=[[]for i in range(N)]
bridge=[]
for i in range(M):
A,B=list(map(int,input().split()))
tree[A-1].append(B-1)
tree[B-1].append(A-1)
bridge.append((A,B))
ans=[]
All=N*(N-1)//2
for a,b in bridge:
ischecked=[0]*N
tree[a-1].pop(0)
tree[b-1].pop(... | N,M=list(map(int,input().split()))
bridge=[]
size=[1]*(N+1)
tree=list(range(N+1))
def find(a):
x=tree[a]
if a==x:
return a
y=find(x)
tree[a]=y
return y
for i in range(M):
A,B=list(map(int,input().split()))
bridge.append((A,B))
Ans=N*(N-1)//2
ans=[]
for a,b in bridge[:... | p03108 |
import sys
sys.setrecursionlimit(2000)
n, m = map(int, input().split())
bridge = list(map(int, sys.stdin.read().split()))
total = n*(n-1)//2
ans =[total]
u = [-1]*(n+1)
size = [1]*(n+1)
rank = [1]*(n+1)
def check(x, y):
return find(x) != find(y)
def find(x):
if u[x] < 0 :
u[x] = x
... | import sys
n , m, *e = map(int,sys.stdin.read().split())
total = n*(n-1)//2
ans =[total]
u = [-1]*(n+1)
def find(x):
if u[x] < 0 :
return x
else:
return find(u[x])
for x , y in zip(e[-2:1:-2],e[:1:-2]):
x = find(x)
y = find(y)
x, y = sorted((x, y))
if x != y:
... | p03108 |
import math
def comb(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
n, m = list(map(int, input().split()))
c = []
for i in range(m):#h:高さ
c.append([int(m) for m in input().split()])
class UnionFind:
def __init__(self, n):
# 親要素のノード番号を格納。par[x] == xの時そのノードは根
... | n, m = list(map(int, input().split()))
c = []
for i in range(m):#h:高さ
c.append([int(m) for m in input().split()])
class UnionFind:
def __init__(self, n):
# 親要素のノード番号を格納。par[x] == xの時そのノードは根
self.par = [-1 for i in range(n+1)]
# 木の高さを格納する（初期状態では0）
self.rank = [0] * (n + 1... | p03108 |
import sys
input = sys.stdin.readline
#木の根を求める
def find(x):
if par[x] == x:
return x
else:
return find(par[x])
#xとyの属する集合の併合
def unite(x,y):
x = find(x)
y = find(y)
if x != y:
#xとyの属している集合が異なる時
if rank[x] < rank[y]:
par[x] = y
... | import sys
input = sys.stdin.readline
#木の根を求める
def find(x):
if par[x] == x:
return x
else:
return find(par[x])
#xとyの属する集合の併合
def unite(x,y):
x = find(x)
y = find(y)
if x != y:
#xとyの属している集合が異なる時
if rank[x] < rank[y]:
par[x] = y
... | p03108 |
import sys
input = sys.stdin.readline
#木の根を求める
def find(x):
if par[x] == x:
return x
else:
return find(par[x])
#xとyの属する集合の併合
def unite(x,y):
x = find(x)
y = find(y)
if x != y:
#xとyの属している集合が異なる時
if rank[x] < rank[y]:
par[x] = y
... | #Union Find
import sys
input = sys.stdin.readline
n,m = list(map(int,input().split()))
#根なら-size,子なら親の頂点
par = [-1]*n
#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(... | p03108 |
import collections
N, M = list(map(int, input().split()))
bridges = reversed([[int(i) for i in input().split()] for i in range(M)])
class UnionFind(object):
def __init__(self, n=1):
self.par = [i for i in range(n)]
self.rank = [0 for _ in range(n)]
def find(self, x):
if sel... | class UnionFind:
def __init__(self, size):
self.parent = [-1 for i in range(size)]#非負なら親ノード，負ならグループの要素数
def root(self, x): #root(x): xの根ノードを返す．
if self.parent[x] < 0:
return x
else:
self.parent[x] = self.root(self.parent[x]) #xをxの根に直接つなぐ
retu... | p03108 |
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):
... | p03108 |
class UnionFind:
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
self.Maxroot = -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]
def Unite(self, x, y):
x = self.Find_R... | class UnionFind:
def __init__(self, n):
self.n = n
self.root = [-1]*(n+1)
self.rnk = [0]*(n+1)
self.Maxroot = -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]
def Unite(self, x, y):
x = self.Find_R... | p03108 |
#!/usr/bin/env python3
from itertools import product
def main():
n, m = list(map(int, input().split()))
a = []
b = []
for _ in range(m):
ai, bi = list(map(int, input().split()))
a.append(ai-1)
b.append(bi-1)
# 不便さのMAX
result = [n * (n-1) // 2]
ch... | #!/usr/bin/env python3
from itertools import product
def main():
n, m = list(map(int, input().split()))
a = []
b = []
for _ in range(m):
ai, bi = list(map(int, input().split()))
a.append(ai-1)
b.append(bi-1)
# 不便さのMAX
result = [n * (n-1) // 2]
labe... | p03108 |
import math
def P(n, r):
return math.factorial(n)//math.factorial(n-r)
def C(n, r):
return P(n, r)//math.factorial(r)
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
e... | import math
def P(n, r):
return math.factorial(n)//math.factorial(n-r)
def C(n, r):
return P(n, r)//math.factorial(r)
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
e... | p03108 |
N, M = list(map(int, input().split()))
ab = [tuple([int(x)-1 for x in input().split()]) for _ in range(M)]
class UnionFind:
def __init__(self, size):
self.rank = [-1 for _ in range(size)]
self.number = [1 for _ in range(size)]
def find(self, x):
while self.rank[x] >= 0:
... | import sys
N, M = list(map(int, input().split()))
ab = [tuple([int(x)-1 for x in sys.stdin.readline().split()]) for _ in range(M)]
class UnionFind:
def __init__(self, size):
self.rank = [-1 for _ in range(size)]
self.number = [1 for _ in range(size)]
def find(self, x):
wh... | p03108 |
import sys
from itertools import combinations
# https://ikatakos.com/pot/programming_algorithm/data_structure/union_find_tree
class UnionFind:
def __init__(self, n):
# 負 : 根であることを示す。絶対値はランクを示す
# 非負: 根でないことを示す。値は親を示す
self.table = [-1] * n
self.n = n
self.max_inconv... | import sys
from itertools import combinations
# https://ikatakos.com/pot/programming_algorithm/data_structure/union_find_tree
class UnionFind:
def __init__(self, n):
self.table = [-1] * n
self.n = n
self.inconvenience = n * (n - 1) // 2
def _root(self, x):
stack = []... | p03108 |
import sys
from itertools import combinations
# https://ikatakos.com/pot/programming_algorithm/data_structure/union_find_tree
class UnionFind:
def __init__(self, n):
self.table = [-1] * n
self.n = n
self.inconvenience = n * (n - 1) // 2
def _root(self, x):
stack = []... | import sys
from itertools import combinations
# https://ikatakos.com/pot/programming_algorithm/data_structure/union_find_tree
class UnionFind:
def __init__(self, n):
self.table = [-1] * n
self.n = n
self.inconvenience = n * (n - 1) // 2
def _root(self, x):
stack = []... | p03108 |
n,m = list(map(int, input().split()))
bridges = []
for i in range(m):
bridges.append([int(x) for x in input().split()])
'''
g = list(range(n+1))
ng = [1 for _ in range(n+1)]
gl = [[i] for i in range(n+1)]
ans = []
unconf = n*(n-1)//2
ans.append(unconf)
for x in reversed(bridges):
a,b = x
... | n,m = list(map(int, input().split()))
bridges = []
for i in range(m):
bridges.append([int(x) for x in input().split()])
'''
g = list(range(n+1))
ng = [1 for _ in range(n+1)]
gl = [[i] for i in range(n+1)]
ans = []
unconf = n*(n-1)//2
ans.append(unconf)
for x in reversed(bridges):
a,b = x
... | p03108 |
import math
from collections import defaultdict
from collections import deque
class UnionFindTree:
'''
Union Find Tree
'''
def __init__(self):
self.p = {}
self.rank = {}
def make(self, x):
self.p[x] = x
self.rank[x] = 0
def find(self, x):
... | from collections import defaultdict
from collections import deque
class UnionFindTree:
def __init__(self):
self.p = {}
self.rank = {}
def make(self, x):
self.p[x] = x
self.rank[x] = 0
def find(self, x):
if x in self.p:
if self.p[x] != x:... | p03108 |
import sys
sys.setrecursionlimit(100000)
N,M=list(map(int,input().split()))
AB=[list(map(int,input().split())) for _ in range(M)]
AB.reverse()
par=list(range(1,N+1))
size=[1]*N
ans=[(N-1)*N//2]*M
def spar(n):
if par[n-1]==n:
return n
else:
return spar(par[n-1])
for i in range(0,M-1):
A... | import sys
sys.setrecursionlimit(100000)
N,M=list(map(int,input().split()))
AB=[list(map(int,input().split())) for _ in range(M)]
AB.reverse()
par=list(range(1,N+1))
size=[1]*N
ans=[(N-1)*N//2]*M
def spar(n):
if par[n-1]==n:
return n
else:
par[n-1]=spar(par[n-1])
return par[n-1]
for ... | p03108 |
class UnionFind:
__slots__ = ["_size", "_first_idx", "_parents"]
def __init__(self, size: int, first_index: int = 0) -> None:
self._size = size
self._first_idx = first_index
self._parents = [-1] * (size + first_index)
def find(self, x: int) -> int:
"""Find the grou... | class UnionFind:
__slots__ = ["_size", "_first_idx", "_parents"]
def __init__(self, size: int, first_index: int = 0) -> None:
self._size = size
self._first_idx = first_index
self._parents = [-1] * (size + first_index)
def find(self, x: int) -> int:
"""Find the grou... | p03108 |
from itertools import combinations
n,m = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(m)]
class Unionfind():
def __init__(self,n):
self.n = n
self.parents = [-1]*n
def find(self,x):
if self.parents[x] < 0:
return x
... | n,m = list(map(int,input().split()))
AB = [list(map(int,input().split())) for _ in range(m)]
class Unionfind():
def __init__(self,n):
self.n = n
self.parents = [-1]*n
def find(self,x):
if self.parents[x] < 0:
return x
else:
self.parents... | p03108 |
sn,bn=list(map(int,input().split(" ")))
fubensa=[int(sn*(sn-1)/2)]
if bn>1:
br=[]
for _ in range(bn):
br.append(list(map(int, input().split(" "))))
br=br[::-1]
sg=[0 for n in range(sn+1)]
sg[br[0][0]]=1
sg[br[0][1]]=1
gn=1
fubensa.append(fubensa[0]-1)
sgc=[0,2]
... | sn,bn=map(int,input().split(" "))
fu=[int(sn*(sn-1)/2)]
gr_si=[n for n in range(sn+1)]
siL_gr=[[n] for n in range(sn+1)]
siL_br=[]
for _ in range(bn):
siL_br.append(list(map(int, input().split(" "))))
siL_br=siL_br[::-1]
for bri in range(bn-1):
si1,si2=siL_br[bri]
gr1 = gr_si[si1]
gr2 = gr_... | p03108 |
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]
def Unit... | 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]
def Unit... | p03108 |
# https://atcoder.jp/contests/abc120/tasks/abc120_d
class UnionFind():
def __init__(self,n):
self.n = n
self.parents = [-1]*n
def find(self,x):
if self.parents[x] < 0:
return x
self.parents[x] = self.find(self.parents[x])
return self.parents[x... | # https://atcoder.jp/contests/abc120/tasks/abc120_d
class UnionFind():
def __init__(self,n):
self.n = n
self.parents = [-1]*n
def find(self,x):
if self.parents[x] < 0:
return x
self.parents[x] = self.find(self.parents[x])
return self.parents[x... | p03108 |
import sys
class UnionFind():
def __init__(self, num):
self.par = [-1]*num
self.size = [1]*num
def find(self, x):
if self.par[x] < 0:
return x
else:
x = self.par[x]
return self.find(x)
def union(self, x, y):
rx =... | import sys
class UnionFind():
def __init__(self, num):
self.par = [-1]*num
def find(self, x):
if self.par[x] < 0:
return x
else:
x = self.par[x]
return self.find(x)
def union(self, x, y):
rx = self.find(x)
ry = s... | p03108 |
# https://atcoder.jp/contests/abc120/tasks/abc120_d
import itertools
import collections
import bisect
import sys
input = sys.stdin.readline
# Union find
class UnionFind():
#負の値の場合根を表す。絶対値はツリーの高さ
#正の値は次の要素を返す、根まで続く
def __init__(self,size):
self.table = [-1 for _ in range(size)]
... | # https://atcoder.jp/contests/abc120/tasks/abc120_d
import itertools
import collections
import bisect
import sys
input = sys.stdin.readline
# Union find
class UnionFind():
#負の値の場合根を表す。絶対値はツリーの高さ
#正の値は次の要素を返す、根まで続く
def __init__(self,size):
self.table = [-1 for _ in range(size)]
... | p03108 |
from collections import deque
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
else:
self.par[x] = self.find(self.par[x])... | from collections import deque
import sys
input = sys.stdin.readline
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
else:
... | p03108 |
#!/usr/bin/env python3
import sys
# refered to
# rank : http://at274.hatenablog.com/entry/2018/02/02/173000
# size : abc120 kaisetsu
class UnionFind:
def __init__(self, n):
# par = Parent Number or NoV
self.par = [-1] * (n+1)
# rank = Tree Height
self.rank = [0] * (n+1)
... | #!/usr/bin/env python3
import sys
# refered to
# rank : http://at274.hatenablog.com/entry/2018/02/02/173000
# size : abc120 kaisetsu
class UnionFind:
def __init__(self, n):
# par = Parent Number or NoV
self.par = [-1] * (n+1)
# rank = Tree Height
self.rank = [0] * (n+1)
... | p03108 |
#!/usr/bin/env python3
import sys
# refered to
# rank : http://at274.hatenablog.com/entry/2018/02/02/173000
# size : abc120 kaisetsu
class UnionFind:
def __init__(self, n):
# par = Parent Number or NoV
self.par = [-1] * (n+1)
# rank = Tree Height
self.rank = [0] * (n+1)
... | #!/usr/bin/env python3
import sys
# refered to
# rank : http://at274.hatenablog.com/entry/2018/02/02/173000
# size : abc120 kaisetsu
class UnionFind:
def __init__(self, n):
# par = Parent Number or NoV
self.par = [-1] * (n+1)
# rank = Tree Height
self.rank = [0] * (n+1)
... | p03108 |
tmp=input().split(" ")
n = int(tmp[0])
m = int(tmp[1])
node_groups = [ i for i in range(n)]
group_nodes = [ [i] for i in range(n)]
edges = []
for i in range(m):
tmp=input().split(" ")
edges.append([int(tmp[0])-1, int(tmp[1])-1])
hubensa_list = [0] * (m + 1)
hubensa_list[m] = n*(n-1)//2
for i ... | import sys
sys.setrecursionlimit(100000)
tmp=input().split(" ")
n = int(tmp[0])
m = int(tmp[1])
node_groups = [ i for i in range(n)]
group_sizes = [ 1 for _ in range(n)]
edges = []
for i in range(m):
tmp=input().split(" ")
edges.append([int(tmp[0])-1, int(tmp[1])-1])
hubensa_list = [0] * (m... | p03108 |
from collections import Counter
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[... | from collections import Counter
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[... | p03108 |
def find(tab, a):
if tab[a]==-1:
return a
tab[a] = find(tab, tab[a])
return tab[a]
def union(tab, a, b):
p1, p2 = find(tab, a), find(tab, b)
if p1 != p2:
tab[p1] = p2
def count(tab, a):
ans = 0
parent = find(tab, a)
for b in range(len(tab)):
if fi... | import sys
sys.setrecursionlimit(100000)
def find(tab, a):
if tab[0][a]==a:
return a
tab[0][a] = find(tab, tab[0][a])
return tab[0][a]
def union(tab, a, b):
p1, p2 = (find(tab, a), find(tab, b))
if p1 != p2:
tab[0][p1] = p2
tab[1][p2] += tab[1][p1]
def size(... | p03108 |
class UnionFind():
'''
@properties
parents:
- 各要素の親要素の番号を格納するリスト
- 要素が根の場合はそのグループの要素数を格納する
'''
def __init__(self,n):
self.n = n
self.parents = [-1] * n
def __str__(self):
return '\n'.join('{}: {}'.format(r,self.members(r)) for r i... | class UnionFind():
'''
@properties
parents:
- 各要素の親要素の番号を格納するリスト
- 要素が根の場合はそのグループの要素数を格納する
'''
def __init__(self,n):
self.n = n
self.parents = [-1] * n
def __str__(self):
return '\n'.join('{}: {}'.format(r,self.members(r)) for r i... | p03108 |
class UnionFind:
def __init__(self, n):
# 親要素のノード番号を格納。par[x] == xの時そのノードは根
self.parent = [i for i in range(n + 1)]
# 木の高さを格納する（初期状態では0）
self.rank = [0] * (n + 1)
# 木の要素数
self.size = [1] * (n + 1)
self.score = n * (n - 1) // 2
# 検索
def fi... | class UnionFind:
def __init__(self, n):
# 親要素のノード番号を格納。par[x] == xの時そのノードは根
self.parent = [i for i in range(n + 1)]
# 木の高さを格納する（初期状態では0）
self.rank = [0] * (n + 1)
# 木の要素数
self.size = [1] * (n + 1)
self.score = n * (n - 1) // 2
# 検索
def fi... | p03108 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
# A = [ int(input()) for _ in range(N) ]
##############################
class UnionFind:
def __init__(self, N):
self.rank = [0] * N
self.parent = [i for i in range(N)]
self... |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
# A = [ int(input()) for _ in range(N) ]
##############################
class UnionFind:
def __init__(self, N):
self.rank = [0] * N
self.parent = [i for i in range(N)]
self.n... | p03108 |
#sizeありversion
class DisjointSet:
def __init__(self):
self.rank = {}
self.p = {}
self._size = {}
def makeSet(self, x):
self.p[x] = x
self.rank[x] = 0
self._size[x] = 1
def same(self, x, y):
return self.findSet(x) == self.findSet(y)
... | #sizeありversion
class DisjointSet:
def __init__(self):
self.rank = {}
self.p = {}
self._size = {}
def makeSet(self, x):
self.p[x] = x
self.rank[x] = 0
self._size[x] = 1
def same(self, x, y):
return self.findSet(x) == self.findSet(y)
... | p03108 |
class Union:
def __init__(self, num):
self.T = [-1 for i in range(num)]
def root(self, x):
if self.T[x] < 0: return x
return self.root(self.T[x])
def size(self, x):
return -self.T[self.root(x)]
def merge(self, x, y):
a = self.root(x)
b = self.root(y)
if a == b: ret... | class Union:
def __init__(self, num):
self.T = [-1 for i in range(num)]
def root(self, x):
if self.T[x] < 0: return x
return self.root(self.T[x])
def size(self, x):
return -self.T[self.root(x)]
def merge(self, x, y):
a = self.root(x)
b = self.root(y)
if a == b: ret... | p03108 |
N, M = list(map(int, input().split()))
B = [list(map(int, input().split())) for _ in range(M)]
pt = []
G = [0 for x in range(N+1)]
C = [1 for x in range(N+1)]
def find(x):
while G[x] != 0:
x = G[x]
return x
cnt = 0
while len(B):
x, y = B.pop()
wx = find(x)
wy = find(y)
... | N, M = list(map(int, input().split()))
B = [list(map(int, input().split())) for _ in range(M)]
pt = []
G = [[None, 1] for x in range(N+1)]
def find(x):
n = G[x]
c = []
while not n[0] is None:
c.append(n)
n = n[0]
for ci in c:
ci[0] = n
return n
cnt = 0
whi... | p03108 |
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):
... | def find(x):
if P[x] < 0:
return x
else:
P[x] = find(P[x])
return P[x]
N, M, *X = list(map(int,open(0).read().split()))
P = [-1] * (N + 1)
S = N * (N - 1) // 2
r = [S]
while X:
b, a = find(X.pop()), find(X.pop())
if a != b:
S -= P[a] * P[b]
if P[a] > P[b]:
a, b = b, ... | p03108 |
def find(x):
if P[x] < 0:
return x
else:
P[x] = find(P[x])
return P[x]
N, M, *X = list(map(int,open(0).read().split()))
P = [-1] * (N + 1)
S = N * (N - 1) // 2
r = [S]
while X:
b, a = find(X.pop()), find(X.pop())
if a != b:
S -= P[a] * P[b]
if P[a] > P[b]:
a, b = b, ... | def find(x):
if P[x] < 0:
return x
else:
P[x] = find(P[x])
return P[x]
N, M, *X = map(int,open(0).read().split())
P = [-1] * (N + 1)
S = N * (N - 1) // 2
r = [S]
while X:
b, a = find(X.pop()), find(X.pop())
if a != b:
S -= P[a] * P[b]
if P[a] > P[b]:
a, b = b, a
... | p03108 |
from functools import reduce
from operator import mul
def cmb(n,r):
r = min(r, n-r)
if r==0: return 1
if r<0: return 0
over = reduce(mul, list(range(n, n-r, -1)))
under = reduce(mul, list(range(1,r+1)))
return over//under
class UnionFind:
def __init__(self, n):
self.par = [i for i in ra... | class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n)]
self.size = [1]*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)
... | p03108 |
import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
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:
... | import sys
read = sys.stdin.buffer.read
input = sys.stdin.readline
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(m... | p03108 |
import sys
input = sys.stdin.readline
class Node:
def __init__(self):
self.is_root = True
self.parent = None
self.child_num = 0
def root_node(self):
node = self
while not node.is_root:
node = node.parent
return node
def main():
... | import sys
input = sys.stdin.readline
class Node:
def __init__(self):
self.is_root = True
self.parent = None
self.child_num = 0
def root_node(self):
node = self
while not node.is_root:
node = node.parent
return node
def main():
... | p03108 |
import sys
input = sys.stdin.readline
class Node:
def __init__(self):
self.is_root = True
self.parent = None
self.child_num = 0
def root_node(self):
node = self
while not node.is_root:
node = node.parent
return node
def main():
... | import sys
input = sys.stdin.readline
class Node:
def __init__(self):
self.is_root = True
self.parent = None
self.child_num = 0
def root_node(self):
node = self
while not node.is_root:
node = node.parent
return node
def main():
... | p03108 |
import sys
input_int = lambda:int(eval(input()))
input_ints = lambda:list(map(int,input().split()))
input_ints_list = lambda:list(input_ints())
input_str = lambda:eval(input())
input_strs = lambda:input().split()
input_lines = lambda n,f:[f() for _ in range(n)]
import functools,fractions
gcd = lambda a:func... | import sys
input_int = lambda:int(eval(input()))
input_ints = lambda:list(map(int,input().split()))
input_ints_list = lambda:list(input_ints())
input_str = lambda:eval(input())
input_strs = lambda:input().split()
input_lines = lambda n,f:[f() for _ in range(n)]
import functools,fractions
gcd = lambda a:func... | p03108 |
import sys
sys.setrecursionlimit(10 ** 7)
class UnionFind:
def __init__(self, size: int):
self.parent = [-1 for _ in range(size)]
self.size = [1 for _ in range(size)]
def unite(self, x, y):
px = self.find(x)
py = self.find(y)
if px != py:
if se... | class UnionFind:
def __init__(self, size: int):
self.parent = [-1 for _ in range(size)]
def unite(self, x, y):
px = self.find(x)
py = self.find(y)
if px == py:
return
if self.size(px) > self.size(py):
px, py = py, px
self.parent... | p03108 |
import collections as co
import copy as cp
L = co.deque()
N, M = list(map(int, input().split()))
def check(n, x, done):
try:
if n in dic[x]:
return True
else:
if x in done or len(dic[x]) == 0:
return False
done.add(x)
for j ... | import collections as co
L = co.deque()
N, M = list(map(int, input().split()))
def check(n, x, done):
try:
if n in dic[x]:
return True
else:
if x in done or len(dic[x]) == 0:
return False
done.add(x)
for j in dic[x]:
... | p03108 |
N, M = [int(i) for i in input().split()]
parent = [i for i in range(N+1)]
node_num = [1 for i in range(N+1)]
def find(x):
if parent[x] == x:
return x
else:
parent[x] = find(parent[x])
return parent[x]
def find_for(x):
while parent[x] != x:
x = parent[x]
retu... | import sys
sys.setrecursionlimit(10**6)
N, M = [int(i) for i in input().split()]
parent = [i for i in range(N+1)]
node_num = [1 for i in range(N+1)]
def find(x):
if parent[x] == x:
return x
else:
parent[x] = find(parent[x])
return parent[x]
bridge = []
for i in range(M):
... | p03108 |
#D問題再チャレンジ
#Union Find
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 self.par[x] == x:
return x
else:
self.par[x] = self.fin... | 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)
self.con = [0] * (m+1)#convenience
# 検索
def find(self, x):
if self.par[x] == x:
return x
else:
self.... | p03108 |
#要素の根を探す関数
def find_root(n):
while(parts[n-1][0]!=n-1):
n=parts[n-1][0]+1
return tuple(parts[n-1])
#入力を受け取る
N,M=list(map(int,input().split()))
AB=[list(map(int,input().split())) for i in range(M)]
#partsの1つ目は根の番号、2つ目は深さ、3つ目は接続されている要素数
parts=[[i,1,1] for i in range(N)]
#全部壊れた時の不便度はN(N-1)
a... | #要素の根を探す関数
def find_root(n):
while(parts[n-1][0]!=n-1):
n=parts[n-1][0]+1
return tuple(parts[n-1])
#入力を受け取る
N,M=list(map(int,input().split()))
AB=[list(map(int,input().split())) for i in range(M)]
#partsの1つ目は根の番号、2つ目は深さ、3つ目は接続されている要素数
parts=[[i,1,1] for i in range(N)]
#全部壊れた時の不便度はN(N-1)
a... | p03108 |
#要素の根を探す関数
def find_root(n,parts):
root=[]
n=n-1
#根をnとして返す
while(parts[n][0]!=n):
root.append(n)
n=parts[n][0]
#途中で見つけた要素は全てnに繋ぐことで経路圧縮
for i in root:
parts[i][0]=n
#partsをタプルで返す
return tuple(parts[n])
#入力を受け取る
N,M=list(map(int,input().split()))
A... | #要素の根を探す関数
def find_root(n,parts):
n=n-1
#partsをタプルで返す
if parts[n][0]==n:
return tuple(parts[n])
else:
return find_root(parts[n][0]+1,parts)
#入力を受け取る
N,M=list(map(int,input().split()))
AB=[list(map(int,input().split())) for i in range(M)]
#partsの1つ目は根の番号、2つ目は深さ、3つ目は接続されている... | p03108 |
import itertools
[N, M] = list(map(int, input().split(' ')))
bridge_list = []
for _ in range(M):
[a, b] = list(map(int, input().split(' ')))
bridge_list.append((a - 1, b - 1))
# print(bridge_list)
convenience_list = []
inconvenience_list = list(itertools.combinations(list(range(N)), 2))
# print... | class UnionFindNode(object):
def __init__(self, group_id, parent=None, value=None):
self.group_id = group_id
self.parent_ = parent
self.value = value
self.size_ = 1
def __str__(self):
return "UnionFindNode(group_id: {}, \n\tparent: {}, value: {}, size: {})".forma... | p03108 |
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 unite(self,x,y):
x = sel... | 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 unite(self,x,y):
x = sel... | p03108 |
import sys
from io import StringIO
import unittest
import os
# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)
class UnionFind:
def __init__(self, n):
"""
コンストラクタ
:要素数 n:
"""
self.n = n
# 添字x: 値yとすると・・
# root以外の場合： 要... | import sys
from io import StringIO
import unittest
import os
# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)
class UnionFind:
def __init__(self, n):
"""
コンストラクタ
:要素数 n:
"""
self.n = n
# 添字x: 値yとすると・・
# root以外の場合： 要... | p03108 |
class UnionFindTree:
'''
Union Find木の実装
ランクは無視する
'''
def __init__(self, n):
'''ノード数nで初期化'''
# nodes[i] == i すなわち各ノードは自身が根
self.nodes = list(range(n))
def isSameTree(self, idxA, idxB):
return self.root(idxA) == self.root(idxB)
def union... | class UnionFindTree:
'''
Union Find木の実装
ランクは無視する
'''
def __init__(self, n):
'''ノード数nで初期化'''
# nodes[i] < 0 すなわち各ノードは自身が根
# 根の値はその木の要素数の符号反転したもの
self.nodes = [-1] * n
def is_root(self, idx):
'''根ならTrue、根以外ならFalse'''
return self.n... | p03108 |
class UnionFind:
def __init__(self, size):
self.parent = [-1] * size
self.rank = [0] * size
self.num = self.parent
def unite(self, n1, n2):
rank, parent, num = self.rank, self.parent, self.num
root, root_2 = self.find(n1), self.find(n2)
if rank[root] >... | class UnionFind:
def __init__(self, size):
self.parent = [-1] * size
self.rank = [0] * size
self.num = self.parent
def unite(self, n1, n2):
rank, parent, num = self.rank, self.parent, self.num
root, root_2 = self.find(n1), self.find(n2)
if rank[root] >... | p03108 |
import sys
input = sys.stdin.readline
def readlines(n):
for _ in range(n):
a, b = list(map(int, input().split()))
yield a, b
def main():
n, m = list(map(int, input().split()))
bridges = list(readlines(m))
tree = list(range(n+1))
rank = [1] * (n+1)
def root(v):
... | import sys
input = sys.stdin.readline
def readlines(n):
for _ in range(n):
a, b = list(map(int, input().split()))
yield a, b
n, m = list(map(int, input().split()))
bridges = list(readlines(m))
tree = list(range(n+1))
rank = [1] * (n+1)
def root(v):
while tree[v] != v:
... | p03108 |
class UnionFind():
# コンストラクタ
def __init__(self, n):
# 要素数
self.n = n
# parents[i]: 要素iの親要素の番号
# 要素iが根の場合、parents[i] = -(そのグループの要素数)
self.parents = [-1] * n
# 要素xが属するグループの根を返す
# 経路圧縮
def find(self, x):
if self.parents[x] < 0:
r... | class UnionFind():
# コンストラクタ
def __init__(self, n):
# 要素数
self.n = n
# parents[i]: 要素iの親要素の番号
# 要素iが根の場合、parents[i] = -(そのグループの要素数)
self.parents = [-1] * n
# 要素xが属するグループの根を返す
# 経路圧縮
def find(self, x):
if self.parents[x] < 0:
r... | p03108 |
class UnionFind():
def __init__(self, n):
self.parent = [-1 for _ in range(n)]
# 正==子: 根の頂点番号 / 負==根: 連結頂点数
def find(self, x):
if self.parent[x] < 0:
return x
else:
self.parent[x] = self.find(self.parent[x])
return self.parent[x]
... | class UnionFind():
def __init__(self, n):
self.parent = [-1 for _ in range(n)]
# 正==子: 根の頂点番号 / 負==根: 連結頂点数
def find(self, x):
if self.parent[x] < 0:
return x
else:
self.parent[x] = self.find(self.parent[x])
return self.parent[x]
... | p03108 |
class UnionFind:
def __init__(self, n):
self.v = [-1] * n
def find(self, x):
if self.v[x] < 0:
return x
else:
self.v[x] = self.find(self.v[x])
return self.v[x]
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
... | class UnionFind:
def __init__(self, n):
self.v = [-1] * n
def find(self, x):
if self.v[x] < 0:
return x
else:
self.v[x] = self.find(self.v[x])
return self.v[x]
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
... | p03108 |
import sys
sys.setrecursionlimit(10**9)
from collections import Counter
from itertools import permutations, combinations,combinations_with_replacement,product
from collections import defaultdict
input = sys.stdin.readline
icase=0
if icase==0:
n,m=list(map(int,input().split()))
a=[0]*m
b=[0]*... | import sys
sys.setrecursionlimit(10**9)
from collections import Counter
from itertools import permutations, combinations,combinations_with_replacement,product
from collections import defaultdict
input = sys.stdin.readline
icase=0
if icase==0:
n,m=list(map(int,input().split()))
a=[0]*m
b=[0]*... | p03108 |
import sys
sys.setrecursionlimit(10**9)
from collections import defaultdict
input = sys.stdin.readline
icase=0
if icase==0:
n,m=list(map(int,input().split()))
a=[0]*m
b=[0]*m
for i in range(m):
ai,bi=list(map(int,input().split()))
a[i]=ai-1
b[i]=bi-1
pair=[i ... | import sys
sys.setrecursionlimit(10**9)
from collections import defaultdict
input = sys.stdin.readline
icase=0
if icase==0:
n,m=list(map(int,input().split()))
a=[0]*m
b=[0]*m
for i in range(m):
ai,bi=list(map(int,input().split()))
a[i]=ai-1
b[i]=bi-1
pair=[i ... | p03108 |
def check_connection(bridge_data, a_bridge, b_bridge):
flg = 1
fin_flg = 0
a_bridge_data = set([a_bridge])
b_bridge_data = set([b_bridge])
pre_a = 1
pre_b = 1
while flg:
flg = 0
for i in range(len(bridge_data)):
bridge_data_now = bridge_data[i]
... |
def get_parent(num, parent):
if parent[num] == num:
return num
else:
return get_parent(parent[num], parent)
def calc_change_data(ans, parent, a_parent, b_parent, island_count):
big_parent = max(a_parent, b_parent)
min_parent = min(a_parent, b_parent)
parent[big_parent] = ... | p03108 |
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
... | #!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
... | p03108 |
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
... | #!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
... | p03108 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline()... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [lis... | p03108 |
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [lis... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [lis... | p03108 |
# -*- coding: utf-8 -*-
"""
・ライブラリ確認用
"""
import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians, log10
if sys.version_info.minor >= 5: from math import gcd
else: from fractions import gcd
from heapq import heappop, heappush, heapi... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p03108 |
n,m=list(map(int,input().split()))
ab=[list(map(int, input().split())) for _ in range(m)]
ab=ab[::-1]
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... | n,m=list(map(int,input().split()))
ab=[list(map(int, input().split())) for _ in range(m)]
ab=ab[::-1]
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... | p03108 |
# coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, M = lr()
AB = [lr() for _ in range(M)]
V = [x for x in range(N+1)]
total = N * (N-1) // 2
def find(A, x):
parent = A[x]
if parent == x: return x
root = ... | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, M = lr()
AB = [lr() for _ in range(M)]
V = [x for x in range(N+1)]
total = N * (N-1) // 2
def find(A, x):
parent = A[x]
if parent == x: return x
root = ... | p03108 |
def comb(n):
return (n * (n - 1)) // 2
def main():
n, m = [int(a) for a in input().split()]
AB = [
[int(a) for a in input().split()]
for _ in range(m)
]
table = {i: (1, set([i])) for i in range(n)} # (便利さ,行ける島集合)
current_benrisa = 0
max_hubensa = comb(n)
... | def comb(n):
return (n * (n - 1)) // 2
def main():
n, m = [int(a) for a in input().split()]
AB = [
[int(a) for a in input().split()]
for _ in range(m)
]
table = {i: {i} for i in range(n)} # (便利さ,行ける島集合)
current_benrisa = 0
max_hubensa = comb(n)
rev... | p03108 |
def comb(n):
return n * (n - 1) // 2
class UnionFind():
def __init__(self, size):
self.table = [-1 for _ in range(size)]
def find(self, x):
if self.table[x] < 0:
return x
else:
self.table[x] = self.find(self.table[x])
return self.tabl... | class UnionFind:
def __init__(self, size):
self.data = [-1 for _ in range(size)]
def find(self, x):
if self.data[x] < 0:
return x
else:
self.data[x] = self.find(self.data[x])
return self.data[x]
def union(self, x, y):
x, y = self.... | p03108 |
N, M = [int(x) for x in input().split()]
A = []
B = []
for i in range(M):
a, b = [int(x) for x in input().split()]
A.append(a)
B.append(b)
A.reverse()
B.reverse()
import math
Z = N * (N - 1) // 2
L = []
ans = []
for i in range(M):
a, b = A[i], B[i]
ia, ib = -1, -1
for... | import sys
sys.setrecursionlimit(100000)
N, M = [int(x) for x in input().split()]
g = 0
A = []
B = []
for i in range(M):
a, b = [int(x) for x in input().split()]
A.append(a)
B.append(b)
A.reverse()
B.reverse()
# ----- Union Find -----------
PARENT = list(range( N + 1 ))
SIZE = [1] ... | p03108 |
import sys
input = sys.stdin.readline
n, m = [int(x) for x in input().split()]
ab = [[int(x) for x in input().split()] for _ in range(m)][::-1]
#Union Find
#xの根を求める
def find(x):
if par[x] < 0:
return x
else:
par[x] = find(par[x])
return par[x]
#xとyの属する集合の併合
def unite(x... | import sys
input = sys.stdin.readline
n, m = [int(x) for x in input().split()]
ab = [[int(x) for x in input().split()] for _ in range(m)][::-1]
#Union Find
#xの根を求める
def find(x):
if par[x] < 0:
return x
else:
par[x] = find(par[x])
return par[x]
#xとyの属する集合の併合
def unite(x... | p03108 |
n,m = list(map(int,input().split()))
ab = [list(map(int,input().split())) for _ in range(m)]
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x... | n,m = list(map(int,input().split()))
ab = [list(map(int,input().split())) for _ in range(m)]
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x... | p03108 |
n, m=list(map(int, input().split()))
a=[0 for i in range(m)]
b=[0 for i in range(m)]
g=[list() for i in range(1+n)]
#print(g)
for i in range(m):
a[i], b[i]=list(map(int, input().split()))
g[a[i]].append(b[i])
g[b[i]].append(a[i])
#print(g)
def Count_n_d(neighbor, start, search):
visited... | import sys
sys.setrecursionlimit(100000)
n, m=list(map(int, input().split()))
a=[0 for i in range(m)]
b=[0 for i in range(m)]
g=[list() for i in range(1+n)]
#print(g)
par=[i for i in range(n)]
cnt_con=[1 for i in range(n)]
def root(x):
if x==par[x]:
return x
else:
par[x]=root(... | p03108 |
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor
import heapq
import itertools
import operator
inf = float('inf')
def get_int():
return int(... | from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque, OrderedDict
from copy import deepcopy
from functools import lru_cache, reduce
from math import ceil, floor
import heapq
import itertools
import operator
inf = float('inf')
def get_int():
return int(... | p03108 |
class UnionFind_size:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.size = [1] * (n+1)
# 根を検索する関数
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.find(... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
class UnionFind:
def __init__(self, n):
# 初期状態は全要素が根なので、親は自分自身
self.par = [i for i in range(n+1)]
# 集団の要素数(size)を格納する(初期は全て1)
self.size = [1] * (n+1)
# 根を検索する関数
d... | p03108 |
import itertools
n, m = list(map(int, input().split()))
pair = []
for i in range(m):
pair.append(list(map(int, input().split())))
ans = []
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... | n, m = list(map(int, input().split()))
pair = []
for i in range(m):
pair.append(list(map(int, input().split())))
pair = pair[::-1]
ans = []
ans.append(int(n*(n-1)/2))
class UnionFind:
def __init__(self, n):
self.par = [-1] * (n+1)
self.rank = [0] * (n+1)
def find(self, x):
... | p03108 |
def top(L, node):
current = node
while L[current] != current:
current = L[current]
return current
def main():
n, m = list(map(int, input().rstrip("\n").split(" ")))
L = [0]
counts = {}
for i in range(1, n + 1):
L.append(i)
counts[i] = 1
edges =... | def main():
n, m = list(map(int, input().rstrip("\n").split(" ")))
L = [0]
counts = {}
for i in range(1, n + 1):
L.append(i)
counts[i] = 1
edges = []
for j in range(m):
a_b = list(map(int, input().rstrip("\n").split(" ")))
edges.append(a_b)
to... | p03108 |
class DisjointSet:
def __init__(self,n):
self.rank = [0]*n
self.parent = [i for i in range(n)]
self.siz = [1]*n
def same(self,x,y):
return self.findSet(x) == self.findSet(y)
def unite(self,x,y):
return self.link(self.findSet(x), self.findSet(y))
d... | class DisjointSet:
def __init__(self,n):
self.parent = [i for i in range(n)]
self.siz = [1]*n
def root(self,x):
if x != self.parent[x]:
self.parent[x] = self.root(self.parent[x])
return self.parent[x]
def same(self,x,y):
return self.root(x) ... | p03108 |
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):
... | p03108 |
n,m = [int(i) for i in input().split()]
ab = []
for i in range(m):
ab.append([int(i)-1 for i in input().split()])
def find_index(c,eld):
if c in eld[c]:
return(c,len(eld[c]))
else:
return(eld[c][0],len(eld[eld[c][0]]))
eld = []
for i in range(n):
eld.append([i])
stat = eld
an... | n,m = [int(i) for i in input().split()]
ab = []
for i in range(m):
ab.append([int(i)-1 for i in input().split()])
def find_index(c,eld):
if c in eld[c]:
return(c,len(eld[c]))
else:
return(eld[c][0],len(eld[eld[c][0]]))
eld = []
for i in range(n):
eld.append([i])
stat = eld
an... | p03108 |
import collections
N, M = list(map(int, input().split()))
AB = [list(map(int, input().split())) for i in range(M)]
class UnitDict(dict):
def __init__(self, iterable=None, wrapper=lambda x: x):
super().__init__(self)
self.wrapper = wrapper
if iterable is not None:
... | N, M = list(map(int, input().split()))
AB = [list(map(int, input().split())) for i in range(M)]
class UnionFind():
def __init__(self, N):
self.rank = [0] * N
self.par = [i for i in range(N)]
self.counter = [1] * N
def find(self, x):
if self.par[x] == x:
... | p03108 |
import sys
import collections
n, m = list(map(int, sys.stdin.readline().split()))
p = list(range(n))
r = [1] * n
def li_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def find(x):
global p
if p[x] != x:
p[x] = find(p[x])
return p[x]
def union(x, y):
x, y ... |
import sys
import collections
n, m = list(map(int, sys.stdin.readline().split()))
p = list(range(n))
r = [1] * n
def li_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def find(x):
global p
if p[x] != x:
p[x] = find(p[x])
return p[x]
def union(x, y):
x, y ... | p03108 |
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... | 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... | p03108 |
class UnionFind():
def __init__(self, n):
self.n=n
self.p=[-1]*n
def find(self,x):
if self.p[x]<0:
return x
else:
self.p[x]=self.find(self.p[x])
return self.p[x]
def same(self,x,y):
return self.find(x)==self.find(y)
def unite(self,x,y):
x = self.find(x)... | n, m = list(map(int, input().split()))
e = [[int(x) for x in input().split()] for _ in range(m)]
u = [-1]*(n+1)
def find(x):
return x if u[x] < 0 else find(u[x])
t = n*(n-1)// 2
s = [t]
for i in range(m-1,0,-1):
a = find(e[i][0])
b = find(e[i][1])
if a > b:
a, b = b, a
if a != b:
... | p03108 |
n,m = list(map(int,input().split()))
isl1,isl2 = [0]*m,[0]*m
for i in range(m):
(isl1[i], isl2[i]) = list(map(int,input().split()))
isl1[i] -= 1
isl2[i] -= 1
boss = [-1]*n
member_number = [1]*n
dpt = [0]*n
ans = [0]*m
s = (n*(n-1))//2
ans[m-1] = s
def search_member(island, boss):
m = ... | #https://atcoder.jp/contests/abc120/submissions/4458925
(N,M) = list(map(int,input().split()))
A = [0]*M
B = [0]*M
for i in range(M):
(A[i], B[i]) = list(map(int,input().split()))
A[i] -= 1
B[i] -= 1
parent = [-1]*N
depth = [0] * N
def boss(n):
d = 0
while parent[n] >= 0:
... | p03108 |
import sys,queue,math
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in input().split()]
_LI = lambda : [int(x)-1 for x in input().split()]
N,M = LI()
B = [_LI() for _ in range(M)]
g = [i for i in range(N)]
c = [1 for _ in range(N)]
def ... | import sys,queue,math
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in input().split()]
_LI = lambda : [int(x)-1 for x in input().split()]
N,M = LI()
B = [_LI() for _ in range(M)]
g = [i for i in range(N)]
c = [1 for _ in range(N)]
def ... | p03108 |
#!/usr/bin/env python3
from pprint import pprint
import sys
sys.setrecursionlimit(10 ** 6)
# 辺を取り除くのではなく、辺が無い状態から始めて辺を順にグラフに追加していくことを考える
# 最初は辺が無いので不便さは N * (N-1) / 2
# 辺 u <-> v を追加したとき、頂点 u, v が既に到達可能であるなら、不便さは変わらない
# そうでなければ、不便さは直前の値より size[u] * size[v] だけ小さくなる
N, M = list(map(int, input().split())... | #!/usr/bin/env python3
from pprint import pprint
import sys
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
N, M = list(map(int, input().split()))
edges = []
for _ in range(M):
u, v = list(map(int, input().split()))
edges.append([u-1, v-1])
# どの島も繋がっていないとき、不便さは最大値 N * (N-1) / 2 を取る
# 1 本ず... | p03108 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.