lightoj 1079 - Just another Robbery(01背包)
来源:互联网 发布:java获取当前时间 编辑:程序博客网 时间:2024/06/06 04:19
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.
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 Mj millions, 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
给你一个实数,表示在被抓住概率最大为这么大的时候最多能抢多少钱。
求被抓住的概率不好求,所以反过来求不被抓住的概率。
dp[i]表示在抢的钱为i的时候的不被抓住的概率。
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;int main(void){ int T,n,i,j; double P; double dp[11000]; double p[110]; int a[110]; scanf("%d",&T); int cas = 1; while(T--) { scanf("%lf%d",&P,&n); int sum = 0; for(i=1;i<=n;i++) { scanf("%d%lf",&a[i],&p[i]); p[i] = 1 - p[i]; sum += a[i]; } for(i=0;i<=sum;i++) dp[i] = 0; dp[0] = 1; for(i=1;i<=n;i++) for(j=sum;j>=a[i];j--) dp[j] = max(dp[j],dp[j-a[i]]*p[i]); for(i=sum;i>=0;i--) if(P >= 1 - dp[i]) { printf("Case %d: %d\n",cas++,i); break; } } return 0;}
- LightOJ 1079 - Just another Robbery (01背包)
- lightoj 1079 - Just another Robbery 01背包
- LightOJ 题目1079 Just another Robbery(01背包)
- lightoj Just another Robbery 1079 (01背包转换&概率)
- lightoj 1079 - Just another Robbery(01背包)
- LightOJ - 1079 Just another Robbery(背包)
- LightOJ 1079 - Just another Robbery 【背包问题】
- LightOJ 1079Just another Robbery &&HDU 2955Robberies 01背包
- 【LightOJ 1079】Just another Robbery(概率DP+背包)
- LightOJ 1079 - Just another Robbery (背包问题)
- lightOJ 1079 Just another Robbery
- lightoj 1079 - Just another Robbery
- lightoj 1079 Just another Robbery
- LightOJ 1079 Just another Robbery
- 【lightoj 1079 Just another Robbery】
- LightOJ 1079 Just another Robbery
- Just another Robbery LightOJ
- Just another Robbery LightOJ
- OpenCV split函数 merge函数 及示例
- 解决grid拖拽功能后,复选框多选后取消不掉的问题
- 如何使用上aliyun的maven镜像
- jquery mobile 链接
- java删除文件夹及其子文件
- lightoj 1079 - Just another Robbery(01背包)
- IOS UIWebView自适应
- JavaWeb中Ajax的使用-基本使用+省市联动例子
- 使用0x3f3f3f表示无穷大
- Vue.js的常用指令-vue.js
- LoadRunner性能测试问题集锦
- solr学习(一)集成solr到tomcat中
- Linux-Shell脚本编程-学习-1-Linux基本命令
- H.264 NALU语法结构