zoukankan      html  css  js  c++  java
  • hdu 3853 LOOPS(概率dp)

    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
    #include<cstdio>
    #include<cstring>
    #include<map>
    #include<algorithm>
    using namespace std;
    double p[1005][1005][3];
    double dp[1005][1005];
    int main()
    {
        int r,c;
        while(scanf("%d%d",&r,&c)!=EOF)
        {
            memset(dp,0,sizeof(dp));
            memset(p,0,sizeof(p));
            for(int i=1;i<=r;i++)
                for(int j=1;j<=c;j++)
                    for(int k=0;k<3;k++)
                        scanf("%lf",&p[i][j][k]);
            dp[r][c]=0;
            for(int i=r;i>=1;i--)
                for(int j=c;j>=1;j--)
                {
                    if(p[i][j][0]==1.0)continue;
                    if(i==r&&j==c)continue;
                    dp[i][j]=(dp[i][j+1]*p[i][j][1]+dp[i+1][j]*p[i][j][2]+2)/(1-p[i][j][0]);
                }
            printf("%.3f
    ",dp[1][1]);
        }
        return 0;
    }
  • 相关阅读:
    探寻京东云核心竞争力的源泉
    在线公开课 | 教你如何自行搭建一个威胁感知大脑?
    推迟学习系统调用
    linux中未实现的系统调用
    man(2) V
    man(2) W
    图像叠加
    man(2) readv writev
    qt 视频播放
    ffmpeg参数
  • 原文地址:https://www.cnblogs.com/homura/p/5349235.html
Copyright © 2011-2022 走看看