hdu 2955 Robberies
2014-10-18 09:56
176 查看
Robberies
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12553 Accepted Submission(s): 4651
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.
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 .
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.
Sample Input
3
0.04 3
1 0.02
2 0.03
3 0.05
0.06 3
2 0.03
2 0.03
3 0.05
0.10 3
1 0.03
2 0.02
3 0.05
Sample Output
2
4
6
#include<iostream> #include<algorithm> #include<cstring> #define MAX(a,b) ((a)<(b)?(b):(a)) using namespace std; int N; double PP; double dp[10105];//dp[i]:to rob i money and not be caught probability double P[105];//not be caught probability bool arrive[10105]; int M[105];//money int main(){ int i,j,k,m,n,T,ans; ios::sync_with_stdio(false); cin>>T; while(T--){ cin>>PP>>N; for(i=0;i<N;i++){ cin>>M[i]>>P[i]; P[i]=1-P[i]; } memset(arrive,0,sizeof(arrive)); arrive[0]=true; dp[0]=1; for(i=0;i<N;i++){ for(j=10005;j>=0;j--){ if(arrive[j]){ if(arrive[j+M[i]]) dp[j+M[i]]=MAX(dp[j+M[i]],dp[j]*P[i]); else { arrive[j+M[i]]=true; dp[j+M[i]]=dp[j]*P[i]; } } } } for(i=10005;i>0;i--){ if(arrive[i]&&dp[i]>=1-PP) break;//此处注意判断arrive[i] } cout<<i<<endl; } return 0; }
相关文章推荐
- HDU 2955 Robberies(0-1 DP)
- hdu 2955 Robberies 01背包
- HDU2955_Robberies【01背包】
- hdu 2955 Robberies
- hdu 2955 Robberies + LightOJ 1079 Just another Robbery (01背包 概率)
- hdu 2955 Robberies 背包
- hdu 2955 Robberies(背包问题)
- hdu 2955 Robberies(概率,dp)
- HDU 2955 Robberies(01背包)(动态规划)
- HDU 2955 Robberies(01 背包)
- HDU 2955 Robberies(01背包变型)
- HDU 2955 Robberies(01背包)
- HDU 2955 Robberies
- hdu 2955 Robberies
- HDU 2955 Robberies
- HDU 2955 Robberies (01背包,思路要转换一下,推荐!)
- LightOJ 1079 Just another Robbery &&HDU 2955 Robberies 01背包
- HDU2955 Robberies
- hdu 2955 Robberies
- HDU 2955 Robberies (0-1背包)