Submission #10118165
Source Code Expand
def main(): n,q=map(int,input().split()) parents=[-1]*(n+1) for _ in range(q): q,a,b=map(int,input().split()) if q==0: union(parents,a,b) if q==1: f=same(parents,a,b) print("Yes" if f else "No") def root(parents,x): if parents[x]<0: return x else: parents[x]=root(parents,parents[x]) return parents[x] def union(parents,x,y): x=root(parents,x) y=root(parents,y) if x==y: return if x<y: x,y=y,x parents[x]+=parents[y] parents[y]=x def same(parents,x,y): return root(parents,x)==root(parents,y) if __name__=="__main__": main()
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | yuuuuuuuu |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 674 Byte |
Status | AC |
Exec Time | 1665 ms |
Memory | 5620 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 | 975 ms | 3444 KB |
subtask_01_02.txt | AC | 17 ms | 3828 KB |
subtask_01_03.txt | AC | 1594 ms | 3828 KB |
subtask_01_04.txt | AC | 1635 ms | 4468 KB |
subtask_01_05.txt | AC | 110 ms | 3064 KB |
subtask_01_06.txt | AC | 106 ms | 3956 KB |
subtask_01_07.txt | AC | 1619 ms | 3700 KB |
subtask_01_08.txt | AC | 1665 ms | 4468 KB |
subtask_01_09.txt | AC | 17 ms | 3064 KB |
subtask_01_10.txt | AC | 17 ms | 3828 KB |
subtask_01_11.txt | AC | 1555 ms | 3700 KB |
subtask_01_12.txt | AC | 1597 ms | 4468 KB |
subtask_01_13.txt | AC | 1286 ms | 3572 KB |
subtask_01_14.txt | AC | 21 ms | 3828 KB |
subtask_01_15.txt | AC | 1598 ms | 3700 KB |
subtask_01_16.txt | AC | 1607 ms | 4468 KB |
subtask_01_17.txt | AC | 1475 ms | 5620 KB |
subtask_01_18.txt | AC | 1308 ms | 4212 KB |