hdu-2955-01背包-Robberies
来源:互联网 发布:期货程序化交易软件 编辑:程序博客网 时间:2024/05/01 22:25
Robberies
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 13554 Accepted Submission(s): 4989
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
Source
IDI Open 2009
//dp[i]表示偷i钱不被抓到的最大概率dp[i]=max{dp[j],dp[j-c[i]]*(1-w[i])}#include<stdio.h>#include<string.h>#include<vector>#include<algorithm>#include<iostream>using namespace std;int main(){ int T,N,i,m,c[105],sum,j; scanf("%d",&T); double P,p,w[105],dp[10050]; while(T--) { memset(dp,0,sizeof(dp)); sum=0; scanf("%lf%d",&P,&N); //表示小偷被抓到的概率应小于P,而不被抓到的概率应大于1-P for(i=0; i<N; i++) { scanf("%d%lf",&c[i],&w[i]); //w[i]为小偷被抓到的概率 sum+=c[i]; } dp[0]=1; for(i=0;i<N;i++) { for(j=sum;j>=c[i];j--) { dp[j]=dp[j]>dp[j-c[i]]*(1-w[i])?dp[j]:dp[j-c[i]]*(1-w[i]); } } for(i=sum;i>=0;i--) { if(dp[i]>=1-P) break; } printf("%d\n",i); } return 0;}
0 0
- hdu 2955 01 背包 Robberies
- hdu 2955 Robberies--01背包
- Hdu 2955 Robberies//01背包
- hdu 2955 Robberies (01背包)
- hdu 2955 Robberies 01背包
- HDU 2955 Robberies(01背包)
- HDU 2955 Robberies (01背包)
- hdu 2955 Robberies(01背包)
- hdu 2955 Robberies(01背包)
- hdu Robberies 2955 01背包
- HDU 2955 - Robberies(01 背包)
- HDU--2955--Robberies--01背包
- hdu-2955-01背包-Robberies
- HDU 2955 Robberies 01背包
- HDU 2955Robberies(01 背包)
- HDU - 2955 Robberies 01背包
- HDU-2955-Robberies【01背包】
- HDU 2955 Robberies 【01背包】
- Binary Tree Maximum Path Sum
- IOS DLNA PlatinumKit库的使用
- 怎样在log4j.xml配置文件中引入变量:小公司经验较多的我和阿里UC等大公司经验较多的Boss,一些技术交流和探讨
- hdu 2874 森林中处理最近公共祖先问题
- IOS DLNA开发(CyberLink和PlatinumKit)
- hdu-2955-01背包-Robberies
- unity重力感应控制摄像机旋转
- chrome谷歌翻译失败、谷歌应用商店打不开解决方法、谷歌ip大全
- The method setOnClickListener(View.OnClickListener) in the type View is not applicable for the argum
- 自定义adapter时getView多次重复调用的问题
- poi设置一个Excel单元格的内容为多种样式的方法
- KEIL MDK 查看代码量、RAM使用情况--RO-data、RW-data、ZI-data的解释
- Android 4.0 Camera架构分析之Camera初始化
- nusoap与php5自带soap扩展会产生冲突