POJ - 2151Check the difficulty of problems(概率DP)

最新推荐文章于 2019-10-25 20:41:33 发布

Rain722

最新推荐文章于 2019-10-25 20:41:33 发布

阅读量641

点赞数

分类专栏：动态规划-基础

本文链接：https://blog.csdn.net/Rain722/article/details/70739139

版权

动态规划-基础专栏收录该内容

45 篇文章 0 订阅

订阅专栏

Check the difficulty of problems

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 7530		Accepted: 3228

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

Sample Output

0.972

思路:

注意S[i][k]实际上是第i个队做出不少于k题的概率。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
double dp[1005][35][35], s[1005][35], p[1005][35];
int main()
{
    int m, n, t;
    double p1, p2;
    while(scanf("%d%d%d", &m, &t, &n) &&(m||t||n))
    {
        for(int i = 1; i <= t; i++)
            for(int j = 1; j <= m; j++)
                scanf("%lf", &p[i][j]);
        memset(dp, 0, sizeof(dp));
        memset(s, 0, sizeof(s));
        for(int i = 1; i <= t; i++)
        {
            dp[i][0][0] = 1.0;
            for(int j = 1; j <= m; j++)
                dp[i][j][0] = dp[i][j-1][0] * (1-p[i][j]);
            for(int j = 1; j <= m; j++)
                for(int k = 1; k <= j; k++)
                    dp[i][j][k] = dp[i][j-1][k-1] * p[i][j] + dp[i][j-1][k] * (1-p[i][j]);
            s[i][0] = dp[i][m][0];
            for(int k = 1; k <= m; k++)
                s[i][k] = s[i][k-1] + dp[i][m][k];
        }
        p1 = p2 = 1.0;
        for(int i = 1; i <= t; i++)
            p1 *= (s[i][m]-s[i][0]);
        for(int i = 1; i <= t; i++)
            p2 *= (s[i][n-1] - s[i][0]);
        printf("%.3f\n", p1-p2);
    }
    return 0;
}