HDU 2955 Robberies (01背包)
来源:互联网 发布:php程序员需要学什么 编辑:程序博客网 时间:2024/06/05 15:18
Robberies
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4852 Accepted Submission(s): 1844
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
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
简单题
:
#include<iostream>
#include<vector>
#include<cstdio>
#include<algorithm>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<string.h>
#include<queue>
using namespace std;
double dp[255555];
int v;
void ZOP(int cost,int wei)
{
for(int i=v;i>=cost;i--)
dp[i]=max(dp[i],dp[i-cost]+wei);
}
void CP(int cost,int wei)
{
for(int i=cost;i<=v;i++)
dp[i]=max(dp[i],dp[i-cost]+wei);
}
void MP(int cost,int wei,int cnt)
{
if(cost*cnt>=v)
{
CP(cost,wei);
return;
}
else
{
int k=1;
while(k<cnt)
{
ZOP(k*cost,k*wei);
cnt-=k;
k<<=1;
}
ZOP(cnt*cost,cnt*wei);
}
}
int main()
{
int t;
cin>>t;
while(t--)
{
memset(dp,0,sizeof(dp));
dp[0]=1;
int sum=0;
int g;
double safe;
cin>>safe>>g;
safe=1-safe;
int a[1001];
double b[1001];
for(int i=1;i<=g;i++)
{
cin>>a[i]>>b[i];
b[i]=1-b[i];
sum+=a[i];
}
v=sum;
for(int i=0;i<=g;i++)
{
for(int j=v;j>=a[i];j--)
dp[j]=max(dp[j],dp[j-a[i]]*b[i]);
}
for(int i=v;i>=0;i--)
{
if(dp[i]>safe)
{
cout<<i<<endl;
break;
}
}
}
return 0;
}
简单题
:
#include<iostream>
#include<vector>
#include<cstdio>
#include<algorithm>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<string.h>
#include<queue>
using namespace std;
double dp[255555];
int v;
void ZOP(int cost,int wei)
{
for(int i=v;i>=cost;i--)
dp[i]=max(dp[i],dp[i-cost]+wei);
}
void CP(int cost,int wei)
{
for(int i=cost;i<=v;i++)
dp[i]=max(dp[i],dp[i-cost]+wei);
}
void MP(int cost,int wei,int cnt)
{
if(cost*cnt>=v)
{
CP(cost,wei);
return;
}
else
{
int k=1;
while(k<cnt)
{
ZOP(k*cost,k*wei);
cnt-=k;
k<<=1;
}
ZOP(cnt*cost,cnt*wei);
}
}
int main()
{
int t;
cin>>t;
while(t--)
{
memset(dp,0,sizeof(dp));
dp[0]=1;
int sum=0;
int g;
double safe;
cin>>safe>>g;
safe=1-safe;
int a[1001];
double b[1001];
for(int i=1;i<=g;i++)
{
cin>>a[i]>>b[i];
b[i]=1-b[i];
sum+=a[i];
}
v=sum;
for(int i=0;i<=g;i++)
{
for(int j=v;j>=a[i];j--)
dp[j]=max(dp[j],dp[j-a[i]]*b[i]);
}
for(int i=v;i>=0;i--)
{
if(dp[i]>safe)
{
cout<<i<<endl;
break;
}
}
}
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背包】
- 欢迎使用CSDN-markdown编辑器
- 将数组传递给函数
- 【HDU】畅通工程
- [C++] 公开课全套笔记
- Linux 下Centos7 PHP使用redis 安装redis扩展
- HDU 2955 Robberies (01背包)
- 图论之最小生成树
- vim基本命令
- 删除数据遇到表或视图不存在
- Functional Programming in Scala week2 Assignment-Function Sets感想
- 【HDU】Red and Black
- AAC ADTS头详解
- Python的集合set
- 子查询中空值问题