题目链接
http://acm.hdu.edu.cn/showproblem.php?pid=4336
题意
开袋有卡(也有概率没有),不同卡有不同概率,问集齐一套期望
思路
不难想到状态压缩,一维DP,dp[i]代表i状态下到集齐的期望。显然答案是dp[0]。期望则逆推,我们易推得
d
p
[
i
]
=
d
p
[
i
]
∗
p
f
a
i
l
+
∑
可
达
状
态
j
p
j
∗
d
p
[
j
]
+
1
dp[i]=dp[i]*p_{fail}+\sum_{可达状态j}p_j*dp[j]+1
dp[i]=dp[i]∗pfail+可达状态j∑pj∗dp[j]+1
化简
d
p
[
i
]
=
(
∑
可
达
状
态
j
p
j
∗
d
p
[
j
]
+
1
)
/
(
1
−
p
f
a
i
l
)
dp[i]=(\sum_{可达状态j}p_j*dp[j]+1)/(1-p_{fail})
dp[i]=(可达状态j∑pj∗dp[j]+1)/(1−pfail)
教训/收获
数学菜就老老实实写DP,别想着推式子
代码
#include<cstdio>
#include<iostream>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<string>
#include<queue>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<chrono>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define endl "\n"
//#define int long long
//#define double long double
using namespace std;
typedef long long ll;
const int maxn=21;
const int inf=0x3f3f3f3f;
int n,m,k;
double p[maxn];
double dp[1<<maxn];
signed main(){
IOS
#ifndef ONLINE_JUDGE
freopen("IO\\in.txt","r",stdin);
freopen("IO\\out.txt","w",stdout);
#endif
int tn=1;
while(cin>>n){
memset(dp,0,sizeof dp);
double pp=1.0;
for(int i=1;i<=n;i++) cin>>p[i],pp-=p[i];
for(int i=(1<<n)-2;i>=0;i--){
double pfail=pp;
double ans=0;
for(int j=1;j<=n;j++){
if(i&(1<<(j-1))){
pfail+=p[j];
}
else{
ans+=dp[i|(1<<(j-1))]*p[j];
}
}
dp[i]=(ans+1)/(1-pfail);
}
cout<<fixed<<setprecision(6)<<dp[0]<<endl;
}
return 0;
}