HDU 4405 Aeroplane chess (概率DP)——2012 ACM/ICPC Asia Regional Jinhua Online
来源:互联网 发布:诉苦大会 知乎 编辑:程序博客网 时间:2024/05/16 18:59
传送门
Aeroplane chess
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3520 Accepted Submission(s): 2232
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
题目大意:
有一个人在玩飞行棋,现在你开始的时候站在
解题思路:
其实这个题目很容易得到转移方程,现在设
#include <iostream>#include <cstdio>#include <cstring>#include <cstdlib>#include <algorithm>#include <cmath>using namespace std;const int MAXN = 1e5+5;int vis[MAXN];double dp[MAXN];int main(){ ///freopen("in.txt","r",stdin); int n, m, x, y; while(~scanf("%d%d",&n,&m)){ if(n==0 && m==0) break; memset(vis, 0, sizeof(vis)); for(int i=1; i<=m; i++){ scanf("%d%d",&x,&y); vis[x] = y; } dp[n] = 0; for(int i=n-1; i>=0; i--){ if(!vis[i]){ double sum = 0; for(int j=1; j<=6; j++) if(i+j < n) sum += dp[i+j]; dp[i] = sum/6+1; } else dp[i] = dp[vis[i]]; } printf("%.4f\n",dp[0]); } return 0;}
1 0
- HDU 4405 Aeroplane chess (概率DP)——2012 ACM/ICPC Asia Regional Jinhua Online
- 2012 ACM/ICPC Asia Regional Jinhua Online
- hdu 5045 - Contest(2014 ACM/ICPC Asia Regional Shanghai Online )概率dp
- [ACM] hdu 4405 Aeroplane chess (概率DP)
- hdu 5001 Walk 概率dp 2014 ACM/ICPC Asia Regional Anshan Online
- The 37th ACM/ICPC Asia Regional JinHua Site Online Contest - D(爆搜)
- hdu 4722 Good Numbers 数位dp(2013 ACM/ICPC Asia Regional Online —— Warmup2 1007)
- HDU 5492 Find a path DP —— 2015 ACM-ICPC Asia Regional Hefei Online
- HDU 5492 Find a path(DP)——2015 ACM/ICPC Asia Regional Hefei Online
- HDU 5492 Find a path DP —— 2015 ACM-ICPC Asia Regional Hefei Online
- 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)
- HDU 4405 Aeroplane chess (概率DP)
- Linux命令三——iptables
- mysql定时器执行存储过程
- 雅虎34条军规
- Building Web Apps with Go
- 【Arduino】【ESP】使用Arduino(ESP8266版本)获取雅虎天气信息,并使用点阵显示......进行中
- HDU 4405 Aeroplane chess (概率DP)——2012 ACM/ICPC Asia Regional Jinhua Online
- 项目感悟:TV端项目的0—1
- JavaScript 运算符
- 课堂笔记
- ubuntu时区设置
- 数据库知识复习
- Android程序崩溃统一处理机制
- Maven软件管理学习
- nmon集群资源使用情况 监控工具