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
一个关于背包的题目。。题目的意思就是抢劫银行,一个是抢劫的
钱,一个是被抓的概率,。 然后问最后在有限的概率之内,
可以抢到多少的钱。 那么,我们可以将被抓转化成不被抓,
所以,在输入的时候。转化概率,。为1-p[i]; 然后呢,求全都抢到的
总钱数。之后,就是01背包的模型,在一个概率的数组里面,
只要在有限的安全概率之上,就可以了、、
#include<iostream> using namespace std; int max(int x,int y) { return x>y?x:y; } int main() { int bbs,n; double m,p[110]; double a[10010]; //安全系数 int s[110]; cin>>bbs; int i,j; while(bbs--) { cin>>m; m=1-m; cin>>n; int sum=0; for(i=0;i<n;i++) { cin>>s[i]; cin>>p[i]; p[i]=1-p[i];//没被抓的概率 sum+=s[i]; } for(i=0;i<=sum;i++) { a[i]=0; } a[0]=1;//没抢的时候 for(i=0;i<n;i++) { for(j=sum;j>=s[i];j--) { a[j]=max(a[j],a[j-s[i]]*p[i]); } } for(i=sum;i>=0;i--) { if(a[i]-m>0.000000001) { cout<<i<<endl; break; } } } return 0; }