結果
問題 | No.1473 おでぶなおばけさん |
ユーザー | harurun |
提出日時 | 2021-04-10 00:23:56 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 1,342 ms / 2,000 ms |
コード長 | 3,317 bytes |
コンパイル時間 | 316 ms |
コンパイル使用メモリ | 11,504 KB |
実行使用メモリ | 67,356 KB |
最終ジャッジ日時 | 2023-09-07 19:23:26 |
合計ジャッジ時間 | 30,963 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 50 ms
16,224 KB |
testcase_01 | AC | 48 ms
16,264 KB |
testcase_02 | AC | 1,146 ms
62,972 KB |
testcase_03 | AC | 627 ms
55,048 KB |
testcase_04 | AC | 525 ms
42,368 KB |
testcase_05 | AC | 164 ms
26,160 KB |
testcase_06 | AC | 721 ms
57,760 KB |
testcase_07 | AC | 1,240 ms
66,660 KB |
testcase_08 | AC | 1,342 ms
67,356 KB |
testcase_09 | AC | 1,201 ms
66,104 KB |
testcase_10 | AC | 315 ms
47,332 KB |
testcase_11 | AC | 310 ms
45,988 KB |
testcase_12 | AC | 298 ms
47,936 KB |
testcase_13 | AC | 182 ms
32,536 KB |
testcase_14 | AC | 147 ms
28,232 KB |
testcase_15 | AC | 258 ms
39,732 KB |
testcase_16 | AC | 295 ms
46,592 KB |
testcase_17 | AC | 64 ms
18,504 KB |
testcase_18 | AC | 71 ms
20,116 KB |
testcase_19 | AC | 323 ms
43,580 KB |
testcase_20 | AC | 637 ms
50,564 KB |
testcase_21 | AC | 497 ms
54,096 KB |
testcase_22 | AC | 1,009 ms
58,176 KB |
testcase_23 | AC | 742 ms
50,568 KB |
testcase_24 | AC | 735 ms
51,276 KB |
testcase_25 | AC | 1,052 ms
60,196 KB |
testcase_26 | AC | 1,012 ms
63,168 KB |
testcase_27 | AC | 281 ms
36,744 KB |
testcase_28 | AC | 1,113 ms
64,712 KB |
testcase_29 | AC | 386 ms
49,956 KB |
testcase_30 | AC | 448 ms
55,536 KB |
testcase_31 | AC | 1,164 ms
64,132 KB |
testcase_32 | AC | 567 ms
57,548 KB |
testcase_33 | AC | 580 ms
50,328 KB |
testcase_34 | AC | 336 ms
35,020 KB |
testcase_35 | AC | 258 ms
37,120 KB |
testcase_36 | AC | 634 ms
53,552 KB |
testcase_37 | AC | 780 ms
50,812 KB |
testcase_38 | AC | 132 ms
25,156 KB |
testcase_39 | AC | 307 ms
47,176 KB |
testcase_40 | AC | 290 ms
47,128 KB |
testcase_41 | AC | 241 ms
32,136 KB |
testcase_42 | AC | 249 ms
32,244 KB |
testcase_43 | AC | 520 ms
53,728 KB |
testcase_44 | AC | 540 ms
53,620 KB |
testcase_45 | AC | 529 ms
53,724 KB |
testcase_46 | AC | 801 ms
54,720 KB |
testcase_47 | AC | 1,052 ms
62,700 KB |
testcase_48 | AC | 785 ms
57,852 KB |
ソースコード
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 heapq import heapify,heappop,heappush INF=1000000000000000000 V=0 G=[[] for _ in [0]*100000] d=[INF]*100000 def dijkstra(s): que=[] heapify(que) d[s]=0 heappush(que,[0,s]) while que: p=heappop(que) v=p[1] if d[v]<p[0]: continue for i in range(len(G[v])): e=G[v][i] if d[e[0]]>d[v]+e[1]: d[e[0]]=d[v]+e[1] heappush(que,[d[e[0]],e[0]]) """ G[from].append([to,value])で追加 """ class INPUT: def __init__(self): self.l=open(0).read().split()[::-1] self.length=len(self.l) return def stream(self,k=1,f=int,f2=False): assert(-1<k) m=self.length if m==0 or m<k: raise Exception("There is no input!") elif f!=str: if k==0: self.length=0 return list(map(f,self.l[::-1])) if k==1 and not f2: self.length-=1 return f(self.l.pop()) if k==1 and f2: self.length-=1 return [f(self.l.pop())] ret=[] for _ in [0]*k: ret.append(f(self.l.pop())) self.length-=k return ret else: if k==0: self.length=0 return self.l[::-1] if k==1 and not f2: self.length-=1 return self.l.pop() if k==1 and f2: self.length-=1 return [self.l.pop()] ret=[] for _ in [0]*k: ret.append(self.l.pop()) self.length-=k return ret pin=INPUT().stream """ pin(number[default:1],f[default:int],f2[default:False]) if number==0 -> return left all listを変数で受け取るとき、必ずlistをTrueにすること。 """ def main(): n,m=pin(2) uf=dsu(n) ds=[pin(3)for i in range(m)] ds=sorted(ds,key=lambda x:x[2],reverse=True) w=float("inf") j=m-1 for i in range(m): w=min(w,ds[i][2]) uf.merge(ds[i][0]-1,ds[i][1]-1) G[ds[i][0]-1].append([ds[i][1]-1,1]) G[ds[i][1]-1].append([ds[i][0]-1,1]) if uf.same(0,n-1): j=i+1 break while j<m and w==ds[j][2]: G[ds[j][0]-1].append([ds[j][1]-1,1]) G[ds[j][1]-1].append([ds[j][0]-1,1]) j+=1 dijkstra(0) print(w,d[n-1]) return main()