hdu 2955
来源:互联网 发布:香港人怎么看大陆知乎 编辑:程序博客网 时间:2024/09/21 09:22
Robberies
Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uAppoint description:
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
转成以所有银行的总资产为背包容量V。。求最大的逃跑概率。
#include <stdio.h>#include<algorithm>#include<cstring>#define INF 1<<20float dp[10003];using std::max;int n,m;float v[1003];int w[1003];int main(){ //freopen("input.txt","r",stdin); int t,n; scanf("%d",&t); float P; while(t--) { scanf("%f%d",&P,&n); P=1-P; memset(dp,0,sizeof(dp)); dp[0]=1; int sum=0; for(int i=1;i<=n;i++) { scanf("%d%f",w+i,v+i); v[i]=1-v[i]; sum+=w[i]; } for(int i=1;i<=n;i++) for(int j=sum;j>=w[i];j--) { dp[j]=max(dp[j],dp[j-w[i]]*v[i]); } for(int i=sum;i>=0;i--) { if(dp[i]>=P) { printf("%d\n",i); break; } } } return 0;}
0 0
- hdu 2955
- HDU 2955
- HDU 2955
- HDU 2955
- hdu 2955
- hdu 2955
- hdu 2955
- hdu 2955
- hdu 2955
- HDU--2955
- hdu 2955
- HDU 2955
- HDU 2955
- HDU 2955
- hdu 2955
- hdu--2955
- HDU 2955
- hdu 2955
- Eclipse以及TOMCAT(以脚本启动)报错PermGen space
- Android JavaEE里面常用的快捷键
- 编译器和解释器
- 函数探幽(一)——内联函数,引用变量
- windows下,android 4.4 开发环境配置
- hdu 2955
- 如何判断链表中是否有环
- vi常用操作
- opencv移植2
- [JAVA]简单的打字母游戏
- node.js第十三课(工程的结构)
- log file sync 等待超高一例子
- Leetcode之递归之苦
- 二叉树运用