HDU 2955 Robberies(dp)
来源:互联网 发布:360恢复软件免费版 编辑:程序博客网 时间:2024/05/22 12:44
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
题意:
输入小偷被抓概率的最大值和银行个数,然后输入每个银行的钱和偷这个银行被抓的概率,求小偷在最大被抓的概率内可以偷到的最多的钱?
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;#define N 10005int va[N];double c[N],dp[N];int main(){ int t,n,i; double p; scanf("%d",&t); while(t--) { int sum=0; scanf("%lf%d",&p,&n); p=1-p; //不被抓的概率 for(i=0;i<n;i++) { scanf("%d%lf",&va[i],&c[i]); sum+=va[i]; } memset(dp,0,sizeof(dp)); dp[0]=1; for(i=0;i<n;i++) for(int v=sum;v>=va[i];v--) dp[v]=max(dp[v],dp[v-va[i]]*(1-c[i])); for(i=sum;i>=0;i--) if(dp[i]-p>0.0000001) break; printf("%d\n",i); } return 0;}
0 0
- HDU 2955 Robberies(dp)
- hdu 2955 Robberies DP
- hdu 2955 Robberies DP
- hdu 2955 Robberies dp
- HDU Robberies 2955 dp
- HDU 2955 Robberies(0-1 DP)
- hdu 2955 Robberies (DP:背包)
- HDU 2955 Robberies(概率DP)
- hdu 2955 Robberies(概率,dp)
- [HDU 2955 Robberies] 入门DP
- HDU 2955(Robberies)
- Robberies(HDU-2955)
- hdu 2955 Robberies 【dp】 01背包
- hdu 2955 dp(0,1背包) Robberies
- HDU 2955 Robberies(DP:01背包)
- 【DP|01背包】HDU-2955 Robberies
- HDU 2955 Robberies (01背包dp)
- hdu Robberies 概率DP
- .atitit.web 推送实现解决方案集合(3)----dwr3 Reverse Ajax
- 『ANDROID』去除或替换listview 默认的点击选中时的颜色
- Atitit. 解决80端口 System 占用pid 4,,找到拉个程序或者服务占用http 80服务
- Java中的Serializable浅谈,只是浅谈
- githug通关部分黏贴(git代码练习)
- HDU 2955 Robberies(dp)
- 工厂方法模式与抽象工厂模式
- APUE
- Atitit.mssql 数据库表记录数and 表体积大小统计
- 求csdn博客优良编辑方法
- EGORefreshTableHeaderView开源框架使用
- 《数据结构》实验二: 线性表实验
- Java如何判断线程池所有任务是否执行完毕
- atitit.抽奖活动插件组件设计--结构设计and 抽奖流程建模