HDU - 4405 Aeroplane chess（概率dp）

Aeroplane chess

 

Hzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws a dice(a dice have six faces with equal probability to face up and the numbers on the faces are 1,2,3,4,5,6). When Hzz is at grid i and the dice number is x, he will moves to grid i+x. Hzz finishes the game when i+x is equal to or greater than N. 

There are also M flight lines on the chess map. The i-th flight line can help Hzz fly from grid Xi to Yi (0<Xi<Yi<=N) without throwing the dice. If there is another flight line from Yi, Hzz can take the flight line continuously. It is granted that there is no two or more flight lines start from the same grid. 

Please help Hzz calculate the expected dice throwing times to finish the game. 

2 0
8 3
2 4
4 5
7 8
0 0

1.1667
2.3441




飞行棋求步数期望。
逆推求期望典型。dp[i]下标状态为所在位置，值为步数。

n=3,m=0

 

e[3]=0

e[2]=1/6e[3]+1

e[1]=1/6e[2]+1/6e[3]+1

e[0]=1/6e[1]+1/6e[2]+1/6e[3]+1

 

#include<bits/stdc++.h>
#define MAX 100010
using namespace std;
typedef long long ll;

int f[MAX];
double dp[MAX];

int main()
{
    int t,n,m,i,j;
    int x,y;
    while(scanf("%d%d",&n,&m)&&n+m){
        memset(f,-1,sizeof(f));
        memset(dp,0,sizeof(dp));
        for(i=1;i<=m;i++){
            scanf("%d%d",&x,&y);
            f[x]=y;
        }
        dp[n]=0;
        for(i=n-1;i>=0;i--){
            if(f[i]>-1){
                dp[i]+=dp[f[i]];
            }
            else{
                for(j=1;j<=6;j++){
                    if(i+j>n) break;
                    dp[i]+=1.0/6*dp[i+j];
                }
                dp[i]++;
            }
        }
        printf("%.4f\n",dp[0]);
    }
    return 0;
}