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
Inputcopy | Outputcopy |
---|---|
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 | 2 4 6
|
思路:
在一开始很自然的想到以概率为背包,但是概率为小数,在尝试了小数转整数无果后,通过网上查阅题解发现这是个01背包的变形题,需要将钱当做背包,将被抓概率变为安全概率,去得到不同的钱对应的概率,最后去看符合条件的概率对应的是多少钱。每偷一次,安全概率都会变小。
代码如下:
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int t;
double P;
int N;
int m[105];
double p[105];
double dp[10050]; // 注意这里dp数组的范围是根据背包大小开的,本题背包大小为100 * 100左右
int sum;
int main() {
ios::sync_with_stdio(false);
cout.tie(nullptr);
cin >> t;
while(t --) {
memset(dp, 0, sizeof dp);
sum = 0; // 每次都要初始化sum 和 dp数组
cin >> P >> N;
for(int i = 1; i <= N; i ++) {
cin >> m[i] >> p[i];
p[i] = 1 - p[i]; // 求安全概率
sum += m[i]; // sum 是背包大小
}
dp[0] = 1; // 这里的初始化不能少,因为不是默认的0,而是 1
for(int i = 1; i <= N; i ++) {
for(int j = sum; j >= m[i]; j --) { // 压缩后的一维dp数组必须反向遍历
// 因为 j - m[i] >= 0, 所以 j >= m[i], 减少遍历次数
dp[j] = max(dp[j], dp[j - m[i]] * p[i]);
}
}
for(int i = sum; i >= 0; i --) {
if(dp[i] >= 1 - P) { // 查询在安全概率内能偷的最多的价值
cout << i << "\n";
break;
}
}
}
return 0;
}