hdu 2955 Robberies
来源:互联网 发布:在线抽奖软件 编辑:程序博客网 时间:2024/06/15 01:01
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.
![](http://acm.hdu.edu.cn/data/images/con211-1010-1.jpg)
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.
![](http://acm.hdu.edu.cn/data/images/con211-1010-1.jpg)
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 <cstring>using namespace std;#define N 110000double dp[N], d[N];int val[N];int main(){ int t; cin>>t; while(t--) { double live, sum=0; int bank; cin>>live>>bank; for(int i=0;i<bank;i++) { cin>>val[i]>>dp[i]; dp[i]=1-dp[i]; sum+=val[i]; } double p=1-live; memset(d,0,sizeof(d)); d[0]=1; for(int i=0;i<bank;i++) { for(int j=sum;j>=val[i];j--) { d[j]=max(d[j],d[j-val[i]]*dp[i]);//很难想到 } } for(int i=sum;i>=0;i--) { if(d[i]-p>0.000000001) { cout<<i<<endl; break; } } } return 0;}
0 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
- hdu1054 【树形dp】【二分匹配】
- 【Android动画九章】-属性动画集
- 区间动规 回文词
- UIApplicationDelegate-UI进阶
- android开发笔记之多媒体—撕衣服(开心一下)
- hdu 2955 Robberies
- 4. Median of Two Sorted Arrays
- iOS基础开发UI界面-xib与代码自定义控件的区别
- jQuery源码分析--event事件绑定(下)
- BestCoder Round #83 1001 zxa and set
- POJ 2229 Sumsets
- uva10651 Pebble Solitaire(记忆化搜索)
- iOS应用程序的启动原理-UI进阶
- 第七周项目一-成员函数、友元函数和一般函数有区别