結果
問題 | No.2200 Weird Shortest Path |
ユーザー | vwxyz |
提出日時 | 2023-12-01 14:39:33 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 1,355 ms / 2,000 ms |
コード長 | 4,081 bytes |
コンパイル時間 | 401 ms |
コンパイル使用メモリ | 12,288 KB |
実行使用メモリ | 54,088 KB |
最終ジャッジ日時 | 2023-12-01 14:40:12 |
合計ジャッジ時間 | 36,829 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 30 ms
10,368 KB |
testcase_01 | AC | 31 ms
10,368 KB |
testcase_02 | AC | 30 ms
10,368 KB |
testcase_03 | AC | 33 ms
10,368 KB |
testcase_04 | AC | 39 ms
10,496 KB |
testcase_05 | AC | 31 ms
10,368 KB |
testcase_06 | AC | 31 ms
10,368 KB |
testcase_07 | AC | 32 ms
10,368 KB |
testcase_08 | AC | 37 ms
10,496 KB |
testcase_09 | AC | 34 ms
10,496 KB |
testcase_10 | AC | 30 ms
10,368 KB |
testcase_11 | AC | 30 ms
10,368 KB |
testcase_12 | AC | 31 ms
10,368 KB |
testcase_13 | AC | 31 ms
10,368 KB |
testcase_14 | AC | 31 ms
10,368 KB |
testcase_15 | AC | 35 ms
10,624 KB |
testcase_16 | AC | 31 ms
10,368 KB |
testcase_17 | AC | 361 ms
24,684 KB |
testcase_18 | AC | 686 ms
34,052 KB |
testcase_19 | AC | 977 ms
47,324 KB |
testcase_20 | AC | 1,037 ms
46,968 KB |
testcase_21 | AC | 512 ms
27,528 KB |
testcase_22 | AC | 579 ms
31,412 KB |
testcase_23 | AC | 1,075 ms
48,928 KB |
testcase_24 | AC | 208 ms
17,408 KB |
testcase_25 | AC | 992 ms
46,836 KB |
testcase_26 | AC | 1,085 ms
48,468 KB |
testcase_27 | AC | 451 ms
26,224 KB |
testcase_28 | AC | 822 ms
39,980 KB |
testcase_29 | AC | 1,127 ms
49,300 KB |
testcase_30 | AC | 1,038 ms
48,208 KB |
testcase_31 | AC | 694 ms
34,984 KB |
testcase_32 | AC | 1,224 ms
54,088 KB |
testcase_33 | AC | 1,244 ms
54,088 KB |
testcase_34 | AC | 1,234 ms
54,088 KB |
testcase_35 | AC | 1,184 ms
54,088 KB |
testcase_36 | AC | 1,193 ms
54,088 KB |
testcase_37 | AC | 1,195 ms
54,088 KB |
testcase_38 | AC | 1,188 ms
54,088 KB |
testcase_39 | AC | 714 ms
37,088 KB |
testcase_40 | AC | 1,012 ms
47,304 KB |
testcase_41 | AC | 638 ms
33,960 KB |
testcase_42 | AC | 952 ms
44,176 KB |
testcase_43 | AC | 1,341 ms
54,088 KB |
testcase_44 | AC | 1,339 ms
54,088 KB |
testcase_45 | AC | 1,355 ms
54,088 KB |
ソースコード
import sys readline=sys.stdin.readline from collections import defaultdict class UnionFind: def __init__(self,N,label=None,f=None,weighted=False,rollback=False): self.N=N self.parents=[None]*self.N self.size=[1]*self.N self.roots={i for i in range(self.N)} self.label=label if self.label!=None: self.label=[x for x in label] self.f=f self.weighted=weighted if self.weighted: self.weight=[0]*self.N self.rollback=rollback if self.rollback: self.operate_list=[] self.operate_set=[] def Find(self,x): stack=[] while self.parents[x]!=None: stack.append(x) x=self.parents[x] if not self.rollback: if self.weighted: w=0 for y in stack[::-1]: self.parents[y]=x w+=self.weight[y] self.weight[y]=w else: for y in stack[::-1]: self.parents[y]=x return x def Union(self,x,y,w=None): root_x=self.Find(x) root_y=self.Find(y) if self.rollback: self.operate_list.append([]) self.operate_set.append([]) if root_x==root_y: if self.weighted: if self.weight[y]-self.weight[x]==w: return True else: return False else: if self.size[root_x]<self.size[root_y]: x,y=y,x root_x,root_y=root_y,root_x if self.weighted: w=-w if self.rollback: self.operate_list[-1].append((self.parents,root_y,self.parents[root_y])) self.operate_list[-1].append((self.size,root_x,self.size[root_x])) self.operate_set[-1].append(root_y) if self.label!=None: self.operate_list[-1]((self.label,root_x,self.label[root_x])) if self.weighted: self.operate_list[-1].append((self.weight,root_y,self.weight[root_y])) self.parents[root_y]=root_x self.size[root_x]+=self.size[root_y] self.roots.remove(root_y) if self.label!=None: self.label[root_x]=self.f(self.label[root_x],self.label[root_y]) if self.weighted: self.weight[root_y]=w+self.weight[x]-self.weight[y] def Size(self,x): return self.size[self.Find(x)] def Same(self,x,y): return self.Find(x)==self.Find(y) def Label(self,x): return self.label[self.Find(x)] def Weight(self,x,y): root_x=self.Find(x) root_y=self.Find(y) if root_x!=root_y: return None return self.weight[y]-self.weight[x] def Roots(self): return list(self.roots) def Linked_Components_Count(self): return len(self.roots) def Linked_Components(self): linked_components=defaultdict(list) for x in range(self.N): linked_components[self.Find(x)].append(x) return linked_components def Rollback(self): assert self.rollback if self.operate_list: for lst,x,v in self.operate_list.pop(): lst[x]=v for x in self.operate_set.pop(): self.roots.add(x) return True else: return False def __str__(self): linked_components=defaultdict(list) for x in range(self.N): linked_components[self.Find(x)].append(x) return "\n".join(f"{r}: {linked_components[r]}" for r in sorted(list(linked_components.keys()))) N,M=map(int,readline().split()) edges=[] for m in range(M): a,b,w=map(int,readline().split()) a-=1;b-=1 edges.append((w,a,b)) edges.sort() ans=0 UF=UnionFind(N) for w,a,b in edges: if not UF.Same(a,b): ans+=UF.Size(a)*UF.Size(b)*w UF.Union(a,b) print(ans)