HDU - 2955 Robberies
来源:互联网 发布:mac翻墙回国软件 编辑:程序博客网 时间:2024/05/01 23:57
Robberies
Time Limit: 1000MS Memory Limit: 32768KB 64bit IO Format: %I64d & %I64u
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.
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 .
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.
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
30.04 31 0.022 0.033 0.050.06 32 0.032 0.033 0.050.10 31 0.032 0.023 0.05
Sample Output
246
Source
IDI Open 2009
分析:
0-1背包问题。
题目大意:有一个小偷要偷银行的钱,可是他偷没家银行总是有一定的概率被抓,现在给了你一个概率P,只要他被抓的概率乘积不大与P,他就是安全的。问你在他安全的情况下,他最多可以偷多少钱。
注意:题目给我们的是被抓的概率,,而我们要求最大的逃跑率,需要去被抓的概率pi的补 ,即1-pi
只有逃跑率才会等于各个逃跑率之积,被抓的概率不会等于各个被抓的概率之积,,概率的知识,不多说。。
状态转移方程:dp[j] = max ( dp[j], dp[j-cost[i]] * weight[i])..
读懂题目很关键!!!!!!!!!!!!链接:http://blog.csdn.net/forpro_yang/article/details/6683850
不知为啥样例都过不了的我的代码:
#include <iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>//max()函数需要
using namespace std;
int m[105];
double p[105],dp[105*105];
double max(double a,double b)
{
return a>b?a:b;
}//repeal
int main()
{
int t,p1,n,s,i,j;
scanf("%d",&t);
while(t--)
{
scanf("%lf%d",&p1,&n);
p1=1-p1;
s=0;
for(i=0;i<n;i++)//i=1;i<=n;i++
{
scanf("%d%lf",&m[i],&p[i]);
s+=m[i];
}
memset(dp,0,sizeof(dp));
dp[0]=1;
for(i=0;i<n;i++)//i=1;i<=n;i++
{
for(j=s;j>=m[i];j--)
{
dp[j]=max(dp[j],dp[j-m[i]]*(1-p[i]));
}
}
for(i=s;i>=0;i--)
{
if(dp[i]>=p1)
{
printf("%d\n",i);
break;
}
}
}
return 0;
}
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>//max()函数需要
using namespace std;
int m[105];
double p[105],dp[105*105];
double max(double a,double b)
{
return a>b?a:b;
}//repeal
int main()
{
int t,p1,n,s,i,j;
scanf("%d",&t);
while(t--)
{
scanf("%lf%d",&p1,&n);
p1=1-p1;
s=0;
for(i=0;i<n;i++)//i=1;i<=n;i++
{
scanf("%d%lf",&m[i],&p[i]);
s+=m[i];
}
memset(dp,0,sizeof(dp));
dp[0]=1;
for(i=0;i<n;i++)//i=1;i<=n;i++
{
for(j=s;j>=m[i];j--)
{
dp[j]=max(dp[j],dp[j-m[i]]*(1-p[i]));
}
}
for(i=s;i>=0;i--)
{
if(dp[i]>=p1)
{
printf("%d\n",i);
break;
}
}
}
return 0;
}
0 0
- hdu 2955 Robberies
- HDU 2955 - Robberies
- hdu 2955 Robberies DP
- Hdu 2955 - Robberies
- hdu 2955 Robberies
- hdu 2955 Robberies
- hdu 2955 Robberies
- hdu 2955 Robberies
- HDU 2955 Robberies
- hdu 2955 Robberies
- hdu 2955(Robberies)
- hdu 2955 Robberies
- HDU 2955 Robberies
- hdu 2955 Robberies
- hdu 2955 Robberies
- hdu-2955-Robberies
- hdu 2955 Robberies
- HDU:2955 Robberies
- mysql mysqldump只导出表结构或只导出数据的实现方法
- POJ 2492 A Bug's Life(扩展并查集)
- linux下Qt安装问题
- 提升linux下tcp服务器并发连接数限制
- c# Serialization: 序列化内容至CData
- HDU - 2955 Robberies
- KVO的使用
- leetcode:Number of Islands
- 通俗说说DSP、SSP、RTB、DMP是什么
- java面试总结
- poj3370Halloween treats抽屉原理
- 转自http://bbs.pfan.cn/
- Android boot up 过程
- 字符串的输入与输出