很傻逼的一道期望DP,不要少处理状态转移。
f [ i ] [ j ] [ 0 / 1 ] f[i][j][0/1] f[i][j][0/1]表示前 i i i节课已经换了 j j j节课,其中第 i i i节课换了与否 ( 1 / 0 ) (1/0) (1/0)的期望最小值。
由于转移比较长并且转移方程十分简单就不罗列出来了。
f [ ] [ ] [ ] f[][][] f[][][]之前用 f l o y d floyd floyd求一下两两之间的最短路:
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define db double
#define ll long long
#define rep(i,x,y) for(ll i=(x);i<=(y);i++)
#define red(i,x,y) for(ll i=(x);i>=(y);i--)
using namespace std;
const ll N=2e3+5;
const ll M=3e2+5;
const db Inf=1e8;
ll n,m,v,e,a[N],b[N];
db p[N],dis[M][M],f[N][N][2];
inline ll read() {
ll x=0;char ch=getchar();bool f=0;
while(ch>'9'||ch<'0'){if(ch=='-')f=1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
return f?-x:x;
}
int main() {
n=read(),m=read();
v=read(),e=read();
rep(i,1,n) a[i]=read();
rep(i,1,n) b[i]=read();
rep(i,1,n) scanf("%lf",&p[i]);
rep(i,1,v) rep(j,1,v) dis[i][j]=Inf;
rep(i,1,v) dis[i][i]=0;
rep(i,1,e) {
ll x=read(),y=read(),z=read();
dis[x][y]=dis[y][x]=min(dis[x][y],z*1.0);
}
rep(k,1,v) rep(i,1,v) rep(j,1,v) dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
rep(i,1,n) rep(j,0,m) f[i][j][0]=f[i][j][1]=Inf;
f[0][0][0]=f[1][0][0]=f[1][1][1]=0.0;
rep(i,2,n) rep(j,0,m) {
f[i][j][0]=min(f[i-1][j][1]+dis[b[i-1]][a[i]]*p[i-1]+dis[a[i-1]][a[i]]*(1.0-p[i-1]),f[i-1][j][0]+dis[a[i-1]][a[i]]);
if(j) f[i][j][1]=min(f[i-1][j-1][0]+dis[a[i-1]][b[i]]*p[i]*1.0+dis[a[i-1]][a[i]]*(1.0-p[i]),
f[i-1][j-1][1]+dis[b[i-1]][b[i]]*p[i]*p[i-1]+dis[a[i-1]][b[i]]*p[i]*(1.0-p[i-1])+dis[b[i-1]][a[i]]*(1.0-p[i])*p[i-1]+dis[a[i-1]][a[i]]*(1.0-p[i])*(1.0-p[i-1]));
}
db ans=Inf*1.0;
rep(i,0,m) ans=min(ans,min(f[n][i][0],f[n][i][1]));
printf("%.2lf",ans);
return 0;
}