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): 23934    Accepted Submission(s): 8842

    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 <stdio.h>  
    #include <algorithm>  
    #include <iostream>  
    #include <cmath>  
    #include <string.h>  
    using namespace std;  
      
    const int N = 50005;  
      
    int main()  
    {  
      //  freopen("in.txt", "r", stdin);      
    int t, m0, m[N];  
        double p0, p[N], ans[N];  
        scanf("%d", &t);  
        while(t --)  
        {  
            scanf("%lf%d", &p0, &m0);  
            int sum = 0;  
            for(int i = 0; i < m0; i ++)  
            {  
                scanf("%d%lf", &m[i], &p[i]);  
                sum += m[i];  
            }  
            memset(ans, 0, sizeof(ans));  
            ans[0] = 1;  
            for(int i = 0; i < m0; i ++)  
            {  
                for(int j = sum; j >= m[i]; j --)  
                {  
                    ans[j] = max(ans[j], ans[j - m[i]] *(1 - p[i]));  
                }  
            }  
            for(int i = sum; i >= 0; i --)  
            {  
                if(ans[i] > (1 - p0))  
                {  
                    printf("%d
    ", i);  
                    break;  
                }  
            }  
        }  
        return 0;  
    }  
    

      

  • 相关阅读:
    vm8.0安装mac提示中断导致虚拟cpu进入终止状态……vm重启的解决办法
    WPF和WindowsForm下的按下Enter跳转下一个控件通用方法
    【Z】oledb读写excel出现“操作必须使用一个可更新的查询”错误
    关于系统编码的那点事
    【Z】使用OleDbCommandBuilder时出现“Insert into 语句的语法错误”
    Thread 初学(二)——线程同步
    Oracle中针对一张表建立触发器,并且触发器也处理同一张表的数据(ora04091 错误)
    Thread初学 (一)
    【Z】使用SQL Server的OPENROWSET函数
    13个绚丽的Jquery 界面设计
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7063221.html
Copyright © 2011-2022 走看看