結果
問題 | No.1307 Rotate and Accumulate |
ユーザー | Wizist |
提出日時 | 2020-12-05 22:42:48 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,518 ms / 5,000 ms |
コード長 | 1,546 bytes |
コンパイル時間 | 526 ms |
コンパイル使用メモリ | 87,224 KB |
実行使用メモリ | 126,276 KB |
最終ジャッジ日時 | 2023-10-14 10:03:11 |
合計ジャッジ時間 | 16,236 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 66 ms
71,576 KB |
testcase_01 | AC | 64 ms
71,608 KB |
testcase_02 | AC | 66 ms
71,436 KB |
testcase_03 | AC | 75 ms
76,448 KB |
testcase_04 | AC | 85 ms
76,720 KB |
testcase_05 | AC | 72 ms
76,364 KB |
testcase_06 | AC | 73 ms
76,568 KB |
testcase_07 | AC | 65 ms
71,740 KB |
testcase_08 | AC | 764 ms
100,488 KB |
testcase_09 | AC | 764 ms
102,764 KB |
testcase_10 | AC | 768 ms
102,848 KB |
testcase_11 | AC | 754 ms
94,952 KB |
testcase_12 | AC | 773 ms
102,556 KB |
testcase_13 | AC | 189 ms
89,460 KB |
testcase_14 | AC | 441 ms
92,316 KB |
testcase_15 | AC | 1,514 ms
124,712 KB |
testcase_16 | AC | 1,516 ms
124,516 KB |
testcase_17 | AC | 1,512 ms
124,636 KB |
testcase_18 | AC | 1,497 ms
126,276 KB |
testcase_19 | AC | 1,512 ms
124,856 KB |
testcase_20 | AC | 1,518 ms
125,228 KB |
testcase_21 | AC | 71 ms
71,380 KB |
ソースコード
#!/usr/bin/env python3 # # No.1307 Rotate and Accumulate # import sys, os, math def ntt(a, inverse=False, mod=(119 << 23) + 1, root=3): n = 1 while n < len(a): n <<= 1 if len(a) < n: a += [0] * (n - len(a)) r = [0] * n for i in range(len(r)): r[i] = mod - pow(root, (mod - 1) >> (i + 2), mod) if not inverse: k = n >> 1 while k != 0: w = 1 for s in range(0, n, 2 * k): for i in range(s, s + k): u = a[i]; v = a[i + k] * w % mod a[i] = (u + v) % mod a[i + k] = (u - v + mod) % mod z = 0; x = s // 2 // k + 1 while x and x % 2 == 0: z += 1; x >>= 1 w = w * r[z] % mod k >>= 1 else: ir = [0] * n for i in range(len(r)): ir[i] = pow(r[i], mod - 2, mod) k = 1 while k < n: w = 1 for s in range(0, n, 2 * k): for i in range(s, s + k): u = a[i]; v = a[i + k] a[i] = (u + v) % mod a[i + k] = (u - v + mod) % mod * w % mod z = 0; x = s // 2 // k + 1 while x and x % 2 == 0: z += 1; x >>= 1 w = w * ir[z] % mod k <<= 1 n_1 = pow(n, mod - 2, mod) for i in range(len(a)): a[i] = a[i] * n_1 % mod def multiply(a, b): n = 1 while n < len(a) + len(b): n <<= 1 f, g = [0] * n, [0] * n for i, v in enumerate(a): f[i] = v for i, v in enumerate(b): g[i] = v ntt(f); ntt(g) for i in range(n): f[i] *= g[i] ntt(f, True) return f def read_ints(): return list(map(int, input().split())) n, q = read_ints() a, r = read_ints(), read_ints() f = a + a g = [0] * (n + 1) for x in r: g[n - x] += 1 c = multiply(f, g) print(" ".join(map(str, c[n:n + n])))