結果
問題 | No.1473 おでぶなおばけさん |
ユーザー | buey_t |
提出日時 | 2023-03-26 10:25:03 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 769 ms / 2,000 ms |
コード長 | 3,422 bytes |
コンパイル時間 | 159 ms |
コンパイル使用メモリ | 81,852 KB |
実行使用メモリ | 118,396 KB |
最終ジャッジ日時 | 2023-10-19 13:25:22 |
合計ジャッジ時間 | 24,560 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 132 ms
88,164 KB |
testcase_01 | AC | 132 ms
88,172 KB |
testcase_02 | AC | 661 ms
116,440 KB |
testcase_03 | AC | 581 ms
111,356 KB |
testcase_04 | AC | 478 ms
104,740 KB |
testcase_05 | AC | 331 ms
94,916 KB |
testcase_06 | AC | 550 ms
113,200 KB |
testcase_07 | AC | 735 ms
118,396 KB |
testcase_08 | AC | 769 ms
117,804 KB |
testcase_09 | AC | 665 ms
117,188 KB |
testcase_10 | AC | 360 ms
102,744 KB |
testcase_11 | AC | 346 ms
102,532 KB |
testcase_12 | AC | 351 ms
102,516 KB |
testcase_13 | AC | 267 ms
96,108 KB |
testcase_14 | AC | 235 ms
95,472 KB |
testcase_15 | AC | 317 ms
99,584 KB |
testcase_16 | AC | 344 ms
102,752 KB |
testcase_17 | AC | 162 ms
89,332 KB |
testcase_18 | AC | 170 ms
89,332 KB |
testcase_19 | AC | 424 ms
102,128 KB |
testcase_20 | AC | 582 ms
109,684 KB |
testcase_21 | AC | 596 ms
107,704 KB |
testcase_22 | AC | 615 ms
114,088 KB |
testcase_23 | AC | 506 ms
110,844 KB |
testcase_24 | AC | 564 ms
110,280 KB |
testcase_25 | AC | 643 ms
113,148 KB |
testcase_26 | AC | 674 ms
113,464 KB |
testcase_27 | AC | 363 ms
98,340 KB |
testcase_28 | AC | 613 ms
116,692 KB |
testcase_29 | AC | 458 ms
106,684 KB |
testcase_30 | AC | 487 ms
108,488 KB |
testcase_31 | AC | 617 ms
117,700 KB |
testcase_32 | AC | 487 ms
111,760 KB |
testcase_33 | AC | 563 ms
109,408 KB |
testcase_34 | AC | 418 ms
99,824 KB |
testcase_35 | AC | 383 ms
100,096 KB |
testcase_36 | AC | 501 ms
107,308 KB |
testcase_37 | AC | 512 ms
109,656 KB |
testcase_38 | AC | 290 ms
93,308 KB |
testcase_39 | AC | 333 ms
102,520 KB |
testcase_40 | AC | 336 ms
102,712 KB |
testcase_41 | AC | 338 ms
103,432 KB |
testcase_42 | AC | 334 ms
103,428 KB |
testcase_43 | AC | 288 ms
105,972 KB |
testcase_44 | AC | 276 ms
105,968 KB |
testcase_45 | AC | 276 ms
105,968 KB |
testcase_46 | AC | 644 ms
109,616 KB |
testcase_47 | AC | 714 ms
113,176 KB |
testcase_48 | AC | 603 ms
111,356 KB |
ソースコード
def main(): from math import sqrt,sin,cos,tan,ceil,radians,floor,gcd,exp,log,log10,log2,factorial,fsum from heapq import heapify, heappop, heappush from bisect import bisect_left, bisect_right from copy import deepcopy import copy import random from collections import deque,Counter,defaultdict from itertools import permutations,combinations from decimal import Decimal,ROUND_HALF_UP #tmp = Decimal(mid).quantize(Decimal('0'), rounding=ROUND_HALF_UP) from functools import lru_cache, reduce #@lru_cache(maxsize=None) from operator import add,sub,mul,xor,and_,or_,itemgetter INF = 10**18 mod1 = 10**9+7 mod2 = 998244353 #DecimalならPython #再帰ならPython!!!!!!!!!!!!!!!!!!!!!!!!!! ''' ''' class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * n #親だけ self.edge = [0]*n def find(self, x): if self.parents[x] < 0: return x else: self.parents[x] = self.find(self.parents[x]) return self.parents[x] def union(self, x, y): x = self.find(x) y = self.find(y) if self.parents[x] > self.parents[y]: x, y = y, x self.edge[x] += 1 if x == y: return self.parents[x] += self.parents[y] self.edge[x] += self.edge[y] self.parents[y] = x def size(self, x): return -self.parents[self.find(x)] def same(self, x, y): return self.find(x) == self.find(y) def members(self, x): root = self.find(x) return [i for i in range(self.n) if self.find(i) == root] def roots(self): return [i for i, x in enumerate(self.parents) if x < 0] def group_count(self): return len(self.roots()) def all_group_members(self): group_members = defaultdict(list) for member in range(self.n): group_members[self.find(member)].append(member) return group_members def __str__(self): return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items()) N,M = map(int, input().split()) uf = UnionFind(N+1) edge = [] for _ in range(M): u,v,w = map(int, input().split()) edge.append((u,v,w)) edge.sort(lambda x:x[2],reverse=True) G = [[] for _ in range(N+1)] mx = 0 for i in range(M): u,v,w = edge[i] if uf.same(1,N) and mx != w: break uf.union(u,v) mx = w G[u].append(v) G[v].append(u) Q = deque() Q.append((1,0)) seen = [0]*(N+1) while len(Q) > 0: pos,cnt = Q.popleft() if seen[pos] == 1: continue if pos == N: print(mx,cnt) exit() seen[pos] = 1 for nx in G[pos]: if seen[nx] == 0: Q.append((nx,cnt+1)) if __name__ == '__main__': main()