結果
問題 | No.2756 GCD Teleporter |
ユーザー |
|
提出日時 | 2024-05-16 23:10:30 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 3,468 bytes |
コンパイル時間 | 396 ms |
コンパイル使用メモリ | 82,252 KB |
実行使用メモリ | 178,300 KB |
最終ジャッジ日時 | 2024-05-16 23:10:49 |
合計ジャッジ時間 | 13,440 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 130 ms
100,184 KB |
testcase_01 | AC | 138 ms
100,192 KB |
testcase_02 | AC | 132 ms
100,136 KB |
testcase_03 | AC | 158 ms
99,872 KB |
testcase_04 | AC | 194 ms
102,572 KB |
testcase_05 | AC | 241 ms
110,904 KB |
testcase_06 | AC | 341 ms
132,820 KB |
testcase_07 | AC | 318 ms
123,388 KB |
testcase_08 | AC | 314 ms
124,340 KB |
testcase_09 | AC | 286 ms
119,096 KB |
testcase_10 | AC | 328 ms
127,288 KB |
testcase_11 | AC | 402 ms
136,700 KB |
testcase_12 | AC | 237 ms
108,116 KB |
testcase_13 | AC | 379 ms
148,736 KB |
testcase_14 | AC | 387 ms
141,064 KB |
testcase_15 | AC | 263 ms
109,028 KB |
testcase_16 | AC | 299 ms
119,324 KB |
testcase_17 | AC | 322 ms
123,592 KB |
testcase_18 | AC | 224 ms
107,360 KB |
testcase_19 | AC | 447 ms
159,184 KB |
testcase_20 | AC | 328 ms
131,732 KB |
testcase_21 | AC | 252 ms
117,688 KB |
testcase_22 | AC | 349 ms
160,352 KB |
testcase_23 | AC | 234 ms
103,836 KB |
testcase_24 | AC | 305 ms
134,968 KB |
testcase_25 | AC | 297 ms
130,040 KB |
testcase_26 | AC | 315 ms
134,308 KB |
testcase_27 | AC | 390 ms
157,096 KB |
testcase_28 | AC | 241 ms
115,664 KB |
testcase_29 | AC | 309 ms
129,060 KB |
testcase_30 | AC | 349 ms
147,592 KB |
testcase_31 | AC | 284 ms
112,452 KB |
testcase_32 | AC | 229 ms
136,036 KB |
testcase_33 | AC | 176 ms
111,532 KB |
testcase_34 | AC | 182 ms
104,336 KB |
testcase_35 | AC | 266 ms
131,228 KB |
testcase_36 | AC | 296 ms
129,412 KB |
testcase_37 | RE | - |
testcase_38 | AC | 325 ms
147,716 KB |
testcase_39 | AC | 369 ms
178,300 KB |
ソースコード
# 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)