Robberies

Robberies

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6352    Accepted Submission(s): 2372

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.

 

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 .

 

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.

 

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
  
  

本题是比较典型的背包问题！！！

但需要转换一下。

因为被逮住的概率是浮点数！！

不妨令d[i]表示偷取i数目的钱而不被逮住的最大概率！！！

必须把输入的逮住的概率转换成不被逮住的概率否则无法直接向城

此题用的是乘法规则！！！！！而不是简单的概率相加！！！

所以：

d[i] = max{d[i],d[i-b[j].money]*(1-b[j].pro)}

//点击打开链接

#include <stdio.h>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <stdlib.h>
#include <vector>
using namespace std;
struct bank
{
    int money;
    double pro;
}b[110];
double d[10010];
int main()
{
    int t;
    scanf("%d",&t);
    for(int k = 0;k<t;++k)
    {
        int N;
        double P;
        scanf("%lf%d",&P,&N);
        P = 1- P;
        int sum = 0;
        for(int i = 1;i<=N;++i)
        {
            scanf("%d%lf",&b[i].money,&b[i].pro);
            sum+=b[i].money;
        }
        memset(d,0,sizeof(d));
        d[0] = 1;
        for(int i = 1;i<=N;++i)
          for(int j = sum;j>=b[i].money;--j)
              d[j] = max(d[j],d[j - b[i].money]*(1-b[i].pro));
        for(int j = sum;j>=0;--j)
        if(d[j] - P>1e-9 )
        {
            printf("%d\n",j);
            break;
        }
    }
}