zoukankan      html  css  js  c++  java
  • 【hdu 2955 Robberies】

    Robberies

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 3934    Accepted Submission(s): 1492


    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
     
    Recommend
    gaojie
     
     
     1 // Project name : 2955 ( Robberies ) 
     2 // File name    : main.cpp
     3 // Author       : Izumu
     4 // Date & Time  : Tue Jul 10 10:32:00 2012
     5 
     6 
     7 #include <iostream>
     8 #include <stdio.h>
     9 #include <cstring>
    10 using namespace std;
    11 
    12 #define N 10020
    13 
    14 
    15 struct Good
    16 {
    17     int value;
    18     double pro;
    19 };
    20 
    21 Good good[N];
    22 double max(double a, double b)
    23 {
    24     return a > b ? a : b ;
    25 }
    26 
    27 int main()
    28 {
    29     int t;
    30     cin >> t;
    31     while (t--)
    32     {
    33         double p;
    34         int n;
    35         double f[N];
    36         cin >> p >> n;
    37         int m;
    38         m = 0;
    39         memset(f, 0, sizeof(f));
    40         f[0] = 1;
    41         for (int i = 0; i < n; i++)
    42         {
    43             cin >> good[i].value >> good[i].pro;
    44             m += good[i].value;
    45         }
    46 
    47         for (int i = 0; i < n; i++)
    48         {
    49             for (int j = m; j >= good[i].value; j--)
    50             {
    51                 f[j]=max(f[j],f[j-good[i].value]*(1-good[i].pro));
    52             }
    53         }
    54 
    55         int index;
    56         for (int i = m; i >= 0; i--)
    57         {
    58             if (f[i] >= 1 - p)
    59             {
    60                 index = i;
    61                 break;
    62             }
    63         }
    64         cout << index << endl;
    65     }
    66 }
    67 // end 
    68 // ism 
  • 相关阅读:
    如何在for循环中使用多线程
    解决ios10以上H5页面手势、双击缩放问题
    select标签默认选项
    vue三级联动
    手动安装composer详细教学
    密码校验:长度6位以上,至少包含一个数字,一个大写字母,一个小写字母,不包含空格
    tp5生成6位不重复验证码
    css漂亮的阴影边框
    圆形进度条css3样式
    jQuery倒计时组件(jquery.downCount.js)
  • 原文地址:https://www.cnblogs.com/ismdeep/p/2584241.html
Copyright © 2011-2022 走看看