hdu 4405 Aeroplane chess（概率+dp）

Problem Description

Hzz loves aeroplane chess very much. The chess map contains N+ grids labeled from  to N. Hzz starts at grid . 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 ,,,,,). 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 (<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(≤N≤) and M(≤M≤).
Then M lines follow, each line contains two integers Xi,Yi(≤Xi<Yi≤N).
The input end with N=, M=. 

Output

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

 

Sample Input

 

Sample Output

1.1667
2.3441

 

Source

2012 ACM/ICPC Asia Regional Jinhua Online

 

这道题适合从后面开始dp。将能跳的格子标志了，然后从n-1开始dp。具体看代码吧，不知道怎么说了。。。

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 using namespace std;
 #define N 100006
 int n,m;
 double dp[N];
 int vis[N];
 int main()
 {
     while(scanf("%d%d",&n,&m)== && n+m){
         memset(vis,-,sizeof(vis));
         memset(dp,,sizeof(dp));
         for(int i=;i<m;i++){
             int x,y;
             scanf("%d%d",&x,&y);
             vis[x]=y;
         }
         for(int i=n-;i>=;i--){
             if(vis[i]!=-){
                 dp[i]=dp[vis[i]];
             }else{
                 for(int j=;j<=;j++){
                     dp[i]+=dp[i+j]/;
                 }
                 dp[i]+=1.0;
             }
         }
         printf("%.4lf\n",dp[]);
     }
     return ;
 }