HDU 3853：LOOPS（概率DP）

时间：2016-08-20 15:59:10 阅读：205 评论：0 收藏：0 [点我收藏+]

标签：

http://acm.split.hdu.edu.cn/showproblem.php?pid=3853

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

题意：每一个格子有三个概率，分别是原地不动的概率，走到（i，j+1）的概率，走到（i+1，j）的概率，保证在边界的时候相对的概率为0，求从（1，1）走到（r，c）的期望。

思路：居然连圆神的题目都能出Orz，注意一个如果原地不动的概率为1要跳过。

 1 #include <cstdio>
 2 #include <algorithm>
 3 #include <cstring>
 4 using namespace std;
 5 #define N 1010
 6 
 7 double dp[N][N];
 8 double maze[N][N][3];
 9 
10 int main()
11 {
12     int r, c;
13     scanf("%d%d", &r, &c);
14     while(~scanf("%d%d", &r, &c)) {
15         for(int i = 1; i <= r; i++) {
16             for(int j = 1; j <= c; j++) {
17                 for(int k = 0; k < 3; k++) {
18                     scanf("%lf", &maze[i][j][k]);
19                 }
20             }
21         }
22         dp[r][c] = 0;
23         for(int i = r; i > 0; i--) {
24             for(int j = c; j > 0; j--) {
25                 if(j == c && i == r) continue;
26                 if(maze[i][j][0] == 1) continue; // 坑点,如果为1的话会永远无法走出去
27                 dp[i][j] = (maze[i][j][1] * dp[i][j+1] + maze[i][j][2] * dp[i+1][j] + 2) / ((double)1 - maze[i][j][0]);
28             }
29         }
30         printf("%.3f\n", dp[1][1]);
31     }
32     return 0;
33 }

HDU 3853：LOOPS（概率DP）

标签：

原文地址：http://www.cnblogs.com/fightfordream/p/5790556.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行