結果

問題 No.1639 最小通信路
ユーザー ansainansain
提出日時 2021-08-06 21:25:44
言語 Python3
(3.11.6 + numpy 1.26.0 + scipy 1.11.3)
結果
AC  
実行時間 38 ms / 2,000 ms
コード長 2,813 bytes
コンパイル時間 193 ms
コンパイル使用メモリ 12,284 KB
実行使用メモリ 10,408 KB
最終ジャッジ日時 2023-10-17 02:44:01
合計ジャッジ時間 3,287 ms
ジャッジサーバーID
(参考情報)
judge12 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 28 ms
10,400 KB
testcase_01 AC 28 ms
10,400 KB
testcase_02 AC 35 ms
10,408 KB
testcase_03 AC 37 ms
10,408 KB
testcase_04 AC 38 ms
10,408 KB
testcase_05 AC 30 ms
10,408 KB
testcase_06 AC 31 ms
10,408 KB
testcase_07 AC 33 ms
10,400 KB
testcase_08 AC 34 ms
10,408 KB
testcase_09 AC 30 ms
10,400 KB
testcase_10 AC 29 ms
10,400 KB
testcase_11 AC 32 ms
10,408 KB
testcase_12 AC 30 ms
10,400 KB
testcase_13 AC 35 ms
10,408 KB
testcase_14 AC 28 ms
10,400 KB
testcase_15 AC 29 ms
10,400 KB
testcase_16 AC 32 ms
10,408 KB
testcase_17 AC 33 ms
10,408 KB
testcase_18 AC 27 ms
10,400 KB
testcase_19 AC 29 ms
10,408 KB
testcase_20 AC 33 ms
10,408 KB
testcase_21 AC 28 ms
10,400 KB
testcase_22 AC 29 ms
10,400 KB
testcase_23 AC 31 ms
10,408 KB
testcase_24 AC 31 ms
10,400 KB
testcase_25 AC 29 ms
10,408 KB
testcase_26 AC 28 ms
10,408 KB
testcase_27 AC 28 ms
10,400 KB
testcase_28 AC 28 ms
10,400 KB
testcase_29 AC 31 ms
10,408 KB
testcase_30 AC 33 ms
10,408 KB
testcase_31 AC 29 ms
10,408 KB
testcase_32 AC 32 ms
10,408 KB
testcase_33 AC 30 ms
10,408 KB
testcase_34 AC 31 ms
10,408 KB
testcase_35 AC 37 ms
10,408 KB
testcase_36 AC 31 ms
10,408 KB
testcase_37 AC 32 ms
10,408 KB
testcase_38 AC 28 ms
10,400 KB
testcase_39 AC 29 ms
10,408 KB
testcase_40 AC 28 ms
10,400 KB
testcase_41 AC 29 ms
10,408 KB
testcase_42 AC 33 ms
10,408 KB
testcase_43 AC 29 ms
10,408 KB
testcase_44 AC 29 ms
10,400 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
#from math import isqrt, prod, comb  #python3.8用(notpypy)
#from bisect import bisect_left, bisect_right
#from functools import lru_cache, reduce
#from heapq import heappush, heappop, heapify, heappushpop, heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError, maximum_bipartite_matching, maximum_flow, minimum_spanning_tree
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)

from collections import defaultdict
# https://note.nkmk.me/python-union-find/から一部改変


class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n
        self.group_num = 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 x == y:
            return

        self.group_num -= 1
        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[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 self.group_num

    def all_group_members(self):
        self.all_group_member = defaultdict(list)
        for i in range(self.n):
            self.all_group_member[self.find(i)].append(i)
        return self.all_group_member

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())


def main():
    mod = 10**9+7
    mod2 = 998244353
    n=int(input())
    uf=UnionFind(n)
    ans=0
    for i in range((n*(n-1))//2):
        a,b,c=map(int, input().split())
        a-=1
        b-=1
        if not uf.same(a,b):
            uf.union(a,b)
            ans=c
    print(ans)



if __name__ == '__main__':
    main()
0