lightoj Just another Robbery 1079 (01背包转换&概率)
来源:互联网 发布:印度神油 知乎 编辑:程序博客网 时间:2024/06/05 18:50
Submit Status
Description
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 Pof 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
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
Case 1: 2
Case 2: 4
Case 3: 6
#include<stdio.h>#include<string.h>double max(double a,double b){return a>b?a:b; }double dp[10100];struct zz{int v;double p;}q[1010];int main(){int t,T=1;int n,i,j;double p,x;scanf("%d",&t);while(t--){scanf("%lf%d",&p,&n);double pp=1-p;int sum=0;for(i=1;i<=n;i++){scanf("%d%lf",&q[i].v,&x);sum+=q[i].v;q[i].p=1-x;}memset(dp,0,sizeof(dp));dp[0]=1;for(i=1;i<=n;i++){for(j=sum;j>=q[i].v;j--){dp[j]=max(dp[j],dp[j-q[i].v]*q[i].p);}}printf("Case %d: ",T++);for(i=sum;i>=0;i--){if(dp[i]>=pp){printf("%d\n",i);break;}}}return 0;}
- lightoj Just another Robbery 1079 (01背包转换&概率)
- 【LightOJ 1079】Just another Robbery(概率DP+背包)
- LightOJ 1079 - Just another Robbery (01背包)
- lightoj 1079 - Just another Robbery 01背包
- LightOJ 题目1079 Just another Robbery(01背包)
- lightoj 1079 - Just another Robbery(01背包)
- LightOJ 1079 Just another Robbery 概率dp
- hdu 2955 Robberies + LightOJ 1079 Just another Robbery (01背包 概率)
- LightOJ-1079-Just another Robbery (概率dp)
- LightOJ - 1079 Just another Robbery(背包)
- LightOJ 1079 - Just another Robbery 【背包问题】
- LightOJ 1079Just another Robbery &&HDU 2955Robberies 01背包
- LightOJ 1079 - Just another Robbery (背包问题)
- LightOJ1079 Just another Robbery 01背包、概率
- LightOJ1079---Just another Robbery (概率牌01背包问题)
- lightOJ 1079 Just another Robbery
- lightoj 1079 - Just another Robbery
- lightoj 1079 Just another Robbery
- 操作系统概念(第八章) 内存管理(二)
- Linux基本命令(配图)
- hdoj5591ZYB's Game
- MFC和API
- 要么成为顶尖人物,要么跟随顶尖人物
- lightoj Just another Robbery 1079 (01背包转换&概率)
- 通过 File API 使用 JavaScript 读取文件
- lightoj--1116--Ekka Dokka(水题)
- ListView列表显示通讯录
- JZOJ1133. power
- Java基础——Java重点基础之集合框架(三)
- synchronized
- 解决问题 java.lang.ClassNotFoundException: org.springframework.web.context.ContextLoaderListener
- 蓝桥杯 字母图形(循环+字符串)