結果
問題 | No.1639 最小通信路 |
ユーザー | harurun |
提出日時 | 2021-07-11 21:09:14 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 1,089 ms / 2,000 ms |
コード長 | 2,996 bytes |
コンパイル時間 | 151 ms |
コンパイル使用メモリ | 12,432 KB |
実行使用メモリ | 12,284 KB |
最終ジャッジ日時 | 2023-10-17 02:27:08 |
合計ジャッジ時間 | 11,377 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 30 ms
10,576 KB |
testcase_01 | AC | 33 ms
10,576 KB |
testcase_02 | AC | 882 ms
11,868 KB |
testcase_03 | AC | 201 ms
12,284 KB |
testcase_04 | AC | 1,089 ms
12,284 KB |
testcase_05 | AC | 226 ms
10,884 KB |
testcase_06 | AC | 381 ms
11,132 KB |
testcase_07 | AC | 34 ms
10,576 KB |
testcase_08 | AC | 659 ms
11,448 KB |
testcase_09 | AC | 77 ms
10,604 KB |
testcase_10 | AC | 150 ms
10,728 KB |
testcase_11 | AC | 471 ms
11,216 KB |
testcase_12 | AC | 188 ms
10,808 KB |
testcase_13 | AC | 844 ms
11,684 KB |
testcase_14 | AC | 34 ms
10,576 KB |
testcase_15 | AC | 162 ms
10,756 KB |
testcase_16 | AC | 510 ms
11,260 KB |
testcase_17 | AC | 657 ms
11,448 KB |
testcase_18 | AC | 70 ms
10,592 KB |
testcase_19 | AC | 271 ms
10,952 KB |
testcase_20 | AC | 675 ms
11,500 KB |
testcase_21 | AC | 30 ms
10,576 KB |
testcase_22 | AC | 203 ms
10,828 KB |
testcase_23 | AC | 368 ms
11,112 KB |
testcase_24 | AC | 181 ms
10,792 KB |
testcase_25 | AC | 56 ms
10,792 KB |
testcase_26 | AC | 42 ms
10,648 KB |
testcase_27 | AC | 35 ms
10,584 KB |
testcase_28 | AC | 33 ms
10,580 KB |
testcase_29 | AC | 84 ms
11,120 KB |
testcase_30 | AC | 128 ms
11,456 KB |
testcase_31 | AC | 52 ms
10,760 KB |
testcase_32 | AC | 96 ms
11,224 KB |
testcase_33 | AC | 47 ms
10,676 KB |
testcase_34 | AC | 95 ms
11,140 KB |
testcase_35 | AC | 199 ms
11,892 KB |
testcase_36 | AC | 118 ms
11,100 KB |
testcase_37 | AC | 107 ms
11,280 KB |
testcase_38 | AC | 38 ms
10,584 KB |
testcase_39 | AC | 58 ms
10,812 KB |
testcase_40 | AC | 39 ms
10,592 KB |
testcase_41 | AC | 47 ms
10,676 KB |
testcase_42 | AC | 125 ms
11,400 KB |
testcase_43 | AC | 47 ms
10,704 KB |
testcase_44 | AC | 36 ms
10,584 KB |
ソースコード
class INPUT: def __init__(self): self._l=open(0).read().split() self._length=len(self._l) self._index=0 return def stream(self,k=1,f=int,f2=False): assert(-1<k) if self._length==self._index or self._length-self._index<k: raise Exception("There is no input!") elif f!=str: if k==0: ret=list(map(f,self._l[self._index:])) self._index=self._length return ret if k==1 and not f2: ret=f(self._l[self._index]) self._index+=1 return ret if k==1 and f2: ret=[f(self._l[self._index])] self._index+=1 return ret ret=[] for _ in [0]*k: ret.append(f(self._l[self._index])) self._index+=1 return ret else: if k==0: ret=list(self._l[self._index:]) self._index=self._length return ret if k==1 and not f2: ret=self._l[self._index] self._index+=1 return ret if k==1 and f2: ret=[self._l[self._index]] self._index+=1 return ret ret=[] for _ in [0]*k: ret.append(self._l[self._index]) self._index+=1 return ret pin=INPUT().stream #pin(number[default:1],f[default:int],f2[default:False]) #if number==0 -> return left all #listを変数で受け取るとき、必ずlistをTrueにすること。 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)) def main(): N=pin(1) d=[[-1]*N for _ in[0]*N] for _ in [0]*(N*(N-1)//2): a,b,C=pin(3) d[a-1][b-1]=C d[b-1][a-1]=C small=1 big=pow(10,100) for _ in [0]*400: mid=(small+big)//2 uf=dsu(N) for i in range(N): for j in range(i+1,N): if d[i][j]<=mid: uf.merge(i,j) if uf.size(0)==N: big=mid else: small=mid print(big) return main()