HDU3853--LOOPS--概率DP
来源:互联网 发布:js 大屏幕 倒计时特效 编辑:程序博客网 时间:2024/05/22 10:51
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.
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
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 20.00 0.50 0.50 0.50 0.00 0.500.50 0.50 0.00 1.00 0.00 0.00
Sample Output
6.000
典型的概率DP入门题了、、、p[i][j][1]有可能=1、、、这点要小心!!WA了N次!
/*dp[i][j] = p1*dp[i][j] + p2*dp[i][j+1] + p3*dp[i+1][j] + 2dp[i][j] = (p2*dp[i][j+1] + p3*dp[i+1][k] + 2)/(1-p1);*/#include <iostream>#include <cstdio>#include <cmath>#include <cstring>using namespace std;#define maxn 1080double dp[maxn][maxn];double p[maxn][maxn][4];#define eps 1e-5int main(){int r,c;while(scanf("%d%d",&r,&c)==2){for(int i = 1;i <= r;i++)for(int j = 1;j <= c;j++)for(int k = 1;k <= 3;k++)scanf("%lf",&p[i][j][k]);dp[r][c] = 0;for(int i = r;i >= 1;i--)for(int j = c;j >= 1;j--)if((i == r && j == c) || fabs(1-p[i][j][1]) < eps)continue;else dp[i][j] = (p[i][j][2] * dp[i][j+1] + p[i][j][3] * dp[i+1][j] + 2)/(1-p[i][j][1]);printf("%.3lf\n",dp[1][1]);}return 0;}
0 0
- HDU3853:LOOPS(概率DP)
- HDU3853--LOOPS--概率DP
- HDU3853 LOOPS 概率DP
- HDU3853 LOOPS 概率DP
- hdu3853 LOOPS(概率dp)
- LOOPS(hdu3853,概率DP入门)
- hdu3853 LOOPS 概率dp求期望
- HDU3853-LOOPS(概率DP求期望)
- hdu3853 LOOPS 【概率DP+期望问题】
- HDU3853:LOOPS(概率dp & 期望)
- hdu3853[LOOPS] 继续浅尝期望概率DP
- [dp] hdu3853 loops
- 【期望DP】HDU3853 LOOPS
- hdu3853(概率DP)
- HDU3853概率DP
- hdu3853(概率dp)
- hdu3853 概率dp
- hdu3853(简单概率dp)
- 生活
- 【算法导论】插入排序实现
- 写给linux系统管理员看的systemd 五 关闭的三个级别(systemd作者blog翻译过来的)
- jstl的fmt标签
- hdu 2845 Beans(最长不连续子序列和)
- HDU3853--LOOPS--概率DP
- 九度1482解题报告
- ZOJ 3764 - ZOJ Monthly, March 2014 最大流最小割
- hadoop伪分布式部署及测试
- TreeView读取数据库
- SVN提交小结
- 【算法导论】归并排序实现
- 九度OJ 题目1002:Grading
- 组合问题(从M个不同字符中任取N个字符的所有组合)