hdu 3853 LOOPS 概率dp

LOOPS

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

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

 

Source

2011 Invitational Contest Host by BUPT

 

Recommend

chenyongfu   |   We have carefully selected several similar problems for you:  3857 3854 3849 3850 3851 

 

題意：r*c的格子，每一步可以原地不動，向下走 或向右走，每一步的花費是2，求走到r，c點的期望花費。

思路：算是概率dp求期望的簡單題了，直接就能寫出方程：dp[i][j]=(p2*dp[i][j+1]+p3*dp[i+1][j]+2)/(1-p1)，然後就是求了。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
using namespace std;
const int N=1005;
const double eps=1e-5;
int r,c;
double dp[N][N];
double a[N][N][3];
void init(){
    for(int i=0;i<r;i++){
        for(int j=0;j<c;j++){
            scanf("%lf%lf%lf",&a[i][j][0],&a[i][j][1],&a[i][j][2]);
        }
    }
}
void solve(){
    memset(dp,0,sizeof(dp));
    for(int i=r-1;i>=0;i--){
        for(int j=c-1;j>=0;j--){
            if(i==r-1&&j==c-1||a[i][j][0]==1)continue;
            dp[i][j]+=(a[i][j][2]*dp[i+1][j]+a[i][j][1]*dp[i][j+1]+2)/(1-a[i][j][0]);
        }
    }
    printf("%.3f\n",dp[0][0]);
}
int main()
{
    while(scanf("%d%d",&r,&c)!=EOF){
        init();
        solve();
    }
    return 0;
}