Submission #2791242
Source Code Expand
n, q = map(int, input().split()) xs = [tuple(map(int, input().split())) for _ in range(q)] union = {x:x for x in range(n)} def root(n): if union[n] == n: return n union[n] = root(union[n]) return union[n] for p, a, b in xs: if p == 0: union[root(a)] = root(b) else: print("Yes" if root(a) == root(b) else "No")
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | zehnpaard |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 370 Byte |
Status | AC |
Exec Time | 1083 ms |
Memory | 43784 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
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 | 17 ms | 3064 KB |
subtask_01_01.txt | AC | 489 ms | 21720 KB |
subtask_01_02.txt | AC | 28 ms | 15084 KB |
subtask_01_03.txt | AC | 752 ms | 20072 KB |
subtask_01_04.txt | AC | 843 ms | 43784 KB |
subtask_01_05.txt | AC | 70 ms | 4656 KB |
subtask_01_06.txt | AC | 80 ms | 17008 KB |
subtask_01_07.txt | AC | 737 ms | 19948 KB |
subtask_01_08.txt | AC | 851 ms | 43536 KB |
subtask_01_09.txt | AC | 17 ms | 3064 KB |
subtask_01_10.txt | AC | 28 ms | 15080 KB |
subtask_01_11.txt | AC | 751 ms | 19968 KB |
subtask_01_12.txt | AC | 806 ms | 43560 KB |
subtask_01_13.txt | AC | 622 ms | 26160 KB |
subtask_01_14.txt | AC | 30 ms | 15076 KB |
subtask_01_15.txt | AC | 746 ms | 19944 KB |
subtask_01_16.txt | AC | 836 ms | 43540 KB |
subtask_01_17.txt | AC | 1083 ms | 43560 KB |
subtask_01_18.txt | AC | 863 ms | 43540 KB |