Submission #421365


Source Code Expand

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[s1] = s2
 
def isSame(x, y):
    return unilist[x] == unilist[y]
 
N, Q = map(int, input().split())
unilist = [i for i in range(N)]
 
for _ in range(Q):
    p, a, b = map(int, input().split())
    if p == 0:
        union(a, b)
    else:
        print("Yes" if isSame(a, b) else "No")

Submission Info

Submission Time
Task B - Union Find
User Lhaplus
Language Python (2.7.3)
Score 0
Code Size 517 Byte
Status RE
Exec Time 183 ms
Memory 8320 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
RE × 1
RE × 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 RE 183 ms 8240 KB
subtask_01_01.txt RE 131 ms 8296 KB
subtask_01_02.txt RE 131 ms 8296 KB
subtask_01_03.txt RE 133 ms 8304 KB
subtask_01_04.txt RE 134 ms 8320 KB
subtask_01_05.txt RE 136 ms 8300 KB
subtask_01_06.txt RE 132 ms 8308 KB
subtask_01_07.txt RE 130 ms 8304 KB
subtask_01_08.txt RE 133 ms 8168 KB
subtask_01_09.txt RE 129 ms 8300 KB
subtask_01_10.txt RE 129 ms 8304 KB
subtask_01_11.txt RE 131 ms 8300 KB
subtask_01_12.txt RE 130 ms 8300 KB
subtask_01_13.txt RE 130 ms 8304 KB
subtask_01_14.txt RE 131 ms 8240 KB
subtask_01_15.txt RE 131 ms 8304 KB
subtask_01_16.txt RE 131 ms 8296 KB
subtask_01_17.txt RE 137 ms 8296 KB
subtask_01_18.txt RE 132 ms 8304 KB