hdoj4405Aeroplane chess【概率dp求期望】

Aeroplane chess

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2532    Accepted Submission(s): 1632

Problem Description

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.

 

Input

There are multiple test cases.  
Each test case contains several lines.
The first line contains two integers N(1≤N≤100000) and M(0≤M≤1000).
Then M lines follow, each line contains two integers Xi,Yi(1≤Xi<Yi≤N).  
The input end with N=0, M=0.  

 

Output

For each test case in the input, you should output a line indicating the expected dice throwing times. Output should be rounded to 4 digits after decimal point.

 

Sample Input

  
  

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

 

Sample Output

  
  

   
   1.1667
2.3441
  
  

 

题意：玩飞行棋转动骰子转到几点往前走几点，走到的某一点可能有跳到另一点的要求当走到的位置大于等于N则获胜求获胜的转动骰子的期望

#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
int p[100010];
double dp[100010];
int main()
{
	int i,j,n,m;
	while(scanf("%d%d",&n,&m),n||m){
		memset(p,0,sizeof(p));
		memset(dp,0,sizeof(dp));
		for(i=0;i<m;++i){
			int a,b;
			scanf("%d%d",&a,&b);
			p[a]=b;
		}
		for(i=n-1;i>=0;--i){
			if(p[i])dp[i]=dp[p[i]];
			else{
				for(j=1;j<=6;++j){
					if(i+j<=n){
						dp[i]+=dp[i+j]*1.0/6.0;
					}
					else break;
				}
				dp[i]+=1.0;
			}
		}
		printf("%.4lf\n",dp[0]);
	}
	return 0;
}