結果

問題 No.1473 おでぶなおばけさん
ユーザー buey_tbuey_t
提出日時 2023-03-26 10:23:26
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 3,410 bytes
コンパイル時間 140 ms
コンパイル使用メモリ 82,176 KB
実行使用メモリ 119,484 KB
最終ジャッジ日時 2024-09-19 09:33:49
合計ジャッジ時間 23,671 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 142 ms
89,216 KB
testcase_01 AC 142 ms
89,344 KB
testcase_02 AC 646 ms
116,408 KB
testcase_03 AC 584 ms
112,236 KB
testcase_04 AC 484 ms
105,868 KB
testcase_05 AC 336 ms
96,068 KB
testcase_06 AC 561 ms
114,580 KB
testcase_07 AC 703 ms
118,168 KB
testcase_08 AC 739 ms
118,728 KB
testcase_09 AC 664 ms
118,144 KB
testcase_10 AC 339 ms
103,296 KB
testcase_11 AC 330 ms
103,296 KB
testcase_12 AC 341 ms
103,040 KB
testcase_13 AC 276 ms
96,896 KB
testcase_14 AC 237 ms
96,128 KB
testcase_15 AC 321 ms
100,992 KB
testcase_16 AC 336 ms
103,424 KB
testcase_17 AC 170 ms
90,496 KB
testcase_18 AC 174 ms
90,240 KB
testcase_19 AC 410 ms
102,128 KB
testcase_20 AC 568 ms
110,708 KB
testcase_21 AC 565 ms
108,588 KB
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 AC 608 ms
118,424 KB
testcase_29 WA -
testcase_30 WA -
testcase_31 AC 662 ms
119,484 KB
testcase_32 AC 487 ms
113,704 KB
testcase_33 AC 534 ms
110,308 KB
testcase_34 AC 439 ms
100,988 KB
testcase_35 AC 374 ms
101,160 KB
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 AC 360 ms
102,912 KB
testcase_40 AC 346 ms
103,040 KB
testcase_41 AC 336 ms
104,052 KB
testcase_42 AC 335 ms
103,928 KB
testcase_43 AC 289 ms
106,624 KB
testcase_44 AC 284 ms
106,752 KB
testcase_45 AC 275 ms
106,624 KB
testcase_46 AC 661 ms
109,804 KB
testcase_47 AC 711 ms
114,340 KB
testcase_48 AC 614 ms
112,716 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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]
        
        uf.union(u,v)
        mx = w
        G[u].append(v)
        G[v].append(u)
        
        if uf.same(1,N):
            break
    
    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()
0