HDU 2955 Robberies
2015-11-23 15:48
375 查看
传送门点我
**
**
**
Bank j contains Mj millions, and the probability of getting caught from robbing it is Pj .
**
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.
**
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.
**
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
**
2
4
6
**
IDI Open 2009
**
**
然后会有一个浮点数Pi表示抢第i个银行会降低Pi的生还率…
然后这个人的善良的麻麻预估了一个捉捕率(1-生还率)上限 如果高于此上线就会被捉到QAQ
问最多能抢多少钱QAQ
**
由于noip写挂了dp…所以dp重头学起QAQ
一个01背包题
dp[j]表示抢 j million dollars 的时候被捉捕的最小概率是多少
然后我们就可以放心的跑01背包惹~~
需要注意的是….我的数组又开小了QAQ…RE了一次…以后不能再犯这样的错误了QAQ
**
——既然选择了远方,便只顾风雨兼程
**
Robberies
****
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
**
Source
**IDI Open 2009
**
**
题意
有个人去抢银行,有n个银行 对于第i个银行里有Mi million dollars…然后会有一个浮点数Pi表示抢第i个银行会降低Pi的生还率…
然后这个人的善良的麻麻预估了一个捉捕率(1-生还率)上限 如果高于此上线就会被捉到QAQ
问最多能抢多少钱QAQ
**
Solution
**由于noip写挂了dp…所以dp重头学起QAQ
一个01背包题
dp[j]表示抢 j million dollars 的时候被捉捕的最小概率是多少
然后我们就可以放心的跑01背包惹~~
需要注意的是….我的数组又开小了QAQ…RE了一次…以后不能再犯这样的错误了QAQ
**
Code
**#include <cstdio> #include <iostream> #include <algorithm> #include <cstring> using namespace std; const int maxn=11000; double dp[maxn]; int main() { //freopen("in.txt","r",stdin); int T; scanf("%d",&T); while(T--) { memset(dp,0,sizeof(dp)); dp[0]=1; double pos; int n,sum=0; cin>>pos>>n; pos=1-pos; for(int i=1;i<=n;i++) { double p;int w; cin>>w>>p; sum+=w; for(int j=sum;j>=w;j--) dp[j]=max(dp[j],dp[j-w]*(1-p)); } for(int i=sum;i>=0;i--) if(dp[i]>pos) { printf("%d\n",i); break; } } return 0; }
——既然选择了远方,便只顾风雨兼程
相关文章推荐
- Android开发进阶系列(三) 系统参数的获取和Broadcast
- 数据层交换和高性能并发处理(开源ETL大数据治理工具--KETTLE使用及二次开发 )
- 利用开源框架Volley来下载文本和图片。
- Android 使用存放在存assets文件夹下的SQLite数据库
- 使用框架的好处,hibernate缓存
- MySQL不支持动态表名
- SIGCHLD和waitpid的使用
- 平台数据库导入导出快捷工具说明
- Struts2常见错误-No result defined for action XXX and result input
- 一次完整的HTTP请求所经历的7个步骤
- Android Studio 快捷键
- JAVA单例模式 关于延迟加载问题
- 信息安全系统设计基础实验二报告
- D3.js 的基本用法外加一个略调皮的demo
- 杭电1599 find the mincost route
- 平台数据库导入导出快捷工具说明
- javaWeb监听器结合定时器实现定时执行任务
- ANSJ调用word2vec model文件
- poi3.9 操作excel 2007
- 线程池,处理高并发问题,处理大数据量的方法