Submission #912828


Source Code Expand

import array
n, q = map(int,input().split())
table = array.array('I', [i for i in range(n)])
def root(x):
    if table[x] == x:
        return x
    else:
        table[x] = root(table[x])
        return table[x]
for _ in range(q):
    p, a, b = map(int,input().split())
    if p == 0:
        rx = root(a)
        ry = root(b)
        if rx != ry:
            table[ry] = rx
    else:
        if root(a) == root(b):
            print('Yes')
        else:
            print('No')

Submission Info

Submission Time
Task B - Union Find
User tookunn
Language Python (3.4.2)
Score 100
Code Size 499 Byte
Status AC
Exec Time 4883 ms
Memory 11204 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 1
AC × 19
Set Name Test Cases
Sample 00_sample_01.txt
All 00_sample_01.txt, subtask_01_01.txt, subtask_01_02.txt, subtask_01_03.txt, subtask_01_04.txt, subtask_01_05.txt, subtask_01_06.txt, subtask_01_07.txt, subtask_01_08.txt, subtask_01_09.txt, subtask_01_10.txt, subtask_01_11.txt, subtask_01_12.txt, subtask_01_13.txt, subtask_01_14.txt, subtask_01_15.txt, subtask_01_16.txt, subtask_01_17.txt, subtask_01_18.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 67 ms 6712 KB
subtask_01_01.txt AC 2834 ms 7072 KB
subtask_01_02.txt AC 77 ms 11100 KB
subtask_01_03.txt AC 4666 ms 6708 KB
subtask_01_04.txt AC 4883 ms 11096 KB
subtask_01_05.txt AC 338 ms 6820 KB
subtask_01_06.txt AC 325 ms 11100 KB
subtask_01_07.txt AC 4644 ms 6792 KB
subtask_01_08.txt AC 4802 ms 11204 KB
subtask_01_09.txt AC 68 ms 6692 KB
subtask_01_10.txt AC 83 ms 11100 KB
subtask_01_11.txt AC 4565 ms 6692 KB
subtask_01_12.txt AC 4703 ms 11100 KB
subtask_01_13.txt AC 3742 ms 6940 KB
subtask_01_14.txt AC 88 ms 11100 KB
subtask_01_15.txt AC 4687 ms 6692 KB
subtask_01_16.txt AC 4821 ms 11096 KB
subtask_01_17.txt AC 3406 ms 11100 KB
subtask_01_18.txt AC 3796 ms 11200 KB