hdu4405 Aeroplane chess
来源:互联网 发布:淘宝联盟推广教程视频 编辑:程序博客网 时间:2024/05/29 18:38
Aeroplane chess
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 833 Accepted Submission(s): 575
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
Source
2012 ACM/ICPC Asia Regional Jinhua Online
Recommend
zhoujiaqi2010
很水的概率dp,我们知道,求期望的时候,我们用的从后住前推,其实,我们就可以看成是一个图,是从后向前推的,这一题 就是很明显的要用图了,
我们可以很容易得出状态转移方程dp[i]表示已经走到了i到结束,还要用的步数的期望
如果,一个点,没有和别的点相连,那么这个点可以推出向后的6步,dp[i]=sum{1/6.0dp[i+k]}+1,如果,这个点,是在一个航线上,那么这个点,只能推出,到航线上,别一个点
,那么,这个点的期望 ,不就等于,航线上的另一点个的概率值了么!,这样,我们就可以很快得到解!
#include <iostream>#include <stdio.h>#include <string.h>using namespace std;#define MAXN 100050int vec[MAXN];double dp[MAXN];int main(){ int n,m,a,b,i,j; while(scanf("%d%d",&n,&m)!=EOF&&(n+m)) { memset(vec,-1,sizeof(vec)); memset(dp,0,sizeof(dp)); for(i=0;i<m;i++) { scanf("%d%d",&a,&b); vec[a]=b; } dp[n]=0; for(i=n-1;i>=0;i--) { if(vec[i]!=-1) dp[i]=dp[vec[i]]; else { for(j=1;j<=6;j++) { if(i+j<=n) dp[i]+=1.0/6*dp[i+j]; } dp[i]+=1.0; } } printf("%.4f\n",dp[0]); } return 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+期望问题】
- 利用GetPrivateProfileString读取配置文件(.ini)
- Arcgis ios skd 中 设置背景颜色 和方格 的颜色
- 数据结构与算法—斐波那契查找2
- Puppet报错Failed to realize virtual resources
- android基础知识06:intent和intentfilter
- hdu4405 Aeroplane chess
- 视频音频常用编码解码介绍
- 一次大量Library Cache lock的处理
- Parcelable接口的使用
- win8 万能驱动 32位,64位最新版 显卡驱动 网卡驱动 装机必备
- JAVA书籍推荐
- 开机自动启动程序 托盘图标 不显示问题的解决办法
- c++默认参数和函数重载
- LINUX释放内存