zoukankan      html  css  js  c++  java
  • Help Me Escape (ZOJ 3640)

    J - Help Me Escape
    Crawling in process... Crawling failed Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu

    Description

    Background

        If thou doest well, shalt thou not be accepted? and if thou doest not well, sin lieth at the door. And unto thee shall be his desire, and thou shalt rule over him.
        And Cain talked with Abel his brother: and it came to pass, when they were in the field, that Cain rose up against Abel his brother, and slew him.
        And the LORD said unto Cain, Where is Abel thy brother? And he said, I know not: Am I my brother's keeper?
        And he said, What hast thou done? the voice of thy brother's blood crieth unto me from the ground.
        And now art thou cursed from the earth, which hath opened her mouth to receive thy brother's blood from thy hand;
        When thou tillest the ground, it shall not henceforth yield unto thee her strength; a fugitive and a vagabond shalt thou be in the earth.

    —— Bible Chapter 4

    Now Cain is unexpectedly trapped in a cave with N paths. Due to LORD's punishment, all the paths are zigzag and dangerous. The difficulty of the ith path is ci.

    Then we define f as the fighting capacity of Cain. Every day, Cain will be sent to one of the N paths randomly.

    Suppose Cain is in front of the ith path. He can successfully take ti days to escape from the cave as long as his fighting capacity f is larger than ci. Otherwise, he has to keep trying day after day. However, if Cain failed to escape, his fighting capacity would increase ci as the result of actual combat. (A kindly reminder: Cain will never died.)

    As for ti, we can easily draw a conclusion that ti is closely related to ci. Let's use the following function to describe their relationship:

    After D days, Cain finally escapes from the cave. Please output the expectation of D.

    Input

    The input consists of several cases. In each case, two positive integers N and f (n ≤ 100, f ≤ 10000) are given in the first line. The second line includes N positive integers ci (ci ≤ 10000, 1 ≤ i ≤ N)

    Output

    For each case, you should output the expectation(3 digits after the decimal point).

    Sample Input

    3 1
    1 2 3
    

    Sample Output

    6.889
    
    概率dp
    求期望,记忆化搜索

    #include <cstdio>
    #include <cmath>
    #include <cstring>
    #define N 105
    #define M 2500000
    double f, c[N], t[N], p[M];
    int n;
    double dp(int ff)
    {
        if(p[ff] > 0.0) return p[ff];
         for(int i = 0; i < n; i++)
            if(ff > c[i]) p[ff] += t[i] / (double)n;
            else p[ff] += (1.0 + dp(ff + c[i])) / (double)n;
         return p[ff];
    }
    
    int main()
    {
        while(~scanf("%d%lf", &n, &f))
        {
            memset(p, 0, sizeof(p));
            for(int i = 0; i < n; i++) {
                    scanf("%lf", &c[i]);
                    t[i] = floor((1.0 + sqrt(5.0)) * c[i] * c[i] / 2.0);
            }
            printf("%.3lf
    ", dp(f));
        }
        return 0;
    
    }
    View Code
  • 相关阅读:
    转发:原本优秀的我们是怎样滑向平庸的
    阿里巴巴C++实习生相关招聘一则
    [置顶] 我希望在20岁时就知道的26条时间管理技巧
    提示用户进行版本更新并且发布通知监控版本下载情况
    树状数组求正序数与逆序数hdu Minimum Inversion Number
    通过js 实现简单验证码的 刷新 看不清 换一张
    配置 CACTI 监控 MySQL 数据库状态
    Win7下ADB不能识别设备的可能原因
    Java 开源博客——B3log Solo 0.6.0 正式版发布了!
    MyEclipse下Import没有Maven的处理办法
  • 原文地址:https://www.cnblogs.com/sunus/p/4442935.html
Copyright © 2011-2022 走看看