【概率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

INPUTOUTPUT
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, then the 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 has only option, just to rob rank 2.


AC代码

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

struct Node 
{
  int w;
  double p;
}rec[104];

double dp[11000];

int main() 
{
  int k = 1, T, V, n, i, j;
  double P;
  scanf("%d", &T);
  while (T--) 
  {
    scanf("%lf %d", &P, &n);
    P = 1 - P, V = 0;
    for (i = 0; i < n; i++) 
    {
      scanf("%d %lf", &rec[i].w, &rec[i].p);
      rec[i].p = 1 - rec[i].p, V += rec[i].w;
    }
    memset(dp, 0, sizeof(dp));
    dp[0] = 1;
    for (i = 0; i < n; i++) 
    {
      for (j = V; j >= rec[i].w; j--) 
      {
        dp[j] = max(dp[j], dp[j - rec[i].w] * rec[i].p);
      }
    }
    for (i = V; i >= 0; i--) 
    {
      if (dp[i] >= P) 
      {
        printf("Case %d: %d\n", k++, i);
        break;
      }
    }
  }
  return 0;
}

 

点赞

发表评论

电子邮件地址不会被公开。必填项已用 * 标注

13 + 3 =