hdu3853(概率dp)

这个题和上个题还蛮像。。Homura好评！！

设d[i][j]为从i,j位置走到n,m位置的步数期望，输入为a[i][j][k]  k=1-3  可以得

d[i][j]=a[i][j][1]*d[i][j]+a[i][j][2]*d[i+1][j]+a[i][j][3]*d[i][j+1]+1

可得d[i][j]=(a[i][j][2]*d[i+1][j]+a[i][j][3]*d[i][j+1])/(1-a[i][j][3])

然后求出d[1][1]记得乘2。。

有个比较坑爹的就是有些地方是1.00 0.00 0.00，这样根本就走不出去。。然后这样期望一下子就变成inf了。。然而所谓正解是直接把他当0？这是在给他另一个出口？不是很懂他怎么搞的。。

然后因为一个下标搞错导致怀疑自己的概率是不是又算错了qaq概率题练得不够是这么虚啦，得多练。。

/**
 *　　　　　　　　┏┓　　 　┏┓
 * 　　　　　　　┏┛┗━━━━━━━┛┗━━━┓
 * 　　　　　　　┃　　　　　　　┃ 　
 * 　　　　　　　┃　　　━　　 　┃
 * 　　　　　　　┃　＞　　　＜　┃
 * 　　　　　　　┃　　　　　　　┃
 * 　　　　　　　┃...　⌒　... 　┃
 * 　　　　　　　┃　　　　　　　┃
 * 　　　　　　　┗━┓　　　┏━┛
 * 　　　　　　　　　┃　　　┃　Code is far away from bug with the animal protecting　　　　　　　　　　
 * 　　　　　　　　　┃　　　┃   神兽保佑,代码无bug
 * 　　　　　　　　　┃　　　┃　　　　　　　　　　　
 * 　　　　　　　　　┃　　　┃  　　　　　　
 * 　　　　　　　　　┃　　　┃
 * 　　　　　　　　　┃　　　┃　　　　　　　　　　　
 * 　　　　　　　　　┃　　　┗━━━┓
 * 　　　　　　　　　┃　　　　　　　┣┓
 * 　　　　　　　　　┃　　　　　　　┏┛
 * 　　　　　　　　　┗┓┓┏━┳┓┏┛
 * 　　　　　　　　　　┃┫┫　┃┫┫
 * 　　　　　　　　　　┗┻┛　┗┻┛
 */ 
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<cmath>
#include<map>
#include<stack>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-12
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define mid (x+y>>1)
#define NM 1005
#define nm 7000000
#define pi 3.1415926535897931
using namespace std;
const ll inf=1000000;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    return f*x;
}
 


int n,m;
double a[NM][NM][3],d[NM][NM];

int main(){
	//freopen("data.in","r",stdin);
	while(~scanf("%d%d",&n,&m)){
		mem(d);
		inc(i,1,n)inc(j,1,m)inc(k,1,3)scanf("%lf",&a[i][j][k]);
		dec(i,n,1)dec(j,m,1)if(i<n||j<m){
			if(d[i+1][j]>inf)d[i+1][j]=0;
			if(d[i][j+1]>inf)d[i][j+1]=0;
			d[i][j]=(d[i+1][j]*a[i][j][3]+d[i][j+1]*a[i][j][2]+1)/(1-a[i][j][1]);
		}
		printf("%.3lf\n",2*d[1][1]);
	}
	return 0;
}

LOOPS

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

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

 

Statistic |  Submit |  Discuss | Note