Robberies
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4852 Accepted Submission(s): 1844
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.
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
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
一道0-1背包的问题,题目大意为在不被抓住的情况下,求能拿到的最多的钱。输入的是被抓住的概率,所以要用1-被抓住的概率,求出逃跑的概率。又因为概率为浮点数,具体的精度不清楚,所以本题可以从最大的钱数开始求,求出在拿出一样的钱是的最大逃跑概率,最后在能逃跑的前提下输出最大金额。
#include <iostream>
#include<cstdio>
#include<cstring>
#include <cmath>
using namespace std;
int T,N,cnt;
float P,f[10005];
void ZeroOnePack(int cost, float weight){
for(int i = cnt; i >= cost; i --)
f[i] = max(f[i],f[i - cost] * weight);
}
int main(){
float p[10005];
int a[10005];
scanf("%d",&T);
while(T --){
scanf("%f%d",&P,&N);
cnt = 0;
for(int i = 0; i < N; i ++){
scanf("%d%f",&a[i],&p[i]);
p[i] = 1 - p[i];
cnt += a[i];
}
memset(f,0,sizeof(f));
f[0] = 1;
for(int i = 0; i < N; i ++){
ZeroOnePack(a[i],p[i]);
}
for(int j = cnt; j >= 0; j --)
if(f[j] > 1 - P){
printf("%d\n",j);
break;
}
}
return 0;
}