[HDU] 3853 LOOPS 期望dp入门

最新推荐文章于 2020-03-24 11:43:17 发布

MaxMercer

最新推荐文章于 2020-03-24 11:43:17 发布

阅读量379

点赞数

CC 4.0 BY-SA版权

分类专栏： -----------概率与期望----------- -----------DP----------- HDU 文章标签：期望 dp

本文链接：https://blog.csdn.net/MaxMercer/article/details/77943270

-----------DP----------- 同时被 3 个专栏收录

42 篇文章

订阅专栏

-----------概率与期望-----------

19 篇文章

订阅专栏

HDU

12 篇文章

订阅专栏

本文描述了一个关于魔法少女Homura被困在一个称为LOOPS的迷宫中，并需要计算她逃离此迷宫所需的期望魔法能量的问题。迷宫是一个R*C的网格，每个网格中都有一个传送门，会将Homura传送到下方、右侧或者停留在当前位置。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

就是说有一个R*C的矩阵，求从1，1 走到R ，C 的期望消耗能量数，移动一格算2个能量，对于每个点，会有不动，向右走，向下走的几率，注意原地不动也要消耗能量. 仍然是普通期望dp，直接从dp[R][C]倒推过来即可. 注意有原地不动的概率为1.00的情况，要特判，因为那个点永远无法走到.

dp方程由期望的线性性可得到：
dp[i][j]=p1[i][j]*dp[i][j]+p2[i][j]*dp[i][j+1]+p3[i][j]*dp[i+1][j]+2;
化简得到：
dp[i][j]=p2[i][j]*dp[i][j+1]/(1-p1[i][j])+p3[i][j]*dp[i+1][j]/(1-p1[i][j])+2/(1-p1[i][j]);
dp[i][j]表示在(i, j)到终点还需的期望步数.

#include<stdio.h>
#include<cmath>
const double eps = 1e-7;
const int maxn = 1010;
int R, C;
double dp[maxn][maxn], p1[maxn][maxn], p2[maxn][maxn], p3[maxn][maxn];
int main(){
    while(scanf("%d%d", &R, &C) != EOF){
        for(int i = 1; i <= R; ++i)
            for(int j = 1; j <= C; ++j) 
                scanf("%lf%lf%lf", &p1[i][j], &p2[i][j], &p3[i][j]);
        dp[R][C] = 0;
        for(int i = R; i; --i)
            for(int j = C; j; --j)
                if(i ^ R || j ^ C){
                    if(fabs(1 - p1[i][j]) < eps) continue;
                    dp[i][j] = (dp[i][j+1] * p2[i][j] + dp[i+1][j] * p3[i][j] + 2) / (1 - p1[i][j]);
                }
        printf("%.3lf\n", dp[1][1]);
    }
}