tests/potential_unionfind.py

• View this file on GitHub
• Last update: 2025-05-06 17:45:42+09:00
• Problem: https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_1_B

Depends on

• libs/potential_unionfind.py
• libs/standard_input.py

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.in	AC	31 ms	12 MB
Python	01_small_00.in	AC	29 ms	12 MB
Python	02_corner_00.in	AC	28 ms	11 MB
Python	03_general_00.in	AC	28 ms	12 MB
Python	04_rand_00.in	AC	28 ms	12 MB
Python	04_rand_01.in	AC	28 ms	12 MB
Python	04_rand_02.in	AC	28 ms	12 MB
Python	04_rand_03.in	AC	29 ms	12 MB
Python	04_rand_04.in	AC	29 ms	11 MB
Python	04_rand_05.in	AC	31 ms	11 MB
Python	04_rand_06.in	AC	31 ms	11 MB
Python	04_rand_07.in	AC	31 ms	12 MB
Python	05_large_00.in	AC	155 ms	14 MB
Python	05_large_01.in	AC	225 ms	12 MB
Python	06_maximum_00.in	AC	500 ms	15 MB
Python	06_maximum_02.in	AC	472 ms	16 MB
Python	07_dense_00.in	AC	88 ms	12 MB
Python	07_dense_01.in	AC	119 ms	12 MB
Python	07_dense_02.in	AC	313 ms	12 MB
Python	07_dense_03.in	AC	480 ms	16 MB
Python	08_shell_00.in	AC	902 ms	16 MB
Python	09_extreme_line_00.in	AC	949 ms	16 MB
Python	09_extreme_same_00.in	AC	973 ms	14 MB
Python	09_extreme_same_01.in	AC	1098 ms	15 MB

Back to top page