Check the difficulty of problems (概率DP)poj2151

原创 2017年07月31日 17:16:58

Check the difficulty of problems
Time Limit: 2000MS   Memory Limit: 65536K
Total Submissions: 7104   Accepted: 3078

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 <cstring>
#include <cstdio>
#include <iomanip>
using namespace std;

const int maxn=1010;
double dp[maxn][33] [33];
double p[maxn][33];
double p1,p2;
int m,t,n;

int main()
{
    int i,j,k;
    while(cin>>m>>t>>n)
    {
        if(m==0 && t==0 && n==0)
        {
            return 0;
        }

        for(i=1; i<=t; i++)
        {
            for(j=1; j<=m; j++)
            {
                cin>>p[i][j];
            }
        }
        ///判断dp边界
        for(i=1; i<=t; i++)
        {
            dp[i][0][0]=1.0; ///第i队 前0题 a了0道 概率必然是1
            for(j=1; j<=m; j++)
            {
                dp[i][0][j]=0.0; ///第i队 前0题 a了j(j>=1)道 概率必然是0
                dp[i][j][0]=dp[i][j-1][0]*(1-p[i][j]); ///继续求前j道题全错的情况
            }
        }
        ///求dp[i][j][k]的循环过程 第i队 前j题 a了k道
        for(i=1; i<=t; i++)
        {
            for(j=1; j<=m; j++)
            {
                for(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]);
                }
            }
        }
        ///p2-p1 就是队伍a至多n道的概率 ??exm ??
        p1=1.0; ///所有队伍a 1~n-1 道的概率
        p2=1.0; ///所有队至少a一道的概率
        for(i=1; i<=t; i++)
        {
            p2=p2*(1-dp[i][m][0]); ///至少a一道
        }

        for(i=1; i<=t; i++)
        {
            double sum=0.0;
            for(j=1; j<n; j++)
            {
                sum+=dp[i][m][j];
            }
            p1=p1*sum;
        }
        printf("%.3f\n",p2-p1);
    }
    return 0;
}


版权声明:有错误麻烦赐教,感激不尽~~~(转载留言哦~)

POJ 2151 Check the difficulty of problems 概率dp

题意: 一场acm比赛,给n

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

问题的解等于(所有队都做出至少一题的概率 - 所有队做题数都在1到N-1之间的概率) 设计DP状态时,因为DP过程中要记录哪些题做过了很难,一般来说要把DP的过程设计成有方向的,比如有一维表示前i个...

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

题目链接 Check the difficulty of problems Time Limit: 2000MS   Memory Limit: 65536K T...

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

http://poj.org/problem?id=2151 有t个队伍,m道题,给出每个队伍做出每道题的概率。求出每个队伍至少做出一道题并且冠军队伍至少做出n道题的概率。 只要设出数组来,就...

(POJ2151)Check the difficulty of problems <概率DP>

Check the difficulty of problems DescriptionOrganizing a programming contest is not an easy job. To...

poj 2151 Check the difficulty of problems(概率DP)

DP-概率DP,一道简单题。

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

Description Organizing a programming contest is not an easy job. To avoid making the problems too di...

poj2151 Check the difficulty of problems 概率dp

题目连接:http://poj.org/problem?id=2151 题意:略。 分析:我是顺着概率dp入门16题写的,然后这个题是简单的分类qwq. 状态转移方程还是好想:记dp[i][j][k]...
  • Na_OH
  • Na_OH
  • 2017年04月11日 16:41
  • 69

POJ 2151 Check the difficulty of problems 概率DP

题目大意: 就是现在有一场比赛有M道题( 大致思路: 就是一个典型的dp吧 ( ﹁ ﹁ ), 过程见代码注释 Result  :  Accepted     Memory  :  15...

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

题目链接:点击打开链接 题意:ACM比赛中, 有T个队, m道题, 每个队能解出每道题的概率已知, 求每个队至少解出一道题并且冠军队解出至少n道题的概率。 思路:首先, 我们不难想到用d[i][j...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Check the difficulty of problems (概率DP)poj2151
举报原因:
原因补充:

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