hdu 4405 概率dp
来源:互联网 发布:数据归一化啥意思 编辑:程序博客网 时间:2024/06/14 13:44
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.
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.
2 08 32 44 57 80 0
1.16672.3441
题意:玩飞行棋,从0走到n,每次掷骰子,掷到几走几步,还有一些直接到达的点
如果题中给出(a,b)数对,那么当你走到a时可以直接跳到b,问知多少次骰子可以到达n或者超过n的期望
思路:
直接倒着dp就可以了,如果i节点可以直接跳到某个节点j那么dp[i]=dp[j],否则就是枚举骰子面k
dp[i]+=dp[i+(1~6)]+1;
ac代码:
#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <math.h>#include <vector>using namespace std;const int maxn=1e5+5;int vis[maxn];double dp[maxn];int main(){ int n,m; while(cin>>n>>m&&(n+m)) { int x,y; memset(vis,0,sizeof(vis)); for(int i=1;i<=m;i++) { scanf("%d%d",&x,&y); vis[x]=y; } memset(dp,0,sizeof(dp)); for(int i=n-1;i>=0;i--) { if(vis[i]==0) { for(int j=1;j<=6;j++) dp[i]+=dp[j+i]/6; dp[i]++; } else dp[i]=dp[vis[i]]; } printf("%.4lf\n",dp[0]); } return 0;}
阅读全文
0 0
- hdu 4405 概率DP
- hdu 4405 概率dp
- 概率dp HDU 4405
- hdu 4405 概率dp
- HDU 4405(概率DP)
- HDU 4405 概率dp
- hdu 4405 概率dp
- hdu 4405 简单概率dp
- HDU 4405 概率期望DP
- HDU 4405(概率dp)
- hdu 4405 Aeroplane chess 概率dp
- hdu 4405 概率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)
- JS的Math方法使用
- 2012 ACM/ICPC 长春赛区网络赛 1006(dfs)
- POJ 3311 Hie with Pie 状压dp,tsp
- 怎么应用vertical-align,才能生效?
- Nginx服务器的进程
- hdu 4405 概率dp
- VirtualBox之Cannot register the hard disk
- 数据库设计
- script无素
- JavaScript(js)
- MyBatis逆向工程
- myeclipse快捷键
- MySQL数据库的安装和配置
- LeetCode-30-Substring with Concatenation of All Words 暴力+Map灵活数据结构