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

    http://acm.hdu.edu.cn/showproblem.php?pid=2955

    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

    代码:

    #include <bits/stdc++.h>
    using namespace std;
    
    const int maxn = 1e5 + 10;
    int T, N, sum;
    double P;
    double dp[maxn];
    double p[110];
    int value[110];
    
    void ZeroOnePack(int cost, double get) {
        for(int i = sum; i >= cost; i --)
            dp[i] = max(dp[i], dp[i - cost] * get);
    }
    
    int main() {
        scanf("%d", &T);
        while(T --) {
            scanf("%lf%d", &P, &N);
            sum = 0;
            for(int i = 0; i < N; i ++) {
                scanf("%d%lf",&value[i], &p[i]);
                p[i] = 1 - p[i];
                sum += value[i];
            }
            memset(dp, 0, sizeof(dp));
            dp[0] = 1;
            
            for(int i = 0; i < N; i ++)
                ZeroOnePack(value[i], p[i]);
    
            for(int i = sum; i >= 0; i --) {
                if(dp[i] >= 1 - P) {
                    printf("%d
    ", i);
                    break;
                }
            }
        }
        return 0;
    }
    

      

  • 相关阅读:
    写在连载之前——DIY微型操作系统篇
    footer始终在页面最底部的方法(问题待检验)
    各种二级菜单代码
    复选框已经有checked,但是页面没有选中效果(解决)
    px em rem 的区别
    marquee标签详解
    Docker:正常运行的容器突然端口不通一般检查方法
    linux中 vm.overcommit_memory 的含义
    redis6 redis-cli cluster的使用总结
    利用Java反射机制优化简单工厂设计模式
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/10158448.html
Copyright © 2011-2022 走看看