結果

問題 No.1307 Rotate and Accumulate
ユーザー convexineq
提出日時 2020-12-04 04:30:02
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 279 ms / 5,000 ms
コード長 1,711 bytes
コンパイル時間 245 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 120,772 KB
最終ジャッジ日時 2024-09-14 14:57:00
合計ジャッジ時間 5,022 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 19
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

ROOT = 3
MOD = 998244353
roots = [pow(ROOT,(MOD-1)>>i,MOD) for i in range(24)] # 1 2^i
iroots = [pow(x,MOD-2,MOD) for x in roots] # 1 2^i
def untt(a,n):
for i in range(n):
m = 1<<(n-i-1)
for s in range(1<<i):
w_N = 1
s *= m*2
for p in range(m):
a[s+p], a[s+p+m] = (a[s+p]+a[s+p+m])%MOD, (a[s+p]-a[s+p+m])*w_N%MOD
w_N = w_N*roots[n-i]%MOD
def iuntt(a,n):
for i in range(n):
m = 1<<i
for s in range(1<<(n-i-1)):
w_N = 1
s *= m*2
for p in range(m):
a[s+p], a[s+p+m] = (a[s+p]+a[s+p+m]*w_N)%MOD, (a[s+p]-a[s+p+m]*w_N)%MOD
w_N = w_N*iroots[i+1]%MOD
inv = pow((MOD+1)//2,n,MOD)
for i in range(1<<n):
a[i] = a[i]*inv%MOD
def convolution(a,b):
la = len(a)
lb = len(b)
if min(la, lb) <= 50:
if la < lb:
la,lb = lb,la
a,b = b,a
res = [0]*(la+lb-1)
for i in range(la):
for j in range(lb):
res[i+j] += a[i]*b[j]
res[i+j] %= MOD
return res
deg = la+lb-2
n = deg.bit_length()
N = 1<<n
a += [0]*(N-len(a))
b += [0]*(N-len(b))
untt(a,n)
untt(b,n)
for i in range(N):
a[i] = a[i]*b[i]%MOD
iuntt(a,n)
return a[:deg+1]
# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n,Q = map(int,input().split())
*a, = map(int,input().split())
*q, = map(int,input().split())
b = [0]*n
for i in q: b[(n-i)%n] += 1
r = convolution(a,b)
for i in range(n,len(r)):
r[i%n] += r[i]
print(*r[:n])
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0