hdoj Robberies 2955 (概率Dp&&01背包) 好题

原创 2015年11月20日 19:43:52

Robberies

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


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
//题意:
先给你小偷被抓的概率m与它准备去偷的银行的个数n。
然后给你n个银行中每个银行的钱数和偷这个银行被抓的概率,求出小偷最多能偷多少钱。
//转换:
将n个银行的总钱数看做是背包容量,将成功逃跑的概率(1-m)作为目标,进行01背包就可求出。
Hait:重在转化....
#include<stdio.h>
#include<string.h>
double max(double a,double b)
{
	return a>b?a:b;
}
int a[110];
double dp[10010],b[110];
int main()
{
	int t;
	int n,i,j,k,sum;
	double m,num;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%lf%d",&m,&n);
		m=1-m;
		sum=0;
		for(i=1;i<=n;i++)
		{
			scanf("%d%lf",&a[i],&num);
			b[i]=1-num;
			sum+=a[i];
		}
		memset(dp,0,sizeof(dp));
		dp[0]=1;
		for(i=1;i<=n;i++)
		{
			for(j=sum;j>=a[i];j--)
			{
				dp[j]=max(dp[j],dp[j-a[i]]*b[i]);
			}
		}
		for(i=sum;i>=0;i--)
		{
			if(dp[i]>=m)
			{
				printf("%d\n",i);
				break;
			}
		}
	}
	return 0;
}

DP背包问题小结(01背包,完全背包,需恰好装满或不需,一维DP、二维DP)

1) 01背包基础,求背包所装物品价值之和的最大值,不要求恰好装满时,采用易于理解的二维DP数组存储。 #include #include using namespace std; int d...
  • a272846945
  • a272846945
  • 2016年03月17日 22:53
  • 2107

动态规划之01背包问题讲解

给大家附上一个题目吧,便于理解 ctest有n个苹果,要将它放入容量为v的背包。给出第i个苹果的大小和价钱,求出能放入背包的苹果的总价钱最大值。 输入:每组测试数据第一行为2个正整数,...
  • su20145104009
  • su20145104009
  • 2016年05月04日 10:21
  • 3349

【DP算法篇之初学】背包问题

昨天做了爱奇艺的内推笔试,编程题又出现了动态规划问题,感觉动态规划出现的概率好大,需要加强下。这里借用背包问题开始我们的学习。 背包问题的经典讲解可以参见背包问题九讲,此外我在刷题的过程中发现还发...
  • woxiaohahaa
  • woxiaohahaa
  • 2016年08月31日 10:13
  • 3549

HDU 2955 Robberies(经典01背包概率问题)

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...
  • fjy4328286
  • fjy4328286
  • 2013年06月03日 18:42
  • 604

hdu2955---Robberies(概率做01背包)

Problem Description The aspiring Roy the Robber has seen a lot of American movies, and knows that t...
  • Guard_Mine
  • Guard_Mine
  • 2015年02月24日 14:47
  • 930

HDU 2955 Robberies (转化概率-01背包)

【题目链接】:click here~~ 代码: /* * Problem: HDU No.2955 * Running time: 46MS * Complier: G++ * Author: A...
  • u013050857
  • u013050857
  • 2015年09月09日 15:14
  • 872

hdu 2955 Robberies(概率01背包,反向思维)

欢迎使用Markdown编辑器写博客本Markdown编辑器使用StackEdit修改而来,用它写博客,将会带来全新的体验哦: Markdown和扩展Markdown简洁的语法 代码块高亮 图片链接和...
  • xiaosshhaa
  • xiaosshhaa
  • 2017年04月02日 21:54
  • 102

hdu 2955 Robberies + LightOJ 1079 Just another Robbery (01背包 概率)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2955 题意:有一个小偷要偷银行的钱,可是他偷没家银行总是有一定的概率被抓,现在给了你一个概率P,只要他...
  • whyorwhnt
  • whyorwhnt
  • 2013年02月26日 20:22
  • 602

hdoj problem 2955 Robberies(01背包问题)

Robberies Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Tota...
  • lh__huahuan
  • lh__huahuan
  • 2014年11月17日 16:26
  • 298

【DP|01背包】HDU-2955 Robberies

给出几家银行拥有的钱数、抢走该银行的所有钱被抓的概率和能够容忍的最大被抓概率,求在被抓概率在容忍线以下时能够抢劫的最大钱数。...
  • u012325552
  • u012325552
  • 2014年12月17日 09:10
  • 718
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdoj Robberies 2955 (概率Dp&&01背包) 好题
举报原因:
原因补充:

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