hdojJ3853

翻译 2012年03月27日 22:54:24
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

Source

 2011 Invitational Contest Host by BUPT 

#include<stdio.h>
#include<memory.h>
#define M 1003

const double eps=1e-5;

int R,C;

double map[M][M][3];//存放该点到达相邻各可能点的概率
double dp[M][M];//存放该点到达终点消耗魔法的期望

void s()//DP函数
{
    dp[R][C]=0;
    //从终点开始逆序DP到出发点
    for(int i=R;i>0;i--){
        for(int j=C;j>0;j--){
            if(1-map[i][j][0]<eps)
                dp[i][j]=0;          
            else dp[i][j]=(2.0*map[i][j][0]+(2.0+dp[i][j+1])*map[i][j][1]+(2.0+dp[i+1][j])*map[i][j][2])/(1.0-map[i][j][0]);
            //由dp[i][j] = (2 + dp[i][j]) * map[i][j][[0] + (2 + dp[i][j+1]) * map[i][j][1] + (2 + dp[i+1][j]) * map[i][j][2]该式推得
        }
    }
}

int main(void)
{
    while(scanf("%d%d",&R,&C)!=EOF){//读取地图
        for(int i=1;i<=R;i++){
            for(int j=1;j<=C;j++){
                for(int k=0;k<3;k++){
                    scanf("%lf",&map[i][j][k]);
                }
            }
        }
        memset(dp,0,sizeof(dp));//初始化数组
        s();//进行DP
        printf("%.3lf\n",dp[1][1]);
    }
    return 0;
}
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdojJ3853
举报原因:
原因补充:

(最多只允许输入30个字)