[ACM] hdu 4405 Aeroplane chess (概率DP)
HDU DP 概率 ACM
2023-09-27 14:27:01 时间
Aeroplane chess
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
Source
题意为一条直线上有N+1个格子,编号0-N,也是其位置,有一枚骰子。比方当前位置你在i,骰子执到了 y点(1<=y<=6),那么下一步你就到了i+y位置,格子里有几个特殊的格子。能够从x位置瞬间转移到y位置,不须要步数,假设转移以后的格子还是特殊的格子,那么继续转移,要求的是,最后到达的位置>=n,所须要的投骰子次数的期望。
我们用 dp[i]表示当前位置到达位置>=n所须要投掷骰子的平均次数。
那么非常明显有 dp[n]=0; 而我们要求的则是dp[0] (起点)
注意两点:
①不遇到特殊格子时,投掷一次筛子,由当前位置i到达位置 ,i+1 , i+2 , i+3 , i+4 , i+5 ,i+6 的概率是一样的。都是 1/6,那么 dp[i]=(dp[i+1] +dp[i+2]+....dp[i+6])/6 +1 (须要多投掷一次筛子。所以+1).
②遇到特殊格子时。当前位置的投掷骰子的平均次数等于转移到的位置的平均次数. 比方由x到y。 那么 dp[x]=dp[y]。
依据以上两点。就能够写出代码.
dp[n]是已知的。须要从后往前推。
代码:
#include <iostream> #include <iomanip> #include <string.h> using namespace std; const int maxn=100005; double dp[maxn]; int hash[maxn]; int n,m; int main() { while(cin>>n>>m&&(n||m)) { int x,y; memset(hash,0,sizeof(hash)); for(int i=1;i<=m;i++) { cin>>x>>y; hash[x]=y;//标记一下,x位置的格子是特殊格子 } dp[n]=0; for(int i=n-1;i>=0;i--) { if(hash[i])//特殊格子 dp[i]=dp[hash[i]]; else { double temp=0; for(int j=1;j<=6&&i+j<=n;j++) temp+=dp[i+j]/6; dp[i]=temp+1; } } cout<<setiosflags(ios::fixed)<<setprecision(4)<<dp[0]<<endl; } return 0; }
相关文章
- 致初学者(四):HDU 2044~2050 递推专项习题解
- 从“HDU 2005 第几天?”谈起
- hdu 1814 字典序最小的2sat(暴力深搜)
- HDU 2830 Matrix Swapping II (预处理的线性dp)
- hdu 3006 The Number of set(思维+壮压DP)
- HDU-2577 How to Type DP
- HDU 2415 Bribing FIPA
- 2015 Multi-University Training Contest 3 hdu 5323 Solve this interesting problem
- HDU 2433 Travel
- HDU 2147 kiki's game (奇偶博弈)
- HDU 2829 Lawrence (斜率优化DP或四边形不等式优化DP)
- HDU 1207 汉诺塔II (简单DP)
- HDU 1520 Anniversary party (树形DP)
- HDU 4714 Tree2cycle (树形DP)
- HDU 4489 The King’s Ups and Downs (DP+数学计数)
- HDU 4599 Dice (概率DP+数学+快速幂)
- HDU 1087 Super Jumping! Jumping! Jumping! (DP+LIS)
- Eight HDU-1043 (bfs)
- 【hdu 6161】Big binary tree(二叉树、dp)
- HDU 4287 Intelligent IME(map运用)
- hdu 4734 数位dp
- hdu 1158 Employment Planning (dp)
- HDU 2217 Data Structure?
- 【HDU-4614】Vases and Flowers(线段树双查询)
- HDU-4249-A Famous Equation(DP)
- hdu 1087 Super Jumping! Jumping! Jumping!(dp 最长上升子序列和)
- hdu 1028 Sample Ignatius and the Princess III (母函数)
- hdu 1530 Maximum Clique (最大包)