結果

問題 No.2756 GCD Teleporter
ユーザー Navier_BoltzmannNavier_Boltzmann
提出日時 2024-05-16 23:11:30
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 432 ms / 2,000 ms
コード長 3,511 bytes
コンパイル時間 324 ms
コンパイル使用メモリ 82,100 KB
実行使用メモリ 178,392 KB
最終ジャッジ日時 2024-05-16 23:11:45
合計ジャッジ時間 13,354 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 134 ms
100,092 KB
testcase_01 AC 135 ms
99,904 KB
testcase_02 AC 133 ms
100,188 KB
testcase_03 AC 140 ms
100,044 KB
testcase_04 AC 221 ms
102,804 KB
testcase_05 AC 249 ms
110,712 KB
testcase_06 AC 348 ms
132,820 KB
testcase_07 AC 313 ms
123,772 KB
testcase_08 AC 346 ms
124,580 KB
testcase_09 AC 286 ms
118,848 KB
testcase_10 AC 341 ms
127,468 KB
testcase_11 AC 379 ms
136,804 KB
testcase_12 AC 258 ms
108,104 KB
testcase_13 AC 409 ms
149,272 KB
testcase_14 AC 381 ms
140,796 KB
testcase_15 AC 262 ms
108,900 KB
testcase_16 AC 302 ms
119,328 KB
testcase_17 AC 317 ms
123,460 KB
testcase_18 AC 224 ms
107,268 KB
testcase_19 AC 432 ms
159,200 KB
testcase_20 AC 296 ms
139,220 KB
testcase_21 AC 243 ms
117,848 KB
testcase_22 AC 341 ms
160,656 KB
testcase_23 AC 201 ms
104,308 KB
testcase_24 AC 305 ms
134,968 KB
testcase_25 AC 298 ms
129,904 KB
testcase_26 AC 321 ms
134,308 KB
testcase_27 AC 364 ms
157,232 KB
testcase_28 AC 263 ms
115,644 KB
testcase_29 AC 307 ms
129,084 KB
testcase_30 AC 358 ms
147,616 KB
testcase_31 AC 270 ms
112,840 KB
testcase_32 AC 228 ms
136,204 KB
testcase_33 AC 181 ms
111,532 KB
testcase_34 AC 187 ms
104,136 KB
testcase_35 AC 274 ms
131,244 KB
testcase_36 AC 310 ms
129,392 KB
testcase_37 AC 138 ms
99,968 KB
testcase_38 AC 339 ms
147,168 KB
testcase_39 AC 369 ms
178,392 KB
権限があれば一括ダウンロードができます

ソースコード

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 len(Keys)==0:
    print(2*N)
    exit()

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