結果
問題 |
No.3087 University Coloring
|
ユーザー |
|
提出日時 | 2025-04-04 21:51:30 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 872 ms / 2,000 ms |
コード長 | 5,236 bytes |
コンパイル時間 | 388 ms |
コンパイル使用メモリ | 82,656 KB |
実行使用メモリ | 108,816 KB |
最終ジャッジ日時 | 2025-04-04 21:52:07 |
合計ジャッジ時間 | 23,873 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 33 |
ソースコード
# input import sys input = sys.stdin.readline II = lambda : int(input()) MI = lambda : map(int, input().split()) LI = lambda : [int(a) for a in input().split()] SI = lambda : input().rstrip() LLI = lambda n : [[int(a) for a in input().split()] for _ in range(n)] LSI = lambda n : [input().rstrip() for _ in range(n)] MI_1 = lambda : map(lambda x:int(x)-1, input().split()) LI_1 = lambda : [int(a)-1 for a in input().split()] def graph(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[int]]: edge = [set() for i in range(n+1+index)] for _ in range(m): a,b = map(int, input().split()) a += index b += index edge[a].add(b) if not dir: edge[b].add(a) return edge def graph_w(n:int, m:int, dir:bool=False, index:int=-1) -> list[set[tuple]]: edge = [set() for i in range(n+1+index)] for _ in range(m): a,b,c = map(int, input().split()) a += index b += index edge[a].add((b,c)) if not dir: edge[b].add((a,c)) return edge mod = 998244353 inf = 1001001001001001001 ordalp = lambda s : ord(s)-65 if s.isupper() else ord(s)-97 ordallalp = lambda s : ord(s)-39 if s.isupper() else ord(s)-97 yes = lambda : print("Yes") no = lambda : print("No") yn = lambda flag : print("Yes" if flag else "No") def acc(a:list[int]): sa = [0]*(len(a)+1) for i in range(len(a)): sa[i+1] = a[i] + sa[i] return sa prinf = lambda ans : print(ans if ans < 1000001001001001001 else -1) alplow = "abcdefghijklmnopqrstuvwxyz" alpup = "ABCDEFGHIJKLMNOPQRSTUVWXYZ" alpall = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ" URDL = {'U':(-1,0), 'R':(0,1), 'D':(1,0), 'L':(0,-1)} DIR_4 = [[-1,0],[0,1],[1,0],[0,-1]] DIR_8 = [[-1,0],[-1,1],[0,1],[1,1],[1,0],[1,-1],[0,-1],[-1,-1]] DIR_BISHOP = [[-1,1],[1,1],[1,-1],[-1,-1]] prime60 = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59] sys.set_int_max_str_digits(0) sys.setrecursionlimit(10**6) # import pypyjit # pypyjit.set_param('max_unroll_recursion=-1') from collections import defaultdict,deque from heapq import heappop,heappush from bisect import bisect_left,bisect_right DD = defaultdict BSL = bisect_left BSR = bisect_right class BIT: def __init__(self, n): self.n = n self.data = [0]*(n+1) def build(self, arr): for i,a in enumerate(arr): self.data[i+1] = a for i in range(1, self.n+1): if i + (i&-i) <= self.n: self.data[i + (i&-i)] += self.data[i] def add(self, p, x): p += 1 while p <= self.n: self.data[p] += x p += p& -p def sum0(self, r): s = 0 while r: s += self.data[r] r -= r& -r return s def sum(self, l, r): s = 0 while r: s += self.data[r] r -= r& -r while l: s -= self.data[l] l -= l& -l return s def get(self, p): return self.sum0(p+1) - self.sum0(p) def bisect_left(self, w): """ not valify sum_{0 <= i < x} >= w となる 最小のx """ if w <= 0: return 0 x = 0 r = 1 << (self.n-1).bit_length() while r: if x + r < self.n and self.data[x + r] < w: w -= self.data[x + r] x += r r >>= 1 return x + 1 def bisect_right(self, w): """ sum_{0 <= i < x} <= w となる 最大のx """ if w < 0: return -1 x = 0 r = 1 << (self.n-1).bit_length() while r: if x + r < self.n and self.data[x + r] <= w: w -= self.data[x + r] x += r r >>= 1 return x def __str__(self): return str([self.get(i) for i in range(self.n)]) class DSU: def __init__(self, n, fix_leader = False): self.n = n self.par = [*range(n)] self.siz = [1] * n self.fix_leader = fix_leader def leader(self, a): while self.par[a] != a: self.par[a] = a = self.par[self.par[a]] return a def merge(self, a, b): a = self.leader(a) b = self.leader(b) if a == b: return a if self.fix_leader or self.siz[a] > self.siz[b]: self.siz[a] += self.siz[b] self.par[b] = a return a else: self.siz[b] += self.siz[a] self.par[a] = b return b def same(self, a, b): return self.leader(a) == self.leader(b) def size(self, a): return self.siz[self.leader(a)] def groups(self): res = [[] for i in range(self.n)] for i in range(self.n): res[self.leader(i)].append(i) res2 = [] for i in range(self.n): if len(res[i]) > 0: res2.append(res[i]) return res2 n,m = MI() edges = [] for i in range(m): a,b,c = MI() edges.append((c,a-1,b-1)) # 最長のパス -> 最長全域木? ans = 0 uf = DSU(n) edges.sort(reverse=True) for c,a,b in edges: if uf.same(a,b): continue ans += c uf.merge(a, b) print(ans * 2)