HDOJ 2955 Robberies 【0 1背包】

原创 2015年11月19日 19:17:06

Robberies

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


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
题目链接:HDOJ 2955 Robberies 【0  1背包】

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

已AC代码:

#include<cstdio>
#include<cstring>
#define M 11000
#define Max(x,y) (x>y?x:y)

double dp[M],p[M],P;
int m[M],n;

int main()
{
	int T,i,j,max;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%lf%d",&P,&n);
		max=0;//最大可抢数 
		for(i=0;i<n;++i)
		{
			scanf("%d%lf",&m[i],&p[i]);
			p[i]=1-p[i];//找反面 
			max+=m[i];
		}
		
		memset(dp,0,sizeof(dp));
		dp[0]=1.0;//抢 0 元一定不会被抓 
		
		for(i=0;i<n;++i)
			for(j=max;j>=m[i];--j)
				dp[j]=Max(dp[j],dp[j-m[i]]*p[i]);
		
		for(i=max;i>=0;--i)//从大到小,找一个最大的 
			if(dp[i]>=1-P)
			{
				printf("%d\n",i);
				break;
			}
	}
	return 0;
}


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

相关文章推荐

HDU2955-Robberies(0-1背包)

题目链接http://acm.hdu.edu.cn/showproblem.php?pid=2955思路简单的01背包,但是要想清楚状态。 最先考虑的状态是选到第i个物品,被抓的概率是j的时候的最大...
  • Lzedo
  • Lzedo
  • 2016-09-11 20:47
  • 113

hdu 2955 Robberies (0-1背包)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2955 Robberies Time Limit: 2000/1000 MS (...

HD 2955 Robberies(0-1背包)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2955 Problem Description The aspiring Roy the...

hdu 2955 Robberies (0 1背包)

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

hdu 2955 Robberies(0/1背包)

题意: Robberies 抢劫 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32...

hdoj problem 2955 Robberies(01背包问题)

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

[DP]HDOJ2955 Robberies

[题目] Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Other...

hdoj 2955 Robberies

题目 地址 http://acm.hdu.edu.cn/showproblem.php?pid=2955

【DP|01背包】HDU-2955 Robberies

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

hdu2955 Robberies(01背包)题解

传送门 The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guy...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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