HDU 3853 概率DP 解题报告
来源:互联网 发布:ios10软件不受信任 编辑:程序博客网 时间:2024/05/27 20:52
LOOPS
Problem Description
Akemi Homura is a Mahou Shoujo (Puella Magi/Magical Girl).
Homura wants to help her friend Madoka save the world. But because of the plot of the Boss Incubator, she is trapped in a labyrinth called LOOPS.
The planform of the LOOPS is a rectangle of R*C grids. There is a portal in each grid except the exit grid. It costs Homura 2 magic power to use a portal once. The portal in a grid G(r, c) will send Homura to the grid below G (grid(r+1, c)), the grid on the right of G (grid(r, c+1)), or even G itself at respective probability (How evil the Boss Incubator is)!
At the beginning Homura is in the top left corner of the LOOPS ((1, 1)), and the exit of the labyrinth is in the bottom right corner ((R, C)). Given the probability of transmissions of each portal, your task is help poor Homura calculate the EXPECT magic power she need to escape from the LOOPS.
Input
The first line contains two integers R and C (2 <= R, C <= 1000).
The following R lines, each contains C*3 real numbers, at 2 decimal places. Every three numbers make a group. The first, second and third number of the cth group of line r represent the probability of transportation to grid (r, c), grid (r, c+1), grid (r+1, c) of the portal in grid (r, c) respectively. Two groups of numbers are separated by 4 spaces.
It is ensured that the sum of three numbers in each group is 1, and the second numbers of the rightmost groups are 0 (as there are no grids on the right of them) while the third numbers of the downmost groups are 0 (as there are no grids below them).
You may ignore the last three numbers of the input data. They are printed just for looking neat.
The answer is ensured no greater than 1000000.
Terminal at EOF
Output
A real number at 3 decimal places (round to), representing the expect magic power Homura need to escape from the LOOPS.
Sample Input
2 2
0.00 0.50 0.50 0.50 0.00 0.50
0.50 0.50 0.00 1.00 0.00 0.00
Sample Output
6.000
【解题报告】
题意:有一个迷宫r行m列,开始点在[1,1]现在要走到[r,c]
对于在点[x,y]可以打开一扇门走到[x+1,y]或者[x,y+1]
消耗2点魔力
问平均消耗多少魔力能走到[r,c]
分析:假设dp[i][j]表示在点[i,j]到达[r,c]所需要消耗的平均魔力(期望)
则从dp[i][j]可以到达:
dp[i][j],dp[i+1,j],dp[i][j+1];
对应概率分别为:
p1,p2,p3
由E(aA+bB+cC…)=aEA+bEB+cEC+…//包含状态A,B,C的期望可以分解子期望求解
得到dp[i][j]=p1*dp[i][j]+p2*dp[i+1][j]+p3*dp[i][j+1]+2;
代码如下:
#include<cstdio> #include<cstring> #include<algorithm> using namespace std; #define N 1010int n,m; double dp[N][N],p[N][N][3]; int main(){ while(scanf("%d%d",&n,&m)!=EOF) { for(int i=1;i<=n;++i) for(int j=1;j<=m;++j) scanf("%lf%lf%lf",&p[i][j][0],&p[i][j][1],&p[i][j][2]); memset(dp,0,sizeof dp); for(int i=n;i>=1;--i) { for(int j=m;j>=1;--j) { if(i==n&&j==m) continue; if(p[i][j][0]==1.00) continue;//该点无路可走,期望值肯定为0(dp[i][j]=0) dp[i][j]=(p[i][j][1]*(dp[i][j+1])+p[i][j][2]*(dp[i+1][j])+2)/(1-p[i][j][0]); } } printf("%.3f\n",dp[1][1]); } return 0; }
- HDU 3853 概率DP 解题报告
- HDU4089概率dp解题报告
- POJ 2096 概率DP 解题报告
- poj 2096 概率DP 解题报告
- POJ2096 Collecting Bugs 解题报告【概率DP】
- hdu 1024 dp 解题报告
- hdu 3853 概率DP
- HDU 3853 概率DP
- HDU 3853 概率DP
- HDU 3853 概率dp
- 概率dp HDU 3853
- hdu 3853 概率dp
- HDU 3853 概率dp
- hdu 3853 概率dp
- 【解题报告】HDU 4616 Game - 树形dp
- hdu 5375 - Gray code(dp) 解题报告
- HDU 3045 DP斜率优化 解题报告
- HDU 3507 DP斜率优化 解题报告
- asp.net4.0网站开发与项目实战—学习笔记1
- java高级特性之--自动拆装箱和枚举
- Working with Linear Models
- linux命令之 tree 命令
- 集群
- HDU 3853 概率DP 解题报告
- ToLua学习笔记,通信(二)
- 源码分析:SharedPreferences实现
- String类与深浅拷贝
- 课堂学习——HDUOJ-1215
- 1007 Financial Management
- ACM 格式化输出,杨辉三角
- 提高.Net程序猿工作效率的开发工具
- 模板--二叉搜索树