Robberies (01背包问题)
来源:互联网 发布:圣诞节 知乎 编辑:程序博客网 时间:2024/06/06 01:28
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.
分析:被抓概率可以转换成安全的概率,他的安全概率在大于1-P时都是安全的。就是一个01背包的变种。抢劫的金额为0时,肯定是安全的,所以d[0]=1,其他金额初始为最危险的所以概率全为0。
注意:精度如果只是两位的话会WA,这题要注意精度问题
#include<iostream> #include<cstring> #include<algorithm>using namespace std;int main(){ int t,n,i,j,k,M,m[105]; double q[105],f[10005],p; scanf("%d",&t); while(t--) { M=0; memset(f,0,sizeof(f)); scanf("%lf %d",&p,&n); for(i=1;i<=n;i++) { cin>>m[i]>>q[i]; M=M+m[i]; } f[0]=1; for(i=1;i<=n;i++) { for(j=M;j>=m[i];j--) f[j]=max(f[j],f[j-m[i]]*(1-q[i])); //背包 } for(i=M;i>=0;i--) { if(f[i]>=1-p) { printf("%d\n",i); break; } } } }
- Robberies (01背包问题)
- HDU 2955 Robberies(01背包问题)
- HDU 2955 Robberies(01背包问题)
- Robberies(01背包的概率问题)
- Robberies(01背包)
- Robberies(01背包)
- Robberies(01背包)
- Robberies(背包01)
- Robberies+hdu+01背包问题
- hdu2955---Robberies(01背包)
- hdu2955 Robberies (01背包)
- hdu2955 Robberies(01背包)
- hdu2955 Robberies(01背包)
- hdu2955 Robberies(01背包)
- HDU 2955 Robberies(经典01背包概率问题)
- hdu 2955 Robberies 01背包问题
- [HDU 2955] Robberies (01背包问题)
- hdoj problem 2955 Robberies(01背包问题)
- String类的intern()方法详解
- Unity_血条的制作_056
- 转载:MySQL源码分析(1):主要模块及数据流
- 第二章、React-Native生命周期
- CircularAnim动画效果使用说明
- Robberies (01背包问题)
- 网络桥接与网络接口
- 使用集合arrayList的时候为什么用它的父类Collection
- 从程序员到CTO的Java技术路线图
- JVM运行时的内存模型
- 反射实现
- 【Java并发之】BlockingQueue
- 十种深蹲技巧
- oozie整理