HDU 2955 Robberies
来源:互联网 发布:道路里程数据库 编辑:程序博客网 时间:2024/06/01 18:17
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.
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
ORZ,这是肿么啦,写博客都写不了=。=,跟上一题一样取反求安全概率。本质01背包
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int vo[101];double p,dp[10001],va[101];int main(){ int i,j,t,n,s; scanf("%d",&t); while(t--) { s=0; scanf("%lf%d",&p,&n); p=1-p; for(i=0;i<n;i++) { scanf("%d%lf",&vo[i],&va[i]); va[i]=1-va[i]; s+=vo[i]; } memset(dp,0,sizeof dp); dp[0]=1; for(i=0;i<n;i++) { for(j=s;j>=vo[i];j--) { dp[j]=max(dp[j-vo[i]]*va[i],dp[j]); } } for(i=s;i>=0;i--) { if(dp[i]>=p) { printf("%d\n",i);break; } } } return 0;}
1 0
- hdu 2955 Robberies
- HDU 2955 - Robberies
- hdu 2955 Robberies DP
- Hdu 2955 - Robberies
- hdu 2955 Robberies
- hdu 2955 Robberies
- hdu 2955 Robberies
- hdu 2955 Robberies
- HDU 2955 Robberies
- hdu 2955 Robberies
- hdu 2955(Robberies)
- hdu 2955 Robberies
- HDU 2955 Robberies
- hdu 2955 Robberies
- hdu 2955 Robberies
- hdu-2955-Robberies
- hdu 2955 Robberies
- HDU:2955 Robberies
- JAVA NIO 文章
- delete和delete[]的区别
- 蓝牙核心技术概述(四):蓝牙协议规范(HCI、L2CAP、SDP、RFOCMM)
- 数组简略初始化过程
- vSphere实战攻略1
- HDU 2955 Robberies
- ReportStudio入门教程(七十六) - JS拼接报表- 第2页显示表头
- 遍历Json
- hql的使用之小细节
- 关于android源码4.3 CTS测试的问题
- Android 4.2 Input Event事件处理流程<一>---应用注册
- B - Friends(8.4.1)
- 设计模式之观察者observer模式
- 关于tcpjava网络编程服务器端收不到信息