This documentation is automatically generated by competitive-verifier/competitive-verifier
# competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/unionfind
from libs.standard_input import *
from libs.unionfind import UnionFind
from libs.yn_func import *
N, Q = il()
UF = UnionFind(N)
while Q:
t, u, v = il()
if t == 0:
UF.merge(u, v)
else:
print(int(UF.same(u, v)))
Q -= 1
| Env | Name | Status | Elapsed | Memory |
|---|---|---|---|---|
| Python | example_00 |
|
30 ms | 12 MB |
| Python | max_random_00 |
|
1169 ms | 28 MB |
| Python | max_random_01 |
|
1111 ms | 28 MB |
| Python | max_random_02 |
|
1165 ms | 25 MB |
| Python | path_00 |
|
926 ms | 35 MB |
| Python | path_01 |
|
921 ms | 39 MB |
| Python | path_02 |
|
697 ms | 46 MB |
| Python | path_03 |
|
695 ms | 46 MB |
| Python | random_00 |
|
795 ms | 24 MB |
| Python | random_01 |
|
775 ms | 24 MB |
| Python | random_02 |
|
697 ms | 21 MB |
| Python | random_03 |
|
147 ms | 15 MB |
| Python | random_04 |
|
497 ms | 17 MB |
| Python | random_05 |
|
731 ms | 22 MB |
| Python | random_06 |
|
546 ms | 22 MB |
| Python | random_07 |
|
95 ms | 13 MB |
| Python | random_08 |
|
271 ms | 15 MB |
| Python | random_09 |
|
1010 ms | 27 MB |