Robberies
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2395 Accepted Submission(s): 904
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.
Bank j contains Mj millions, and the probability of getting caught from robbing it is Pj .
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.
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
2 4 6
#include<stdio.h>
#include<string.h>
double max(double a,double b)
{
return a>b?a:b;
}
int main()
{
int n,i,t,total,M[109],j;
double P[109],p,f[10100];//f[i]偷i元的最大逃亡率
scanf("%d",&t);
while(t--)
{
scanf("%lf %d",&p,&n);
total=0;
for(i=0;i<n;i++)
{
scanf("%d%lf",&M[i],&P[i]);
total+=M[i];
}
f[0]=1;
for(i=1;i<=total;i++)
f[i]=0;
for(i=0;i<n;i++)
for(j=total;j>=M[i];j--)
f[j]=max(f[j],f[j-M[i]]*(1-P[i]));
for(i=total;i>=0;i--)
if(f[i]>=(1-p))
{
printf("%d\n",i);
break;
}
}
return 0;
}