E1 - Nauuo and Pictures (easy version) (期望dp)

 

思路：dp[ i ][ j ][ k ] 代表 i 轮，当前类别被访问了 j次，这个东西被访问了 k 次的概率。

         边界条件 dp[0][0][0] = 1;代表这个初始状态的概率为1.

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef long long lint;
const int maxn = 10000;
const int mod = 998244353;
lint a[maxn],w[maxn],inv[maxn],dp[100][100][100],A,B,m,n;
void add( lint& x,lint y ){
    x  = (x+y)%mod;
}
lint mul( lint x,lint y ){
    return (x*y)%mod;
}
void mul2(lint& x,lint y){
    x = (x*y)%mod;
}
void solve( lint x ){
    memset( dp,0,sizeof(dp) );
    dp[0][0][0] = 1;
    for(lint i = 0;i <= m;i++){
        for( lint j = 0;j <= i;j++ ){
            for( lint k = 0;k <= j;k++ ){
                if( a[x] ){
                    lint wx = w[x]+k,wa = A + j,wb = B - (i-j);
                    add(dp[i+1][j+1 ][k+1] , mul(mul( dp[i][j][k],wx), inv[wa + wb]));
                    add(dp[i+1][j+1][k] , mul(mul(dp[i][j][k],wa-wx),inv[wa+wb]));
                    add(dp[i+1][j][k],mul(mul(dp[i][j][k],wb),inv[wa+wb]));
                }else{
                    lint wx = w[x]-k,wb = B - j,wa = A + (i-j);
                    add(dp[i+1][j+1][k+1] ,mul(mul( dp[i][j][k],wx),inv[wa+wb]));
                    add(dp[i+1][j+1][k],mul(mul(dp[i][j][k],(wb-wx)),inv[wa+wb]));
                    add(dp[i+1][j][k],mul(mul(dp[i][j][k],wa),inv[wa+wb]));
                }
        }
        }
    }
    lint re = 0;
    for( lint i = 0;i <= m;i++ ){
        for( lint j = 0;j <= i;j++ ){
            if( a[x] ){
                lint val = w[x]+j;
                add( re,mul(val,dp[m][i][j]) );
            }else{
                lint val = w[x]-j;
                add(re,mul(val,dp[m][i][j]));
            }
        }
    }
    printf("%I64d\n",re);
}
lint mypow( lint x,lint y ){
    lint re = 1;
    while(y){
        if(y&1LL) mul2(re,x);
        y >>= 1;
        mul2(x,x);
    }
    return re;
}
void prework(){
    for( lint i = 1;i <= 3000;i++ ){
        inv[i] = mypow(i,mod-2);
    }
}
int main()
{
    prework();
    scanf("%I64d%I64d",&n,&m);
    A =B = 0;
    for( lint i = 1;i <= n;i++ ) scanf("%I64d",&a[i]);
    for( lint i = 1;i <= n;i++ ) {scanf("%I64d",&w[i]);if(a[i])A += w[i];else B += w[i];}
    for( lint i = 1;i <= n;i++ ) solve(i);
    return 0;
}