library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub hidehic0/library

:heavy_check_mark: tests/unionfind.py

Depends on

Code

# competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/unionfind
from libs.unionfind import UnionFind
from libs.standard_input import *
from libs.yn_func import *

N, Q = il()
UF = UnionFind(N)

while Q:
    t, u, v = il()

    if t == 0:
        UF.unite(u, v)
    else:
        print(int(UF.same(u, v)))

    Q -= 1

Test cases

Env Name Status Elapsed Memory
Python example_00 :heavy_check_mark: AC 32 ms 12 MB
Python max_random_00 :heavy_check_mark: AC 881 ms 28 MB
Python max_random_01 :heavy_check_mark: AC 922 ms 28 MB
Python max_random_02 :heavy_check_mark: AC 883 ms 25 MB
Python path_00 :heavy_check_mark: AC 686 ms 35 MB
Python path_01 :heavy_check_mark: AC 759 ms 39 MB
Python path_02 :heavy_check_mark: AC 606 ms 46 MB
Python path_03 :heavy_check_mark: AC 597 ms 46 MB
Python random_00 :heavy_check_mark: AC 627 ms 24 MB
Python random_01 :heavy_check_mark: AC 653 ms 24 MB
Python random_02 :heavy_check_mark: AC 561 ms 21 MB
Python random_03 :heavy_check_mark: AC 136 ms 15 MB
Python random_04 :heavy_check_mark: AC 453 ms 18 MB
Python random_05 :heavy_check_mark: AC 728 ms 22 MB
Python random_06 :heavy_check_mark: AC 491 ms 22 MB
Python random_07 :heavy_check_mark: AC 75 ms 13 MB
Python random_08 :heavy_check_mark: AC 304 ms 14 MB
Python random_09 :heavy_check_mark: AC 846 ms 27 MB
Back to top page