LightOJ 1079 Just another Robbery（概率DP）

Just another Robbery

As Harry Potter series is over, Harry has no job. Since he wants to make quick money, (he wants everything quick!) so he decided to rob banks. He wants to make a calculated risk, and grab as much money as possible. But his friends - Hermione and Ron have decided upon a tolerable probability P of getting caught. They feel that he is safe enough if the banks he robs together 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 Harry needs to be below, and an integer N (0 < N ≤ 100), the number of banks he has plans for. Then follow N lines, where line j gives an integer Mj (0 < Mj ≤ 100) and a real number Pj . Bank j contains Mj millions, and the probability of getting caught from robbing it is Pj. A bank goes bankrupt if it is robbed, and you may assume that all probabilities are independent as the police have very low funds.

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

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

Case 1: 2
Case 2: 4
Case 3: 6

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

题意
给出一个期望的概率$P$,和银行数量$n$,再给出$n$个银行的金额和被抓住的概率$p_i$,并且$p_i$是相互独立的。求在低于$P$的情况下能抢劫的最大金额

题解
概率，01背包
$dp[i]$表示抢劫金额为$i$时安全的概率，因此我们在输入时将被抓捕的概率转换为安全的概率
状态转移方程：$dp[i]=max(dp[i],dp[i-w[i]]\ast p[i])$

代码

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <cmath>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <cmath>

using namespace std;
#define me(x,y) memset(x,y,sizeof x)
#define MIN(x,y) x < y ? x : y
#define MAX(x,y) x > y ? x : y
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e4+10;
const ll INF = 0x3f3f3f3f;
const int MOD = 998244353;
const double eps = 1e-06;
const double PI = acos(-1);




int main(){
    int t;
    cin>>t;
    double dp[maxn],p[maxn];
    int w[maxn];
    for(int ca = 1; ca <= t; ++ca){
        double P;
        me(dp,0);
        int n;
        int sum = 0;
        cin>>P>>n;
        P = 1-P;
        for(int i = 1;i <= n; ++i){
            scanf("%d%lf",&w[i],&p[i]);
            p[i] = 1-p[i];
            sum += w[i];
        }
        dp[0] = 1;
        for(int i = 1; i <= n; ++i){
            for(int j = sum; j >= w[i]; --j){
                dp[j] = max(dp[j],dp[j-w[i]]*p[i]);
            }
        }
        int mx = 0;
        for(int i = 1; i <= sum; ++i){
            if(dp[i] > P) mx = i;
        }
        printf("Case %d: %d\n",ca,mx);
    }
    return 0;
}


/*


*/