#911022 (PyPy3) No.2499 Sum of Products of Sums

提出ソース

結果

問題	No.2499 Sum of Products of Sums
ユーザー	とりゐ
提出日時	2023-09-05 12:10:18
言語	PyPy3 (7.3.15)
結果	AC
実行時間	497 ms / 2,000 ms
コード長	5,600 bytes
コンパイル時間	707 ms
コンパイル使用メモリ	82,432 KB
実行使用メモリ	83,316 KB
最終ジャッジ日時	2024-06-23 07:48:07
合計ジャッジ時間	5,087 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	54 ms 62,592 KB
testcase_01	AC	54 ms 63,104 KB
testcase_02	AC	129 ms 80,112 KB
testcase_03	AC	54 ms 62,848 KB
testcase_04	AC	54 ms 62,976 KB
testcase_05	AC	53 ms 63,104 KB
testcase_06	AC	54 ms 62,592 KB
testcase_07	AC	110 ms 79,616 KB
testcase_08	AC	80 ms 71,040 KB
testcase_09	AC	108 ms 79,616 KB
testcase_10	AC	79 ms 71,168 KB
testcase_11	AC	111 ms 79,616 KB
testcase_12	AC	78 ms 71,168 KB
testcase_13	AC	385 ms 81,652 KB
testcase_14	AC	346 ms 81,412 KB
testcase_15	AC	346 ms 81,740 KB
testcase_16	AC	374 ms 81,912 KB
testcase_17	AC	494 ms 83,064 KB
testcase_18	AC	497 ms 83,316 KB
testcase_19	AC	479 ms 83,060 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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 butterfly(a):
  n = len(a)
  h = (n - 1).bit_length()
  le = 0
  while le < h:
    if h - le == 1:
      p = 1 << (h - le - 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 butterfly_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 multiply(s, t):
  n = len(s)
  m = len(t)
  if min(n, m) <= 60:
    a = [0] * (n + m - 1)
    for i in range(n):
      if i % 8 == 0:        
        for j in range(m):
          a[i + j] += s[i] * t[j]
          a[i + j] %= MOD
      else:
        for j in range(m):
          a[i + j] += s[i] * t[j]
    return [x % MOD for x in a]
  a = s.copy()
  b = t.copy()
  z = 1 << (n + m - 2).bit_length()
  a += [0] * (z - n)
  b += [0] * (z - m)
  butterfly(a)
  butterfly(b)
  for i in range(z):
    a[i] *= b[i]
    a[i] %= MOD
  butterfly_inv(a)
  a = a[:n + m - 1]
  iz = pow(z, MOD - 2, MOD)
  return [v * iz % MOD for v in a]


mod=998244353
table_size=2*10**5

fac=[1]*(table_size+1)
finv=[1]*(table_size+1)

for i in range(2,table_size+1):
  fac[i]=fac[i-1]*i%mod
finv[table_size]=pow(fac[table_size],mod-2,mod)
for i in range(table_size-1,-1,-1):
  finv[i]=finv[i+1]*(i+1)%mod

def rebuild(n):
  global table_size,fac,finv
  fac+=[0]*(n-table_size)
  fac+=[0]*(n-table_size)
  finv+=[0]*(n-table_size)
  for i in range(table_size+1,n+1):
    fac[i]=fac[i-1]*i%mod
  finv[n]=inv(fac[n])
  for i in range(n-1,table_size,-1):
    finv[i]=finv[i+1]*(i+1)%mod
  table_size=n

def binom(n,k):
  if n<0 or k<0:
    return 0
  if k>n:
    return 0
  if n>table_size:
    rebuild(n+10**4)
  return (fac[n]*finv[k]%mod)*finv[n-k]%mod

def fpow(x,k):
  res=1
  while k:
    if k&1:
      res=res*x%mod
    x=x*x%mod
    k>>=1
  return res

def inv(a):
  if a<table_size:
    return fac[a-1]*finv[a]%mod
  return fpow(a,mod-2)




def f(N,S,k):
  # |X| = N, sum X <= S なる X に対する Π[i<=k] X_i の総和
  return binom(N+S,N+k)

def g(N,S):
  # f(N,S,0),...,f(N,S,N) を列挙
  res=[0]*(N+1)
  tmp=1
  for i in range(N):
    tmp*=N+S-i
    tmp%=mod
  res[0]=tmp*finv[N]%mod
  for i in range(1,N+1):
    tmp*=S-i+1
    tmp%=mod
    res[i]=tmp*finv[N+i]%mod
  return res

H,W=map(int,input().split())
dp=[0]*(W+1)
dp[0]=1
for _ in range(H):
  L,R=map(int,input().split())
  res1=g(W,R)
  res2=g(W,L-1)
  for i in range(W+1):
    res1[i]-=res2[i]
    res1[i]%=mod
    res1[i]*=finv[i]
    res1[i]%=mod
  dp=multiply(dp,res1)[:W+1]

print(dp[W]*fac[W]%mod)

yukicoder

結果

テストケース

ソースコード