hdu 4870 Rating

最新推荐文章于 2021-10-15 21:35:41 发布

GDRetop

最新推荐文章于 2021-10-15 21:35:41 发布

阅读量563

点赞数

分类专栏： ##ACM-ICPC编程题 ##动态规划文章标签：动态规划概率

本文链接：https://blog.csdn.net/firenet1/article/details/38048845

版权

##ACM-ICPC编程题同时被 2 个专栏收录

173 篇文章 0 订阅

订阅专栏

##动态规划

28 篇文章 0 订阅

订阅专栏

概率dp

题意有两个账号，每次使用分数最低的进行比赛，p的概率可以得到50分，1-p的概率会丢掉100分，但是最低分为0，问达到最高分1000分的期望

因为都是50，,100，可以约分变成1,2,20的关系，就是如何从0变成20

dp[i]表示得分为i时晋级的期望值。

dp[i] = 1*p+(1-p)*(1+dp[i-2]+dp[i-1]+dp[i])

表示得分为i时晋级的期望等于 1次成功概率 + 1次失败概率*（失败时二维一次操作+i-2晋级到i-1的期望+i-1晋级到i的期望+i晋级的期望）

转化方程 dp[i] = 1+(1-p)/p*(1+dp[i-2]+dp[i])

i=0,1时特殊处理即可

问了三次才明白---感谢单总

Rating

Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 78 Accepted Submission(s): 25
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

Sample Output

Source

2014 Multi-University Training Contest 1

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

double p;
double dp[25];
int main() {
    while (~scanf("%lf", &p)) {
        dp[0] = 1.0/p;
        dp[1] = 1+(1-p)*(dp[0]+1)/p;
        for(int i = 2;i <= 19;i++){
            dp[i] = 1+(1-p)*(dp[i-2]+dp[i-1]+1)/p;
        }
        double ans = 0;
        for(int i = 0;i < 19; i++)
            ans+=dp[i]*2;
            ans+=dp[19];
        printf("%.6lf\n", ans);
    }
    return 0;
}