HDU4405-Aeroplane chess
来源:互联网 发布:弯矩图绘制软件 编辑:程序博客网 时间:2024/05/21 17:59
Aeroplane chess
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3077 Accepted Submission(s): 1970
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 08 32 44 57 80 0
Sample Output
1.16672.3441
#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <algorithm>#include <cmath>#include <queue>#include <stack>#include <vector>#include <set>#include <map>#include <climits>using namespace std;#define MAXN 100050int f[MAXN];double dp[MAXN];int main(){ int n,m,a,b; while(~scanf("%d%d",&n,&m)&&(n+m)) { memset(f,-1,sizeof(f)); memset(dp,0,sizeof(dp)); for(int i=0; i<m; i++) { scanf("%d%d",&a,&b); f[a]=b; } for(int i=n-1; i>=0; i--) { if(f[i]!=-1) dp[i]=dp[f[i]]; else { for(int j=1; j<=6; j++) dp[i]+=1.0/6*dp[i+j]; dp[i]+=1.0; } } printf("%.4f\n",dp[0]); } return 0;}
0 0
- HDU4405 Aeroplane chess
- hdu4405 Aeroplane chess 期望
- hdu4405 Aeroplane chess
- HDU4405 Aeroplane chess
- HDU4405-Aeroplane chess
- Hdu4405 Aeroplane chess 数论
- 【HDU4405】Aeroplane chess
- hdu4405 Aeroplane chess (概率dp)
- HDU4405--Aeroplane chess--概率DP
- hdu4405——Aeroplane chess
- 【HDU4405】【Aeroplane chess】【概率dp】
- hdu4405 Aeroplane chess 【期望dp】
- 【期望DP】HDU4405 Aeroplane chess
- hdu4405 Aeroplane chess---金华网络赛 期望
- hdu4405--Aeroplane chess+概率期望dp
- hdu4405 Aeroplane chess(期望dp)
- HDU4405 Aeroplane chess (概率DP求期望)
- hdu4405 Aeroplane chess【概率DP+期望问题】
- 42. Trapping Rain Water
- 自定义view下载进度条展示
- Android仿微信语音聊天(一)
- gulp-mockapi
- 循环浏览图片的另一种方法—Gallery组件的使用
- HDU4405-Aeroplane chess
- SpringMVC的RESTful(二)定制格式
- sorted函数以及operator.itemgetter函数
- boost::function
- 价值观
- 加密后的php代码需要ZendGuardLoader模块才能正常运行
- python wave文件的额处理方法
- Android基础知识
- 轮播图