Submission #7469117
Source Code Expand
import sys def input(): return sys.stdin.readline().strip() N, Q = list(map(int, input().split())) union = [i for i in range(N)] level = [0 for i in range(N)] def root(union, i, mode=0): keiro = [i] ans = i while ans != union[ans]: ans = union[ans] keiro.append(ans) if mode == 0: return ans else: return ans, keiro def unite(union, i, j, level): root_i = root(union, i, 0) root_j = root(union, j, 0) if root_i != root_j: if level[root_i] < level[root_j]: level[root_j] = max(level[root_i] + 1, level[root_j]) union[root_i] = union[root_j] else: level[root_i] = max(level[root_j] + 1, level[root_i]) union[root_j] = union[root_i] for q in range(Q): P, A, B = list(map(int, input().split())) if P == 0: unite(union, A, B, level) else: if root(union, A) == root(union, B): print("Yes") else: print("No")
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | Awaful |
Language | PyPy3 (2.4.0) |
Score | 100 |
Code Size | 897 Byte |
Status | AC |
Exec Time | 569 ms |
Memory | 60336 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 | 163 ms | 38256 KB |
subtask_01_01.txt | AC | 388 ms | 53080 KB |
subtask_01_02.txt | AC | 170 ms | 45492 KB |
subtask_01_03.txt | AC | 468 ms | 53848 KB |
subtask_01_04.txt | AC | 493 ms | 60208 KB |
subtask_01_05.txt | AC | 242 ms | 44380 KB |
subtask_01_06.txt | AC | 268 ms | 47280 KB |
subtask_01_07.txt | AC | 489 ms | 58200 KB |
subtask_01_08.txt | AC | 515 ms | 60336 KB |
subtask_01_09.txt | AC | 167 ms | 38256 KB |
subtask_01_10.txt | AC | 170 ms | 45492 KB |
subtask_01_11.txt | AC | 466 ms | 56920 KB |
subtask_01_12.txt | AC | 516 ms | 60336 KB |
subtask_01_13.txt | AC | 429 ms | 55000 KB |
subtask_01_14.txt | AC | 187 ms | 45748 KB |
subtask_01_15.txt | AC | 504 ms | 58072 KB |
subtask_01_16.txt | AC | 512 ms | 60208 KB |
subtask_01_17.txt | AC | 568 ms | 59440 KB |
subtask_01_18.txt | AC | 569 ms | 59440 KB |