Robberies(HDU-2955)
来源:互联网 发布:mplayerx for mac破解 编辑:程序博客网 时间:2024/06/18 17:51
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.
![](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.
![](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.
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
题意:小偷偷银行,不能重复的偷,t个测试数列,然后输入能接受的风险p,和n家银行,每家银行都有资金和被抓概率,问最多能偷多少钱;
思路:01背包,这有一个坑,概率,连续偷不被抓的概率是相乘的,而且我们要用的是不被抓的概率,所以这个是
dp[j]=max(dp[j],dp[j-a[i]]*(1-b[i]));
#include<iostream>#include<cstring.>#include<cstdio>using namespace std;int t,m,n,a[105];double p,b[105],dp[10005];int main(){ scanf("%d",&t); while(t--) { m=0; scanf("%lf%d",&p,&n); for(int i=0; i<n; i++) { scanf("%d%lf",&a[i],&b[i]); m+=a[i]; } for(int i=0; i<=m; i++) { dp[i]=0.0; } dp[0]=1.0; for(int i=0; i<n; i++) { for(int j=m; j>=a[i]; j--) { dp[j]=max(dp[j],dp[j-a[i]]*(1-b[i])); } } for(int i=m; i>=0; i--) { if(dp[i]>=(1-p)) { printf("%d\n",i); break; } } } return 0;}
阅读全文
0 0
- HDU 2955(Robberies)
- Robberies(HDU-2955)
- HDU 2955 Robberies(dp)
- hdu 2955 Robberies(01背包)
- hdu 2955 Robberies(01背包)
- HDU 2955 Robberies (10背包改编)
- hdu 2955 Robberies(01背包)
- hdu 2955 Robberies(01背包)
- hdu 2955 Robberies(01背包)
- HDU 2955 Robberies(0-1 DP)
- HDU 2955 Robberies (01背包)
- hdu-2955(01背包)Robberies
- hdu 2955 Robberies (DP:背包)
- HDU 2955 Robberies(01背包变型)
- HDU 2955 Robberies (01背包)
- HDU 2955 Robberies(01背包)
- HDU 2955 Robberies (01背包)
- hdu 2955 Robberies(0/1背包)
- 社交礼仪(二)
- java.lang.ClassNotFoundException: org.springframework.web.context.ContextLoaderListener at org.a
- 【POJ3254】Corn Fields Java实现代码
- WebService的CXF框架整合Spring
- iOS面试题2017
- Robberies(HDU-2955)
- 一张图说明CDN网络的原理
- Kotlin 安卓开发
- 使用 grep 的 -o 和 -E 选项进行正则的精确匹配
- FE Basic
- Hibernate并发控制乐观锁实现——Version
- 级联菜单下拉的实现
- c++数组指针动态开辟
- git 操作