zoukankan      html  css  js  c++  java
  • HDU 2955 Robberies

    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
     
     1 #include<cstdio>
     2 #include<cstring>
     3 #include<algorithm>
     4 using namespace std;
     5 
     6 const int maxn=10005;
     7 
     8 int main()
     9 {
    10     double P;
    11     double p[maxn],dp[maxn];
    12     int t,total,n,i,j;
    13     int v[maxn];
    14     scanf("%d",&t);
    15     while(t--)
    16     {
    17         memset(dp,0,sizeof(dp));
    18         scanf("%lf%d",&P,&n);
    19         for(total=0,i=0;i<n;i++)
    20         {
    21             scanf("%d%lf",&v[i],&p[i]);
    22             total+=v[i];
    23         }
    24         dp[0]=1;
    25         for(i=0;i<n;i++)
    26             for(j=total;j>=v[i];j--)
    27             {
    28                 dp[j]=max(dp[j],dp[j-v[i]]*(1-p[i]));
    29             }
    30         for(i=total;i>=0;i--)
    31             if(dp[i]>=1-P)
    32             {
    33                 printf("%d
    ",i);
    34                 break;
    35             }
    36     }
    37     return 0;
    38 }
     
  • 相关阅读:
    Android PopupWindow 弹窗背景半透明,设置最大高度
    Android性能优化之:ViewStub
    EventBus使用详解(一)——初步使用EventBus
    Android开发中,那些让你相见恨晚的方法、类或接口
    android 提高进程优先级 拍照永不崩溃(闪退)
    Android框架 加载图片 库 Picasso 的使用简介
    vc 取windows系统信息 版本 cpu信息 内存信息 ie版本信息 office版本
    VC 三点 划 曲线
    VC 类泡泡龙游戏算法
    vc 判断哪个按键 被按下 消息 按键 状态
  • 原文地址:https://www.cnblogs.com/homura/p/4768766.html
Copyright © 2011-2022 走看看