Light OJ-----1097 01背包dp

1079 - Just another Robbery

PDF (English)

Statistics

Forum

Time Limit: 4 second(s)

Memory Limit: 32 MB

As Harry Potter series is over, Harry has no job. Since hewants to make quick money, (he wants everything quick!) so he decided to robbanks. He wants to make a calculated risk, and grab as much money as possible. Buthis friends - Hermione and Ron have decided upon a tolerable probability Pof getting caught. They feel that he is safe enough if the banks he robstogether give a probability less than P.

Input

Input starts with an integer T (≤ 100),denoting the number of test cases.

Each case contains a real number P, the probability Harryneeds to be below, and an integer N (0 < N ≤ 100), the numberof banks he has plans for. Then follow N lines, where line jgives an integer M_j (0 < M_j ≤ 100) and areal number P_j . Bank j contains M_jmillions, and the probability of getting caught from robbing it is P_j.A bank goes bankrupt if it is robbed, and you may assume that all probabilitiesare independent as the police have very low funds.

Output

For each case, print the case number and the maximum numberof millions he can expect to get while the probability of getting caught isless than P.

Sample Input	Output for 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	Case 1: 2 Case 2: 4 Case 3: 6

Note

For the first case, if he wants to rob bank 1 and 2, thenthe probability of getting caught is 0.02 + (1 - 0.02) * .03 = 0.0494which is greater than the given probability (0.04). That's why he hasonly option, just to rob rank 2

输入n个银行的钱和被抓的概率，问最多抢多少钱

dp[i]表示抢劫i金币，逃脱的最大概率

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<map>
#include<queue>
#include<algorithm>
#include<cmath>
#include<vector>
#define PI acos(-1.0)
#define INF 0x3f3f3f3f
#define DL(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long LL;
const int maxn = 1e5+10;
typedef struct{
    int val;
    double rel;
} node;
node bak[maxn];
double dp[maxn];
int main(){
    int t, k, ans, kcase = 1;
    double res;
    scanf("%d", &t);
    while(t--){
        ans = 0;
        scanf("%lf%d", &res, &k);
        for(int i = 0; i < k; i++){
            scanf("%d%lf", &bak[i].val, &bak[i].rel);
            ans += bak[i].val;
        }
        for(int i = 0; i <= ans; i++) dp[i] = 0;
        dp[0] = 1;
        for(int i = 0; i < k; i++){
            for(int j = ans; j >= bak[i].val; j--){
                if(dp[j-bak[i].val]) {
                    dp[j] = max(dp[j], dp[j-bak[i].val]*(1-bak[i].rel));
                }
            }
        }
        for(int i = ans; i >= 0; i--){
            if(res >= 1-dp[i]) {
                printf("Case %d: %d\n", kcase++, i);
                break;
            }
        }
    }
    return 0;
}