HDU
来源:互联网 发布:淘宝营销活动 编辑:程序博客网 时间:2024/06/06 09:34
Robberies
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25698 Accepted Submission(s): 9482
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
Source
IDI Open 2009
Recommend
gaojie
题意:
求在安全的情况下最多可以得到多少财富。
思路:
把被抓概率转变成安全概率,然后定义一个以钱数为下标的一维数组,用动态规划的思想解题。概率的计算是相乘的。
最后从最大钱数开始循环,只要找到满足条件的就输出并结束循环。
代码:
题意:
求在安全的情况下最多可以得到多少财富。
思路:
把被抓概率转变成安全概率,然后定义一个以钱数为下标的一维数组,用动态规划的思想解题。概率的计算是相乘的。
最后从最大钱数开始循环,只要找到满足条件的就输出并结束循环。
代码:
#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>using namespace std;int v[105];double p[105];double dp[10005];int main(){int t;scanf("%d",&t);while(t--){double y,m;int n;memset(v,0,sizeof(v));memset(p,0,sizeof(p));memset(dp,0,sizeof(dp));scanf("%lf %d",&m,&n);m=1.0-m;int sum=0;for(int i=1;i<=n;i++){double j;scanf("%d %lf",&v[i],&p[i]);sum+=v[i];p[i]=1.0-p[i];}dp[0]=1.0;for(int i=1;i<=n;i++){for(int j=sum;j>=v[i];j--){dp[j]=max(dp[j],dp[j-v[i]]*p[i]);}}for(int i=sum;i>=0;i--){if(dp[i]>m){printf("%d\n",i);break;}}}return 0;}
阅读全文
0 0
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- hdu
- hdu
- hdu
- HDU
- mac上实现切换python版本
- [PAT]1009. Product of Polynomials (25)@Java
- 神经网络
- enum是神马
- LA 3485
- HDU
- Ubuntu16.04安装中文输入法
- 对RFC系列文档中ASN.1 bitstring 编码取值的解释
- Bagging与随机森林
- 第三章:3.7 傅里叶变换性质(二)
- BZOJ 2179 FFT快速傅立叶(FFT)
- Python实用黑科技——找出最大/最小的n个元素
- 2017可赚钱的共享影院安卓APP源码分享
- stm32 TFTLCD驱动原理(二)