HDU 2955 01背包（思维）

Robberies

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 15649    Accepted Submission(s): 5747

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

 

题目意思：
一个人去抢劫n个银行，初始给一个概率p，每个银行有能抢劫的价值和被抓住的概率，当抢劫银行被抓住的总概率小于p的时候认为这个人是安全的，求在安全状态下能抢劫到最多得价值。

 

思路：
若以被抓概率为体积、价值为价值，概率是浮点数无法作为数组下标，不可取。

若以价值为体积、被抓概率为价值，而背包的定义是体积一定时获得最多得价值和使得被抓概率尽可能小相反，不可取。

若以价值为体积、不被抓概率为价值，使得不被抓概率尽可能高，可取。

 

代码：

 1 #include <cstdio>
 2 #include <cstring>
 3 #include <algorithm>
 4 #include <iostream>
 5 #include <vector>
 6 #include <queue>
 7 #include <cmath>
 8 #include <set>
 9 using namespace std;
10 
11 #define N 105
12 
13 int max(int x,int y){return x>y?x:y;}
14 int min(int x,int y){return x<y?x:y;}
15 int abs(int x,int y){return x<0?-x:x;}
16 
17 int n;
18 int v[N];
19 double val[N];
20 double dp[N*N]; 
21 int V;
22 
23 main()
24 {
25     int i, j, k;
26     int t;
27     cin>>t;
28     while(t--){
29         double vv;
30         scanf("%lf %d",&vv,&n);
31         V=0;
32         for(i=1;i<=n;i++) {
33             scanf("%d %lf",&v[i],&val[i]);
34             val[i]=1.0-val[i];
35             V+=v[i];
36         }
37         memset(dp,0,sizeof(dp));
38         dp[0]=1;
39         for(i=1;i<=n;i++){
40             for(j=V;j>=v[i];j--) 
41                 dp[j]=max(dp[j],dp[j-v[i]]*val[i]);
42         }
43         for(i=V;i>=0;i--){
44             if(dp[i]>=1-vv) break;
45         }
46         if(i<0) printf("0\n");
47         else
48         printf("%d\n",i);
49     }
50 }

 

转载于:https://www.cnblogs.com/qq1012662902/p/4648606.html