hdoj 2955 Robberies 【dp&&01背包】

原创 2015年11月19日 21:54:57


Robberies

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 17564    Accepted Submission(s): 6490


Problem Description
The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to work in the lucrative business of bank robbery only for a short while, before retiring to a comfortable job at a university.


For a few months now, Roy has been assessing the security of various banks and the amount of cash they hold. He wants to make a calculated risk, and grab as much money as possible.


His mother, Ola, has decided upon a tolerable probability of getting caught. She feels that he is safe enough if the banks he robs together give a probability less than this.
 

Input
The first line of input gives T, the number of cases. For each scenario, the first line of input gives a floating point number P, the probability Roy needs to be below, and an integer N, the number of banks he has plans for. Then follow N lines, where line j gives an integer Mj and a floating point number Pj .
Bank j contains Mj millions, and the probability of getting caught from robbing it is Pj .
 

Output
For each test case, output a line with the maximum number of millions he can expect to get while the probability of getting caught is less than the limit set.

Notes and Constraints
0 < T <= 100
0.0 <= P <= 1.0
0 < N <= 100
0 < Mj <= 100
0.0 <= Pj <= 1.0
A bank goes bankrupt if it is robbed, and you may assume that all probabilities are independent as the police have very low funds.
 

Sample Input
3 0.04 3 1 0.02 2 0.03 3 0.05 0.06 3 2 0.03 2 0.03 3 0.05 0.10 3 1 0.03 2 0.02 3 0.05
 

Sample Output
2 4 6
分析:
这道题给出的是被抓率,所以要求出贼在被抓之前能偷到最多的东西,就要贼在得到最大一次前被抓的概率低于最小被抓率。
代码:
//#include<cstdio>
//#include<cstring>
//#include<algorithm>
//#include<cstdlib>
//#include<cmath>
//using namespace std;
//int bb[110];
//double dp[10100],rate[110];
//
//int main()
//{
//    int T;
//    double temp,p,n;
//    int i,j;
//    while(scanf("%d",&T)!=EOF)
//    {
//        while(T--)
//        {
//            int sum=0;
//            memset(dp,0,sizeof(dp));
//            dp[0]=1;
//            scanf("%lf%d",&p,&n);
//            for(i=0;i<n;i++)
//            {
//                scanf("%d%lf",&bb[i],&temp);
//                rate[i]=1-temp;
//                sum+=bb[i];
//            }
//            for(i=0;i<n;i++)
//                for(j=sum;j>=bb[i];j--)
//                if(dp[j-bb[i]]*rate[i]>dp[j])
//                dp[j]=dp[j-bb[i]]*rate[i];
//            p=1-p;
//            for(i=sum;i>=0;i--)
//                if(dp[i]>=p){
//            printf("%d\n",i);
//            break;}
//        }
//    }
//
//    return 0;
//}




#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<queue>
using namespace std;

int main()
{
    int T;
    double p;
    int n;
    int bb[102];
    double rate[102];
    int i,j;
    double temp;
    int sum;
    double dp[10002];
    while(~scanf("%d",&T))
    {
        while(T--)
        {
            sum=0;
            memset(dp,0,sizeof(dp));
            dp[0]=1;
            scanf("%lf%d",&p,&n);
            for(i=0;i<n;i++)
            {
                scanf("%d%lf",&bb[i],&temp);
                rate[i]=1-temp;
                sum+=bb[i];
            }
            for(i=0;i<n;i++)
                for(j=sum;j>=bb[i];j--)
            {
                if(dp[j-bb[i]]*rate[i]>dp[j])
                    dp[j]=dp[j-bb[i]]*rate[i];
            }
            p=1-p;
            for(i=sum;i>=0;i--)
                if(dp[i]>=p)
                break;
            printf("%d\n",i);
        }
    }
    return 0;
}












 
版权声明:博主情人,外人误碰!!!

相关文章推荐

hdoj problem 2955 Robberies(01背包问题)

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...

【DP|01背包】HDU-2955 Robberies

给出几家银行拥有的钱数、抢走该银行的所有钱被抓的概率和能够容忍的最大被抓概率,求在被抓概率在容忍线以下时能够抢劫的最大钱数。...

HDU 2955 Robberies(DP:01背包)

HDU 2955 Robberies(DP:01背包) 题意:给你一个被抓的概率P,要求去抢银行的被抓概率要小于P,每个银行有一个价值和一个被抓概率Pi,问你在被抓概率的前提下,能获得的最大价值. ...

HDU 2955 Robberies (01背包dp)

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)     ...

HDOJ 2955 Robberies 【0 1背包】

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...

HDU_2955_Robberies(01背包,需动脑子)

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...

hdu2955 Robberies(01背包)题解

传送门 The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guy...

HDU 2955 Robberies (01背包)

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total ...

Hdu 2955 Robberies//01背包

题目描述:Roy去抢银行,如何在不被抓住的情况下抢到最多的钱。给出抢每个银行能抢到的钱和被抓到的概率。 分析:刚开始以为概率只有两位小数,乘以100直接做的,结果发现数据不是这样的,果断wa了。然后...
  • mr_zys
  • mr_zys
  • 2013年06月04日 18:53
  • 414

HDU - 2955 Robberies(01背包)

点击打开题目链接 Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdoj 2955 Robberies 【dp&&01背包】
举报原因:
原因补充:

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