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 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

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, 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.

---

Problem Setter: Jane Alam Jan

思路：01背包；

被抓的概率不容易求，那么转变为不被抓的概率，去求，然后因为钱的范围不大，所以按钱来做一个01背包。

1 #include
2 #include
3 #include
4 #include
5 #include
6 #include
7 using namespace std;
8 typedef struct node
9 {
10 int cost;
11 double pr;
12 } ss;
13 ss ans[105];
14 double dp[10005];
15 int main(void)
16 {
17 int T;
18 scanf("%d",&T);
19 int __ca = 0;
20 double pi;
21 while(T--)
22 {
23 __ca++;
24 int n;int sum = 0;
25 scanf("%lf %d",&pi,&n);
26 int i,j;pi = 1-pi;
27 memset(dp,0,sizeof(dp));
28 for(i = 1; i <= n; i++) 29 { 30 scanf("%d %lf",&ans[i].cost,&ans[i].pr); 31 ans[i].pr = 1-ans[i].pr; 32 sum += ans[i].cost; 33 } 34 dp[0] = 1; 35 for(i = 1;i <= n;i++) 36 { 37 for(j = sum;j >= ans[i].cost; j--)
38 {
39 dp[j] = max(dp[j],dp[j-ans[i].cost]*ans[i].pr);
40 }
41 }
42 int ask = 0;
43 for(i = 1;i <= sum ;i++) 44 { 45 if(dp[i] >= pi)
46 {
47 ask = i;
48 }
49 }
50 printf("Case %d: %d\n",__ca,ask);
51 }
52 return 0;
53 }