hdu 3853 LOOPS(概率dp)
2016-04-03 10:09
477 查看
LOOPS
[align=left]Problem Description[/align]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.
[align=left]Input[/align]
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
[align=left]Output[/align]
A real number at 3 decimal places (round to), representing the expect magic power Homura need to escape from the LOOPS.
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
6.000
#include<cstdio> #include<cstring> #include<map> #include<algorithm> using namespace std; double p[1005][1005][3]; double dp[1005][1005]; int main() { int r,c; while(scanf("%d%d",&r,&c)!=EOF) { memset(dp,0,sizeof(dp)); memset(p,0,sizeof(p)); for(int i=1;i<=r;i++) for(int j=1;j<=c;j++) for(int k=0;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(p[i][j][0]==1.0)continue; if(i==r&&j==c)continue; dp[i][j]=(dp[i][j+1]*p[i][j][1]+dp[i+1][j]*p[i][j][2]+2)/(1-p[i][j][0]); } printf("%.3f\n",dp[1][1]); } return 0; }
相关文章推荐
- nginx access_log 完全关闭
- nginx access_log 完全关闭
- linux小结
- linux服务器自动备份mysql数据库
- bash学习整理
- [Mac]-bash: mysql: command not found
- Shell Script 学习整理
- ubuntu配置环境变量
- SPOJ839 Optimal Marks(最小割)
- 分析Linux内核创建一个新进程的过程
- openwrt 平均负载的含义 Load Average
- Linux 手册 —— 管道
- 基于JavaScript实现 网页切出 网站title变化代码
- centos 7下Hadoop 2.7.2 伪分布式安装
- centos 7下Hadoop 2.7.2 伪分布式安装
- 使用BusyBox解决adb shell命令无法使用awk等命令的问题
- Google镜像网站全(4-3更)
- 三. 监控工具
- Linux内核及分析 第六周 分析Linux内核创建一个新进程的过程
- 玩转Bash脚本:test測试语句