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<stdio.h>
 2 #include<algorithm>
 3 #include<iostream>
 4 #include<stdlib.h>
 5 #include<queue>
 6 #include<string.h>
 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 }
时间: 2024-10-13 23:31:49

1079 - Just another Robbery的相关文章

[LightOJ 1079] Just another Robbery

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 friend

lightoj 1079 Just another Robbery 解题心得

原题: Description 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 - H

LightOJ 1079 Just another Robbery (01背包)

题意:给定一个人抢劫每个银行的被抓的概率和该银行的钱数,问你在他在不被抓的情况下,能抢劫的最多数量. 析:01背包,用钱数作背包容量,dp[j] = max(dp[j], dp[j-a[i] * (1.0 - pp[i])),dp[i] 表示不被抓的最大概率,在能抢劫到 i 个钱. 代码如下: #pragma comment(linker, "/STACK:1024000000,1024000000") #include <cstdio> #include <stri

LightOJ - 1079 Just another Robbery 概率 + dp

题目大意:harry要去抢劫银行,他手上有每个银行布局,所以他很清楚的了解到每个银行有多少钱,和去抢劫该银行被捕的概率 现在他要拟定一个计划,要求在被捕概率低于p的情况下,抢劫到最多的钱 解题思路:银行1个1个的抢过去,抢到的钱随着抢劫银行的数量增加或者不变(不变的情况就是不抢劫该银行),被捕的概率随着银行数量的增加而增大或者不变(不变的情况就是不抢劫该银行) 所以这个题有三个量在改变,一个是银行的数量,一个是抢到的钱,还有一个是被捕的概率 所以用二维dp来表示三个变量,设dp[i][j]表示抢

lightoj 1079 Just another Robbery 概率 背包

题目中给的都是被逮捕的概率p,并不方便计算,所以统统通过1-p,变成q,表示安全的概率. 然后这么多银行可以选择,有些类似背包问题.开始下意识认为应该是安全概率算体积,金钱算价值,更符合直观想法.但安全概率不是整数,这样子没法dp. 但是背包有个技巧,有时候体积可能是直观上的价值,我们不妨把金钱作为体积试试. dp[i][j]表示,考虑前i个银行,拿了j的金钱,的最大安全概率. dp[i][j] = max(dp[i - 1][j],dp[i - 1][j - v[i]] * q[i]),我们再

(概率 01背包) Just another Robbery -- LightOJ -- 1079

http://lightoj.com/volume_showproblem.php?problem=1079 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 r

Just another Robbery(背包)

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

Light OJ Dynamic Programming

免费做一样新 1004 - Monkey Banana Problem 号码塔 1005 - Rooks 排列 1013 - Love Calculator LCS变形 dp[i][j][k]对于第一个字符串i 到jLCS为k的方案数 1068 - Investigation 数位dp 能被K整数且各位数字之和也能被K整除的数 dp[i][j][k] 到第i位每位数字之和的余数为j 当前数字余数为k 1079 - Just another Robbery 01背包 全部钱之和为背包体积 不被抓的

BZOJ 1079: [SCOI2008]着色方案 记忆化搜索

1079: [SCOI2008]着色方案 Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://www.lydsy.com/JudgeOnline/problem.php?id=1079 Description 有n个木块排成一行,从左到右依次编号为1~n.你有k种颜色的油漆,其中第i种颜色的油漆足够涂ci个木块.所有油漆刚好足够涂满所有木块,即c1+c2+...+ck=n.相邻两个木块涂相同色显得很难看,所以你希望统计任意两个相邻木块颜色不同的