HDU3853 概率DP

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 

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

题意：

最开始他在Map[1][1]，出口在Map[n][m]；每一次他会消耗两颗神丹，然后每一个格子，有一定概率留在原地，有一定概率向下走一格，有一定概率向右走一格。。。求逃出去的神丹消耗期望。

思路：

dp[i][j]:从(i,j)到(n,m)的期望步数，所求答案即为dp[1][1]。

dp[i][j]=p1*dp[i][j]+p2*dp[i][j+1]+p3*dp[i+1][j](写的时候需要移项dp[i][j])

代码：

#include"bits/stdc++.h"

#define db double
#define ll long long
#define vl vector<ll>
#define ci(x) scanf("%d",&x)
#define cd(x) scanf("%lf",&x)
#define cl(x) scanf("%lld",&x)
#define pi(x) printf("%d
",x)
#define pd(x) printf("%f
",x)
#define pl(x) printf("%lld
",x)
#define rep(i, n) for(int i=0;i<n;i++)
using namespace std;
const int N   = 1e6 + 5;
const int mod = 1e9 + 7;
const int MOD = 998244353;
const db  PI  = acos(-1.0);
const db  eps = 1e-10;
const ll INF = 0x3fffffffffffffff;
db p1[1005][1005];
db p2[1005][1005];
db p3[1005][1005];
db dp[1005][1005];
int n,m;
int main()
{

    while(scanf("%d%d",&n,&m)==2){
        for(int i=1;i<=n;i++)
            for(int j=1;j<=m;j++) cd(p1[i][j]),cd(p2[i][j]),cd(p3[i][j]);
        memset(dp,0, sizeof(dp));
        for(int i=n;i>=1;i--){
            for(int j=m;j>=1;j--){
                if(dp[i][j]>eps) continue;
                if(p1[i][j]>1-eps) continue;
                dp[i][j]=(p2[i][j]*dp[i][j+1]+p3[i][j]*dp[i+1][j]+1)/(1-p1[i][j]);
            }
        }
        printf("%.3f
",2*dp[1][1]);
    }
    return 0;
}