HDU 3853 LOOPS 期望DP入门

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

---

About

    给出一个 n * m 的矩阵，每一次可以向下，向右，后者留在原地，每一次都会花费 2 点的魔法值，先给出每个点行走方式的概率，求从 (1, 1) 走到 (n, m) 的概率。

Solution :

    这是我重拾期望DP的第一题，之前学过学得比较仓促，那么就从这里开始吧。
    首先我们设 $DP[i][j]$ 表示从点 $(i, j)$ 走到 $(n, m)$ 的概率，我们倒着推期望，于是我们可以得

$$DP[i][j] = DP[i][j] * p[i][j][1] + DP[i][j + 1] * p[i][j][2] + DP[i + 1][j] * p[i][j][3] + 2$$
    好现在让我们好好看一看这个方程式，这个方程式表示我在 $(i, j)$ 分别向右走，向下走，停在原地的期望和，可能有人会问这个 2 看起来很单独，好，你这样想无论我怎么走都会花费 2，可能你会想为什么这个 2 不和其他的 DP 一起乘上概率呢？ 好，你这样想我把每个式子中的 2 连同着和它成的概率都提出来， 那么就会得到这个 $2 * (p[i][j][1] + p[i][j][2] + p[i][j][3])$ 其实你会发现 2 后面乘的那一坨就是 1，想了一想，只有这么解释。要记住和的期望等于期望的和。
$$E\big( \sum_{i=1}^{n}x_i\big) = E \sum_{i=1}^{n}\big( x_i \big)$$
    给出式子纪念入门。时间已经不多了。

Code :

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <ctime>
#include <map>
#include <vector>
using namespace std;

inline int read() {
    int i = 0, f = 1;
    char ch = getchar();
    while(!isdigit(ch)) {
        if(ch == '-') f = -1; ch = getchar();
    }
    while(isdigit(ch)) {
        i = (i << 3) + (i << 1) + ch - '0'; ch = getchar();
    }
    return i * f;
}

const int MAXN = 1000 + 5;
double p[MAXN][MAXN][4], dp[MAXN][MAXN];
int n, m;

int main() {
    while(scanf("%d%d", &n, &m) != EOF) {
        memset(dp, 0, sizeof(dp));
        for(int i = 1; i <= n; ++i)
            for(int j = 1; j <= m; ++j)
                for(int k = 1; k <= 3; ++k)
                    scanf("%lf", &p[i][j][k]);
        dp[n][m] = 0;
        for(int i = n; i >= 1; --i)
            for(int j = m; j >= 1; --j)
                if((i == n && j == m) || p[i][j][1] == 1) continue;
                else dp[i][j] = (double)(dp[i][j + 1] * p[i][j][2] + (double)dp[i + 1][j] * p[i][j][3] + 2) / (double)(1.0 - p[i][j][1]); 
        printf("%.3lf\n", dp[1][1]);
    }
}