HDU 4050wolf5x
来源:互联网 发布:中至数据集团主要业务 编辑:程序博客网 时间:2024/06/16 10:13
Problem Description
There are n grids in a row. The coordinates of grids are numbered from x=1 to x=n. Someone starts from x=0. You can step forward with your left leg or right leg alternatively in turn.Namely,if you step forward with your left leg, then you must step with your right leg next. As you can not jump , only one leg is allowed to use each step. Every step you take is in the range of [A,B], inclusively; namely, every step you take is at most B units and at least A units.
Before you start to move, the grids will be initialized randomly with 4 states(0,1,2,3), and p[i][j] means the probability of ith grid initialized with state j. After initialization, the state of the grids will not change.
State 0 means you can't step into the correspoding grid.
State 1 means you can just step into the grid with your left leg.
State 2 means you can just step into the grid with your right leg.
State 3 means you can step into the grid with either of your legs,and the next step,you can use any legs; namely you don't need to follow the rules above.
If x>n, then the grid can be stepped in with arbitrary method.means you can step at the place after the nth grid.
For every step,you will choose the “step method” with the minimum step length. Namely, if you can take the step of S units and S+1 units, you will choose the step of S units.
Until you can't step in any grids in front of you,or you have been in a grid x>n, you will stop.
Can you calculate the expectation of the steps when you stop?
Before you start to move, the grids will be initialized randomly with 4 states(0,1,2,3), and p[i][j] means the probability of ith grid initialized with state j. After initialization, the state of the grids will not change.
State 0 means you can't step into the correspoding grid.
State 1 means you can just step into the grid with your left leg.
State 2 means you can just step into the grid with your right leg.
State 3 means you can step into the grid with either of your legs,and the next step,you can use any legs; namely you don't need to follow the rules above.
If x>n, then the grid can be stepped in with arbitrary method.means you can step at the place after the nth grid.
For every step,you will choose the “step method” with the minimum step length. Namely, if you can take the step of S units and S+1 units, you will choose the step of S units.
Until you can't step in any grids in front of you,or you have been in a grid x>n, you will stop.
Can you calculate the expectation of the steps when you stop?
Input
An integer T means the number of cases.T<=30
For each case,the first line is three integers n,A,B.
The next n lines,each line has 4 number p[i][0], p[i][1], p[i][2], p[i][3].
1 <= A <= B <= n<= 2000.
0 <= p[i][j] <= 1, p[i][0]+p[i][1]+p[i][2]+p[i][3] = 1.
For each case,the first line is three integers n,A,B.
The next n lines,each line has 4 number p[i][0], p[i][1], p[i][2], p[i][3].
1 <= A <= B <= n<= 2000.
0 <= p[i][j] <= 1, p[i][0]+p[i][1]+p[i][2]+p[i][3] = 1.
Output
The expectation of the steps when you stop
you can assume that the relative epsilon is no more than 1e-6
you can assume that the relative epsilon is no more than 1e-6
Sample Input
92 1 10 0.5 0.5 00 0 1 02 1 10 0.5 0.5 00.5 0.5 0 02 1 20 0.5 0.5 00 0 1 02 1 20.2 0.3 0.4 0.10.15 0.2 0.25 0.43 1 100 0 0 10 0 0 10 0 0 13 1 10 0 0 10 0 0 10 0 0 13 2 20 0 0 10 0 0 10 0 0 13 3 30 0 0 10 0 0 10 0 0 13 1 20.0 0.3 0.6 0.10.1 0.2 0.3 0.40.5 0.4 0.1 0.0
Sample Output
2.000000001.500000002.500000002.460000004.000000004.000000002.000000002.000000002.80200000
#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>using namespace std;const int maxn=5510;int T,n,l,r;double p[maxn][4],f[maxn][4];int main(){ cin>>T; while (T--) { cin>>n>>l>>r; memset(p,0,sizeof(p)); memset(f,0,sizeof(f)); for (int i=1;i<=n;i++) for (int j=0;j<4;j++) scanf("%lf",&p[i][j]); for (int i=n+1;i<=n+r;i++) p[i][3]=1; f[0][3]=1; for (int i=0;i<=n;i++) { double P1,P2,P3; P1=P2=P3=1; for (int k=l;k<=r;k++) { f[i+k][2]+=P1*f[i][1]*p[i+k][2]; f[i+k][3]+=P1*f[i][1]*p[i+k][3]; P1*=p[i+k][1]+p[i+k][0]; f[i+k][1]+=P2*f[i][2]*p[i+k][1]; f[i+k][3]+=P2*f[i][2]*p[i+k][3]; P2*=p[i+k][2]+p[i+k][0]; f[i+k][1]+=P3*f[i][3]*p[i+k][1]; f[i+k][2]+=P3*f[i][3]*p[i+k][2]; f[i+k][3]+=P3*f[i][3]*p[i+k][3]; P3*=p[i+k][0]; } } double ans=0; for (int i=1;i<=n+r;i++) for (int j=1;j<=4;j++) ans+=f[i][j]; printf("%.8lf\n",ans); } return 0;}
0 0
- HDU 4050 wolf5x
- HDU 4050wolf5x
- hdu 4050 wolf5x 概率DP
- HDU 4050 wolf5x 概率DP
- HDU 4050 wolf5x(11年北京 期望问题)
- HDU 4050 wolf5x (概率DP 求期望)
- HDU 4050 wolf5x(动态规划-概率DP)
- hdu4050----wolf5x
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- [BZOJ1269][AHOI2006]文本编辑器editor
- UICollection view or Tableview 使用
- cqoi2007 sum有关于x mod y求和的故事
- 阿里offer学习
- UIView
- HDU 4050wolf5x
- 二维数组的选择排序
- python标准库:collections和heapq模块
- Spark经典视频之Scala中Abstract Types实战详解
- CMake学习笔记
- centos搭建vpn
- IOS开发-13.Autolayout概述
- [转]Cookie/Session机制详解
- 2015071802 - 欢乐谷年卡