結果

問題 No.2062 Sum of Subset mod 999630629
ユーザー googol_S0
提出日時 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
権限があれば一括ダウンロードができます

ソースコード

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

mod=998244353
def cmb(n,r):
if r<0 or r>n:
return 0
return ((g1[n]*g2[r]%mod)*g2[n-r])%mod
N=300000
g1=[1]*(N+3)
for i in range(2,N+3):
g1[i]=g1[i-1]*i%mod
g2=[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)%mod
inv=[0]*(N+3)
for i in range(1,N+3):
inv[i]=g2[i]*g1[i-1]%mod
N=int(input())
A=list(map(int,input().split()))
mod=998244353
MOD=999630629
N=10**5
A=[10**4]*N
S=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=998244353
g=3
def 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=1
for s in range(w):
offset=s<<(h-ph+1)
for i in range(p):
l=a[i+offset]
r=a[i+offset+p]*now
r%=self.mod
a[i+offset]=l+r
a[i+offset]%=self.mod
a[i+offset+p]=l-r
a[i+offset+p]%=self.mod
now*=self.sum_e[(~s & -~s).bit_length()-1]
now%=self.mod
def 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=1
for 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+r
a[i+offset]%=self.mod
a[i+offset+p]=(l-r)*inow
a[i+offset+p]%=self.mod
inow*=self.sum_ie[(~s & -~s).bit_length()-1]
inow%=self.mod
def 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,n
a,b=b,a
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,b=list(a),list(b)
a=a+[0]*(z-n)
b=b+[0]*(z-m)
self.butterfly(a)
self.butterfly(b)
c=[0]*z
for i in range(z):
c[i]=(a[i]*b[i])%self.mod
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]
C=[0]*10000
for i in range(N):
C[10000-A[i]]+=1
X=dict()
X[0]=1
def 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+q
if r>K:
continue
z[r]=(z.get(r,0)+x[p]*y[q])%mod
return z
K=S-MOD
for i in range(10000):
if C[i]==0:
continue
v=dict()
for j in range(C[i],-1,-1):
p=(10000-i)*(C[i]-j)
if p>K:
break
v[p]=(v.get(p,0)+cmb(C[i],j))%mod
X=f(X,v)
print((pow(2,N-1,mod)*S-sum(X)*(MOD-mod))%mod)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0