結果

問題 No.2756 GCD Teleporter
コンテスト
ユーザー tassei903
提出日時 2024-05-10 22:17:27
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 278 ms / 2,000 ms
コード長 2,689 bytes
コンパイル時間 914 ms
コンパイル使用メモリ 81,928 KB
実行使用メモリ 109,984 KB
最終ジャッジ日時 2024-12-20 05:57:30
合計ジャッジ時間 8,976 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################

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 = 2*10**5+10
ff = [0]*N
primes = []
for i in range(2, N):
    if ff[i] == 0:
        primes.append(i)
        for j in range(i, N, i):
            if ff[j] == 0:
                ff[j] = i

def factorize(n):
    res = []
    while n > 1:
        z = ff[n]
        res.append(z)
        #print(ff[:20], n, z)

        while n % z == 0:
            n //= z
            
    return res



n = ni()
a = na()

if all(x == 1 for x in a):
    print(2 * n)
    exit()

m = len(primes)
d = {p: i for i, p in enumerate(primes)}
uf = UnionFind(m+N)

z = 0
f = [0] * m

for i in range(n):
    if a[i] == 1:
        z += 1
    else:
        #print(factorize(a[i])   )
        for x in factorize(a[i]):
            f[d[x]] += 1
            uf.union(d[x], m+a[i])

ans = 10**18
s = set()
for i in range(m):
    if f[i] > 0:
        s.add(uf.find(i))
if f[0]> 0:
    ans = min(ans, (z+len(s)-1)*2)
else:
    ans = min(ans, (z+len(s))*2)
    x = min([i for i in range(m) if f[i] > 0])
    ans = min(ans, (z + len(s) - 1) * primes[x])

print(ans)
0