题目传送门
题目描述:
一天一共有 n 节课,第 i 节课默认在第 c[i] 间教室上,可以
申请第 i 节课到第 d[i] 间教室上,申请有 k[i] 的概率通过,
从第 x 间教室到第 y 间教室有距离 dis[x][y],你最多可以申
请 m 门课,要求跑的期望距离尽量少
Solution
这是一道概率期望dp
我们设 d p [ i ] [ j ] [ 0 / 1 ] dp[i][j][0/1] dp[i][j][0/1]表示在前i个时间段,选了j个时间段进行换教室的最小期望距离
我们容易得到以下转移方程:
f [ i ] [ j ] [ 0 ] = m i n ( f [ i ] [ j ] [ 0 ] , m i n ( f [ i − 1 ] [ j ] [ 0 ] + d i s [ c [ i − 1 ] ] [ c [ i ] ] , f [ i − 1 ] [ j ] [ 1 ] + d i s [ d [ i − 1 ] ] [ c [ i ] ] ∗ k [ i − 1 ] + d i s [ c [ i − 1 ] ] [ c [ i ] ] ∗ ( 1 − k [ i − 1 ] ) ) ) ; f[i][j][0] = min(f[i][j][0] , min(f[i-1][j][0] + dis[c[i-1]][c[i]] , f[i-1][j][1] + dis[d[i-1]][c[i]] * k[i-1] + dis[c[i-1]][c[i]] * (1 - k[i-1]))); f[i][j][0]=min(f[i][j][0],min(f[i−1][j][0]+dis[c[i−1]][c[i]],f[i−1][j][1]+dis[d[i−1]][c[i]]∗k[i−1]+dis[c[i−1]][c[i]]∗(1−k[i−1])));
前一部分表示不选第(i-1)门课,后面表示选第(i-1)门课
f [ i ] [ j ] [ 1 ] = m i n ( f [ i ] [ j ] [ 1 ] , m i n ( f [ i − 1 ] [ m a x ( 0 , j − 1 ) ] [ 0 ] + d i s [ d [ i ] ] [ c [ i − 1 ] ] ∗ k [ i ] + d i s [ c [ i ] ] [ c [ i − 1 ] ] ∗ ( 1 − k [ i ] ) , f [ i − 1 ] [ m a x ( 0 , j − 1 ) ] [ 1 ] + d i s [ d [ i ] ] [ d [ i − 1 ] ] ∗ k [ i ] ∗ k [ i − 1 ] + d i s [ d [ i ] ] [ c [ i − 1 ] ] ∗ k [ i ] ∗ ( 1 − k [ i − 1 ] ) + d i s [ c [ i ] ] [ d [ i − 1 ] ] ∗ ( 1 − k [ i ] ) ∗ k [ i − 1 ] + d i s [ c [ i ] ] [ c [ i − 1 ] ] ∗ ( 1 − k [ i ] ) ∗ ( 1 − k [ i − 1 ] ) ) ) ; f[i][j][1] = min(f[i][j][1] , min(f[i-1][max(0,j-1)][0] + dis[d[i]][c[i-1]] * k[i] + dis[c[i]][c[i-1]] * (1-k[i]) , f[i-1][max(0,j-1)][1] + dis[d[i]][d[i-1]] * k[i] * k[i-1] + dis[d[i]][c[i-1]] * k[i] * (1-k[i-1]) + dis[c[i]][d[i-1]] * (1-k[i]) * k[i-1] + dis[c[i]][c[i-1]] * (1-k[i]) * (1-k[i-1]))); f[i][j][1]=min(f[i][j][1],min(f[i−1][max(0,j−1)][0]+dis[d[i]][c[i−1]]∗k[i]+dis[c[i]][c[i−1]]∗(1−k[i]),f[i−1][max(0,j−1)][1]+dis[d[i]][d[i−1]]∗k[i]∗k[i−1]+dis[d[i]][c[i−1]]∗k[i]∗(1−k[i−1])+dis[c[i]][d[i−1]]∗(1−k[i])∗k[i−1]+dis[c[i]][c[i−1]]∗(1−k[i])∗(1−k[i−1])));
前一部分表示不选第(i-1)门课,后面表示选第(i-1)门课
这个转移方程有点长,大家需要自己好好理解。
特别需要注意的是,对于选课既然有一定概率,那么也就是说会失败,这里也需要把失败的答案也算上才是总的期望。
//总的说,就是能让总的概率之和为1
Code
#include<bits/stdc++.h>
using namespace std;
int n,m,v,e;
double k[1010100];
int dis[501][501];
int c[101100],d[101010];
double f[2001][2001][2];
int main(){
scanf("%d %d %d %d",&n,&m,&v,&e);
for (int i=1;i<=n;i++) scanf("%d",&c[i]);
for (int i=1;i<=n;i++) scanf("%d",&d[i]);
memset(dis,20,sizeof(dis));
for (int i=1;i<=n;i++) scanf("%lf",&k[i]);
for (int i=1,x,y,z;i<=e;i++)
scanf("%d %d %d",&x,&y,&z),dis[x][y]=dis[y][x]=min(dis[x][y],z);
for (int i=1;i<=v;i++) dis[i][i] = 0;
for (int K=1;K<=v;K++)
for (int i=1;i<=v;i++)
for (int j=1;j<=v;j++){
dis[i][j] = min(dis[i][j] , dis[i][K] + dis[K][j]);}
// for (int i=1;i<=v;i++){
// for (int j=1;j<=v;j++) cout<<dis[i][j]<<' ';
// cout<<endl;
// }
for (int i=0;i<=n;i++)
for (int j=0;j<=m;j++) f[i][j][0] = f[i][j][1] = 100000000000.00;
f[1][0][0] = f[1][1][1]= 0.00;
for (int i=2;i<=n;i++){
f[i][0][0]=f[i-1][0][0] + dis[c[i-1]][c[i]];
for (int j=1;j<=min(i,m);j++){
f[i][j][0] = min(f[i][j][0] , min(f[i-1][j][0] + dis[c[i-1]][c[i]] , f[i-1][j][1] + dis[d[i-1]][c[i]] * k[i-1] + dis[c[i-1]][c[i]] * (1 - k[i-1])));
f[i][j][1] = min(f[i][j][1] , min(f[i-1][max(0,j-1)][0] + dis[d[i]][c[i-1]] * k[i] + dis[c[i]][c[i-1]] * (1-k[i]) , f[i-1][max(0,j-1)][1] + dis[d[i]][d[i-1]] * k[i] * k[i-1] + dis[d[i]][c[i-1]] * k[i] * (1-k[i-1]) + dis[c[i]][d[i-1]] * (1-k[i]) * k[i-1] + dis[c[i]][c[i-1]] * (1-k[i]) * (1-k[i-1])));
}
}
double minn=1000000000.00;
for (int i=0;i<=m;i++) minn = min(minn , min(f[n][i][0] , f[n][i][1]));
printf("%.2lf",minn);
return 0;
}