HD 2955 Robberies（0-1背包）

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

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

题意：Roy想要抢劫银行，每家银行多有一定的金额和被抓到的概率，知道Roy被抓的最大概率P，求Roy在被抓的情况下，抢劫最多。
分析：被抓概率可以转换成安全概率，Roy的安全概率大于1-P时都是安全的。抢劫的金额为0时，肯定是安全的，所以d[0]=1;其他金额初始为最危险的所以概率全为0；注意精度。

转移方程为：dp[j]=max(dp[j-v[i]]*p[i],dp[j]);
如下代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#define esp 1e-10
#define M 10005
using namespace std;int main(){int t;scanf("%d",&t);while(t--){double p[M],sp;//p为抢每个银行的安全概率int v[M];//memset(dp,0,sizeof(dp));double dp[M]={1.0};   //dp为拿完钱后自己的安全概率 初始状态最安全，所以为1.0 int n,s=0;scanf("%lf%d",&sp, &n);sp=1-sp;    //转换成安全概率 for(int i=0; i<n; ++i){scanf("%d%lf", &v[i],&p[i]);s+=v[i];p[i]=1-p[i];    //转换成安全概率 }for(int i=0; i<n; ++i){for(int j=s; j>=v[i]; --j){dp[j]=max(dp[j-v[i]]*p[i],dp[j]);}}for(int i=s; i>=0; --i)if(dp[i]-sp>esp){printf("%d\n",i);break;}}return 0;
}

HD 2955 Robberies（0-1背包）相关推荐

HDOJ 2955 Robberies (01背包)
10397780 2014-03-26 00:13:51 Accepted 2955 46MS 480K 676 B C++ 泽泽 http://acm.hdu.edu.cn/showproblem. ...
HDUOJ 2955 Robberies
HDUOJ 2955 Robberies 题目链接 Problem Description The aspiring Roy the Robber has seen a lot of American ...
Python 0/1背包、动态规划
参考:http://www.cnblogs.com/fcyworld/p/6243012.html Python 0/1背包.动态规划 0/1背包问题:在能承受一定重量的背包中,放入重量不同,价值不同 ...
P1417 烹调方案 (0/1背包+贪心)
题目背景由于你的帮助,火星只遭受了最小的损失.但gw懒得重建家园了,就造了一艘飞船飞向遥远的earth星.不过飞船飞到一半,gw发现了一个很严重的问题:肚子饿了~ gw还是会做饭的,于是拿出了储藏的 ...
算法分析与设计——蛮力法0/1背包
蛮力法0/1背包蛮力法蛮力法是一种简单直接解决问题的方法,常常直接基于问题的描述,所以蛮力法也是最容易应用的方法. 蛮力法所依赖的基本技术是遍历,即采用一定的策略依次处理待求解问题的所有元素,从 ...
数据结构与算法 / 回溯算法（八皇后、0 - 1 背包）
回溯算法,顾名思义,就是在没有得到最优解的前提下,不断的返回至前面的岔路口位置,重新选择,直至遍历了所有的情况或者得到的预期最优解的情况下再结束. 与贪心算法不同的是,回溯算法理论上是可以得到最优解, ...
【例1】 0/1背包《信息学奥赛一本通》【解法一】 02
/* [例1] 0/1背包<信息学奥赛一本通>[解法一] 02 http://ybt.ssoier.cn:8088/problem_show.php?pid=1267 */ #includ ...
HDOJ 2602-Bone Collector（0/1背包模板、打印方案及滚动数组解法）
0/1背包一.Bone Collector 解法一:二维数组解法(0/1背包模板代码) 1.1 0/1背包打印方案代码解法二:滚动数组(一维)解法 2.1 一维滚动数组例题 E-爱玩游戏的Tom ...
动态规划（五）——0/1背包
0/1背包一.0/1背包问题 1.实例讲解 2.DP求解0/1背包 3.输出0/1背包方案二.0/1背包题目代码(持续更新) 一.0/1背包问题给定n种物品和一个背包,物品i的重量为wi,价值为 ...

HD 2955 Robberies（0-1背包）

HD 2955 Robberies（0-1背包）相关推荐

最新文章

热门文章