結果
問題 | No.1639 最小通信路 |
ユーザー | harurun |
提出日時 | 2021-06-24 19:00:29 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 45 ms / 2,000 ms |
コード長 | 1,813 bytes |
コンパイル時間 | 163 ms |
コンパイル使用メモリ | 12,240 KB |
実行使用メモリ | 12,496 KB |
最終ジャッジ日時 | 2023-10-17 02:19:30 |
合計ジャッジ時間 | 3,493 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
10,288 KB |
testcase_01 | AC | 31 ms
10,288 KB |
testcase_02 | AC | 39 ms
12,032 KB |
testcase_03 | AC | 42 ms
12,496 KB |
testcase_04 | AC | 45 ms
12,496 KB |
testcase_05 | AC | 32 ms
10,520 KB |
testcase_06 | AC | 34 ms
10,876 KB |
testcase_07 | AC | 31 ms
10,288 KB |
testcase_08 | AC | 37 ms
11,096 KB |
testcase_09 | AC | 31 ms
10,320 KB |
testcase_10 | AC | 32 ms
10,444 KB |
testcase_11 | AC | 35 ms
10,948 KB |
testcase_12 | AC | 31 ms
10,472 KB |
testcase_13 | AC | 37 ms
11,244 KB |
testcase_14 | AC | 30 ms
10,288 KB |
testcase_15 | AC | 32 ms
10,452 KB |
testcase_16 | AC | 34 ms
10,980 KB |
testcase_17 | AC | 35 ms
10,964 KB |
testcase_18 | AC | 30 ms
10,312 KB |
testcase_19 | AC | 33 ms
10,792 KB |
testcase_20 | AC | 35 ms
11,108 KB |
testcase_21 | AC | 29 ms
10,288 KB |
testcase_22 | AC | 32 ms
10,492 KB |
testcase_23 | AC | 33 ms
10,868 KB |
testcase_24 | AC | 31 ms
10,468 KB |
testcase_25 | AC | 31 ms
10,464 KB |
testcase_26 | AC | 30 ms
10,336 KB |
testcase_27 | AC | 31 ms
10,296 KB |
testcase_28 | AC | 31 ms
10,292 KB |
testcase_29 | AC | 33 ms
10,932 KB |
testcase_30 | AC | 38 ms
11,144 KB |
testcase_31 | AC | 30 ms
10,452 KB |
testcase_32 | AC | 34 ms
11,000 KB |
testcase_33 | AC | 30 ms
10,352 KB |
testcase_34 | AC | 34 ms
10,944 KB |
testcase_35 | AC | 38 ms
11,440 KB |
testcase_36 | AC | 34 ms
10,920 KB |
testcase_37 | AC | 37 ms
11,020 KB |
testcase_38 | AC | 32 ms
10,296 KB |
testcase_39 | AC | 31 ms
10,468 KB |
testcase_40 | AC | 30 ms
10,320 KB |
testcase_41 | AC | 31 ms
10,352 KB |
testcase_42 | AC | 36 ms
11,108 KB |
testcase_43 | AC | 30 ms
10,364 KB |
testcase_44 | AC | 30 ms
10,296 KB |
ソースコード
#assert class dsu: def __init__(self,n): assert n>0,"n must be Natural" self.n=n self.parents=[-1]*n return def find(self,x): assert x<self.n,"warning!! this is 0 index" if self.parents[x]<0: return x self.parents[x]=self.find(self.parents[x]) return self.parents[x] def merge(self,x,y): assert x<self.n and y<self.n,"warning!! this is 0 index" x=self.find(x) y=self.find(y) if x==y: return if self.parents[x]>self.parents[y]: x,y=y,x self.parents[x]+=self.parents[y] self.parents[y]=x return def size(self,x): assert x<self.n,"warning!! this is 0 index" return -self.parents[self.find(x)] def same(self,x,y): assert x<self.n and y<self.n,"warning!! this is 0 index" return self.find(x)==self.find(y) def leader(self,x): assert x<self.n,"warning!! this is 0 index" if self.parents[x]<0: return x self.parents[x]=self.leader(self.parents[x]) return self.parents[x] def groups(self): ld=[self.leader(i) for i in range(self.n)] res=[[] for _ in range(self.n)] for i in range(self.n): res[ld[i]].append(i) return list(filter(lambda a:a !=[],res)) from sys import stdin pin=stdin.readline def main(): C_SET=set() AB_SET=set() MAX_C=pow(10,100) N=int(pin()) assert(2<=N<=100) uf=dsu(N) FLAG=False for _ in[0]*(N*(N-1)//2): a,b,s=pin().rstrip().split() a=int(a) b=int(b) assert(1<=a<=N) assert(1<=b<=N) assert(1<=int(s)<=MAX_C) C_SET.add(s) AB_SET.add((a,b)) if FLAG: continue a-=1 b-=1 if uf.same(a,b): continue uf.merge(a,b) if uf.size(0)==N: print(s) FLAG=True assert(2*len(C_SET)==N*(N-1)) assert(2*len(AB_SET)==N*(N-1)) return main()