hdu Robberies
来源:互联网 发布:无人机软件开发 编辑:程序博客网 时间:2024/06/09 13:55
Robberies
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 52 Accepted Submission(s) : 20
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
#include<iostream>#include<cstring>#include<cmath>using namespace std;int m[101];float q[101];float dp[10001];int main(){ int t; cin>>t; while(t--){ int n,sum=0; float p; cin>>p>>n; int i,j; for(i=1;i<=n;i++){ //cin>>m[i]>>p[i]; scanf("%d%f",&m[i],&q[i]); sum+=m[i]; } memset(dp,0,sizeof(dp)); dp[0]=1; for(i=1;i<=n;i++){ for(j=sum;j>=m[i];j--){ dp[j]=max(dp[j],dp[j-m[i]]*(1-q[i])); } } for(i=sum;i>=0;i--){ if(dp[i]>=1-p){ cout<<i<<endl; break; } } } return 0;}
0 0
- HDU Robberies
- hdu Robberies
- 【hdu】【Robberies】
- HDU Robberies
- Robberies HDU
- Robberies HDU
- Robberies HDU
- Robberies(HDU
- hdu 2955 Robberies
- HDU 2955 - Robberies
- hdu 2955 Robberies DP
- Hdu 2955 - Robberies
- hdu 2955 Robberies
- hdu 2955 Robberies
- hdu Robberies 概率DP
- hdu 2955 Robberies
- hdu 2955 Robberies
- HDU 2955 Robberies
- Matlab中保存图像时,图形窗口大小的控制
- inux如何挂载U盘和光盘
- 用w3c读取xml 文件 使用的jar包:xml-apis-1.0.b2.jar
- 多线程的数据互斥
- 双调旅程(bitonic tour)问题
- hdu Robberies
- JSP播放音乐
- 生活像一把无情的刻刀
- linux硬盘分区方案
- Linux设备驱动程序学习(10)-时间、延迟及延缓操作(Jiq.c)
- ios 面试题(1)
- DEBUG_NEW,_DEBUG
- java代码注释规范
- ADS