关闭

HDU 2955 Robberies(01背包)

3877人阅读 评论(0) 收藏 举报
分类:

传送门

Robberies

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


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
 
题目大意:

(题目的背景是一个人想去抢多家银行)首先给定一个数T,表示的是有T组数据,每组数据首先给出一个小数p和一个整数n,分别表示的是最大的能够被抓住的概率,如果>这个概率这个强盗的母亲就不让他去,然后 下面有n行数据,每行有两个数,分别表示这个银行的钱数和被抓住的概率,让你求的是这个强盗在不被抓住的概率的条件下,能够抢到的最大钱数。

 解题思路:

我们首先将这个题给转化一下,就是被抓住的概率转化成没有被抓住的概率,也就是安全概率,那么DP[i],表示的就是能够抢不超过i的安全概率,又因为这是一个概率,利用乘法原理,所以有状态转移方程 DP[j] = max(DP[j], DP[j-money[i]]*p[i]),在这里最大的背包容量就是最大的钱数,然后最后从最大的钱数往前扫描一遍,如果>=刚开始的安全概率就直接输出i就行了。


上代码:

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cstdlib>

using namespace std;
const int MAXN = 1e4+5;
const double eps = 1e-10;
struct Node
{
    int money;
    double cost;
} bank[105];
double dp[MAXN];///DP[i]:表示的是最大的不超过钱数i的概率
int main()
{
    int T;
    cin>>T;
    while(T--)
    {
        int n, sum = 0;
        double p;
        cin>>p>>n;
        p = 1-p;
        for(int i=0; i<n; i++)
        {
            cin>>bank[i].money>>bank[i].cost;
            sum += bank[i].money;
            bank[i].cost = 1-bank[i].cost;
        }
        memset(dp, 0, sizeof(dp));
        dp[0] = 1;
        for(int i=0; i<n; i++)
        {
            for(int j=sum; j>=bank[i].money; j--)
            {
                dp[j] = max(dp[j], dp[j-bank[i].money]*bank[i].cost);
            }
        }
        for(int i=sum; i>=0; i--)
        { 
            if(dp[i]-p > -eps)
            {

                cout<<i<<endl;
                break;
            }
        }
    }
    return 0;
}




0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:487859次
    • 积分:11132
    • 等级:
    • 排名:第1602名
    • 原创:637篇
    • 转载:5篇
    • 译文:0篇
    • 评论:93条
    博客专栏