library

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

View the Project on GitHub hidehic0/library

:heavy_check_mark: tests/potential_unionfind.py

Depends on

Code

# competitive-verifier: PROBLEM https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_1_B
from libs.potential_unionfind import PotentialUnionFind
from libs.standard_input import il

N, Q = il()
PUF = PotentialUnionFind(N)

while Q:
    l = il()

    if l[0] == 0:
        x, y, z = l[1:]

        PUF.unite(x, y, z)
    else:
        x, y = l[1:]
        if not PUF.same(x, y):
            print("?")
        else:
            print(PUF.diff(x, y))

    Q -= 1

Test cases

Env Name Status Elapsed Memory
Python 00_sample_00 :heavy_check_mark: AC 27 ms 12 MB
Python 01_small_00 :heavy_check_mark: AC 25 ms 12 MB
Python 02_corner_00 :heavy_check_mark: AC 25 ms 12 MB
Python 03_general_00 :heavy_check_mark: AC 25 ms 12 MB
Python 04_rand_00 :heavy_check_mark: AC 25 ms 12 MB
Python 04_rand_01 :heavy_check_mark: AC 25 ms 12 MB
Python 04_rand_02 :heavy_check_mark: AC 25 ms 12 MB
Python 04_rand_03 :heavy_check_mark: AC 25 ms 12 MB
Python 04_rand_04 :heavy_check_mark: AC 25 ms 12 MB
Python 04_rand_05 :heavy_check_mark: AC 26 ms 12 MB
Python 04_rand_06 :heavy_check_mark: AC 27 ms 12 MB
Python 04_rand_07 :heavy_check_mark: AC 27 ms 12 MB
Python 05_large_00 :heavy_check_mark: AC 146 ms 14 MB
Python 05_large_01 :heavy_check_mark: AC 223 ms 12 MB
Python 06_maximum_00 :heavy_check_mark: AC 556 ms 15 MB
Python 06_maximum_02 :heavy_check_mark: AC 440 ms 15 MB
Python 07_dense_00 :heavy_check_mark: AC 87 ms 12 MB
Python 07_dense_01 :heavy_check_mark: AC 116 ms 12 MB
Python 07_dense_02 :heavy_check_mark: AC 252 ms 12 MB
Python 07_dense_03 :heavy_check_mark: AC 466 ms 16 MB
Python 08_shell_00 :heavy_check_mark: AC 1075 ms 16 MB
Python 09_extreme_line_00 :heavy_check_mark: AC 947 ms 16 MB
Python 09_extreme_same_00 :heavy_check_mark: AC 974 ms 14 MB
Python 09_extreme_same_01 :heavy_check_mark: AC 1308 ms 15 MB
Back to top page