結果
問題 | No.2756 GCD Teleporter |
ユーザー |
|
提出日時 | 2024-05-16 23:05:23 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,500 bytes |
コンパイル時間 | 397 ms |
コンパイル使用メモリ | 82,568 KB |
実行使用メモリ | 178,272 KB |
最終ジャッジ日時 | 2024-05-16 23:05:41 |
合計ジャッジ時間 | 13,340 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 120 ms
100,336 KB |
testcase_01 | AC | 122 ms
100,336 KB |
testcase_02 | AC | 119 ms
100,256 KB |
testcase_03 | AC | 124 ms
100,420 KB |
testcase_04 | AC | 179 ms
102,460 KB |
testcase_05 | AC | 228 ms
110,820 KB |
testcase_06 | AC | 347 ms
132,816 KB |
testcase_07 | AC | 292 ms
123,636 KB |
testcase_08 | AC | 285 ms
124,224 KB |
testcase_09 | AC | 261 ms
118,696 KB |
testcase_10 | AC | 329 ms
127,324 KB |
testcase_11 | AC | 330 ms
136,712 KB |
testcase_12 | AC | 211 ms
107,692 KB |
testcase_13 | AC | 338 ms
135,712 KB |
testcase_14 | AC | 351 ms
132,592 KB |
testcase_15 | AC | 208 ms
107,260 KB |
testcase_16 | AC | 262 ms
116,400 KB |
testcase_17 | AC | 285 ms
120,280 KB |
testcase_18 | AC | 207 ms
105,904 KB |
testcase_19 | AC | 373 ms
145,136 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 238 ms
115,644 KB |
testcase_29 | AC | 272 ms
128,948 KB |
testcase_30 | AC | 319 ms
147,492 KB |
testcase_31 | AC | 221 ms
112,828 KB |
testcase_32 | AC | 229 ms
136,244 KB |
testcase_33 | AC | 167 ms
111,116 KB |
testcase_34 | AC | 176 ms
104,676 KB |
testcase_35 | AC | 252 ms
131,116 KB |
testcase_36 | AC | 260 ms
129,256 KB |
testcase_37 | AC | 121 ms
100,144 KB |
testcase_38 | AC | 322 ms
147,368 KB |
testcase_39 | AC | 346 ms
178,272 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 len(Keys)==2: 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)