結果
問題 | No.1307 Rotate and Accumulate |
ユーザー | googol_S0 |
提出日時 | 2020-12-04 00:07:18 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 285 ms / 5,000 ms |
コード長 | 2,712 bytes |
コンパイル時間 | 260 ms |
コンパイル使用メモリ | 87,032 KB |
実行使用メモリ | 119,000 KB |
最終ジャッジ日時 | 2023-10-12 10:43:32 |
合計ジャッジ時間 | 5,489 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 73 ms
71,312 KB |
testcase_01 | AC | 72 ms
71,128 KB |
testcase_02 | AC | 72 ms
71,172 KB |
testcase_03 | AC | 76 ms
75,476 KB |
testcase_04 | AC | 78 ms
75,644 KB |
testcase_05 | AC | 79 ms
75,820 KB |
testcase_06 | AC | 76 ms
75,564 KB |
testcase_07 | AC | 74 ms
71,132 KB |
testcase_08 | AC | 244 ms
100,884 KB |
testcase_09 | AC | 250 ms
103,396 KB |
testcase_10 | AC | 198 ms
99,388 KB |
testcase_11 | AC | 179 ms
91,576 KB |
testcase_12 | AC | 198 ms
98,988 KB |
testcase_13 | AC | 122 ms
89,148 KB |
testcase_14 | AC | 147 ms
90,984 KB |
testcase_15 | AC | 283 ms
118,908 KB |
testcase_16 | AC | 285 ms
118,572 KB |
testcase_17 | AC | 284 ms
118,704 KB |
testcase_18 | AC | 279 ms
113,244 KB |
testcase_19 | AC | 282 ms
119,000 KB |
testcase_20 | AC | 285 ms
118,928 KB |
testcase_21 | AC | 72 ms
71,328 KB |
ソースコード
_fft_mod = 998244353 _fft_sum_e = [911660635, 509520358, 369330050, 332049552, 983190778, 123842337, 238493703, 975955924, 603855026, 856644456, 131300601, 842657263, 730768835, 942482514, 806263778, 151565301, 510815449, 503497456, 743006876, 741047443, 56250497, 0, 0, 0, 0, 0, 0, 0, 0, 0] _fft_sum_ie = [86583718, 372528824, 373294451, 645684063, 112220581, 692852209, 155456985, 797128860, 90816748, 860285882, 927414960, 354738543, 109331171, 293255632, 535113200, 308540755, 121186627, 608385704, 438932459, 359477183, 824071951, 0, 0, 0, 0, 0, 0, 0, 0, 0] def butterfly_998244353(a): n = len(a) h = (n - 1).bit_length() for ph in range(1, h + 1): w = 1 << (ph - 1) p = 1 << (h - ph) now = 1 for s in range(w): offset = s << (h - ph + 1) for i in range(p): l = a[i + offset] r = a[i + offset + p] * now % _fft_mod a[i + offset] = (l + r) % _fft_mod a[i + offset + p] = (l - r) % _fft_mod now = now * _fft_sum_e[(~s & -~s).bit_length() - 1] % _fft_mod def butterfly_inv_998244353(a): n = len(a) h = (n - 1).bit_length() for ph in range(h, 0, -1): w = 1 << (ph - 1) p = 1 << (h - ph) inow = 1 for s in range(w): offset = s << (h - ph + 1) for i in range(p): l = a[i + offset] r = a[i + offset + p] a[i + offset] = (l + r) % _fft_mod a[i + offset + p] = (l - r) * inow % _fft_mod inow = inow * _fft_sum_ie[(~s & -~s).bit_length() - 1] % _fft_mod def convolution_998244353(a, b): a = a.copy() b = b.copy() n = len(a) m = len(b) if n == 0 or m == 0: return [] if min(n, m) <= 60: if n < m: n, m = m, n a, b = b, a ans = [0] * (n + m - 1) for i in range(n): for j in range(m): ans[i + j] = (ans[i + j] + a[i] * b[j] % _fft_mod) % _fft_mod return ans z = 1 << (n + m - 2).bit_length() a += [0] * (z - n) b += [0] * (z - m) butterfly_998244353(a) butterfly_998244353(b) for i in range(z): a[i] = a[i] * b[i] % _fft_mod butterfly_inv_998244353(a) a = a[:n + m - 1] iz = pow(z, _fft_mod - 2, _fft_mod) for i in range(n + m - 1): a[i] = a[i] * iz % _fft_mod return a N,Q=map(int,input().split()) A=list(map(int,input().split())) R=list(map(int,input().split())) B=[0]*N for i in range(Q): B[-R[i]]+=1 X=convolution_998244353(A,B) for i in range(N): X.append(0) print(*[X[i]+X[N+i] for i in range(N)])