hdoj 2955 Robberies【01背包】【dp】
来源:互联网 发布:百度推广开放域名 编辑:程序博客网 时间:2024/05/11 01:59
Robberies
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17391 Accepted Submission(s): 6435
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
Mj是背包体积, Pj 是背包价值~
#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>using namespace std;const int inf = 0x3f3f3f;double dp[20000];struct node{int v;//背包 体积 double val;// 背包价值 };node p[1200];int main(){int t;scanf("%d", &t);while(t--){int i,j,k,n;double a;scanf("%lf%d", &a, &n);//被抓概率,n个银行 a = 1-a;//成功逃脱概率 for(i = 1, k = 0; i <= n; i++){scanf("%d%lf", &p[i].v, &p[i].val);k += p[i].v;//背包总体积 p[i].val = 1-p[i].val;//把被抓几率都转换成逃脱概率 }for(i = 1; i <= k; i++)dp[i] = -1;dp[0] = 1;//一分钱不抢 不被抓 逃脱概率100% for(i = 0; i <= n; i++){for(j = k; j >= p[i].v; j--){dp[j] = max(dp[j], dp[j-p[i].v]*p[i].val);//抢成功时 概率相乘 并求最大值 }}for( ; k >= 0; k--){if(dp[k] >= a)break;//直到逃脱概率到最低限度时退出循环 成功抢到最多的钱且不被抓 }printf("%d\n", k);}return 0;}
0 0
- hdoj 2955 Robberies【01背包】【dp】
- hdoj 2955 Robberies 【dp&&01背包】
- hdoj Robberies 2955 (概率Dp&&01背包) 好题
- HDOJ 2955 Robberies (01背包)
- HDOJ 2955 Robberies (01背包)
- hdoj 2955 Robberies 【01背包】
- hdoj 2955Robberies<背包>
- HDOJ Robberies 01背包
- hdoj problem 2955 Robberies(01背包问题)
- HDOJ.2955 Robberies (01背包+概率问题)
- hdu 2955 Robberies 【dp】 01背包
- HDU 2955 Robberies(DP:01背包)
- 【DP|01背包】HDU-2955 Robberies
- HDU 2955 Robberies (01背包dp)
- hdu2955 Robberies 01背包 dp
- Robberies(DP之01背包)
- HDOJ 2955 Robberies 简单01背包+简单概率思想
- HDOJ 题目2955Robberies(01背包变形)
- 图片切换ImageSwitcher&Gallery
- 安卓动态获取及更改view的长宽
- 构建高并发高可用的电商平台架构实践
- 鸟哥的私房菜
- lua 字符串处理
- hdoj 2955 Robberies【01背包】【dp】
- Oracle中语句中的”&“和单引号” ' “
- android防止搜索按钮连续点击加载多次数据
- JS之——获取GET参数
- SpringMVC单文件上传、多文件上传、文件列表显示、文件下载
- iOS开发之使用CocoaPods更新第三方出现“target overrides the `OTHER_LDFLAGS`……”问题解决方案
- Learning Python
- java各种类型转化的转载集合 慢慢添加
- 【C/C++学习笔记】判断一个点是否在多边形内部的例子