HDU 4336 Card Collector(状压期望DP || 容斥原理)

题意：n张卡，选到第i张概率为p[i]，求取到n张的期望次数。

思路：状压期望DP。设取不到卡片概率为none，状态s里为1的位表示已经取到的卡片。求解dp[s]，枚举s里为1的位i，则拿到新卡片的概率为sigma(p[i])，拿不到或拿到已有的概率为 1 - sigma(p[i])。这样有

dp[s] = (1 - sigma(p[i])) * dp[s] + sigma(p[i] * dp[s-(1<<i)]) + 1. 

移项得，

dp[s] =  sigma(p[i] * dp[s-(1<<i)]) / sigma(p[i]).

代码：

#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <cmath>
#include <set>
#include <map>
using namespace std;

typedef long long LL;
#define mem(a, n) memset(a, n, sizeof(a))
#define ALL(v) v.begin(), v.end()
#define si(a) scanf("%d", &a)
#define sii(a, b) scanf("%d%d", &a, &b)
#define siii(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define pb push_back
#define eps 1e-8
const int inf = 0x3f3f3f3f, N =  20 + 5, MOD = 1e9 + 7;

int T, cas = 0;
int n, m;
double p[N], none, dp[1 << 20];

int main(){
#ifdef LOCAL
    freopen("/Users/apple/input.txt", "r", stdin);
//	freopen("/Users/apple/out.txt", "w", stdout);
#endif
	
    while(si(n) != EOF) {
    	none = 0.0;
    	for(int i = 0; i < n; i ++) { scanf("%lf", &p[i]); none += p[i]; }
    	none = 1.0 - none;
    	int Lim = (1 << n) - 1;
    	dp[0] = 0.0;
    	for(int s = 1; s <= Lim; s ++) {
    		double sump = 0.0, sume = 1.0;
    		for(int i = 0; i < n; i ++) {
    			if((1 << i) & s) {
    				int newState = s ^ (1 << i);
    				sume += dp[newState] * p[i];
    				sump += p[i];
    			} 
    		}
    		dp[s] = sume / sump;
    	}
    	printf("%.5f\n", dp[Lim]);
    }
    
    return 0;
}

容斥：

对第i张，拿到的期望次数为1.0 / p[i]次。

对第i个第j张，拿到其中一张的期望次数为1.0 / (p[i] + p[j])。

奇加偶减。

#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <cmath>
#include <set>
#include <map>
using namespace std;

typedef long long LL;
#define mem(a, n) memset(a, n, sizeof(a))
#define ALL(v) v.begin(), v.end()
#define si(a) scanf("%d", &a)
#define sii(a, b) scanf("%d%d", &a, &b)
#define siii(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define pb push_back
#define eps 1e-8
const int inf = 0x3f3f3f3f, N = 1e3 + 5, MOD = 1e9 + 7;

int T, cas = 0;
int n, m;
double p[N], none;

int main(){
#ifdef LOCAL
    freopen("/Users/apple/input.txt", "r", stdin);
//	freopen("/Users/apple/out.txt", "w", stdout);
#endif
	
    while(si(n) != EOF) {
    	double ret = 0.0;
    	for(int i = 0; i < n; i ++) scanf("%lf", &p[i]);
    	int Lim = (1 << n) - 1;
	    for(int s = 1; s <= Lim; s ++) {
	    	int cnt = 0;
	    	double sum = 0.0;
	    	for(int i = 0; i < n; i ++) {
	    		if((1 << i) & s) {
	    			cnt ++;
	    			sum += p[i];
	    		}
	    	}
	    	if(cnt & 1) ret += 1. / sum;
	    	else ret -= 1. / sum;
	    }
	    printf("%.5f\n", ret);
    }
    
    return 0;
}