Aeroplane chess
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1167 Accepted Submission(s): 793
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.
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.
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
题意:让你从0开始走,每次扔骰子,走1-6步,问你到终点(>=n)的期望是多少。
思路:从后往前递推,即e[n]=(e[n+1]+e[n+2]+e[n+3]+e[n+4]+e[n+5]+e[n+6])/6+1。
对于可以从a跳到b的点,就让e[a]=e[b]就可以了。
AC代码如下:
#include<cstdio>
#include<cstring>
using namespace std;
double e[100010];
int vis[100010];
int main()
{ int i,j,k,a,b,n,m;
while(~scanf("%d%d",&n,&m)&& n+m>0)
{ memset(vis,-1,sizeof(vis));
for(i=1;i<=m;i++)
{ scanf("%d%d",&a,&b);
vis[a]=b;
}
memset(e,0,sizeof(e));
for(i=n-1;i>=0;i--)
if(vis[i]!=-1)
e[i]=e[vis[i]];
else
{ for(j=1;j<=6;j++)
e[i]+=e[i+j]/6;
e[i]+=1;
}
printf("%.4f\n",e[0]);
}
}