hdu 4336 Card Collector(概率dp， 容斥原理)

题意：相当于盒子里有n个球，每个球被取到的概率为pi, 问取到全部n个球的次数期望是多少？

概率dp：

题解参见：http://www.cnblogs.com/zhj5chengfeng/archive/2013/03/02/2939601.html

s是用来表示已取到的球的二进制集合，i 是属于集合s的球，k不属于s，s‘是将k加入s得到的集合，即 s’ = s | (1<<k)

例如下面的数据

2

0.1 0.4

f(0) = 1+0.5*f(0)+0.1*f(1)+0.4*f(2)

很容易想到记忆化搜索

//记忆化搜索
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

#define rep(i, s, t) for(int (i)=(s);(i)<=(t);++(i))
#define urep(i, s, t) for(int (i)=(s);(i)>=(t);--(i))

typedef long long LL;

const int maxn = 21;
double p[maxn];
double f[1<<maxn];
int n;

double dp(int x) {
    if (f[x] < 0) {
        f[x] = 1;
        double base = 0;
        rep(i, 0, n-1)
            if (((1<<i)&x) == 0) {
                int nxt = (1<<i)|x;
                f[x] += p[i] * (f[nxt] < 0 ? dp(nxt) : f[nxt]);
                base += p[i];
            }
        f[x] /= base;
    }
    return f[x];
}

int main() {
    //freopen("input.in", "r", stdin);
    while (cin >> n) {
        rep(i, 0, n-1) cin >> p[i];
        for (int i=0;i<(1<<n);++i) f[i] = -1;
        f[(1<<n)-1] = 0;
        dp(0);
        printf("%.5f\n", f[0]);
    }
    return 0;
}

把上面记忆化搜索的过程逆过来, 可以得到dp递推方程

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

#define rep(i, s, t) for(int (i)=(s);(i)<=(t);++(i))
#define urep(i, s, t) for(int (i)=(s);(i)>=(t);--(i))

typedef long long LL;

const int maxn = 21;
double p[maxn];
double f[1<<maxn];
int n;

int main() {
    freopen("input.in", "r", stdin);
    while (cin >> n) {
        rep(i, 0, n-1) cin >> p[i];
        for (int i=0;i<(1<<n);++i) f[i] = -1;
        f[(1<<n)-1] = 0;
        for (int s=(1<<n)-2;s>=0;--s) {
            double tmp = 0;
            f[s] = 1;
            for (int i=0;i<n;++i)
                if ((s&(1<<i)) == 0) { // i 不在 s 中
                    int k = s|(1<<i);
                    tmp += p[i];
                    f[s] += p[i]*f[k];
                }
            f[s] /= tmp;
        }
        printf("%.5f\n", f[0]);
    }
    return 0;
}

容斥原理：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;

#define rep(i, s, t) for(int (i)=(s);(i)<=(t);++(i))
#define urep(i, s, t) for(int (i)=(s);(i)>=(t);--(i))

typedef long long LL;

const int maxn = 21;
double p[maxn];
double f[1<<maxn];
int n;

int main() {
    freopen("input.in", "r", stdin);
    while (cin >> n) {
        rep(i, 0, n-1) cin >> p[i];
        double sum = 0;
        int t = (1<<n)-1;
        for (int i=1;i<=t;++i) {
            double tmp = 0;
            int cnt = 0;
            for (int j=0;j<n;++j)
                if (i & (1<<j)) {
                    tmp += p[j];
                    cnt++;
                }
            if (cnt%2) sum += 1.0/tmp;
            else sum -= 1.0/tmp;
        }
        printf("%.5f\n", sum);
    }
    return 0;
}