8.11省选模拟 T2 【期望dp】

PROBLEM

---

SOL

CODE

#include<bits/stdc++.h>
#define pf printf
#define sf scanf
#define cs const
#define ll long long
#define db double
using namespace std;
cs int N=1700,mod=1e9+7;
#define rint register int 
inline int add(cs int &a,cs int &b){return a+b>mod? a-mod+b:a+b;}
inline int dec(cs int &a,cs int &b){return a-b<0? a+mod-b:a-b;}
inline int mul(cs int &a,cs int &b){return 1ll*a*b%mod;}
int f[15][N][410],q[15][N],c[15],n,inv[N],Q,tot,up,now,mx,fac[N];
bool vis[15][N];
inline int ksm(int a,int b){
	int ans=1;
	while(b){
		if(b&1)ans=mul(ans,a);
		a=mul(a,a);
		b>>=1;
	}
	return ans;
}
inline void init(){
	fac[0]=1;
	for(rint i=1;i<=n;++i)q[i][1]=mul(q[i][1],ksm(Q,mod-2)),q[i][0]=1;
	for(rint i=1;i<=mx;++i)inv[i]=ksm(i,mod-2),fac[i]=mul(fac[i-1],i);
	for(rint i=1;i<=n;++i)
		for(rint j=2;j<=mx;++j)
			q[i][j]=mul(q[i][j-1],mul(inv[j],q[i][1]));//cout<<q[i][j]<<'\n';
}
signed main (){
	//freopen("data.in","r",stdin);
	sf("%d",&n);
	for(rint i=1;i<=n;++i)sf("%d",&q[i][1]),Q+=q[i][1];
	for(rint i=1;i<=n;++i)sf("%d",&c[i]),tot+=c[i];
	mx=tot*4;
	init();
	f[0][0][tot]=1;vis[0][0]=1;
	for(rint i=1;i<=n;++i){
		for(rint j=0;j<mx;++j){
			if(!vis[i-1][j])continue;
			for(rint p=1;p<=tot;++p){
				if(!f[i-1][j][p])continue;
				up=p<=c[i]? p : ((p-c[i])*4+c[i]);
				for(rint k=0;k<=up;++k){
					now=k<=c[i]? p-k : p-c[i]-(k-c[i])/4;
					f[i][j+k][now]=add(f[i][j+k][now],mul(f[i-1][j][p],q[i][k]));	
					vis[i][j+k]=1;
				}
			}
		}
	}
	int ans=1;	
	for(rint j=1;j<=mx;++j)
		for(rint p=1;p<=tot;++p)
			if(f[n][j][p])ans=add(ans,mul(f[n][j][p],fac[j]));//cout<<f[n][j][p]<<'\n';
	cout<<ans;
	return 0;
}