Submission #1689011
Source Code Expand
def find(x): #与えられた頂点の根のindexを取得する while table[x] >= 0: x = table[x] return x def union(x,y): global table s1 = find(x) s2 = find(y) if s1 != s2: if table[s1] != table[s2]: #与えられた頂点の根が異なる場合 if table[s1] < table[s2]: table[s2] = s1 else: table[s1] = s2 else: #グラフの長さが同じ場合,どちらを根にしても変わらない #その際,グラフが1長くなることを考慮する table[s1] += -1 table[s2] = s1 return N,Q = list(map(int,input().split())) table = [-1 for i in range(N)] res = [] for i in range(Q): P,A,B = list(map(int,input().split())) if P == 1: r1 = find(A) r2 = find(B) if r1 == r2: res.append('Yes') else: res.append('No') else: union(A,B) for i in res: print(i)
Submission Info
Submission Time | |
---|---|
Task | B - Union Find |
User | hukuhuku11111 |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 1060 Byte |
Status | AC |
Exec Time | 934 ms |
Memory | 6556 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 | 18 ms | 3064 KB |
subtask_01_01.txt | AC | 522 ms | 5008 KB |
subtask_01_02.txt | AC | 23 ms | 3992 KB |
subtask_01_03.txt | AC | 867 ms | 5704 KB |
subtask_01_04.txt | AC | 908 ms | 6556 KB |
subtask_01_05.txt | AC | 82 ms | 3632 KB |
subtask_01_06.txt | AC | 82 ms | 4628 KB |
subtask_01_07.txt | AC | 889 ms | 5736 KB |
subtask_01_08.txt | AC | 873 ms | 6436 KB |
subtask_01_09.txt | AC | 18 ms | 3064 KB |
subtask_01_10.txt | AC | 23 ms | 3992 KB |
subtask_01_11.txt | AC | 934 ms | 5752 KB |
subtask_01_12.txt | AC | 889 ms | 6520 KB |
subtask_01_13.txt | AC | 658 ms | 5280 KB |
subtask_01_14.txt | AC | 24 ms | 3888 KB |
subtask_01_15.txt | AC | 831 ms | 5748 KB |
subtask_01_16.txt | AC | 866 ms | 6468 KB |
subtask_01_17.txt | AC | 871 ms | 5440 KB |
subtask_01_18.txt | AC | 906 ms | 5452 KB |