POJ 2151 Check the difficulty of problems 概率DP

原创 2016年05月31日 21:43:34
ACM比赛中,共M道题,T个队,pij表示第i队解出第j题的概率 问 每队至少解出一题且冠军队至少解出N道题的概率。 分析: 对于需要求得概率比较容易想到: 假设p1为每个队至少解出一题的概率,这个容易算出。 假设p2为每个队至少解出一题但是不超过n-1题的概率 所以最终答案为:p1-p2 现在问题是如何求出p2? 假设dp[i][j]表示第i个队解出的题目<=j的概率 则dp[i][j]=解出1题+解出2题+...解出j题的概率 现在问题转化为如何求解出1,2,3...k题的概率 假设g[i][j][k]表示第i个队在前j题解出k题的概率 则: g[i][j][k]=g[i][j-1][k-1]*p[i][j]+g[i][j-1][k]*(1-p[i][j]); 所以x[i][M][k]表示的就是第i个队解出k题的概率  假设
Check the difficulty of problems
Time Limit: 2000MS Memory Limit: 65536K
Total Submissions: 6540 Accepted: 2845

Description

Organizing a programming contest is not an easy job. To avoid making the problems too difficult, the organizer usually expect the contest result satisfy the following two terms: 1. All of the teams solve at least one problem. 2. The champion (One of those teams that solve the most problems) solves at least a certain number of problems.Now the organizer has studied out the contest problems, and through the result of preliminary contest, the organizer can estimate the probability that a certain team can successfully solve a certain problem. Given the number of contest problems M, the number of teams T, and the number of problems N that the organizer expect the champion solve at least. We also assume that team i solves problem j with the probability Pij (1 <= i <= T, 1<= j <= M). Well, can you calculate the probability that all of the teams solve at least one problem, and at the same time the champion team solves at least N problems?

Input

The input consists of several test cases. The first line of each test case contains three integers M (0 < M <= 30), T (1 < T <= 1000) and N (0 < N <= M). Each of the following T lines contains M floating-point numbers in the range of [0,1]. In these T lines, the j-th number in the i-th line is just Pij. A test case of M = T = N = 0 indicates the end of input, and should not be processed.

Output

For each test case, please output the answer in a separate line. The result should be rounded to three digits after the decimal point.

Sample Input

2 2 2
0.9 0.9
1 0.9
0 0 0

Sample Output

0.972
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
usingnamespace std;

#define maxn 35
#define maxt 1005

int n, t, m;
double f[maxt][maxn];
double g[maxt][maxn][maxn];

int main()
{
    //freopen("t.txt", "r", stdin);
while (scanf("%d%d%d", &n, &t, &m), n | t | m)
    {
        double ans =1;
        for (int i =0; i < t; i++)
            for (int j =1; j <= n; j++)
                scanf("%lf", &f[i][j]);
        memset(g, 0, sizeof(g));
        for (int i =0; i < t; i++)
        {
            g[i][0][0] =1;
            for (int j =1; j <= n; j++)
            {
                g[i][j][0] = g[i][j -1][0] * (1- f[i][j]);
                for (int k =1; k <= j; k++)
                    g[i][j][k] = g[i][j -1][k -1] * (f[i][j])
                            + g[i][j -1][k] * (1- f[i][j]);
            }
        }
        for (int i =0; i < t; i++)
            ans *=1- g[i][n][0];
        double temp =1;
        for (int i =0; i < t; i++)
        {
            double sum =0;
            for (int j =1; j < m; j++)
                sum += g[i][n][j];
            temp *= sum;
        }
        ans -= temp;
        printf("%.3f\n", ans);
    }
    return0;
}
 

查看原文:http://colorfulshark.cn/wordpress/check-the-difficulty-1044.html
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/wr132/article/details/51549425

POJ2151-Check the difficulty of problems

转载请注明出处:優YoU http://user.qzone.qq.com/289065406/blog/1304863551   大致题意: ACM比赛中,共M道题,T个队,pij表示第i队解...
  • lyy289065406
  • lyy289065406
  • 2011-07-31 16:52:28
  • 3233

poj2151之概率DP

Check the difficulty of problems Time Limit: 2000MS   Memory Limit: 65536K Total Sub...
  • xingyeyongheng
  • xingyeyongheng
  • 2014-05-11 17:30:04
  • 2142

POJ2151:Check the difficulty of problems(概率DP)

Description Organizing a programming contest is not an easy job. To avoid making the problems too di...
  • libin56842
  • libin56842
  • 2013-08-18 15:31:46
  • 2109

poj2151

这是一道比较麻烦的概率题目,与其说是DP
  • hhq420684
  • hhq420684
  • 2014-10-10 20:01:11
  • 559

poj2151(概率dp)

链接:点击打开链接 题意:有M道题,T个队,给出每个队做出每道题的概率,求每队至少做出一题并且冠军至少做出N道题的概率 代码:#include #include #include #includ...
  • stay_accept
  • stay_accept
  • 2016-08-04 20:41:48
  • 171

POJ2151

版权声明:本文为博主原创文章,未经博主允许不得转载。 Description Organizing a programming contest is not an easy job. To a...
  • fengkuangdewoniudada
  • fengkuangdewoniudada
  • 2016-11-28 20:15:35
  • 88

poj2151

题意大概是给出m道题,T支队,n,问求出每个人至少做出一道题而且冠军队至少做出n道题的概率。 明显概率dp问题,不知道关hash 什么事,渣渣不懂。 P[i][j]表示第I支队过第j道题的概率 ...
  • TaskaNon
  • TaskaNon
  • 2015-11-14 16:18:07
  • 189

POJ 2151 Check the difficulty of problems (动态规划-概率DP)

POJ 2151 Check the difficulty of problems (动态规划-概率DP) 题目大意: 有 M 道题目 T 支队伍,N表示 最好 的队 至少要做出N题 ,紧接下来T行...
  • a1061747415
  • a1061747415
  • 2014-06-25 19:08:20
  • 513

POJ 2151 Check the difficulty of problems(概率dp)

POJ 2151 Check the difficulty of problems(概率dp)
  • u012860063
  • u012860063
  • 2015-02-06 14:44:35
  • 991

poj2151 概率dp

传送门 题意:给定t个队伍、m场比赛,每个队伍做对每个题的概率,问每个队都至少做对一个题并且第一名做对的题目至少有n道的概率 思路:每个队至少做对1道题的概率很容易求,这个概率记作p,即每个队能做...
  • zhubing0331
  • zhubing0331
  • 2018-01-22 11:34:15
  • 71
收藏助手
不良信息举报
您举报文章:POJ 2151 Check the difficulty of problems 概率DP
举报原因:
原因补充:

(最多只允许输入30个字)