Submission #7469045
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[i] < level[j]: level[j] = max(level[i] + 1, level[j]) union[root_i] = union[root_j] else: level[i] = max(level[j] + 1, level[i]) union[root_j] = union[root_i] for q in range(Q): P, A, B = list(map(int, input().split())) A -= 1 B -= 1 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 | 0 |
Code Size | 873 Byte |
Status | TLE |
Exec Time | 5263 ms |
Memory | 138988 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 183 ms | 38256 KB |
subtask_01_01.txt | AC | 460 ms | 52440 KB |
subtask_01_02.txt | AC | 191 ms | 45492 KB |
subtask_01_03.txt | AC | 572 ms | 58712 KB |
subtask_01_04.txt | AC | 598 ms | 60592 KB |
subtask_01_05.txt | AC | 273 ms | 44504 KB |
subtask_01_06.txt | AC | 319 ms | 47408 KB |
subtask_01_07.txt | AC | 597 ms | 61016 KB |
subtask_01_08.txt | AC | 573 ms | 60720 KB |
subtask_01_09.txt | AC | 186 ms | 38256 KB |
subtask_01_10.txt | AC | 197 ms | 45492 KB |
subtask_01_11.txt | AC | 629 ms | 64984 KB |
subtask_01_12.txt | AC | 592 ms | 60592 KB |
subtask_01_13.txt | AC | 518 ms | 55384 KB |
subtask_01_14.txt | AC | 201 ms | 45748 KB |
subtask_01_15.txt | AC | 591 ms | 60632 KB |
subtask_01_16.txt | AC | 569 ms | 60592 KB |
subtask_01_17.txt | AC | 605 ms | 59824 KB |
subtask_01_18.txt | TLE | 5263 ms | 138988 KB |