# competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/unionfind
import sys
input = sys.stdin.buffer.readline
from examples.python.union_find import UnionFind
def main() -> None:
N, Q = map(int, input().split())
uf = UnionFind(N)
for _ in range(Q):
t, u, v = map(int, input().split())
if t == 0:
uf.unite(u, v)
else:
print(int(uf.is_same(u, v)))
if __name__ == "__main__":
main()
| Env | Name | Status | Elapsed | Memory |
|---|---|---|---|---|
| Python | example_00 |
|
19 ms | 11 MB |
| Python | max_random_00 |
|
305 ms | 17 MB |
| Python | max_random_01 |
|
316 ms | 18 MB |
| Python | max_random_02 |
|
266 ms | 13 MB |
| Python | path_00 |
|
249 ms | 20 MB |
| Python | path_01 |
|
251 ms | 20 MB |
| Python | path_02 |
|
249 ms | 20 MB |
| Python | path_03 |
|
258 ms | 20 MB |
| Python | random_00 |
|
235 ms | 17 MB |
| Python | random_01 |
|
238 ms | 18 MB |
| Python | random_02 |
|
170 ms | 13 MB |
| Python | random_03 |
|
60 ms | 18 MB |
| Python | random_04 |
|
133 ms | 11 MB |
| Python | random_05 |
|
196 ms | 13 MB |
| Python | random_06 |
|
192 ms | 20 MB |
| Python | random_07 |
|
39 ms | 15 MB |
| Python | random_08 |
|
75 ms | 11 MB |
| Python | random_09 |
|
290 ms | 16 MB |