[bzoj] 4720: [Noip2016]换教室

f数组表示前i个换了j次，此次是否成功的期望值。

先floyd求出所有点间的距离后，进行dp即可。

#include <cstdio>
#include <iostream>
using namespace std;
const int N=2005;
const double eps=1e-9;
int n,m,v,e,a,b;
int c[N],d[N];
double ki[N],w,map[305][305],ans;
double f[N][N][2];
int main()
{
    register int i,j,k;
    scanf("%d %d %d %d",&n,&m,&v,&e);
    for (i=1;i<=v;i++)
    for (j=1;j<=v;j++)
    map[i][j]=1e9;
    for (i=1;i<=n;i++) scanf("%d",&c[i]);
    for (i=1;i<=n;i++) scanf("%d",&d[i]);
    for (i=1;i<=n;i++) scanf("%lf",&ki[i]);
    for (i=1;i<=e;i++)
    {
        scanf("%d %d %lf",&a,&b,&w);
        map[a][b]=min(map[a][b],w);
        map[b][a]=map[a][b];
    }
    for (i=1;i<=v;i++) map[i][i]=0;
    for (k=1;k<=v;k++)
    for (i=1;i<=v;i++)
    for (j=1;j<=v;j++)
    {
        if (i!=j&&j!=k&&i!=k)
        map[i][j]=min(map[i][j],map[i][k]+map[k][j]);
    }
    for (i=1;i<=n;i++)
    for (j=0;j<=m;j++)
    f[i][j][0]=f[i][j][1]=1e9;
    f[1][0][0]=0;f[1][1][1]=0;
    for (i=2;i<=n;i++)
    {
        f[i][0][0]=f[i-1][0][0]+map[c[i-1]][c[i]];
        for (j=1;j<=min(i,m);j++)
        {
            f[i][j][0]=min(f[i-1][j][1]+ki[i-1]*map[d[i-1]][c[i]]+(1-ki[i-1])*map[c[i-1]][c[i]],f[i-1][j][0]+map[c[i-1]][c[i]]);
            f[i][j][1]=min(f[i-1][j-1][0]+ki[i]*map[c[i-1]][d[i]]+(1-ki[i])*map[c[i-1]][c[i]],
                           f[i-1][j-1][1]+ki[i]*(ki[i-1]*map[d[i-1]][d[i]]+(1-ki[i-1])*map[c[i-1]][d[i]])+(1-ki[i])*(ki[i-1]*map[d[i-1]][c[i]]+(1-ki[i-1])*map[c[i-1]][c[i]]));
        }
    }
    ans=f[n][0][0];
    for (i=1;i<=m;i++)
    {
        ans=min(ans,min(f[n][i][0],f[n][i][1]));
    }
    printf("%.2lf",ans);
    return 0;
}