結果
問題 | No.732 3PrimeCounting |
ユーザー | onakasuitacity |
提出日時 | 2020-10-17 14:52:46 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 778 ms / 3,000 ms |
コード長 | 1,770 bytes |
コンパイル時間 | 399 ms |
コンパイル使用メモリ | 86,996 KB |
実行使用メモリ | 271,060 KB |
最終ジャッジ日時 | 2023-09-28 08:02:15 |
合計ジャッジ時間 | 19,552 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 62 ms
71,396 KB |
testcase_01 | AC | 65 ms
71,388 KB |
testcase_02 | AC | 63 ms
71,372 KB |
testcase_03 | AC | 62 ms
70,996 KB |
testcase_04 | AC | 66 ms
71,020 KB |
testcase_05 | AC | 63 ms
71,516 KB |
testcase_06 | AC | 70 ms
76,404 KB |
testcase_07 | AC | 71 ms
76,080 KB |
testcase_08 | AC | 72 ms
76,504 KB |
testcase_09 | AC | 72 ms
76,440 KB |
testcase_10 | AC | 71 ms
76,588 KB |
testcase_11 | AC | 68 ms
76,304 KB |
testcase_12 | AC | 69 ms
75,944 KB |
testcase_13 | AC | 69 ms
76,268 KB |
testcase_14 | AC | 68 ms
76,256 KB |
testcase_15 | AC | 69 ms
76,200 KB |
testcase_16 | AC | 68 ms
76,144 KB |
testcase_17 | AC | 69 ms
76,276 KB |
testcase_18 | AC | 68 ms
76,156 KB |
testcase_19 | AC | 69 ms
76,432 KB |
testcase_20 | AC | 77 ms
76,572 KB |
testcase_21 | AC | 92 ms
77,212 KB |
testcase_22 | AC | 88 ms
77,284 KB |
testcase_23 | AC | 74 ms
76,332 KB |
testcase_24 | AC | 75 ms
76,684 KB |
testcase_25 | AC | 103 ms
79,192 KB |
testcase_26 | AC | 99 ms
78,724 KB |
testcase_27 | AC | 81 ms
77,236 KB |
testcase_28 | AC | 84 ms
77,376 KB |
testcase_29 | AC | 92 ms
77,536 KB |
testcase_30 | AC | 88 ms
77,428 KB |
testcase_31 | AC | 88 ms
77,252 KB |
testcase_32 | AC | 97 ms
78,916 KB |
testcase_33 | AC | 99 ms
78,588 KB |
testcase_34 | AC | 102 ms
78,556 KB |
testcase_35 | AC | 98 ms
78,936 KB |
testcase_36 | AC | 98 ms
78,744 KB |
testcase_37 | AC | 76 ms
76,460 KB |
testcase_38 | AC | 76 ms
76,592 KB |
testcase_39 | AC | 100 ms
78,608 KB |
testcase_40 | AC | 91 ms
77,392 KB |
testcase_41 | AC | 87 ms
77,252 KB |
testcase_42 | AC | 92 ms
77,308 KB |
testcase_43 | AC | 92 ms
77,528 KB |
testcase_44 | AC | 86 ms
77,552 KB |
testcase_45 | AC | 84 ms
77,256 KB |
testcase_46 | AC | 87 ms
77,092 KB |
testcase_47 | AC | 88 ms
77,168 KB |
testcase_48 | AC | 109 ms
79,324 KB |
testcase_49 | AC | 110 ms
79,164 KB |
testcase_50 | AC | 89 ms
77,572 KB |
testcase_51 | AC | 91 ms
77,232 KB |
testcase_52 | AC | 84 ms
77,400 KB |
testcase_53 | AC | 138 ms
99,476 KB |
testcase_54 | AC | 434 ms
179,540 KB |
testcase_55 | AC | 437 ms
179,500 KB |
testcase_56 | AC | 434 ms
179,504 KB |
testcase_57 | AC | 186 ms
108,744 KB |
testcase_58 | AC | 186 ms
108,516 KB |
testcase_59 | AC | 137 ms
99,272 KB |
testcase_60 | AC | 257 ms
138,068 KB |
testcase_61 | AC | 251 ms
137,960 KB |
testcase_62 | AC | 448 ms
190,008 KB |
testcase_63 | AC | 285 ms
135,576 KB |
testcase_64 | AC | 257 ms
134,596 KB |
testcase_65 | AC | 251 ms
134,708 KB |
testcase_66 | AC | 70 ms
76,216 KB |
testcase_67 | AC | 71 ms
76,440 KB |
testcase_68 | AC | 432 ms
177,540 KB |
testcase_69 | AC | 437 ms
177,468 KB |
testcase_70 | AC | 438 ms
179,532 KB |
testcase_71 | AC | 435 ms
179,756 KB |
testcase_72 | AC | 278 ms
136,736 KB |
testcase_73 | AC | 515 ms
202,636 KB |
testcase_74 | AC | 503 ms
202,524 KB |
testcase_75 | AC | 105 ms
79,168 KB |
testcase_76 | AC | 450 ms
179,444 KB |
testcase_77 | AC | 191 ms
109,556 KB |
testcase_78 | AC | 463 ms
201,824 KB |
testcase_79 | AC | 435 ms
177,476 KB |
testcase_80 | AC | 521 ms
199,724 KB |
testcase_81 | AC | 439 ms
179,536 KB |
testcase_82 | AC | 83 ms
77,292 KB |
testcase_83 | AC | 179 ms
108,368 KB |
testcase_84 | AC | 249 ms
127,620 KB |
testcase_85 | AC | 429 ms
179,212 KB |
testcase_86 | AC | 499 ms
199,612 KB |
testcase_87 | AC | 778 ms
270,656 KB |
testcase_88 | AC | 775 ms
271,060 KB |
ソースコード
import sys INF = 1 << 60 MOD = 998244353 sys.setrecursionlimit(2147483647) input = lambda:sys.stdin.readline().rstrip() prime = 998244353 root = 3 def _fmt(A, inverse = False): N = len(A) logN = (N - 1).bit_length() base = pow(root, (prime - 1) // N * (1 - 2 * inverse) % (prime - 1), prime) step = N for k in range(logN): step >>= 1 w = pow(base, step, prime) wj = 1 nA = [0] * N for j in range(1 << k): for i in range(1 << logN - k - 1): s, t = i + j * step, i + j * step + (N >> 1) ps, pt = i + j * step * 2, i + j * step * 2 + step nA[s], nA[t] = (A[ps] + A[pt] * wj) % prime, (A[ps] - A[pt] * wj) % prime wj = (wj * w) % prime A = nA return A def convolution(f, g): N = 1 << (len(f) + len(g) - 2).bit_length() Ff, Fg = _fmt(f + [0] * (N - len(f))), _fmt(g + [0] * (N - len(g))) N_inv = pow(N, prime - 2, prime) fg = _fmt([a * b % prime * N_inv % prime for a, b in zip(Ff, Fg)], inverse = True) del fg[len(f) + len(g) - 1:] return fg def resolve(): n = int(input()) N = 3 * n primes = [] sieve = list(range(N + 1)) for i in range(2, N + 1): if sieve[i] == i: primes.append(i) for p in primes: if sieve[i] < p or i * p > N: break sieve[i * p] = p f = [0] * (n + 1) g = [0] * (2 * n + 1) for p in primes: if p <= n: f[p] += 1 g[p * 2] += 1 a = 0 f3 = convolution(f, convolution(f, f)) for p in primes: a += f3[p] b = 0 fg = convolution(f, g) for p in primes: b += fg[p] ans = (a - 3 * b) // 6 print(ans) resolve()