/*
* 水题,狀態:dp[i] 表示偷了i的金錢而不被捉的概率
* 狀態轉移方程:dp[i] = max(dp[i], dp[i-cost[i]]*rate[i])
* 其中rate[i]表示偷第i個金錢不讓捉的概率
* ans就是從max數起第一個大於問題所給的rate的
* Water title, status: dp [i] stole the probability of i's money not caught
* State transition equation: dp [i] = max (dp [i], dp [i-cost [i]] * rate [i])
* Which rate [i] represents the probability steal money not to catch the i-th
* Ans is the first from the max number greater than the rate of the problem to
*/
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
#define MAXN 10001
int each_cost[MAXN];
double dp[MAXN], each_rate[MAXN];
int zero_one_knapsack(int n, int max_v, double escape_rate)
{
memset(dp, 0, sizeof(dp));
dp[0] = 1;
for(int i = 0; i < n; i ++) {
for(int v = max_v; v >= each_cost[i]; v --) {
dp[v] = max(dp[v], dp[v-each_cost[i]]*each_rate[i]);
}
}
for(int i = max_v; i >= 0; i --) {
if( dp[i] >= escape_rate ) {
return i;
}
}
}
int main(int argc, char const *argv[])
{
#ifndef ONLINE_JUDGE
freopen("test.in", "r", stdin);
#endif
int cas, n, sum;
double catch_rate;
scanf("%d", &cas);
while( cas -- ) {
sum = 0;
scanf("%lf %d", &catch_rate, &n);
for(int i = 0; i < n; i ++) {
scanf("%d %lf", &each_cost[i], &each_rate[i]);
each_rate[i] = 1-each_rate[i];
sum += each_cost[i];
}
printf("%d\n", zero_one_knapsack(n, sum, 1-catch_rate));
}
return 0;
}
hdu_2955
最新推荐文章于 2021-08-08 21:00:03 发布