zoukankan      html  css  js  c++  java
  • hdu 2955

    Robberies

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 8551    Accepted Submission(s): 3230
    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
    和原来的01背包稍微变了
    #include<iostream>
    #include<string.h>
    #include<math.h>
    using namespace std;
    struct node
    {
        int num;
        double k;
    }q[110];
    int main()
    {
        int t,n,i,j,sum;
        double p[11000],s;
        cin>>t;
        while(t--)
        {
            sum=0;
            cin>>s>>n;
            for(i=0;i<n;i++)
            {
                cin>>q[i].num>>q[i].k;
                q[i].k=1-q[i].k;
                sum+=q[i].num;
            }
            for(i=1;i<11000;i++)
                p[i]=0;
                p[0]=1;
            for(i=0;i<n;i++)
                for(j=sum;j>=q[i].num;j--)
                {
                    p[j]=max(p[j],p[j-q[i].num]*q[i].k);
                }
            for(i=sum;i>=0;i--)
                if(p[i]>=1-s)
            {
                cout<<i<<endl;
                break;
            }
        }
    }

     
  • 相关阅读:
    审核被拒:包含隐藏功能
    iOS好的个人博客和平台网站
    免费的Git和SVN服务器
    组件化
    三方生产利器
    RSA加密解密和签名验证机制以及其区别和联系
    APP和后台接口设计规范
    树和二叉树2——输出广义表形式(带括号)二叉树
    树和二叉树1——链式二叉树基础
    计算机图形学5——Two-Dimensional Viewing and Clipping(二维线段裁剪算法)
  • 原文地址:https://www.cnblogs.com/ainixu1314/p/3374012.html
Copyright © 2011-2022 走看看