結果
問題 |
No.1917 LCMST
|
ユーザー |
|
提出日時 | 2025-07-15 18:21:24 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,265 ms / 4,000 ms |
コード長 | 1,877 bytes |
コンパイル時間 | 424 ms |
コンパイル使用メモリ | 82,836 KB |
実行使用メモリ | 314,776 KB |
最終ジャッジ日時 | 2025-07-15 18:22:25 |
合計ジャッジ時間 | 46,692 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 42 |
ソースコード
from collections import defaultdict 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 = int(input()) a = list(map(int, input().split())) M = 10 ** 5 + 10 # M = 10 f = [0 for i in range(M)] ans = 0 for i in range(n): if f[a[i]] == 0: f[a[i]] = 1 else: ans += a[i] uf = UnionFind(M) # print(f) E = [] for g in range(M-1, 0, -1): r = [] for x in range(g, M, g): if f[x]: r.append(x) # print(g, r, ans) for i in range(len(r) - 1): E.append((r[0] * r[i+1] // g, r[0], r[i+1])) E.sort() for x, p, q in E: if not uf.same(p, q): ans += x uf.union(p, q) print(ans)