結果

問題 No.1917 LCMST
コンテスト
ユーザー Koi
提出日時 2025-07-15 19:22:26
言語 PyPy3
(7.3.15)
結果
TLE  
実行時間 -
コード長 3,053 bytes
コンパイル時間 303 ms
コンパイル使用メモリ 82,632 KB
実行使用メモリ 101,400 KB
最終ジャッジ日時 2025-07-15 19:22:43
合計ジャッジ時間 9,967 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 6 TLE * 1 -- * 35
権限があれば一括ダウンロードができます

ソースコード

diff # 

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())


class UnionFindLabel(UnionFind):
    def __init__(self, labels):
        assert len(labels) == len(set(labels))
        
        self.n = len(labels)
        self.parents = [-1] * self.n
        self.d = {x: i for i, x in enumerate(labels)}
        self.d_inv = {i: x for i, x in enumerate(labels)}
    
    def find_label(self, x):
        return self.d_inv[super().find(self.d[x])]
    
    def union(self, x, y):
        super().union(self.d[x], self.d[y])
    
    def size(self, x):
        return super().size(self.d[x])
    
    def same(self, x, y):
        return super().same(self.d[x], self.d[y])
    
    def members(self, x):
        root = self.find(self.d[x])
        return [self.d_inv[i] for i in range(self.n) if self.find(i) == root]
    
    def roots(self):
        return [self.d_inv[i] for i, x in enumerate(self.parents) if x < 0]
    
    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.d_inv[self.find(member)]].append(self.d_inv[member])
        return group_members
M = 10 ** 5
L = [[] for _ in range(M + 1)]
for i in range(1, M + 1):
    x = i
    while x < M:
        L[x].append(i)
        x += i
N = int(input())
A = list(map(int, input().split()))
D = defaultdict(list)
M = []
for i in range(N):
    for p in L[A[i]]:
        D[p].append((A[i], i))
for key in D.keys():
    L = D[key]
    L.sort()
    for i in range(1, len(L)):
        cost = (L[0][0] * L[i][0]) // key
        M.append((cost, L[0][1], L[i][1]))
M.sort()
ans = 0
# DS = dsu.DSU(N)
UF = UnionFind(N)
for (cost, i, j) in M:
    if(not UF.same(i, j)):
        UF.union(i, j)
        ans += cost
print(ans)
0