結果
問題 | No.2062 Sum of Subset mod 999630629 |
ユーザー |
![]() |
提出日時 | 2022-08-26 22:20:15 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,580 bytes |
コンパイル時間 | 210 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 91,520 KB |
最終ジャッジ日時 | 2024-10-13 22:57:14 |
合計ジャッジ時間 | 4,187 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | WA * 3 |
other | WA * 29 |
ソースコード
mod=998244353def cmb(n,r):if r<0 or r>n:return 0return ((g1[n]*g2[r]%mod)*g2[n-r])%modN=300000g1=[1]*(N+3)for i in range(2,N+3):g1[i]=g1[i-1]*i%modg2=[0]*len(g1)g2[-1]=pow(g1[-1],mod-2,mod)for i in range(N+1,-1,-1):g2[i]=g2[i+1]*(i+1)%modinv=[0]*(N+3)for i in range(1,N+3):inv[i]=g2[i]*g1[i-1]%modN=int(input())A=list(map(int,input().split()))mod=998244353MOD=999630629N=10**5A=[10**4]*NS=sum(A)if S<MOD:print(pow(2,N-1,mod)*S%mod)exit()class FPS:sum_e=(911660635, 509520358, 369330050, 332049552, 983190778, 123842337, 238493703, 975955924, 603855026, 856644456, 131300601, 842657263,730768835, 942482514, 806263778, 151565301, 510815449, 503497456, 743006876, 741047443, 56250497)sum_ie=(86583718, 372528824, 373294451, 645684063, 112220581, 692852209, 155456985, 797128860, 90816748, 860285882, 927414960, 354738543,109331171, 293255632, 535113200, 308540755, 121186627, 608385704, 438932459, 359477183, 824071951)mod=998244353g=3def butterfly(self,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=1for s in range(w):offset=s<<(h-ph+1)for i in range(p):l=a[i+offset]r=a[i+offset+p]*nowr%=self.moda[i+offset]=l+ra[i+offset]%=self.moda[i+offset+p]=l-ra[i+offset+p]%=self.modnow*=self.sum_e[(~s & -~s).bit_length()-1]now%=self.moddef butterfly_inv(self,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=1for 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+ra[i+offset]%=self.moda[i+offset+p]=(l-r)*inowa[i+offset+p]%=self.modinow*=self.sum_ie[(~s & -~s).bit_length()-1]inow%=self.moddef convolution(self,a,b):n=len(a);m=len(b)if not(a) or not(b):return []if min(n,m)<=40:if n<m:n,m=m,na,b=b,ares=[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.modreturn resz=1<<((n+m-2).bit_length())a,b=list(a),list(b)a=a+[0]*(z-n)b=b+[0]*(z-m)self.butterfly(a)self.butterfly(b)c=[0]*zfor i in range(z):c[i]=(a[i]*b[i])%self.modself.butterfly_inv(c)iz=pow(z,self.mod-2,self.mod)for i in range(n+m-1):c[i]=(c[i]*iz)%self.modreturn c[:n+m-1]C=[0]*10000for i in range(N):C[10000-A[i]]+=1X=dict()X[0]=1def f(x,y):kx=list(x.keys())ky=list(y.keys())z=dict()for i in range(len(kx)):for j in range(len(ky)):p,q=kx[i],ky[i]r=p+qif r>K:continuez[r]=(z.get(r,0)+x[p]*y[q])%modreturn zK=S-MODfor i in range(10000):if C[i]==0:continuev=dict()for j in range(C[i],-1,-1):p=(10000-i)*(C[i]-j)if p>K:breakv[p]=(v.get(p,0)+cmb(C[i],j))%modX=f(X,v)print((pow(2,N-1,mod)*S-sum(X)*(MOD-mod))%mod)