poj 2151 Check the difficulty of problems (概率DP)
2014-10-21 21:16
495 查看
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 5006 | Accepted: 2203 |
2 2 2 0.9 0.9 1 0.9 0 0 0Sample Output
0.972
题意:ACM比赛中,共M道题,T个队,pij表示第i队解出第j题的概率,问每队至少解出一题且冠军队至少解出N道题的概率。
思路: dp[i][j][k] 表示第i个对在前j题解出k题的概率,sum[i][j]表示第i个对最多解出j题的概率。
dp[i][j][k] = dp[i][j-1][k]*(1-p[i][j]) + dp[i][j-1][k-1]*p[i][j];
sum[i][j]= dp[i][m][0]+dp[i][m][1]+...+ dp[i][m][j];
即 每队至少解出一题的概率 : ans1 = (1- sum[1][0])* (1- sum[2][0])* ......* (1- sum[m][0]) ;
每个队解出题但小于n道的概率 :ans1 = ( sum[m][n-1]- sum[1][0])*
(sum[m][n-1]- sum[2][0])* ......*
(sum[m][n-1]- sum[m][0]) ;
所以最后的答案 ans = ans1-ans2;
#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int M=1050;const int N=35;double dp[M],p[M],sum[M];int n,m,t;void input(){for(int i=1;i<=t;i++)for(int j=1;j<=m;j++)scanf("%lf",&p[i][j]);memset(dp,0,sizeof(dp));}void solve(){for(int i=1;i<=t;i++){dp[i][0][0]=1.0;for(int j=1;j<=m;j++)for(int k=0;k<=j;k++){dp[i][j][k]=dp[i][j-1][k]*(1-p[i][j]);if(k!=0) dp[i][j][k]+=dp[i][j-1][k-1]*p[i][j];}sum[i][0]=dp[i][m][0];for(int j=1;j<=m;j++) sum[i][j]=sum[i][j-1]+dp[i][m][j];}double ans1=1.0,ans2=1.0;for(int i=1;i<=t;i++){ans1*=(1.0-sum[i][0]);ans2*=(sum[i][n-1]-sum[i][0]);}printf("%.3f\n",ans1-ans2);}int main(){while(scanf("%d %d %d",&m,&t,&n)!=EOF){if(m==0 && t==0 && n==0) break;input();solve();}return 0;}[/code]
相关文章推荐
- POJ 2151 Check the difficulty of problems (概率dp)
- 简单概率DP(POJ 2151 Check the difficulty of problems)
- POJ 2151 Check the difficulty of problems 概率DP
- poj 2151 Check the difficulty of problems 概率dp
- poj 2151 Check the difficulty of problems 概率dp
- POJ2151-Check the difficulty of problems(概率DP)
- poj 2151 Check the difficulty of problems(概率DP)
- POJ-2151 Check the difficulty of problems 概率DP
- POJ 2151 Check the difficulty of problems(概率dp)
- poj 2151 Check the difficulty of problems(概率dp)
- POJ 2151 Check the difficulty of problems(概率DP)
- poj 2151 Check the difficulty of problems (dp,概率)
- POJ 2151 Check the difficulty of problems(dp,求概率)
- POJ 2151 Check the difficulty of problems(概率DP)
- poj 2151 Check the difficulty of problems(概率dp)
- poj 2151 Check the difficulty of problems 概率DP
- poj 2151 Check the difficulty of problems(概率dp)
- POJ 2151 Check the difficulty of problems (动态规划-概率DP)
- POJ 2151 Check the difficulty of problems (概率DP)
- poj 2151 Check the difficulty of problems (概率dp)