LightOJ - 1079 Just another Robbery（期望&概率DP）

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.

题意：

现在有n个银行可以打劫，每个银行被抓到的概率是p[i]，可以抢到的资金是v[i]，抢每个银行的时间都是独立的，Harry 他可以接受的被抓概率是一个值，pp，问你在不被抓住的概率下，他最多可以抢到多少钱

思路：

因为每个时间都是独立的，所以可以把银行的资金当成背包容量，概率当成价值，每次选择i银行的概率都是(1 - p[i])，f[i][j]代表抢劫前i个银行并且获得j金币的概率，直接转移就可以了。因为精度问题，判断不能直接<=pp，要加上一个eps，eps我设的1e-9

代码：

double p[109];
int v[109];
double f[199][10050];
int main()
{
//    cout << cmp(1.00009,1.00009) << endl;
    int cas = 1;
    int t; cin >> t;
    while(t--){
        double pp;
        cin >> pp >> n;
        for(int i = 1;i <= n;i++)  cin >> v[i] >> p[i];
        MS0(f);
        f[0][0] = 1;
        int ans = 0;
        for(int i = 1;i <= n;i++){
            for(int j = 0;j <= 10000;j++){
                if(j >= v[i]){
                    f[i][j] = max(f[i - 1][j],f[i - 1][j - v[i]] * (1.0 - p[i])); 
                }else f[i][j] = f[i - 1][j]; 
                if((1.00 - f[i][j]) + eps <= pp ) ans = max(ans,j);
            } 
        } 
        printf("Case %d: %d\n",cas++,ans);
    }
    return 0;
}