Robberies

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

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 
   
 
  
 
  

      
  
 
  
 
  

    Source 
  
 
  
 
   IDI Open 2009  
  
 
  

      
  
 
  
 
  

    Recommend 
  
 
  

    gaojie 
   
 
   
 
   
 解题思路：本题为动态规划题目，用01背包即可解得。
      动态规划的通用公式都是用来求最大值的，题目要求的是被抓住的可能性最小值小于p，可以转换成求不被抓住得可能性大于1-p。
      转换思维，概率不是精度为2的小数，别想着用概率来做dp数组下标。以每个银行为一个物品，以所有的钱的总数为背包大小，以安全值为物品价值（这里是要相乘的）
      对于动态转移方程：dp[j]=max(dp[j-m[i]]*pi[i],dp[j])，
 原型为： 
   dp[i][j]=max(dp[i-1][j-m[i]]*pi[i],dp[i-1][j]),对于前i个银行，共偷了jm元，被抓得概率为1-dp[i][j]。用滚动数组，节约内存。
 
   
 
   
 
   
#include<stdio.h> #include<string.h> double dp[10002]; int main() {     int t;     int n;     double p;     int m[102];     double pi[102];     int i,j;     scanf("%d",&t);     while(t--)     {         int sum=0;         scanf("%lf%d",&p,&n);         p=1-p;   //存储安全性         for(i=0;i<n;i++)             scanf("%d%lf",&m[i],&pi[i]),sum+=m[i],pi[i]=1-pi[i];   //存储安全性         for(i=1;i<=sum;i++)             dp[i]=0;         dp[0]=1;         for(i=0;i<n;i++)   //对于前i个银行，一共偷了jm元，被抓的最大概率为1-p[j]             for(j=sum;j>=m[i];j--)                 if(dp[j-m[i]]*pi[i]>dp[j])                     dp[j]=dp[j-m[i]]*pi[i];         for(i=sum;i>=0;i--)             if(dp[i]>=p)             {                  printf("%d\n",i);                  break;             }     }     return 0; }