534人阅读 评论(0)

# Robberies

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 8822    Accepted Submission(s): 3328

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


#include <iostream>
#include <cstring>
#define maxv 10005
#define maxn 105
using namespace std;
double ans[maxv],p[maxn],P;
int T,N,m[maxn],tot;
int main()
{
cin>>T;
while(T--){
tot=0;          // 非常重要，不然第二组数据可能会超过int范围，会出RE
memset(ans,0,sizeof(ans));  //初始化也同样重要
ans[0]=1;
cin>>P>>N;
for(int i=1; i<=N; i++){
cin>>m[i]>>p[i];
tot += m[i];
}
//背包 转换为乘法 使同一个点不被捉的概率最大
for(int i=1; i<=N; i++){
for(int j=tot; j>=m[i]; j--){
if(ans[j]<ans[j-m[i]]*(1-p[i]))
ans[j]=ans[j-m[i]]*(1-p[i]);
}
}

//输出i而不是ans[i]
for(int i=tot; i>=0; i--)
if(ans[i]>=1-P){
cout<<i<<endl;
break;
}
}
return 0;
}


0
0

【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐（算法+实战）--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：44605次
• 积分：1055
• 等级：
• 排名：千里之外
• 原创：53篇
• 转载：17篇
• 译文：0篇
• 评论：1条
文章存档
阅读排行
评论排行
最新评论