Robberies
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 27965 Accepted Submission(s): 10281
Problem Description
The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to work in the lucrative business of bank robbery only for a short while, before retiring to a comfortable job at a university.
For a few months now, Roy has been assessing the security of various banks and the amount of cash they hold. He wants to make a calculated risk, and grab as much money as possible.
His mother, Ola, has decided upon a tolerable probability of getting caught. She feels that he is safe enough if the banks he robs together give a probability less than this.
Input
The first line of input gives T, the number of cases. For each scenario, the first line of input gives a floating point number P, the probability Roy needs to be below, and an integer N, the number of banks he has plans for. Then follow N lines, where line j gives an integer Mj and a floating point number Pj .
Bank j contains Mj millions, and the probability of getting caught from robbing it is Pj .
Output
For each test case, output a line with the maximum number of millions he can expect to get while the probability of getting caught is less than the limit set.
Notes and Constraints
0 < T <= 100
0.0 <= P <= 1.0
0 < N <= 100
0 < Mj <= 100
0.0 <= Pj <= 1.0
A bank goes bankrupt if it is robbed, and you may assume that all probabilities are independent as the police have very low funds.
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
2
4
6
Source
IDI Open 2009
Recommend
gaojie | We have carefully selected several similar problems for you: 2602 1203 2159 2844 1171
本来以为是简单题,按着01背包的思路直接写,结果悲剧的WA…
网上翻了下资料才发现这里并没有说明被抓概率一定是精确到小数点后两位,意味着将概率放大映射到整数,作为“背包”中的体积,这样的做法是失败的。
所以得转变思路,既然是两个参数的背包问题,一个不能作为“体积”,那么用一个就好了。于是,这里用的是银行的资产(或者说被盗资产)作为“体积”,概率作为“价值”,注意,多个事件发生的概率应该是每个事件发生的概率相乘,这里如果直接用被抓概率,会越乘越小,抢的越多,怎么会被抓概率越小呢?所以,这里必须用安全逃跑的概率,就是1-被抓概率。
用dp[j]表示在总抢劫资产为j时的安全逃跑概率,当然是越高越好,转移方程是dp[j] = max(dp[j], dp[j - list[i].d] * list[i].f)
这里我还犯了一个错误,就是dp数组初始化的问题, 用max求取最大,那么整个数组初始化为0.0,但这样的话,一旦相乘就全部归0。最后才认识到,只要保留dp[0]=1
就好了,也很好理解,当没有抢劫的时候,自然安全逃跑概率为1
#include <iostream>
#include <vector>
using namespace std;
double dp[100000] = { 0.0 };
struct s{
int d;
double f;
};
double max(double a, double b){ return a > b ? a : b; }
int main(){
int t;
cin >> t;
while (t--){
double fp;
int n;
cin >> fp >> n;
fp = 1.0 - fp;
vector<s> list(n);
int sum = 0;
for (int i = 0; i < n; ++i){
cin >> list[i].d >> list[i].f;
sum += list[i].d;
list[i].f = 1.0 - list[i].f;
}
for (int i = 1; i <= sum; ++i)
dp[i] = 0.0;
dp[0] = 1.0;
for (int i = 0; i < n; ++i){
for (int j = sum; j >= list[i].d; --j){
dp[j] = max(dp[j], dp[j - list[i].d] * list[i].f);
}
}
for (int i = sum; i >= 0; --i)
if (dp[i] >= fp){
cout << i << endl;
break;
}
}
return 0;
}