結果
問題 | No.1730 GCD on Blackboard in yukicoder |
ユーザー | ygd. |
提出日時 | 2021-11-07 15:53:45 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,250 ms / 2,000 ms |
コード長 | 3,197 bytes |
コンパイル時間 | 290 ms |
コンパイル使用メモリ | 86,908 KB |
実行使用メモリ | 146,628 KB |
最終ジャッジ日時 | 2023-08-07 23:35:16 |
合計ジャッジ時間 | 12,897 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 182 ms
136,992 KB |
testcase_01 | AC | 91 ms
71,564 KB |
testcase_02 | AC | 100 ms
83,864 KB |
testcase_03 | AC | 107 ms
84,888 KB |
testcase_04 | AC | 107 ms
84,900 KB |
testcase_05 | AC | 109 ms
84,772 KB |
testcase_06 | AC | 107 ms
84,968 KB |
testcase_07 | AC | 111 ms
84,948 KB |
testcase_08 | AC | 94 ms
72,144 KB |
testcase_09 | AC | 105 ms
82,320 KB |
testcase_10 | AC | 112 ms
82,800 KB |
testcase_11 | AC | 91 ms
71,480 KB |
testcase_12 | AC | 89 ms
71,440 KB |
testcase_13 | AC | 1,075 ms
143,496 KB |
testcase_14 | AC | 1,060 ms
143,700 KB |
testcase_15 | AC | 1,068 ms
143,604 KB |
testcase_16 | AC | 1,081 ms
143,512 KB |
testcase_17 | AC | 1,077 ms
143,716 KB |
testcase_18 | AC | 865 ms
140,280 KB |
testcase_19 | AC | 1,250 ms
146,628 KB |
testcase_20 | AC | 191 ms
113,920 KB |
testcase_21 | AC | 191 ms
113,816 KB |
testcase_22 | AC | 180 ms
134,928 KB |
testcase_23 | AC | 172 ms
133,128 KB |
testcase_24 | AC | 180 ms
140,876 KB |
testcase_25 | AC | 1,055 ms
146,328 KB |
ソースコード
import sys #input = sys.stdin.readline input = sys.stdin.buffer.readline from collections import defaultdict import itertools def make_divisors(n): lower_divisors , upper_divisors = [], [] i = 1 while i*i <= n: if n % i == 0: lower_divisors.append(i) if i != n // i: upper_divisors.append(n//i) i += 1 return lower_divisors + upper_divisors[::-1] def gcd(a, b): while b: a, b = b, a % b return a def isPrimeMR(n): d = n - 1 d = d // (d & -d) L = [2] for a in L: t = d y = pow(a, t, n) if y == 1: continue while y != n - 1: y = (y * y) % n if y == 1 or t == n - 1: return 0 t <<= 1 return 1 def findFactorRho(n): m = 1 << n.bit_length() // 8 for c in range(1, 99): f = lambda x: (x * x + c) % n y, r, q, g = 2, 1, 1, 1 while g == 1: x = y for i in range(r): y = f(y) k = 0 while k < r and g == 1: ys = y for i in range(min(m, r - k)): y = f(y) q = q * abs(x - y) % n g = gcd(q, n) k += m r <<= 1 if g == n: g = 1 while g == 1: ys = f(ys) g = gcd(abs(x - ys), n) if g < n: if isPrimeMR(g): return g elif isPrimeMR(n // g): return n // g return findFactorRho(g) def primeFactor(n): #これを実行 i = 2 ret = {} rhoFlg = 0 while i * i <= n: k = 0 while n % i == 0: n //= i k += 1 if k: ret[i] = k i += 1 + i % 2 if i == 101 and n >= 2 ** 20: while n > 1: if isPrimeMR(n): ret[n], n = 1, 1 else: rhoFlg = 1 j = findFactorRho(n) k = 0 while n % j == 0: n //= j k += 1 ret[j] = k if n > 1: ret[n] = 1 if rhoFlg: ret = {x: ret[x] for x in sorted(ret)} return ret def main(): N = int(input()) A = list(map(int,input().split())) mx = max(A) num = [0]*(mx+1) dic = {} for a in A: if a not in dic: dic[a] = 1 else: dic[a] += 1 for a in dic: P = primeFactor(a) base = [] L = [] for p in P: base.append(p) temp = [i for i in range(P[p]+1)] L.append(temp) for T in itertools.product(*L): val = 1 for i,t in enumerate(T): val *= pow(base[i],t) num[val] += dic[a] #print(num) ans = [1]*(N+1) for i in range(1,mx+1): del_num = N - num[i] ans[del_num] = i ret = [1] for v in ans: ret.append(max(ret[-1],v)) print(*ret[1:N+1],sep="\n") if __name__ == '__main__': main()