hdu-2955-Robberies

原创 2013年12月06日 00:36:48

Robberies

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


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 <iostream>
#include <cstring>
#define maxv 10005
#define maxn 105
using namespace std;
double ans[maxv],p[maxn],P;
int T,N,m[maxn],tot;
int main()
{
    cin>>T;
    while(T--){
        tot=0;          // 非常重要,不然第二组数据可能会超过int范围,会出RE
        memset(ans,0,sizeof(ans));  //初始化也同样重要
        ans[0]=1;
        cin>>P>>N;
        for(int i=1; i<=N; i++){
            cin>>m[i]>>p[i];
            tot += m[i];
        }
        //背包 转换为乘法 使同一个点不被捉的概率最大   
        for(int i=1; i<=N; i++){ 
            for(int j=tot; j>=m[i]; j--){
                if(ans[j]<ans[j-m[i]]*(1-p[i]))
                    ans[j]=ans[j-m[i]]*(1-p[i]);
            }
        }
        
        //输出i而不是ans[i]
        for(int i=tot; i>=0; i--)
            if(ans[i]>=1-P){
                cout<<i<<endl;
                break;
            }
    }
    return 0;
}



版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU 2955Robberies

链接:http://acm.hdu.edu.cn/showproblem.php?pid=2955

hdu 2955 Robberies

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

【DP|01背包】HDU-2955 Robberies

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

HDU2955 Robberies

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

0-1背包问题

HDU 2955 Robberies(变形背包)

The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually g...

Hdu 2955 Robberies//01背包

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

[HDU2955]Robberies[dp]

题目链接:[HDU2955]Robberies[dp] 题意分析:Roy要去偷银行的钱,每个银行都存在被抓住的概率。他麻麻担心他被抓,所以如果他抢劫的银行被抓住的概率大于P,她麻麻就不放心了。所以,...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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