Just another Robbery(背包)
2015-12-10 22:32
288 查看
1079 - Just another Robbery
As Harry Potter series is over, Harry has no job. Since he wants to make quick money, (he wants everything quick!) so he decided to rob banks. He wants to make a calculated risk, and grab as much money as possible. But his friends - Hermione and Ron have decided upon a tolerable probability P of getting caught. They feel that he is safe enough if the banks he robs together give a probability less than P.
Each case contains a real number P, the probability Harry needs to be below, and an integer N (0 < N ≤ 100), the number of banks he has plans for. Then follow N lines, where line j gives an integer Mj (0 < Mj ≤ 100) and a real number Pj . Bank j contains Mjmillions, and the probability of getting caught from robbing it is Pj. A bank goes bankrupt if it is robbed, and you may assume that all probabilities are independent as the police have very low funds.
题解:给你一个总概率p,再给你N个银行,里面有钱vi,被抓到的概率是pi,要使被抓住的概率小于p,也就是没被抓到的概率大于1-p就好了,总钱数当作背包的容量,概率当作背包的值;
代码:
PDF (English) | Statistics | Forum |
Time Limit: 4 second(s) | Memory Limit: 32 MB |
Input
Input starts with an integer T (≤ 100), denoting the number of test cases.Each case contains a real number P, the probability Harry needs to be below, and an integer N (0 < N ≤ 100), the number of banks he has plans for. Then follow N lines, where line j gives an integer Mj (0 < Mj ≤ 100) and a real number Pj . Bank j contains Mjmillions, and the probability of getting caught from robbing it is Pj. A bank goes bankrupt if it is robbed, and you may assume that all probabilities are independent as the police have very low funds.
Output
For each case, print the case number and the maximum number of millions he can expect to get while the probability of getting caught is less than P.Sample Input | Output for 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 | Case 1: 2 Case 2: 4 Case 3: 6 |
Note
For the first case, if he wants to rob bank 1 and 2, then the probability of getting caught is 0.02 + (1 - 0.02) * .03 = 0.0494which is greater than the given probability (0.04). That's why he has only option, just to rob rank 2.题解:给你一个总概率p,再给你N个银行,里面有钱vi,被抓到的概率是pi,要使被抓住的概率小于p,也就是没被抓到的概率大于1-p就好了,总钱数当作背包的容量,概率当作背包的值;
代码:
#include<iostream> #include<cstdio> #include<cmath> #include<cstring> #include<algorithm> #include<vector> #include<queue> #include<stack> #include<map> using namespace std; const int INF=0x3f3f3f3f; const double PI=acos(-1.0); typedef long long LL; #define mem(x,y) memset(x,y,sizeof(x)) #define PI(x) printf("%d",x) #define PL(x) printf("%lld",x) #define SI(x) scanf("%d",&x) #define SL(x) scanf("%lld",&x) #define P_ printf(" ") #define T_T while(T--) const int MAXN=110; struct Node{ double p; int w; friend bool operator < (Node a,Node b){ if(a.p<b.p)return true; else return false; } }; double bag[10010]; Node dt[MAXN]; int main(){ int T,kase=0; SI(T); T_T{ double p; int N; scanf("%lf%d",&p,&N); int sum=0; for(int i=0;i<N;i++)scanf("%d%lf",&dt[i].w,&dt[i].p),sum+=dt[i].w; sort(dt,dt+N); mem(bag,0);bag[0]=1; for(int i=0;i<N;i++){ for(int j=sum;j>=dt[i].w;j--) bag[j]=max(bag[j],bag[j-dt[i].w]*(1-dt[i].p)); } for(int i=sum;i>=0;i--){ if(bag[i]>1-p){ printf("Case %d: %d\n",++kase,i);break; } } } return 0; }
相关文章推荐
- python学习之路之案例2---计算器
- 可变参数(C语言):stdarg.h
- Ubuntu15.04 安装卡在logo界面不动
- Android启动页面的正确打开方式
- python练习2
- C语言预处理及特殊函数介绍(extern/exit/atexit/volatile/static/calloc/realloc等)PART ONE
- ios中的手势
- Win10系统菜单打不开问题的解决,难道是Win10的一个Bug ?
- Django doc summary (3)
- Django doc summary (2)
- input placeholder
- 阿姆斯特朗回旋加速喷气式阿姆斯特朗炮
- 抽奖算法
- ubuntu mysql远程连接
- eclipse jetty插件的安装
- nginx 502错误 upstream sent too big header while reading response header from upstream
- Django doc summary (1)
- 2015/12/10--基础javascript实例
- 零崎的悠哉日常Ⅲ
- kaldi monophone training outline