HDOJ 题目2955Robberies(01背包变形)
2014-08-29 16:07
435 查看
Total Submission(s): 12066 Accepted Submission(s): 4492
[align=left]Problem Description[/align]
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.
![](http://acm.hdu.edu.cn/data/images/con211-1010-1.jpg)
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.
[align=left]Input[/align]
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 .
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
2
4
6
[align=left]Source[/align]
IDI Open 2009
[align=left]Recommend[/align]
gaojie | We have carefully selected several similar problems for you: 2844 1864 1231 1505 2577
Robberies
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12066 Accepted Submission(s): 4492
[align=left]Problem Description[/align]
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.
![](http://acm.hdu.edu.cn/data/images/con211-1010-1.jpg)
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.
[align=left]Input[/align]
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 .
[align=left]Output[/align]
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.
[align=left]Sample Input[/align]
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
[align=left]Sample Output[/align]
2
4
6
[align=left]Source[/align]
IDI Open 2009
[align=left]Recommend[/align]
gaojie | We have carefully selected several similar problems for you: 2844 1864 1231 1505 2577
用成功逃走的概率当做价值!银行的总钱数当做背包容量!ad代码#include<stdio.h> #include<string.h> #define max(a,b) (a)>(b)?(a):(b) struct s { double w; int v; }; double dp[10100]; int main() { int t; scanf("%d",&t); while(t--) { double p; int n,i,j,sum=0; struct s b[1010]; scanf("%lf%d",&p,&n); p=1-p; for(i=0;i<n;i++) { scanf("%d%lf",&b[i].v,&b[i].w); sum+=b[i].v; } memset(dp,0,sizeof(dp)); dp[0]=1; for(i=0;i<n;i++) { for(j=sum;j>=b[i].w;j--) { dp[j]=max(dp[j],dp[j-b[i].v]*(1-b[i].w)); } } for(i=sum;i>=0;i--) { if(dp[i]>=p) break; } printf("%d\n",i); } } |
相关文章推荐
- HDOJ 题目2126Buy the souvenirs(01背包变形,求种类)
- HDOJ 题目5501 The Highest Mark(贪心+01背包变形)
- hdoj 1203 01背包变形
- HDOJ 题目1059 Dividing 多重背包转化成01背包 2进制转化
- HDOJ 题目5188 zhx and contest(01背包,限制)
- 【动态规划】【01背包变形】HDOJ 2037 今年暑假不AC
- hdoj 2955 01背包变形+简单的概率论
- NYOJ 题目860 又见01背包(01背包变形)
- 又见01背包——南阳理工题库(背包问题变形)
- POJ 2184 Cow Exhibition 01 背包变形
- HDU2639 Bone Collector II(01背包变形)
- Divisible Group Sums LightOJ - 1125 变形01背包
- hdoj1171 Big Event in HDU(01背包 || 多重背包)
- 01背包——HDOJ2602拾骨者
- ZOJ 3956 Course Selection System(01背包变形)
- Hdu 3236 Gift Hunting(01背包变形)
- nyoj860 又见01背包(背包变形)
- HDU - 3466 Proud Merchants (01背包的变形 + 贪心)
- 01背包——HDOJ 2955
- 01背包变形--求方案数