hdu 2955(01背包问题)Robberies
来源:互联网 发布:win10网络图标不能启用 编辑:程序博客网 时间:2024/05/17 06:06
Robberies
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 22509 Accepted Submission(s): 8317
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.
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 .
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.
Sample Input
3
0.04 3
1 0.02
2 0.03
3 0.05
0.06 3
2 0.03
2 0.03
3 0.05
0.10 3
1 0.03
2 0.02
3 0.05
Sample Output
2
4
6
Source
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 22509 Accepted Submission(s): 8317
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.
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 .
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.
Sample Input
3
0.04 3
1 0.02
2 0.03
3 0.05
0.06 3
2 0.03
2 0.03
3 0.05
0.10 3
1 0.03
2 0.02
3 0.05
Sample Output
2
4
6
Source
IDI Open 2009
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cstdlib>using namespace std;double dp[10005];double w[105];int v[105];int main(){ int n,t; double p; cin>>t; while(t--) { memset(dp,0,sizeof(dp)); int sum=0; cin>>p>>n; p=1.0-p; for(int i=0;i<n;i++) { cin>>v[i]>>w[i]; w[i]=1.0-w[i]; sum+=v[i]; } dp[0]=1.0; for(int i=0;i<n;i++) for(int j=sum;j>=v[i];j--) dp[j]=max(dp[j],dp[j-v[i]]*w[i]); for(int i=sum;i>=0;i--) if(dp[i]>p) { cout<<i<<endl; break; } } return 0;}
0 0
- hdu 2955 Robberies 01背包问题
- [HDU 2955] Robberies (01背包问题)
- HDU 2955 Robberies(01背包问题)
- hdu 2955 Robberies 01背包问题
- hdu 2955(01背包问题)Robberies
- HDU 2955 Robberies(01背包问题)
- 【HDU 2955】【背包问题】Robberies
- Robberies+hdu+01背包问题
- 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背包
- 乐观锁、悲观锁、共享锁、排它锁
- 改写sort函数,使其执行按大到小排列
- 三天打鱼两天晒网
- 六.服务器硬件优化
- python hmmlearn 安装出错 Unable to find vcvarsall.bat
- hdu 2955(01背包问题)Robberies
- hive内部表与外部表区别详细介绍
- HTTP中Get与Post的区别
- 滑块: 基于Bootstrap的jQuery slider插件的使用bootstrap-slider.js
- win10系统 dshow 调用失效修复案例
- 透明Activity(Android)
- 【技巧】多行label AutoLayout 自适应高度。
- RESTful API的良好设计
- 问题记录:virsh start error:cannot get interface MTU on 'qbrXXX':No such device