hdoj 2955 Robberies 【0 1背包】

原创 2015年11月18日 20:23:43

Robberies

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


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<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int mon[110];
double sum[100010],pro[110];
int main()
{
	int T;
	double p;
	int i,j,n,money;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%lf%d",&p,&n);
		p=1-p;//最低逃跑率; 
		money=0;
		for(i=0;i<n;i++)
		{
			scanf("%d%lf",&mon[i],&pro[i]);
			money+=mon[i];
			pro[i]=1-pro[i];
		}
		memset(sum,0,sizeof(sum));
		sum[0]=1;//没偷是逃跑率为1; 
		for(i=0;i<n;i++)
		{
			for(j=money;j>=mon[i];j--)
			{
				sum[j]=max(sum[j],sum[j-mon[i]]*pro[i]);
			}
		}
		for(i=money;i>=0;i--)
		{
			if(sum[i]>=p)//大于给定逃跑率的最大数; 
			{
				printf("%d\n",i);
				break;
			}
		}
	}
	return 0;
}




HDOJ 2955 Robberies 【0 1背包】

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

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...

hdoj 2955 Robberies

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

[DP]HDOJ2955 Robberies

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

hdoj2955Robberies【dp】

Robberies Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Tot...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdoj 2955 Robberies 【0 1背包】
举报原因:
原因补充:

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