Submission #421264


Source Code Expand

N, Q = map(int, input().split())
queries = [list(map(int, input().split())) for _ in range(Q)]
 
unilist = [i for i in range(N)]

def find(x):
    if x == unilist[x]:
        return x
    else:
        unilist[x] = find(unilist[x])
        return unilist[x]

def union(x, y):
    s1, s2 = find(x), find(y)
    if s1 != s2:
        unilist[s2] = s1

def isSame(x, y):
    return find(x) == find(y)

for query in queries:
    if query[0] == 0:
        union(query[1], query[2])
    else:
        print("Yes" if isSame(query[1], query[2]) else "No")

Submission Info

Submission Time
Task B - Union Find
User yumechi
Language Python (3.4.2)
Score 100
Code Size 572 Byte
Status AC
Exec Time 2797 ms
Memory 60128 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 209 ms 6688 KB
subtask_01_01.txt AC 1446 ms 37096 KB
subtask_01_02.txt AC 118 ms 10700 KB
subtask_01_03.txt AC 2119 ms 43228 KB
subtask_01_04.txt AC 2320 ms 60128 KB
subtask_01_05.txt AC 254 ms 9888 KB
subtask_01_06.txt AC 260 ms 14532 KB
subtask_01_07.txt AC 2257 ms 43352 KB
subtask_01_08.txt AC 2320 ms 60024 KB
subtask_01_09.txt AC 105 ms 6744 KB
subtask_01_10.txt AC 121 ms 10712 KB
subtask_01_11.txt AC 2170 ms 43292 KB
subtask_01_12.txt AC 2352 ms 60048 KB
subtask_01_13.txt AC 1783 ms 45292 KB
subtask_01_14.txt AC 128 ms 10864 KB
subtask_01_15.txt AC 2163 ms 43400 KB
subtask_01_16.txt AC 2420 ms 60028 KB
subtask_01_17.txt AC 2422 ms 59996 KB
subtask_01_18.txt AC 2797 ms 60080 KB