zoukankan      html  css  js  c++  java
  • Robberies hdu 2955 01背包

    Robberies

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


    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 <iostream>
     2 #include <stdio.h>
     3 #include <string.h>
     4 #include <math.h>
     5 using namespace std;
     6 #define eps 0.0000001
     7 int main()
     8 {
     9     int t,b[200],i,n,j;
    10     double p,a[200],dp[11000];
    11     scanf("%d",&t);
    12     while(t--)
    13     {
    14         for(i=0;i<11000;i++)dp[i]=2;
    15         scanf("%lf%d",&p,&n);
    16         for(i=0;i<n;i++)
    17             scanf("%d%lf",&b[i],&a[i]);
    18         dp[0]=0;
    19         for(i=0;i<n;i++)
    20             for(j=11000-1;j>=0;j--)
    21             {
    22                 if(j-b[i]>=0)
    23                 dp[j]=min(dp[j-b[i]]*(1-a[i])+dp[j-b[i]]*a[i]+(1-dp[j-b[i]])*a[i],dp[j]);
    24             }
    25 
    26         for(i=11000-1;i>0;i--)
    27         {
    28             if(dp[i]<=p)break;
    29             //if(i==2)cout<<fabs(dp[i]-p)<<endl;
    30         }
    31         cout<<i<<endl;
    32     }
    33 }
    View Code
     
     
  • 相关阅读:
    Selenium+java
    小白学习安全测试(一)——Http协议基础
    解决chrome运行报错unknown error: cannot get automation extension
    Eclipse 中 不能创建 Dynamic web project
    Jmeter遇到Connection reset by peer的解决方法
    用Java检测远程主机是否能被连接
    Java 连接远程Linux 服务器执行 shell 脚本查看 CPU、内存、硬盘信息
    jenkins的svn路径中文问题
    MySql的存储引擎介绍
    Netty SSL性能调优
  • 原文地址:https://www.cnblogs.com/ERKE/p/3839899.html
Copyright © 2011-2022 走看看