結果

問題 No.2817 Competition
ユーザー PNJPNJ
提出日時 2024-07-19 21:51:55
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 928 ms / 2,000 ms
コード長 4,695 bytes
コンパイル時間 217 ms
コンパイル使用メモリ 82,488 KB
実行使用メモリ 130,952 KB
最終ジャッジ日時 2024-07-19 21:52:07
合計ジャッジ時間 10,493 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 39 ms
53,120 KB
testcase_01 AC 37 ms
52,736 KB
testcase_02 AC 37 ms
52,992 KB
testcase_03 AC 841 ms
125,812 KB
testcase_04 AC 826 ms
125,808 KB
testcase_05 AC 876 ms
125,804 KB
testcase_06 AC 852 ms
126,196 KB
testcase_07 AC 822 ms
125,900 KB
testcase_08 AC 216 ms
80,112 KB
testcase_09 AC 280 ms
84,008 KB
testcase_10 AC 432 ms
90,884 KB
testcase_11 AC 579 ms
101,432 KB
testcase_12 AC 80 ms
73,984 KB
testcase_13 AC 318 ms
85,760 KB
testcase_14 AC 452 ms
90,496 KB
testcase_15 AC 301 ms
83,996 KB
testcase_16 AC 487 ms
92,544 KB
testcase_17 AC 327 ms
87,296 KB
testcase_18 AC 928 ms
130,952 KB
testcase_19 AC 44 ms
59,008 KB
testcase_20 AC 39 ms
53,120 KB
testcase_21 AC 44 ms
59,264 KB
testcase_22 AC 46 ms
59,776 KB
testcase_23 AC 49 ms
60,032 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

mod = 998244353
imag = 911660635
iimag = 86583718
rate2 = (0, 911660635, 509520358, 369330050, 332049552, 983190778, 123842337, 238493703, 975955924, 603855026, 856644456, 131300601, 842657263, 730768835, 942482514, 806263778, 151565301, 510815449, 503497456, 743006876, 741047443, 56250497, 867605899, 0)
irate2 = (0, 86583718, 372528824, 373294451, 645684063, 112220581, 692852209, 155456985, 797128860, 90816748, 860285882, 927414960, 354738543, 109331171, 293255632, 535113200, 308540755, 121186627, 608385704, 438932459, 359477183, 824071951, 103369235, 0)
rate3 = (0, 372528824, 337190230, 454590761, 816400692, 578227951, 180142363, 83780245, 6597683, 70046822, 623238099, 183021267, 402682409, 631680428, 344509872, 689220186, 365017329, 774342554, 729444058, 102986190, 128751033, 395565204, 0)
irate3 = (0, 509520358, 929031873, 170256584, 839780419, 282974284, 395914482, 444904435, 72135471, 638914820, 66769500, 771127074, 985925487, 262319669, 262341272, 625870173, 768022760, 859816005, 914661783, 430819711, 272774365, 530924681, 0)

def fft(a):
  n = len(a)
  h = (n - 1).bit_length()
  le = 0
  while le < h:
    if h == le + 1:
      p = 1
      rot = 1
      for s in range(1 << le):
        offset = s << (h - le)
        for i in range(p):
          l = a[i + offset]
          r = a[i + offset + p] * rot
          a[i + offset] = (l + r) % mod
          a[i + offset + p] = (l - r) % mod
        rot *= rate2[(~s & -~s).bit_length()]
        rot %= mod
      le += 1
    else:
      p = 1 << (h - le - 2)
      rot = 1
      for s in range(1 << le):
        rot2 = rot * rot % mod
        rot3 = rot2 * rot % mod
        offset = s << (h - le)
        for i in range(p):
          a0 = a[i + offset]
          a1 = a[i + offset + p] * rot
          a2 = a[i + offset + p * 2] * rot2
          a3 = a[i + offset + p * 3] * rot3
          a1na3imag = (a1 - a3) % mod * imag
          a[i + offset] = (a0 + a2 + a1 + a3) % mod
          a[i + offset + p] = (a0 + a2 - a1 - a3) % mod
          a[i + offset + p * 2] = (a0 - a2 + a1na3imag) % mod
          a[i + offset + p * 3] = (a0 - a2 - a1na3imag) % mod
        rot *= rate3[(~s & -~s).bit_length()]
        rot %= mod
      le += 2

def fft_inv(a):
  n = len(a)
  h = (n - 1).bit_length()
  le = h
  while le:
    if le == 1:
      p = 1 << (h - le)
      irot = 1
      for s in range(1 << (le - 1)):
        offset = s << (h - le + 1)
        for i in range(p):
          l = a[i + offset]
          r = a[i + offset + p]
          a[i + offset] = (l + r) % mod
          a[i + offset + p] = (l - r) * irot % mod
        irot *= irate2[(~s & -~s).bit_length()]
        irot %= mod
      le -= 1
    else:
      p = 1 << (h - le)
      irot = 1
      for s in range(1 << (le - 2)):
        irot2 = irot * irot % mod
        irot3 = irot2 * irot % mod
        offset = s << (h - le + 2)
        for i in range(p):
          a0 = a[i + offset]
          a1 = a[i + offset + p]
          a2 = a[i + offset + p * 2]
          a3 = a[i + offset + p * 3]
          a2na3iimag = (a2 - a3) * iimag % mod
          a[i + offset] = (a0 + a1 + a2 + a3) % mod
          a[i + offset + p] = (a0 - a1 + a2na3iimag) * irot % mod
          a[i + offset + p * 2] = (a0 + a1 - a2 - a3) * irot2 % mod
          a[i + offset + p * 3] = (a0 - a1 - a2na3iimag) * irot3 % mod
        irot *= irate3[(~s & -~s).bit_length()]
        irot %= mod
      le -= 2

def ntt(a):
  if len(a) <= 1:
    return
  fft(a)

def ntt_inv(a):
  if len(a) <= 1:
    return
  fft_inv(a)
  iv = pow(len(a),mod-2,mod)
  for i in range(len(a)):
    a[i] = a[i] * iv % mod

def convolute(a,b):
  aa = a[:]
  bb = b[:]
  n = len(aa)
  m = len(bb)
  if min(n,m) <= 60:
    return convolute_naive(a,b)
  z = 1 << (n + m - 2).bit_length()
  aa += [0] * (z - n)
  bb += [0] * (z - m)
  fft(aa)
  fft(bb)
  for i in range(z):
    aa[i] = aa[i] * bb[i] % mod
  fft_inv(aa)
  aa = aa[:n + m - 1]
  iz = pow(z, mod - 2, mod)
  for i in range(n+m-1):
    aa[i] = (aa[i] * iz) % mod
  return aa

def convolute_naive(a,b):
  res = [0] * (len(a) + len(b) - 1)
  for i in range(len(a)):
    for j in range(len(b)):
      res[i+j] = (res[i+j] + a[i] * b[j] % mod) % mod
  return res

N = int(input())
A = list(map(int,input().split()))

def merge_convolute(P,l,r):
  if l + 1 == r:
    return [1,A[l] % mod]
  m = (l + r) // 2
  f = merge_convolute(P,l,m)
  g = merge_convolute(P,m,r)
  h = convolute(f,g)
  return h

F = merge_convolute(A,0,N)
ans = 0
for n in range(1,N+1):
  ans += F[n] * pow(n,N-n,mod) % mod
  ans %= mod
print(ans)
0