結果

問題 No.2633 Subsequence Combination Score
ユーザー PNJPNJ
提出日時 2024-02-18 10:35:31
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,888 ms / 2,000 ms
コード長 6,944 bytes
コンパイル時間 291 ms
コンパイル使用メモリ 81,572 KB
実行使用メモリ 127,372 KB
最終ジャッジ日時 2024-02-18 10:36:38
合計ジャッジ時間 60,273 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
68,740 KB
testcase_01 AC 49 ms
68,740 KB
testcase_02 AC 311 ms
91,044 KB
testcase_03 AC 1,449 ms
115,876 KB
testcase_04 AC 1,435 ms
120,280 KB
testcase_05 AC 1,359 ms
110,972 KB
testcase_06 AC 1,459 ms
113,540 KB
testcase_07 AC 1,467 ms
118,880 KB
testcase_08 AC 203 ms
97,352 KB
testcase_09 AC 1,825 ms
123,644 KB
testcase_10 AC 1,858 ms
121,676 KB
testcase_11 AC 1,783 ms
117,484 KB
testcase_12 AC 1,837 ms
121,864 KB
testcase_13 AC 1,855 ms
125,384 KB
testcase_14 AC 1,755 ms
119,912 KB
testcase_15 AC 1,743 ms
121,716 KB
testcase_16 AC 1,774 ms
121,440 KB
testcase_17 AC 1,754 ms
121,324 KB
testcase_18 AC 1,757 ms
121,056 KB
testcase_19 AC 1,816 ms
124,760 KB
testcase_20 AC 1,734 ms
118,456 KB
testcase_21 AC 1,762 ms
122,440 KB
testcase_22 AC 1,888 ms
127,372 KB
testcase_23 AC 1,734 ms
122,712 KB
testcase_24 AC 1,772 ms
121,684 KB
testcase_25 AC 1,793 ms
122,324 KB
testcase_26 AC 1,741 ms
124,556 KB
testcase_27 AC 1,694 ms
122,868 KB
testcase_28 AC 1,629 ms
118,532 KB
testcase_29 AC 48 ms
68,740 KB
testcase_30 AC 46 ms
68,740 KB
testcase_31 AC 46 ms
68,740 KB
testcase_32 AC 46 ms
68,740 KB
testcase_33 AC 1,833 ms
124,388 KB
testcase_34 AC 1,818 ms
124,388 KB
testcase_35 AC 1,832 ms
124,384 KB
testcase_36 AC 1,809 ms
124,388 KB
testcase_37 AC 1,759 ms
121,728 KB
testcase_38 AC 1,797 ms
123,340 KB
testcase_39 AC 1,800 ms
123,520 KB
testcase_40 AC 1,840 ms
120,040 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

