hdu3853（概率dp）

LOOPS

Time Limit: 15000/5000 MS (Java/Others)    Memory Limit: 125536/65536 K (Java/Others)
Total Submission(s): 2111    Accepted Submission(s): 844

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

概率dp入門題目，轉移方程式dp[i][j]=dp[i][j]*no[i][j]+dp[i+1][j]*god[i][j]+dp[i][j+1]*gor[i][j]+2;  其中no[i][j]是待在原地的概率，god[i][j]是向下走的概率，gor[i][j]是向右的概率

化簡時候就是 dp[i][j]=(dp[i+1][j]*god[i][j]+dp[i][j+1]*gor[i][j]+2)/(1-no[i][j]);

#include<set>
#include<queue>
#include<cmath>
#include<cstdio>
#include<vector>
#include<string>
#include<utility>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
#define Inf (1<<30)
#define LL long long
#define MOD 1000000009
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int MM=1010;
double dp[MM][MM];
double no[MM][MM],gor[MM][MM],god[MM][MM];
int main()
{
    int r,c;
    ///freopen("D:\\oo.txt","r",stdin);
    while(~scanf("%d%d",&r,&c))
    {
        memset(dp,0,sizeof(dp));
        for(int i=1;i<=r;i++)
        {
            for(int j=1;j<=c;j++)scanf("%lf%lf%lf",&no[i][j],&gor[i][j],&god[i][j]);
        }
        dp[r][c]=0;
        for(int i=r;i>=1;i--)
        {
            for(int j=c;j>=1;j--)
            {
                if(i==r&&j==c)continue;
                if(1-no[i][j]==0)continue;//注意處理這裏，因爲這裏錯了幾次
                dp[i][j]=(dp[i+1][j]*god[i][j]+dp[i][j+1]*gor[i][j]+2)/(1-no[i][j]);
            }
        }
        printf("%.3lf\n",dp[1][1]);
    }
    return 0;
}