Robberies

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

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

 1 #include<stdio.h>
 2 #include<string.h>
 3 int main()
 4 {
 5     int v[10001];
 6     double f[10001],w[10001];
 7     int i,j,n,m;
 8     int T;
 9     scanf("%d",&T);
10     while(T--)
11     {
12         double rate;
13         int sum=0;
14         scanf("%lf %d",&rate,&n);//rate被抓的概率，1-rate逃脱的概率
15         for(i=0;i<n;i++)
16         {
17             scanf("%d %lf",&v[i],&w[i]);
18             sum+=v[i];
19         }
20         memset(f,0,sizeof(f));
21         f[0]=1;//没偷逃脱的概率为1
22         for(i=0;i<n;i++)
23         {
24             for(j=sum;j>=v[i];j--)
25             {
26                 f[j]=f[j]>f[j-v[i]]*(1-w[i])?f[j]:f[j-v[i]]*(1-w[i]);//选择最大逃脱概率
27             }
28         }
29         for(i=sum;i>=0;i--)
30         {
31             if(f[i]>=1-rate)
32             {
33             printf("%d\n",i);
34             break;
35            }
36         }
37     }
38     return 0;
39 }

View Code

HDOJ 2955 Robberies (01背包)相关推荐

HDOJ 2955 Robberies
类似01背包的DP Robberies Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Othe ...
HDU - Robberies(01背包)
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2955 Time Limit: 2000/1000 MS (Java/Others) Memory Li ...
HDOJ2955 Robberies(01背包，概率)
http://acm.hdu.edu.cn/showproblem.php?pid=2955 这道DP题WA了. 今天看了一下,WA在了double max(int x,int y)上,x和y都应该是 ...
暑假N天乐 —— 01背包及变形
暑假集训的第一天第二天了. 决定还是先把基础巩固一下好了,万一后面训练赛出事故更尴尬. 所以今天的主题是 -- 01背包及变形动态规划概念动态规划(Dynamic programming,DP) ...
HDU 2955 Robberies（概率DP，01背包）题解
题意:给出规定的最高被抓概率m,银行数量n,然后给出每个银行被抓概率和钱,问你不超过m最多能拿多少钱思路:一道好像能直接01背包的题,但是有些不同.按照以往的逻辑,dp[i]都是代表i代价能拿的最高 ...
hdu 2955 01背包
http://acm.hdu.edu.cn/showproblem.php?pid=2955 如果认为:1-P是背包的容量,n是物品的个数,sum是所有物品的总价值,条件就是装入背包的物品的体积和不能 ...
hdoj 1864 最大报销额【01背包】||【dfs】
最大报销额 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Subm ...
01背包经典例题详解
转载自点击打开链接首先01背包题目的雏形是有N件物品和一个容量为V的背包.第i件物品的费用是c[i],价值是w[i].求解将哪些物品装入背包可使价值总和最大. 从这个题目中可以看出,01背包的特点 ...
【背包专题】01背包
暑假集训开始了,按照队里的分配,我是弄DP的,嘛,于是我又一次的开始了从01背包开始学习,昨天将杭电的几道01背包重新做了一遍,下面讲讲我自己对于01背包的理解. 首先01背包题目的雏形是有N件物品 ...

HDOJ 2955 Robberies (01背包)

Robberies

HDOJ 2955 Robberies (01背包)相关推荐

最新文章

热门文章