#708046 (PyPy3) No.1639 最小通信路

• 問題: No.1639 最小通信路
• ユーザー: tcltk
• 提出日時: 2021-10-18 03:25:33
• 言語: PyPy3 (7.3.15)
• 結果: AC
• 実行時間: 309 ms / 2,000 ms
• コード長: 1,767 bytes
• コンパイル時間: 413 ms
• コンパイル使用メモリ: 82,432 KB
• 実行使用メモリ: 90,880 KB
• 最終ジャッジ日時: 2024-09-18 19:14:26
• 合計ジャッジ時間: 12,364 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
sample	AC * 2
other	AC * 43

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
#!/usr/bin/env python3
# from typing import *
import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq
def input():
    return sys.stdin.readline()[:-1]
# sys.setrecursionlimit(1000000)
# _INPUT = """# paste here...
# """
# sys.stdin = io.StringIO(_INPUT)
INF = 10**101
class UnionFind():
    parents = []
    sizes = []
    count = 0
    def __init__(self, n):
        self.count = n
        self.parents = [i for i in range(n)]
        self.sizes = [1 for i in range(n)]
    def find(self, i):
        if self.parents[i] == i:
            return i
        else:
            self.parents[i] = self.find(self.parents[i])
            return self.parents[i]
    def unite(self, i, j):
        root_i = self.find(i)
        root_j = self.find(j)
        if root_i == root_j:
            return
        elif root_i < root_j:
            self.parents[root_j] = root_i
            self.sizes[root_i] += self.sizes[root_j]
        else:
            self.parents[root_i] = root_j
            self.sizes[root_j] += self.sizes[root_i]
    def same(self, i, j):
        return self.find(i) == self.find(j)
    def size(self, i):
        return self.sizes[self.find(i)]
    def group_count(self):
        return len(set(self.find(i) for i in range(self.count)))
def check(r):
    uf = UnionFind(N)
    for a, b, c in L:
        if c <= r:
            uf.unite(a, b)
    for i in range(N):
        if not uf.same(i, 0):
            return False
    return True
N = int(input())
L = []
for _ in range(N*(N-1)//2):
    a, b, c = map(int, input().split())
    L.append((a-1, b-1, c))
ok = INF
ng = 0
while abs(ok-ng) > 1:
    mid = (ok+ng) // 2
    if check(mid):
        ok = mid
    else:
        ng = mid
print(ok)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX