結果
問題 |
No.3087 University Coloring
|
ユーザー |
|
提出日時 | 2025-04-04 21:50:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 629 ms / 2,000 ms |
コード長 | 2,286 bytes |
コンパイル時間 | 1,160 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 101,632 KB |
最終ジャッジ日時 | 2025-04-04 21:51:01 |
合計ジャッジ時間 | 16,474 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 33 |
ソースコード
from sys import stdin,setrecursionlimit#,set_int_max_str_digits #import pypyjit #pypyjit.set_param('max_unroll_recursion=-1') setrecursionlimit(20000000) # これこどふぉだと無理 #set_int_max_str_digits(200010) mod = 998244353 ii = lambda :int(stdin.readline()) mi = lambda :map(int,stdin.readline().split()) li = lambda :list(mi()) gmi = lambda :map(lambda x: int(x) - 1, stdin.readline().split()) gi = lambda :list(map(lambda x: 0 if x == "." else 1,input())) # グリッド入力受け取り py = lambda :print("Yes") pn = lambda :print("No") pf = lambda :print("First") ps = lambda :print("Second") vec = [(1,0),(-1,0),(0,-1),(0,1)] vec1 = [(1,0),(1,1),(0,1),(-1,1),(-1,0),(-1,-1),(0,-1),(1,-1)] #8方向 inf = 2*10**18 from collections import defaultdict from heapq import heappop,heapify class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * 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 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 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 = mi() data = [li() for _ in range(m)] data.sort(key= lambda x:-x[-1]) uf = UnionFind(n+1) ans = 0 for u,v,c in data: if uf.same(u,v): continue uf.union(u,v) ans += c print(ans*2)