examples/python/union_find.aoj.py

• View this file on GitHub
• Last update: 2023-10-19 20:09:37+09:00
• Problem: https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_1_A

Depends on

• examples/python/union_find.py

Code

# competitive-verifier: PROBLEM https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_1_A
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()

Test cases

Env	Name	Status	Elapsed	Memory
Python	00_small_00	AC	18 ms	10 MB
Python	00_small_01	AC	18 ms	10 MB
Python	01_rand_00	AC	18 ms	10 MB
Python	01_rand_01	AC	18 ms	10 MB
Python	01_rand_02	AC	18 ms	10 MB
Python	01_rand_03	AC	18 ms	10 MB
Python	01_rand_04	AC	19 ms	10 MB
Python	01_rand_05	AC	18 ms	10 MB
Python	02_linear_00	AC	18 ms	10 MB
Python	02_linear_01	AC	20 ms	10 MB
Python	02_linear_02	AC	28 ms	11 MB
Python	02_linear_03	AC	39 ms	11 MB
Python	03_grid_00	AC	18 ms	10 MB
Python	03_grid_01	AC	18 ms	10 MB
Python	03_grid_02	AC	18 ms	10 MB
Python	03_grid_03	AC	18 ms	10 MB
Python	03_grid_04	AC	18 ms	10 MB
Python	03_grid_05	AC	18 ms	10 MB
Python	03_grid_06	AC	18 ms	11 MB
Python	03_grid_07	AC	19 ms	11 MB
Python	03_grid_08	AC	19 ms	11 MB
Python	04_critical_00	AC	39 ms	11 MB
Python	04_critical_01	AC	39 ms	11 MB
Python	05_groups_00	AC	66 ms	11 MB
Python	05_groups_01	AC	67 ms	11 MB
Python	05_groups_02	AC	68 ms	11 MB
Python	05_groups_03	AC	65 ms	11 MB
Python	05_groups_04	AC	65 ms	11 MB
Python	06_randmax_00	AC	20 ms	11 MB
Python	06_randmax_01	AC	74 ms	11 MB
Python	06_randmax_02	AC	95 ms	11 MB
Python	06_randmax_03	AC	128 ms	11 MB

Back to top page