class FFT():
    def primitive_root_constexpr(self,m):
        if m==2:return 1
        if m==167772161:return 3
        if m==469762049:return 3
        if m==754974721:return 11
        if m==998244353:return 3
        divs=[0]*20
        divs[0]=2
        cnt=1
        x=(m-1)//2
        while(x%2==0):x//=2
        i=3
        while(i*i<=x):
            if (x%i==0):
                divs[cnt]=i
                cnt+=1
                while(x%i==0):
                    x//=i
            i+=2
        if x>1:
            divs[cnt]=x
            cnt+=1
        g=2
        while(1):
            ok=True
            for i in range(cnt):
                if pow(g,(m-1)//divs[i],m)==1:
                    ok=False
                    break
            if ok:
                return g
            g+=1
    def bsf(self,x):
        res=0
        while(x%2==0):
            res+=1
            x//=2
        return res
    rank2=0
    root=[]
    iroot=[]
    rate2=[]
    irate2=[]
    rate3=[]
    irate3=[]
    
    def __init__(self,MOD):
        self.mod=MOD
        self.g=self.primitive_root_constexpr(self.mod)
        self.rank2=self.bsf(self.mod-1)
        self.root=[0 for i in range(self.rank2+1)]
        self.iroot=[0 for i in range(self.rank2+1)]
        self.rate2=[0 for i in range(self.rank2)]
        self.irate2=[0 for i in range(self.rank2)]
        self.rate3=[0 for i in range(self.rank2-1)]
        self.irate3=[0 for i in range(self.rank2-1)]
        self.root[self.rank2]=pow(self.g,(self.mod-1)>>self.rank2,self.mod)
        self.iroot[self.rank2]=pow(self.root[self.rank2],self.mod-2,self.mod)
        for i in range(self.rank2-1,-1,-1):
            self.root[i]=(self.root[i+1]**2)%self.mod
            self.iroot[i]=(self.iroot[i+1]**2)%self.mod
        prod=1;iprod=1
        for i in range(self.rank2-1):
            self.rate2[i]=(self.root[i+2]*prod)%self.mod
            self.irate2[i]=(self.iroot[i+2]*iprod)%self.mod
            prod=(prod*self.iroot[i+2])%self.mod
            iprod=(iprod*self.root[i+2])%self.mod
        prod=1;iprod=1
        for i in range(self.rank2-2):
            self.rate3[i]=(self.root[i+3]*prod)%self.mod
            self.irate3[i]=(self.iroot[i+3]*iprod)%self.mod
            prod=(prod*self.iroot[i+3])%self.mod
            iprod=(iprod*self.root[i+3])%self.mod
    def butterfly(self,a):
        n=len(a)
        h=(n-1).bit_length()
        
        LEN=0
        while(LEN<h):
            if (h-LEN==1):
                p=1<<(h-LEN-1)
                rot=1
                for s in range(1<<LEN):
                    offset=s<<(h-LEN)
                    for i in range(p):
                        l=a[i+offset]
                        r=a[i+offset+p]*rot
                        a[i+offset]=(l+r)%self.mod
                        a[i+offset+p]=(l-r)%self.mod
                    rot*=self.rate2[(~s & -~s).bit_length()-1]
                    rot%=self.mod
                LEN+=1
            else:
                p=1<<(h-LEN-2)
                rot=1
                imag=self.root[2]
                for s in range(1<<LEN):
                    rot2=(rot*rot)%self.mod
                    rot3=(rot2*rot)%self.mod
                    offset=s<<(h-LEN)
                    for i in range(p):
                        a0=a[i+offset]
                        a1=a[i+offset+p]*rot
                        a2=a[i+offset+2*p]*rot2
                        a3=a[i+offset+3*p]*rot3
                        a1na3imag=(a1-a3)%self.mod*imag
                        a[i+offset]=(a0+a2+a1+a3)%self.mod
                        a[i+offset+p]=(a0+a2-a1-a3)%self.mod
                        a[i+offset+2*p]=(a0-a2+a1na3imag)%self.mod
                        a[i+offset+3*p]=(a0-a2-a1na3imag)%self.mod
                    rot*=self.rate3[(~s & -~s).bit_length()-1]
                    rot%=self.mod
                LEN+=2
                
    def butterfly_inv(self,a):
        n=len(a)
        h=(n-1).bit_length()
        LEN=h
        while(LEN):
            if (LEN==1):
                p=1<<(h-LEN)
                irot=1
                for s in range(1<<(LEN-1)):
                    offset=s<<(h-LEN+1)
                    for i in range(p):
                        l=a[i+offset]
                        r=a[i+offset+p]
                        a[i+offset]=(l+r)%self.mod
                        a[i+offset+p]=(l-r)*irot%self.mod
                    irot*=self.irate2[(~s & -~s).bit_length()-1]
                    irot%=self.mod
                LEN-=1
            else:
                p=1<<(h-LEN)
                irot=1
                iimag=self.iroot[2]
                for s in range(1<<(LEN-2)):
                    irot2=(irot*irot)%self.mod
                    irot3=(irot*irot2)%self.mod
                    offset=s<<(h-LEN+2)
                    for i in range(p):
                        a0=a[i+offset]
                        a1=a[i+offset+p]
                        a2=a[i+offset+2*p]
                        a3=a[i+offset+3*p]
                        a2na3iimag=(a2-a3)*iimag%self.mod
                        a[i+offset]=(a0+a1+a2+a3)%self.mod
                        a[i+offset+p]=(a0-a1+a2na3iimag)*irot%self.mod
                        a[i+offset+2*p]=(a0+a1-a2-a3)*irot2%self.mod
                        a[i+offset+3*p]=(a0-a1-a2na3iimag)*irot3%self.mod
                    irot*=self.irate3[(~s & -~s).bit_length()-1]
                    irot%=self.mod
                LEN-=2
    def convolution(self,a,b):
        n=len(a);m=len(b)
        if not(a) or not(b):
            return []
        if min(n,m)<=40:
            res=[0]*(n+m-1)
            for i in range(n):
                for j in range(m):
                    res[i+j]+=a[i]*b[j]
                    res[i+j]%=self.mod
            return res
        z=1<<((n+m-2).bit_length())
        a=a+[0]*(z-n)
        b=b+[0]*(z-m)
        self.butterfly(a)
        self.butterfly(b)
        c=[(a[i]*b[i])%self.mod for i in range(z)]
        self.butterfly_inv(c)
        iz=pow(z,self.mod-2,self.mod)
        for i in range(n+m-1):
            c[i]=(c[i]*iz)%self.mod
        return c[:n+m-1]

mod = 998244353
CONV = FFT(mod)

N = int(input())
A = list(map(int,input().split()))
fact = [1]
for i in range(1,10**5+1):
  fact.append(fact[-1]*i % mod)
fact_inv = [1 for i in range(10**5 + 1)]
fact_inv[-1] = pow(fact[-1],mod-2,mod)
for i in range(10**5,0,-1):
  fact_inv[i-1] = fact_inv[i] * i % mod

dp = [fact[A[i]] for i in range(N)]
def online_convolution(l,r):
  if l + 1 == r:
    return
  m = (l + r) // 2
  online_convolution(l,m)
  u = A[l]
  d = A[m-1]
  P = [0 for i in range(u - d + 1)]
  for i in range(l,m):
    P[u-A[i]] += dp[i]
  x = A[r-1]
  Q = fact_inv[:u-x+1]
  R = CONV.convolution(P,Q)
  for i in range(m,r):
    d = u - A[i]
    dp[i] += R[d]
    dp[i] %= mod
  online_convolution(m,r)

online_convolution(0,N)
ans = 0
for i in range(N):
  ans += dp[i] * fact_inv[A[i]]
  ans %= mod
print(ans)
0