Robberies
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12847 Accepted Submission(s): 4757
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
Source
Recommend
/*
翻译
有抱负的Roy强盗已经见过很多美国电影,和知道那些坏家伙通常获取夹在结束时,常常因为他们变得太贪心。他已决定要在有利可图的业务领域银行抢劫只一会儿,到一个舒适的工作,在一所大学退休前工作。
几个月,罗伊一直在评估各种银行和现金持有量的安全。他想要使计算的风险,并抓住尽可能多尽可能的钱。
他的母亲,法律事务厅,已决定在可容忍的概率被抓住。她会感到足够安全,是否他一起抢劫银行给的概率比这个值小。
*/
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
int m[110];
double p[110];
double dp[10010];
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
double P;
int i,j,n,sum=0;
scanf("%lf%d",&P,&n);
for(i=1;i<=n;i++)
{
scanf("%d%lf",&m[i],&p[i]);
sum+=m[i];
}
memset(dp,0,sizeof(dp));
dp[0]=1;
for(i=1;i<=n;i++)
{
for(j=sum;j>=m[i];j--)
dp[j]=max(dp[j],dp[j-m[i]]*(1-p[i]));
}
for(i=sum;i>=0;i--)
if(dp[i]>1-P)
{
printf("%d\n",i);
break;
}
}
return 0;
}