結果
問題 | No.1763 Many Balls |
ユーザー |
![]() |
提出日時 | 2021-10-16 05:54:06 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 6,002 bytes |
コンパイル時間 | 350 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 260,192 KB |
最終ジャッジ日時 | 2025-01-03 13:02:59 |
合計ジャッジ時間 | 94,400 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 RE * 40 |
ソースコード
class FFT():def primitive_root_constexpr(self,m):if m==2:return 1if m==167772161:return 3if m==469762049:return 3if m==754974721:return 11if m==998244353:return 3divs=[0]*20divs[0]=2cnt=1x=(m-1)//2while(x%2==0):x//=2i=3while(i*i<=x):if (x%i==0):divs[cnt]=icnt+=1while(x%i==0):x//=ii+=2if x>1:divs[cnt]=xcnt+=1g=2while(1):ok=Truefor i in range(cnt):if pow(g,(m-1)//divs[i],m)==1:ok=Falsebreakif ok:return gg+=1def bsf(self,x):res=0while(x%2==0):res+=1x//=2return resbutterfly_first=Truebutterfly_inv_first=Truesum_e=[0]*30sum_ie=[0]*30def __init__(self,MOD):self.mod=MODself.g=self.primitive_root_constexpr(self.mod)def butterfly(self,a):n=len(a)h=(n-1).bit_length()if self.butterfly_first:self.butterfly_first=Falsees=[0]*30ies=[0]*30cnt2=self.bsf(self.mod-1)e=pow(self.g,(self.mod-1)>>cnt2,self.mod)ie=pow(e,self.mod-2,self.mod)for i in range(cnt2,1,-1):es[i-2]=eies[i-2]=iee=(e*e)%self.modie=(ie*ie)%self.modnow=1for i in range(cnt2-2):self.sum_e[i]=((es[i]*now)%self.mod)now*=ies[i]now%=self.modfor 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()if self.butterfly_inv_first:self.butterfly_inv_first=Falsees=[0]*30ies=[0]*30cnt2=self.bsf(self.mod-1)e=pow(self.g,(self.mod-1)>>cnt2,self.mod)ie=pow(e,self.mod-2,self.mod)for i in range(cnt2,1,-1):es[i-2]=eies[i-2]=iee=(e*e)%self.modie=(ie*ie)%self.modnow=1for i in range(cnt2-2):self.sum_ie[i]=((ies[i]*now)%self.mod)now*=es[i]now%=self.modfor 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=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]def inv_gcd(a,b):a=a%bif a==0:return (b,0)s=b;t=am0=0;m1=1while(t):u=s//ts-=t*um0-=m1*us,t=t,sm0,m1=m1,m0if m0<0:m0+=b//sreturn (s,m0)def crt(r,m):assert len(r)==len(m)n=len(r)r0=0;m0=1for i in range(n):assert 1<=m[i]r1=r[i]%m[i]m1=m[i]if m0<m1:r0,r1=r1,r0m0,m1=m1,m0if (m0%m1==0):if (r0%m1!=r1):return (0,0)continueg,im=inv_gcd(m0,m1)u1=m1//gif ((r1-r0)%g):return (0,0)x=(r1-r0)//g % u1*im%u1r0+=x*m0m0*=u1if r0<0:r0+=m0return (r0,m0)def modpow(a,b,m):res=1while b:if b%2:res*=ares%=ma*=aa%=mb//=2return resdef convolution_mod(a,b):mod=90001n=len(a)m=len(b)for i in range(n):a[i]%=modfor i in range(m):b[i]%=modmod1=167772161mod2=469762049ntt1=FFT(mod1)ntt2=FFT(mod2)x=ntt1.convolution(a,b)y=ntt2.convolution(a,b)ret=[0 for i in range(n)]for i in range(n):tmp=crt((x[i],y[i]),(mod1,mod2))ret[i]=tmp[0]%modreturn retn,m=map(int,input().split())n%=90000dp=[0 for i in range(n+1)]dp[0]=1f=[0 for i in range(n+1)]f[0]=1for i in range(1,n+1):f[i]=f[i-1]*modpow(i,89999,90001)f[i]%=90001for i in range(m):dp2=[0 for i in range(n+1)]k,*a=map(int,input().split())for j in range(k):for x in range(0,n+1,a[j]):dp2[x]=f[x]dp=convolution_mod(dp,dp2)dp=convolution_mod(dp,f)for i in range(1,n+1):dp[n]*=idp[n]%=90001print(dp[n])