hdu4870 Rating---2014 Multi-University Training Contest 1
来源:互联网 发布:石破天 武功 知乎 编辑:程序博客网 时间:2024/06/02 19:42
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4870
Rating
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 171 Accepted Submission(s): 91
Special Judge
Problem Description
A little girl loves programming competition very much. Recently, she has found a new kind of programming competition named "TopTopTopCoder". Every user who has registered in "TopTopTopCoder" system will have a rating, and the initial value of rating equals to zero. After the user participates in the contest held by "TopTopTopCoder", her/his rating will be updated depending on her/his rank. Supposing that her/his current rating is X, if her/his rank is between on 1-200 after contest, her/his rating will be min(X+50,1000). Her/His rating will be max(X-100,0) otherwise. To reach 1000 points as soon as possible, this little girl registered two accounts. She uses the account with less rating in each contest. The possibility of her rank between on 1 - 200 is P for every contest. Can you tell her how many contests she needs to participate in to make one of her account ratings reach 1000 points?
Input
There are several test cases. Each test case is a single line containing a float number P (0.3 <= P <= 1.0). The meaning of P is described above.
Output
You should output a float number for each test case, indicating the expected count of contest she needs to participate in. This problem is special judged. The relative error less than 1e-5 will be accepted.
Sample Input
1.0000000.814700
Sample Output
39.00000082.181160
Author
FZU
Source
2014 Multi-University Training Contest 1
Recommend
We have carefully selected several similar problems for you: 4871 4869 4868 4867 4866
最后还是看了神牛们神一样的DP思路,才终于理解。。。哎。。惭愧。。。
设dp[i]为从i到i+1所需要的步数则有
dp[i]=p*1+(1-p)*(1+dp[i-2]+dp[i-1]+dp[i]) 化简一下得 dp[i]=1+(1-p)/p*(1+dp[i-2]+dp[i-1])
又由已知条件可得 dp[0]=p*1+(1-p)*(1+dp[0]) 即 dp[0]=1/p
dp[1]=p*1+(1-p)*(1+dp[0]]+dp[1]) 即 dp[1]=1/p+(1-p)/p*(1+dp[0])
设ans[i][j]表示从初状态到两个号的分数为i,j的期望。两个号的分数的变化总是[i,i]->[i+1,i]->[i+1,i+1];每次只有一个号的分数在进行变动。
所以有 ans[i+1][i] = ans[i][i]+dp[i], ans[i+1][i+1] = ans[i+1][i]+dp[i];
总的dp方程就是 : dp[i]=p*1+(1-p)*(1+dp[i-2]+dp[i-1]+dp[i]) ans[i+1][i] = ans[i][i]+dp[i], ans[i+1][i+1] = ans[i+1][i]+dp[i];
#include<iostream>#include<cstring>#include<cmath>#include<cstdio>#include<algorithm>using namespace std;double ans[20][20],dp[20];int main(){ double p; while(cin>>p){ dp[0]=1/p;dp[1]=1+(1-p)/p*(dp[0]+1); for(int i=2;i<=19;i++) dp[i]=1+(1-p)/p*(dp[i-2]+dp[i-1]+1); ans[0][0]=0;ans[1][0]=dp[0];ans[1][1]=ans[1][0]+dp[0]; for(int i=1;i<=19;i++){ ans[i+1][i]=ans[i][i]+dp[i]; ans[i+1][i+1]=ans[i+1][i]+dp[i]; } printf("%.6lf\n",ans[20][19]); } return 0;}
0 0
- hdu4870 Rating---2014 Multi-University Training Contest 1
- hdu4870 Rating 2014 Multi-University Training Contest 1
- 2014 Multi-University Training Contest 1 - J Rating
- hdu 4870 Rating 2014 Multi-University Training Contest 1
- HDU 4870 Rating 2014 Multi-University Training Contest 1 J题 概率DP+高斯消元
- 2014 Multi-University Training Contest 1小记
- 2014 Multi-University Training Contest 1
- 2014 Multi-University Training Contest 1
- 2014 Multi-University Training Contest 1
- 2014 Multi-University Training Contest 1
- 2014 Multi-University Training Contest 1 题解
- 2014 Multi-University Training Contest 1
- 2014 Multi-University Training Contest 1--by FZU 解题报告
- 2014 Multi-University Training Contest 1/HDU4861_Couple doubi(数论/规律)
- hdu4864 Task 2014 Multi-University Training Contest 1
- 2014 Multi-University Training Contest 1 - A. Couple doubi
- hdu 4861 Couple doubi ---2014 Multi-University Training Contest 1
- 关于2014 Multi-University Training Contest 1的反思
- Hdu 1002 A + B Problem II (高精度相加)
- 【Linux内存管理】深入x86的内存寻址
- AJAX 跨域请求 - JSONP获取JSON数据
- Java集合源码学习(17)_BlockingQueue接口的实现LinkedBlockingQueue
- osx10.9.4安装php开发环境(nginx1.6.0+mysql5.6.19+php5.5.14)
- hdu4870 Rating---2014 Multi-University Training Contest 1
- 【Linux内存管理】深入x86的内存寻址之I/O 外设硬件开发举例
- 用户名,密码
- JavaScript 原型详解
- atitit.java给属性赋值方法总结and BeanUtils 1.6.1 .copyProperty的bug
- android即时通讯研究(逐渐完善中,还很简单)
- C 关于unsigned int compzero = ~0;
- Oulipo poj+KMP水题
- atitit.spring3 mvc url配置最佳实践