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 |
|
27 ms | 12 MB |
| Python | max_random_00 |
|
817 ms | 28 MB |
| Python | max_random_01 |
|
1010 ms | 29 MB |
| Python | max_random_02 |
|
932 ms | 25 MB |
| Python | path_00 |
|
639 ms | 35 MB |
| Python | path_01 |
|
660 ms | 40 MB |
| Python | path_02 |
|
542 ms | 46 MB |
| Python | path_03 |
|
547 ms | 46 MB |
| Python | random_00 |
|
832 ms | 24 MB |
| Python | random_01 |
|
587 ms | 25 MB |
| Python | random_02 |
|
516 ms | 21 MB |
| Python | random_03 |
|
125 ms | 15 MB |
| Python | random_04 |
|
540 ms | 18 MB |
| Python | random_05 |
|
898 ms | 22 MB |
| Python | random_06 |
|
602 ms | 22 MB |
| Python | random_07 |
|
67 ms | 13 MB |
| Python | random_08 |
|
235 ms | 14 MB |
| Python | random_09 |
|
895 ms | 27 MB |