HDU_2955_Robberies(01背包,需动脑子)

Robberies

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


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
 

Source
 

Recommend
gaojie   |   We have carefully selected several similar problems for you:   1203  2159  2844  1171  1864 
 


本题分析:
这道题的题意理解起来比较简单,就是说给你若干个银行的钱数还有抢它们被抓的概率,然后再给你你希望抢的银行数和希望的逃跑率。问你怎么抢比较好。
关于这道题,我一开始想到的01背包是以概率为容量,然后填银行钱数。然而这种方法是行不通的,因为数组不支持double类型的索引。而且涉及到精度问题...(开数组的时候)[zz..当作一个经验mark一下下]
虽然不能将总概率当作容量,但是我们可以换个思考方式:我们假设容量是所有银行的总钱数。所以问题就是求总钱数已知的情况下能够顺利逃跑的银行。
逃跑的概率为(1-p)。因此相当于求已知背包大小的情况下求逃跑的最大概率。那么问题得以求解。
本题代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define maxn 10010

int t;
double p;
int n;
int mj[maxn];
double pj[maxn];
double ans[maxn];

int main(){
    scanf("%d", &t);
    while(t--)
    {
        scanf("%lf%d", &p, &n);
        int sum = 0;
        for(int i = 0; i < n; i++)
        {
            scanf("%d%lf", &mj[i], &pj[i]);
            sum += mj[i];
        }
        memset(ans, 0, sizeof(ans));
        ans[0] = 1;
        for(int i = 0; i < n; i++)
        {
            for(int j = sum; j >= mj[i]; j--)
                ans[j] = max(ans[j], ans[j - mj[i]] * (1 - pj[i]));
        }
        for(int i = sum; i >= 0; i--)
        {
            if(ans[i] > (1 - p))
            {
                printf("%d\n", i);
                break;
            }
        }
    }
    return 0;
}



评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值