hdu 4405 Aeroplane chess (概率DP+求期望)
来源:互联网 发布:程序员眼镜 编辑:程序博客网 时间:2024/04/30 10:18
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1551 Accepted Submission(s): 1063
Total Submission(s): 1551 Accepted Submission(s): 1063
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
题意:有n个格子,掷色子的掷出的数目就是你一次到移动格数。其中有m个飞行通道可以让你直接从第xi格
飞到第yi格。问你走到终点的期望是多少。
思路: dp[i] 表示 当前在第i格走到终点的期望。
当i不是飞行通道的起点时: dp[i] =1.0+ (dp[i+1]+dp[i+2]+dp[i+3]+dp[i+4]+dp[i+5]+dp[i+6])/6.0;
当i是飞行通道的起点时: dp[Xi] = dp[Yi] (因为Xi可直接到Yi,并且不需要掷色子);
#include <iostream>#include <cstring>#include <cstdio>using namespace std;const int N=100050;int n,m,mark,x,y,pre[N];double dp[N];void input(){ memset(pre,-1,sizeof(pre)); for(int i=0; i<m; i++) { scanf("%d %d",&x,&y); pre[x]=y; } memset(dp,0,sizeof(dp));}void solve(){ for(int i=n-1;i>=0;i--) { if(pre[i]!=-1) dp[i]=dp[pre[i]]; else { for(int j=1;j<=6;j++) dp[i]+=dp[i+j]; dp[i]=dp[i]/6.0+1.0; } } printf("%.4lf\n",dp[0]);}int main(){ while(scanf("%d %d",&n,&m)!=EOF) { if(n==0 && m==0) break; input(); solve(); } return 0;}
0 0
- HDU 4405 Aeroplane chess (概率DP求期望)
- HDU 4405 - Aeroplane chess (概率DP 求期望)
- hdu 4405 Aeroplane chess (概率DP+求期望)
- HDU 4405 Aeroplane chess 概率dp 求期望(入门)
- HDU 4405 Aeroplane chess(概率DP求期望)
- HDU 4405 Aeroplane chess 概率dp求期望
- hdu 4405 Aeroplane chess【概率DP求期望】
- Aeroplane chess 4405 hdu 概率DP求期望入门题
- HDU 4405 Aeroplane chess(概率DP求期望)
- HDU 4403(Aeroplane chess ,求期望,概率DP)
- [hdu 4405] Aeroplane chess [概率DP & 期望]
- HDOJ 题目4405 Aeroplane chess(概率dp求期望)
- HDU 4405 Aeroplane chess(全期望公式-概率dp)
- HDU 4405 Aeroplane chess (概率DP & 期望)
- HDU 4405 Aeroplane chess (概率-期望DP)【模板】
- Hdu 4405 Aeroplane chess DP求期望
- hdu 4405 Aeroplane chess(概率DP 求期望__附求期望讲解方法)
- HDU4405 Aeroplane chess (概率DP求期望)
- 面试时,你会问面试官哪些问题?
- 【重读设计模式】桥接模式
- BZOJ 2190 [SDOI2008]仪仗队
- MD5Helper的方法
- uva 417 map暴力
- hdu 4405 Aeroplane chess (概率DP+求期望)
- 黑马程序员-OC多态
- 设计函数返回一个数组中所有元素被第一个元素除的结果
- 上海xx 双向链表 面试题 list node
- 第三章 3.5.4节练习
- C++ 学习笔记_0013_函数(猜数字、小学生算术运算)
- Centos提示-bash: make: command not found的解决办法
- LeetCode:Reverse Words in a String
- 用Mailslot写的客户端和服务器,客户端能向服务器多次发送消息,而服务器可以显示客户端发来的消息