結果
問題 | No.1473 おでぶなおばけさん |
ユーザー | harurun |
提出日時 | 2021-04-10 00:15:00 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,325 bytes |
コンパイル時間 | 78 ms |
コンパイル使用メモリ | 11,480 KB |
実行使用メモリ | 67,396 KB |
最終ジャッジ日時 | 2023-09-07 19:15:08 |
合計ジャッジ時間 | 30,973 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
16,240 KB |
testcase_01 | AC | 56 ms
16,240 KB |
testcase_02 | AC | 1,203 ms
63,016 KB |
testcase_03 | AC | 643 ms
55,096 KB |
testcase_04 | AC | 520 ms
42,316 KB |
testcase_05 | AC | 166 ms
26,156 KB |
testcase_06 | AC | 755 ms
57,756 KB |
testcase_07 | AC | 1,240 ms
66,612 KB |
testcase_08 | AC | 1,372 ms
67,396 KB |
testcase_09 | AC | 1,295 ms
65,996 KB |
testcase_10 | AC | 319 ms
47,328 KB |
testcase_11 | AC | 315 ms
45,844 KB |
testcase_12 | AC | 321 ms
47,868 KB |
testcase_13 | AC | 194 ms
32,508 KB |
testcase_14 | AC | 154 ms
28,324 KB |
testcase_15 | AC | 276 ms
39,764 KB |
testcase_16 | AC | 311 ms
46,548 KB |
testcase_17 | AC | 67 ms
18,572 KB |
testcase_18 | AC | 77 ms
20,068 KB |
testcase_19 | AC | 398 ms
43,416 KB |
testcase_20 | AC | 809 ms
50,588 KB |
testcase_21 | AC | 636 ms
54,032 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 1,126 ms
64,748 KB |
testcase_29 | AC | 390 ms
49,908 KB |
testcase_30 | AC | 449 ms
55,396 KB |
testcase_31 | AC | 1,175 ms
64,056 KB |
testcase_32 | AC | 587 ms
57,536 KB |
testcase_33 | AC | 581 ms
50,244 KB |
testcase_34 | AC | 343 ms
34,972 KB |
testcase_35 | AC | 264 ms
37,004 KB |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | AC | 307 ms
46,992 KB |
testcase_40 | AC | 324 ms
47,072 KB |
testcase_41 | AC | 254 ms
32,132 KB |
testcase_42 | AC | 256 ms
32,192 KB |
testcase_43 | AC | 536 ms
53,596 KB |
testcase_44 | AC | 536 ms
53,656 KB |
testcase_45 | AC | 540 ms
53,592 KB |
testcase_46 | AC | 859 ms
54,696 KB |
testcase_47 | AC | 1,107 ms
62,616 KB |
testcase_48 | AC | 816 ms
57,780 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<n 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()