結果

問題 No.2756 GCD Teleporter
コンテスト
ユーザー detteiuu
提出日時 2024-09-02 22:14:05
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 357 ms / 2,000 ms
コード長 2,786 bytes
コンパイル時間 395 ms
コンパイル使用メモリ 82,456 KB
実行使用メモリ 109,948 KB
最終ジャッジ日時 2024-09-02 22:14:17
合計ジャッジ時間 10,990 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff # 

class UnionFind:
    def __init__(self,n):
        self.n = n
        self.parent_size = [-1]*n
 
    def leader(self,a):
        if self.parent_size[a] < 0:
            return a
        self.parent_size[a] = self.leader(self.parent_size[a])
        return self.parent_size[a]
 
    def merge(self,a,b):
        x, y = self.leader(a), self.leader(b)
        if x == y:
            return 
        if abs(self.parent_size[x]) < abs(self.parent_size[y]):
            x, y = y, x
        self.parent_size[x] += self.parent_size[y]
        self.parent_size[y] = x
        return 
 
    def same(self,a,b):
        return self.leader(a) == self.leader(b)
 
    def size(self,a):
        return abs(self.parent_size[self.leader(a)])
 
    def groups(self):
        result = [[] for _ in range(self.n)]
        for i in range(self.n):
            result[self.leader(i)].append(i)
        return [r for r in result if r != []]

class Eratosthenes:
    def __init__(self, n):
        self.isPrime = [True]*(n+1)
        self.minfactor = [-1]*(n+1)
        self.isPrime[0], self.isPrime[1] = False, False
        self.minfactor[1] = 1
        for i in range(2, n+1):
            if self.isPrime[i]:
                self.minfactor[i] = i
                for j in range(i*2, n+1, i):
                    self.isPrime[j] = False
                    if self.minfactor[j] == -1:
                        self.minfactor[j] = i
    
    def factorize(self, n):
        factor = []
        while n > 1:
            p = self.minfactor[n]
            cnt = 0
            while self.minfactor[n] == p:
                n //= p
                cnt += 1
            factor.append((p, cnt))
        return factor
    
    def divisor(self, n):
        ans = [1]
        pf = self.factorize(n)
        for p, c in pf:
            L = len(ans)
            for i in range(L):
                v = 1
                for _ in range(c):
                    v *= p
                    ans.append(ans[i]*v)
        return sorted(ans)

N = int(input())
A = list(map(int, input().split()))

def compress(S):
    S = sorted(S)
    D = dict()
    for i in range(len(S)):
        D[S[i]] = i
    return D

E = Eratosthenes(10**5*2)
S = set()
for i in range(N):
    F = E.factorize(A[i])
    for n, c in F:
        S.add(n)
D = compress(S)

UF = UnionFind(N+len(D))
cnt2, cnt3 = False, False
for i in range(N):
    F = E.factorize(A[i])
    for n, c in F:
        UF.merge(i, N+D[n])
        if n == 2:
            cnt2 = True
        elif n == 3:
            cnt3 = True

S = set()
for i in range(N):
    S.add(UF.leader(i))
L = len(S)

if L == 1:
    exit(print(0))

ans = 10**18
if cnt2:
    ans = min(ans, 2*(L-1))
else:
    ans = min(ans, 2*L)
if cnt3:
    ans = min(ans, 3*(L-1))
else:
    ans = min(ans, 3*L)

print(ans)
0