Robberies(2955)
来源:互联网 发布:好用的c语言编译器 编辑:程序博客网 时间:2024/06/05 05:21
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
0-1背包
#include <cstdio>#include <cstring>#include <cmath>#include <cstdlib>#include <cctype>#include <iostream>#include <algorithm>#include <vector>#include <stack>#include <deque>#include <queue>#include <set>#include <list> #include <map> #include <string>using namespace std; #define infinity 2147483647 double dp[10005],w[10005]; int v[10005];double maxx(double a,double b){if(a>b)return a;elsereturn b;}int main(){int n,i,j,t,sum;double m;while(scanf("%d",&t)!=EOF){while(t--){scanf("%lf %d",&m,&n);sum=0;for(i=1;i<=n;i++){scanf("%d %lf",&v[i],&w[i]);w[i]=1-w[i];sum+=v[i];}memset(dp,0,sizeof(dp));dp[0]=1;for(i=1;i<=n;i++){for(j=sum;j>=v[i];j--){dp[j]=maxx(dp[j],dp[j-v[i]]*w[i]);}}for(i=sum;i>=0;i--){if(dp[i]>=1-m){cout <<i <<endl;break;}}}}return 0;}
0 0
- Robberies(2955)
- HDU 2955(Robberies)
- Robberies(HDU-2955)
- HDU 2955 Robberies(dp)
- 2955 Robberies
- 2955 Robberies
- 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
- HSU 2955 Robberies(01背包)
- hdu 2955 Robberies (DP:背包)
- HDU 2955 Robberies(01背包变型)
- HDU 5387 Clock
- iOS开发 -- iPhone手机屏幕尺寸
- android常用组件之TextView组件
- 欢迎使用CSDN-markdown编辑器
- c++类的成员变量的初始化顺序
- Robberies(2955)
- 你的代码很烂
- hadoop1.2.1集群增加datanode节点
- Laravel每日一记
- HTML5简介
- 没有永不过时的解决方案
- iGrimace IG 1.44 V3 正版苹果ios 陌陌微信遇见Uber 优步 积分墙 igrimac3.0.0高级版
- 黑马程序员——多线程1
- C# 配置文件的使用