32pts求条

#include<bits/stdc++.h>
#define int long long
#define for(i,l,r) for(i=l;i<=r;i++)
//#define min(a,b) ((a)<(b) ? (a) : (b))
using namespace std;
double f[330][330],k[2020],dp[2020][2020][2];
int n,m,e,v,i,j;
int c[2020],d[2020];

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	cin>>n>>m>>v>>e;
	for(i,1,n) cin>>c[i];
	for(i,1,n) cin>>d[i];
	for(i,1,n) cin>>k[i];
	for(i,1,v){
		for(j,1,v)
			f[i][j]=1e9;
		f[i][i]=0;
	}
	int u,v,w;
	for(i,1,e){
		cin>>u>>v>>w;
		if(f[v][u]>w) f[v][u]=w;
		if(f[u][v]>w) f[u][v]=w;
	}
	int t;
	for(t,1,v) for(i,1,v) for(j,1,v)
		f[i][j]=min(f[i][j],f[i][t]+f[t][j]);
	for(i,1,n) for(j,0,m) 
		dp[i][j][1]=dp[i][j][0]=1e9;
	dp[1][0][0]=dp[1][1][1]=0;
	for(i,2,n){
		for(j,0,m){
			dp[i][j][0]=min(dp[i-1][j][0]+f[c[i-1]][c[i]],dp[i-1][j][1]+k[i-1]*f[d[i-1]][c[i]]+(1-k[i-1])*f[c[i-1]][c[i]]);
			if(j>0)
				dp[i][j][1]=min(dp[i-1][j-1][0]+f[c[i-1]][d[i]]*k[i]+f[c[i-1]][c[i]]*(1-k[i]),dp[i-1][j-1][1]+k[i-1]*k[i]*f[d[i-1]][d[i]]+k[i-1]*(1-k[i])*f[d[i-1]][c[i]]+(1-k[i-1])*k[i]*f[c[i-1]][d[i]]+(1-k[i-1])*(1-k[i])*f[c[i-1]][c[i]]);
		}
	}
	double ans=1e9;
	for(i,0,m)
		ans=min(ans,min(dp[n][i][1],dp[n][i][0]));
	cout<<setprecision(2)<<fixed<<ans<<'\n';
	return 0;
}