Submission #7016788
Source Code Expand
def find(x): if P[x] < 0: return x else: return P[x] N, Q, *X = map(int,open(0).read().split()) P = [-1] * N for i in range(Q): i *= 3 p, a, b = X[i], find(X[i + 1]), find(X[i + 2]) if p: print('Yes' if a == b else 'No') else: if a != b: if P[a] > P[b]: a, b = b, a P[a] += P[b] P[b] = a
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | nkmk |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 362 Byte |
Status | AC |
Exec Time | 403 ms |
Memory | 50424 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 | 231 ms | 31184 KB |
subtask_01_02.txt | AC | 19 ms | 3828 KB |
subtask_01_03.txt | AC | 380 ms | 13900 KB |
subtask_01_04.txt | AC | 403 ms | 50316 KB |
subtask_01_05.txt | AC | 40 ms | 3904 KB |
subtask_01_06.txt | AC | 43 ms | 6272 KB |
subtask_01_07.txt | AC | 392 ms | 35172 KB |
subtask_01_08.txt | AC | 400 ms | 50344 KB |
subtask_01_09.txt | AC | 17 ms | 3064 KB |
subtask_01_10.txt | AC | 18 ms | 3828 KB |
subtask_01_11.txt | AC | 346 ms | 13900 KB |
subtask_01_12.txt | AC | 394 ms | 50304 KB |
subtask_01_13.txt | AC | 314 ms | 40304 KB |
subtask_01_14.txt | AC | 19 ms | 3956 KB |
subtask_01_15.txt | AC | 362 ms | 33684 KB |
subtask_01_16.txt | AC | 390 ms | 50300 KB |
subtask_01_17.txt | AC | 380 ms | 50324 KB |
subtask_01_18.txt | AC | 392 ms | 50424 KB |