Submission #851775
Source Code Expand
n,q=[int(v) for v in input().split()] g=[i for i in range(n)] def fmin(i): n=g[i] if n!=g[i]: n=g[i]=fmin(n) return n for z in range(q): p,a,b=[int(v) for v in input().split()] if p==0: g[a]=g[b]=min(g[a],g[b]) else: if fmin(a)==fmin(b): print("Yes") else: print("No")
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | pnp |
Language | Python (3.4.2) |
Score | 100 |
Code Size | 362 Byte |
Status | AC |
Exec Time | 4457 ms |
Memory | 10852 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 | 270 ms | 6692 KB |
subtask_01_01.txt | AC | 2679 ms | 7164 KB |
subtask_01_02.txt | AC | 111 ms | 10836 KB |
subtask_01_03.txt | AC | 4293 ms | 6820 KB |
subtask_01_04.txt | AC | 4346 ms | 10852 KB |
subtask_01_05.txt | AC | 367 ms | 6808 KB |
subtask_01_06.txt | AC | 359 ms | 10748 KB |
subtask_01_07.txt | AC | 4457 ms | 6812 KB |
subtask_01_08.txt | AC | 4412 ms | 10844 KB |
subtask_01_09.txt | AC | 96 ms | 6816 KB |
subtask_01_10.txt | AC | 109 ms | 10712 KB |
subtask_01_11.txt | AC | 4386 ms | 6720 KB |
subtask_01_12.txt | AC | 4433 ms | 10820 KB |
subtask_01_13.txt | AC | 3507 ms | 6816 KB |
subtask_01_14.txt | AC | 158 ms | 10816 KB |
subtask_01_15.txt | AC | 4208 ms | 6816 KB |
subtask_01_16.txt | AC | 4294 ms | 10820 KB |
subtask_01_17.txt | AC | 3224 ms | 10716 KB |
subtask_01_18.txt | AC | 3398 ms | 10840 KB |