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.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

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 964 ms 28 MB
Python max_random_01 :heavy_check_mark: AC 1093 ms 28 MB
Python max_random_02 :heavy_check_mark: AC 992 ms 25 MB
Python path_00 :heavy_check_mark: AC 706 ms 35 MB
Python path_01 :heavy_check_mark: AC 725 ms 40 MB
Python path_02 :heavy_check_mark: AC 596 ms 46 MB
Python path_03 :heavy_check_mark: AC 608 ms 46 MB
Python random_00 :heavy_check_mark: AC 725 ms 24 MB
Python random_01 :heavy_check_mark: AC 755 ms 24 MB
Python random_02 :heavy_check_mark: AC 538 ms 21 MB
Python random_03 :heavy_check_mark: AC 149 ms 15 MB
Python random_04 :heavy_check_mark: AC 438 ms 17 MB
Python random_05 :heavy_check_mark: AC 650 ms 22 MB
Python random_06 :heavy_check_mark: AC 540 ms 22 MB
Python random_07 :heavy_check_mark: AC 78 ms 13 MB
Python random_08 :heavy_check_mark: AC 238 ms 14 MB
Python random_09 :heavy_check_mark: AC 894 ms 27 MB
Back to top page