hdoj 2955 Robberies 【0 1背包】
来源:互联网 发布:再生聚酯切片进口数据 编辑:程序博客网 时间:2024/06/04 20:09
Robberies
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17541 Accepted Submission(s): 6484
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.
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 .
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.
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
30.04 31 0.022 0.033 0.050.06 32 0.032 0.033 0.050.10 31 0.032 0.023 0.05
Sample Output
246
用金额做容量,用逃脱率做价值。
代码:
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int mon[110];double sum[100010],pro[110];int main(){int T;double p;int i,j,n,money;scanf("%d",&T);while(T--){scanf("%lf%d",&p,&n);p=1-p;//最低逃跑率; money=0;for(i=0;i<n;i++){scanf("%d%lf",&mon[i],&pro[i]);money+=mon[i];pro[i]=1-pro[i];}memset(sum,0,sizeof(sum));sum[0]=1;//没偷是逃跑率为1; for(i=0;i<n;i++){for(j=money;j>=mon[i];j--){sum[j]=max(sum[j],sum[j-mon[i]]*pro[i]);}}for(i=money;i>=0;i--){if(sum[i]>=p)//大于给定逃跑率的最大数; {printf("%d\n",i);break;}}}return 0;}
1 0
- HDOJ 2955Robberies(0 1 背包)
- HDOJ 2955 Robberies (0/1背包)
- hdoj 2955 Robberies 【0 1背包】
- HDOJ 2955 Robberies 【0 1背包】
- hdoj 2955Robberies<背包>
- hdoj 2955 Robberies【对立事件+0-1背包】
- HDOJ 2955 Robberies (01背包)
- HDOJ 2955 Robberies (01背包)
- hdoj 2955 Robberies 【01背包】
- hdoj problem 2955 Robberies(01背包问题)
- hdoj 2955 Robberies【01背包】【dp】
- hdoj 2955 Robberies 【dp&&01背包】
- hdoj--2955--Robberies(背包好题)
- HDOJ.2955 Robberies (01背包+概率问题)
- HDOJ Robberies 01背包
- hdu 2955 dp(0,1背包) Robberies
- hdu 2955 Robberies(0/1背包)
- hdu 2955 Robberies (0 1背包)
- 自定义view
- Android连接Tomcat服务器
- uploadifyJcrop
- JVM 垃圾收集器
- LinkedHashMap 源代码
- hdoj 2955 Robberies 【0 1背包】
- 福州大学有奖月赛2015.11C题(foj 2207)以撒的结合
- github 上初始化版本冲突
- nginx在windows下的运行
- Servlet的使用
- Game of Life 【leetcode】【98.9】【M】
- 学习笔记4-C语言数组和字符串
- JVM 部分命令
- CoordinatorLayout的使用