結果

問題 No.2756 GCD Teleporter
コンテスト
ユーザー Navier_Boltzmann
提出日時 2024-05-16 23:10:30
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 3,468 bytes
コンパイル時間 871 ms
コンパイル使用メモリ 81,912 KB
実行使用メモリ 177,784 KB
最終ジャッジ日時 2024-12-20 11:20:18
合計ジャッジ時間 14,864 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 35 RE * 1
権限があれば一括ダウンロードができます

ソースコード

diff # 

# import pypyjit
# pypyjit.set_param("max_unroll_recursion=-1")
from collections import *
from functools import *
from itertools import *
from heapq import *
import sys, math
# sys.setrecursionlimit(3*10**5)
input = sys.stdin.readline

N = int(input())
A = list(map(int,input().split()))
class prime_factorize():
    
    def __init__(self,M=10**6):
        self.sieve = [-1]*(M+1)
        self.sieve[1] = 1
        self.p = [False]*(M+1)
        self.mu = [1]*(M+1)
        
        for i in range(2,M+1):
            if self.sieve[i] == -1:
                self.p[i] = True
                
                i2 = i**2
                for j in range(i2,M+1,i2):
                    
                    self.mu[j] = 0
                
                
                for j in range(i,M+1,i):
                    self.sieve[j] = i
                    
                    self.mu[j] *= -1
                    
    def factors(self,x):
        tmp = []
        while self.sieve[x] != x:
            tmp.append(self.sieve[x])
            x //= self.sieve[x]
        tmp.append(self.sieve[x])
        return tmp
    
    def divisors(self,x):

        C = Counter(self.factors(x))
        tmp = []
        for p in product(*[[pow(k,i) for i in range(v+1)] for k,v in C.items()]):
            res = 1
            for pp in p:
                res *= pp
            tmp.append(res)
        tmp.sort()
        return tmp
        
    def is_prime(self,x):
        return self.p[x]
        
    def mobius(self,x):
        return self.mu[x]# N = int(input())



class DSU:
    def __init__(self, n):
        self._n = n
        self.parent_or_size = [-1] * n

    def merge(self, a, b):
        assert 0 <= a < self._n
        assert 0 <= b < self._n
        x, y = self.leader(a), self.leader(b)
        if x == y: return x
        if -self.parent_or_size[x] < -self.parent_or_size[y]: x, y = y, x
        self.parent_or_size[x] += self.parent_or_size[y]
        self.parent_or_size[y] = x
        return x

    def same(self, a, b):
        assert 0 <= a < self._n
        assert 0 <= b < self._n
        return self.leader(a) == self.leader(b)

    def leader(self, a):
        assert 0 <= a < self._n
        if self.parent_or_size[a] < 0: return a
        self.parent_or_size[a] = self.leader(self.parent_or_size[a])
        return self.parent_or_size[a]

    def size(self, a):
        assert 0 <= a < self._n
        return -self.parent_or_size[self.leader(a)]

    def groups(self):
        leader_buf = [self.leader(i) for i in range(self._n)]
        result = [[] for _ in range(self._n)]
        for i in range(self._n): result[leader_buf[i]].append(i)
        return [r for r in result if r != []]

pf = prime_factorize()

D = DSU(N)
X = defaultdict(list)
for i,a in enumerate(A):
    if a==1:
        continue
    plist = list(set(pf.factors(a)))
    for p in plist:
        X[p].append(i)

for k,v in X.items():
    n = len(v)
    if k==1:
        continue
    for i in range(n-1):
        xi = v[i]
        xj = v[i+1]
        D.merge(xi,xj)

if len(D.groups())==1:
    print(0)
    exit()

if 2 in X:
    ans = 0
    for j in range(N):
        if D.same(0,j):
            continue
        ans += 2
        D.merge(0,j)
    print(ans)
    exit()

Keys = list(X.keys())
Keys.sort()

if Keys[0]==3:
    if len(D.groups())==2:
        print(3)
        exit()
ans = 2
for i in range(N):
    if D.same(0,i):
        continue
    ans += 2
    D.merge(0,i)
print(ans)
0