厚度2955
来源:互联网 发布:淘宝上如何买呼死你 编辑:程序博客网 时间:2024/05/17 05:02
Robberies
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3367 Accepted Submission(s): 1251
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.
#include <stdio.h>#include <string.h>#include <iostream>using namespace std;struct BANK{ int money; double risk;}bank[105];double dp[10009];//dp[j] rob money j,the risk of not being caught is dp[j]double MAX(double a,double b){ if (a > b) return a; return b;}int main(){ int T,N; double P; cin>>T; while (T--) { int sum=0; scanf("%lf %d",&P,&N); for (int i=1;i<=N;i++) { cin>>bank[i].money>>bank[i].risk; sum+=bank[i].money; } P=1-P;//means security for (int i=0;i<=sum;i++) dp[i]=0; dp[0]=1; for (int i=1;i<=N;i++) { for (int j=sum; j>=bank[i].money;j--) { dp[j]=MAX(dp[j],dp[j-bank[i].money]*(1-bank[i].risk)); } } for (int i=sum;i>=0;i--) { if (dp[i] >= P) { printf("%d\n",i); break; } } }}
- 厚度2955
- 喷涂厚度
- 嘉立创四层板各层厚度
- 纸张厚度一览表
- 折纸的厚度
- 积累一些厚度
- 厚度1207 汉诺塔II
- 买袜子厚度选择
- Altium Designer -- 查看板子厚度
- 基于PARASOL的气溶胶光学厚度反演
- 30岁,为生命积累厚度
- pc板厚度的正确辨别
- zemax 序列模式下负厚度解释
- 上下点激光计算物体厚度
- 电流与铜厚度和宽度的关系
- PCB设计铜箔厚度、线宽和电流关系
- PCB设计铜铂厚度、线宽和电流关系表
- 为你的生命多积累一些厚度 - 作者:杨毅
- 创建桌面图标
- js:单选框选择触发事件
- JSP URL中文传递出现乱码解决
- DZ修改标题字数限制:Discuz X2.0 如何修改帖子标题字数限制
- 五周 三角形类
- 厚度2955
- TCP技术分享第二部分
- /bin/cat: Argument list too long
- 对javascript原型、this、new function的测试和理解
- PS
- 【译】详解Asp.net MVC DropDownLists
- dos指令学习
- [stackoverflow转载翻译练习]How to use a Bind maps as a web service?
- Servlet上传文件打水印生成缩略图全攻略(转载)