hdu4405 Aeroplane chess
2014-10-20 17:52
260 查看
Aeroplane chess
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1597 Accepted Submission(s): 1088
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
2 0
8 3
2 4
4 5
7 8
0 0
[align=left]Sample Output[/align]
1.1667
2.3441
概率dp水题
#include<iostream> #include<cstdio> #include<cstring> #define M(a,b) memset(a,b,sizeof(a)) using namespace std; int n,m; int mp[100005]; double dp[100005]; int main() { while(scanf("%d%d",&n,&m)==2&&(n||m)) { int a,b; M(mp,0); M(dp,0); for(int i = 0;i<m;i++) { scanf("%d%d",&a,&b); mp[a] = b; } for(int i = n-1;i>=0;i--) { if(mp[i]!=0) dp[i] = dp[mp[i]]; else { for(int j = 1;j<=6;j++) dp[i] += dp[i+j]/6; dp[i] += 1; } } printf("%.4f\n",dp[0]); } return 0; }
相关文章推荐
- hdu4405 Aeroplane chess (概率dp)
- HDU4405-Aeroplane chess
- hdu4405 Aeroplane chess【概率DP+期望问题】
- 【HDU4405】Aeroplane chess [期望DP]
- hdu4405_Aeroplane chess
- hdu4405--Aeroplane chess(概率dp第七弹:飞行棋游戏--2012年网络赛)
- hdu4405 Aeroplane chess
- hdu4405--Aeroplane chess(概率dp第七弹:飞行棋游戏--2012年网络赛)
- [hdu4405]Aeroplane chess(概率dp)
- hdu4405 Aeroplane chess
- hdu4405 Aeroplane chess(期望dp)
- HDU4405 Aeroplane chess
- hdu4405--Aeroplane chess(求期望)
- HDU4405-Aeroplane chess(概率DP求期望)
- 【HDU4405】【Aeroplane chess】【概率dp】
- Hdu4405 Aeroplane chess 数论
- HDU4405-Aeroplane chess(可能性DP需求预期)
- HDU4405 Aeroplane chess
- hdu4405 Aeroplane chess 【期望dp】
- 【期望DP】HDU4405 Aeroplane chess