• HDOJ 3853 LOOPS


    水概率DP。。。。

    LOOPS

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


    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
     
    Recommend
    chenyongfu   |   We have carefully selected several similar problems for you:  3857 3854 3849 3850 3851 
     
     
     
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 #include <cmath>
     5 
     6 using namespace std;
     7 
     8 double dp[1100][1100];
     9 struct ppp
    10 {
    11     double stay,right,down;
    12 }p[1100][1100];
    13 
    14 const double eps=1e-8;
    15 
    16 int r,c;
    17 
    18 int main()
    19 {
    20     while(scanf("%d%d",&r,&c)!=EOF)
    21     {
    22         memset(dp,0,sizeof(dp));
    23         for(int i=1;i<=r;i++)   for(int j=1;j<=c;j++)
    24             scanf("%lf%lf%lf",&p[i][j].stay,&p[i][j].right,&p[i][j].down);
    25         for(int i=r;i>=1;i--)
    26         {
    27             for(int j=c;j>=1;j--)
    28             {
    29                 if(i==r&&j==c) continue;
    30                 if(fabs(p[i][j].stay-1.)<=eps) continue;
    31                 dp[i][j]=1./(1-p[i][j].stay)*(dp[i+1][j]*p[i][j].down+dp[i][j+1]*p[i][j].right+2.);
    32             }
    33         }
    34         printf("%.3lf
    ",dp[1][1]);
    35     }
    36     return 0;
    37 }
  • 相关阅读:
    Eclipse快速上手指南之使用CVS
    数据备份的13种最佳做法
    用asp.net来回收IIS6.0应用程序池
    构建插件式的应用程序框架(五)-管理插件
    安全组织评出25个最危险软件编程错误
    在ASP.NET里轻松实现缩略图
    构建插件式的应用程序框架(六)-通讯机制
    快照复制,SQL Server保障数据一致性的法宝
    DataGridView新特色、常用操作
    如何在GridView中一次性批量更新多行数据
  • 原文地址:https://www.cnblogs.com/CKboss/p/3404535.html
Copyright © 2020-2023  润新知