zoukankan      html  css  js  c++  java
  • hdu4336 Card Collector(概率DP,状态压缩)

    In your childhood, do you crazy for collecting the beautiful cards in the snacks? They said that, for example, if you collect all the 108 people in the famous novel Water Margin, you will win an amazing award. 

    As a smart boy, you notice that to win the award, you must buy much more snacks than it seems to be. To convince your friends not to waste money any more, you should find the expected number of snacks one should buy to collect a full suit of cards.

    InputThe first line of each test case contains one integer N (1 <= N <= 20), indicating the number of different cards you need the collect. The second line contains N numbers p1, p2, ..., pN, (p1 + p2 + ... + pN <= 1), indicating the possibility of each card to appear in a bag of snacks. 

    Note there is at most one card in a bag of snacks. And it is possible that there is nothing in the bag.OutputOutput one number for each test case, indicating the expected number of bags to buy to collect all the N different cards. 

    You will get accepted if the difference between your answer and the standard answer is no more that 10^-4.Sample Input

    1
    0.1
    2
    0.1 0.4

    Sample Output

    10.000
    10.500

    题意:
    有N(1<=N<=20)张卡片,每包中含有这些卡片的概率为p1,p2,````pN.
    每包至多一张卡片,可能没有卡片。
    求需要买多少包才能拿到所以的N张卡片,求次数的期望。

    题解:裸的期望dp+状态压缩。

    #include<cstdio>
    #include<algorithm>
    #include<iostream>
    #include<cstring>
    #include<cmath>
    #define N 22
    using namespace std;
    
    int n;
    double p[N],dp[1<<N];
    
    int main()
    {
        while(~scanf("%d",&n))
        {
            double tt=0;
            for(int i=0;i<n;i++)
            {
                scanf("%lf",&p[i]);
                tt+=p[i];
            }
            tt=1-tt;//tt就表示没有卡片的概率了
            dp[(1<<n)-1]=0;//期望倒推。 
            for(int i=(1<<n)-2;i>=0;i--)
            {
                double x=0,sum=1;
                for(int j=0;j<n;j++)
                    if((i&(1<<j)))x+=p[j];
                    else sum+=p[j]*dp[i|(1<<j)];
                dp[i]=sum/(1-tt-x);//其它期望总和,除以其它期望概率,化简得到。 
            }
            printf("%.5lf
    ",dp[0]);
    
        }
    }
     
  • 相关阅读:
    Android—应用程序开机自启
    Android—简单的仿QQ聊天界面
    Android—关于自定义对话框的工具类
    Android—基于GifView显示gif动态图片
    Android—ListView条目背景为图片时,条目间距问题解决
    Android—自定义开关按钮实现
    FileProvider的使用
    Android 7.0新特性
    Android SDK自带调试优化工具
    Android监视器概述
  • 原文地址:https://www.cnblogs.com/fengzhiyuan/p/7674055.html
Copyright © 2011-2022 走看看