hdu 2955 Robberies
来源:互联网 发布:手机图片搜索软件 编辑:程序博客网 时间:2024/06/05 03:10
Robberies
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 22320 Accepted Submission(s): 8250
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<iostream>#include<string>#include<map>#include<string.h>#include<math.h>#include<memory.h>#include<algorithm> using namespace std;//题目大意是说:一个强盗在被抓概率不高于p下去抢劫n个银行 给你抢劫的每个银行的金额和被抓的概率,//求抢劫的最大金额 //在低于1-p不被抓的概 int main(){int num;cin>>num;while(num--){double p,w[200],dp[100001];int n,cost[200],i,j,sum=0;cin>>p>>n;p=1-p;//逃跑的概率 memset(dp,0,sizeof(dp)); for(i=0;i<n;i++) { cin>>cost[i]>>w[i]; sum+=cost[i];//总钱数 w[i]=1-w[i];//每个银行逃跑的概率 }dp[0]=1.0;for(i=0;i<n;i++) for(j=sum;j>=cost[i];j--) { dp[j]=max(dp[j],dp[j-cost[i]]*w[i]); } for(i=sum;i>=0;i--){if(dp[i]>p)//大于逃跑的概率被抓 { cout<<i<<endl;break;}}}}//被抓概率 不被抓概率 //0.04 3 0.96 3 //1 0.02 1 0.98//2 0.03 2 0.97//3 0.05 3 0.95// 0 1 2 3 4 5 6// 1 2 3//dp 1 0.98 0 0 0 0 0 0//i=0 v[0]=1 1
1 0
- hdu 2955 Robberies
- HDU 2955 - Robberies
- hdu 2955 Robberies DP
- Hdu 2955 - Robberies
- hdu 2955 Robberies
- hdu 2955 Robberies
- hdu 2955 Robberies
- hdu 2955 Robberies
- HDU 2955 Robberies
- hdu 2955 Robberies
- hdu 2955(Robberies)
- hdu 2955 Robberies
- HDU 2955 Robberies
- hdu 2955 Robberies
- hdu 2955 Robberies
- hdu-2955-Robberies
- hdu 2955 Robberies
- HDU:2955 Robberies
- Jquery——Day2(基础事件)
- 编码与解码-UVA
- servlet纲要
- java基础学习--------第三章流程控制
- 回溯算法的使用
- hdu 2955 Robberies
- shell(2)脚本执行方式
- 深度神经网络(DNN)模型与前向传播算法
- maven项目打包发布时跳过测试
- USACO 2013open :yinyang(treap+启发式合并)
- 信息安全系统的组织管理
- Spring Cloud系列二 之 Ribbon负载均衡
- [LNMPA搭建二]PHP详细安装搭建
- BZOJ 4300 绝世好题