Robberies

01背包

http://acm.hdu.edu.cn/showproblem.php?pid=2955

Robberies

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

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
  
  

 

这一题是说要在0，p之间的概率可以逃跑，但是全部乘起来那个数好小好小，至于为什么是乘，我也不太清楚，多么痛的领悟。

p=1-p的话那么p-1之间就是可以逃跑的概率，dp[i][j]表示选前i个银行抢到的钱为j的最大的逃跑概率（不转还要改模板），后面晒一遍找到第一个大于等于1-p的即为ans

//dp500-10
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <string>
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define LL long long
using namespace std;
const int SIZE=1e4+10;
double dp[SIZE],w[110];
int c[110];
void Zero_One_Pack(int c,double w,int sum){
    for(int i=sum;i>=c;i--){
        dp[i]=max(dp[i],dp[i-c]*(1-w));
    }
}
int main()
{
    int T,n;
    double p;
    scanf("%d",&T);
    for(int cas=1;cas<=T;cas++){
        memset(dp,0,sizeof(dp));
        int sum=0;
        scanf("%lf%d",&p,&n);
        for(int i=0;i<n;i++){
            scanf("%d%lf",&c[i],&w[i]);
            sum+=c[i];
        }
        dp[0]=1;
        for(int i=0;i<n;i++)
            Zero_One_Pack(c[i],w[i],sum);
        while(dp[sum]<1-p)sum--;
        printf("%d\n",sum);
    }
}