zoukankan      html  css  js  c++  java
  • HDOJ1114 PiggyBank[完全背包问题]

    Piggy-Bank

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 5078    Accepted Submission(s): 2505


    Problem Description
    Before ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money (IBM). The idea behind is simple. Whenever some ACM member has any small money, he takes all the coins and throws them into a piggy-bank. You know that this process is irreversible, the coins cannot be removed without breaking the pig. After a sufficiently long time, there should be enough cash in the piggy-bank to pay everything that needs to be paid.

    But there is a big problem with piggy-banks. It is not possible to determine how much money is inside. So we might break the pig into pieces only to find out that there is not enough money. Clearly, we want to avoid this unpleasant situation. The only possibility is to weigh the piggy-bank and try to guess how many coins are inside. Assume that we are able to determine the weight of the pig exactly and that we know the weights of all coins of a given currency. Then there is some minimum amount of money in the piggy-bank that we can guarantee. Your task is to find out this worst case and determine the minimum amount of cash inside the piggy-bank. We need your help. No more prematurely broken pigs!
     
    Input
    The input consists of T test cases. The number of them (T) is given on the first line of the input file. Each test case begins with a line containing two integers E and F. They indicate the weight of an empty pig and of the pig filled with coins. Both weights are given in grams. No pig will weigh more than 10 kg, that means 1 <= E <= F <= 10000. On the second line of each test case, there is an integer number N (1 <= N <= 500) that gives the number of various coins used in the given currency. Following this are exactly N lines, each specifying one coin type. These lines contain two integers each, Pand W (1 <= P <= 50000, 1 <= W <=10000). P is the value of the coin in monetary units, W is it's weight in grams.
     
    Output
    Print exactly one line of output for each test case. The line must contain the sentence "The minimum amount of money in the piggy-bank is X." where X is the minimum amount of money that can be achieved using coins with the given total weight. If the weight cannot be reached exactly, print a line "This is impossible.".
     
    Sample Input
    3 10 110 2 1 1 30 50 10 110 2 1 1 50 30 1 6 2 10 3 20 4
     
    Sample Output
    The minimum amount of money in the piggy-bank is 60. The minimum amount of money in the piggy-bank is 100. This is impossible.
     
    Source
     
    Recommend
    Eddy
     
     
     
    code:
     1 /*
     2 3
     3 10 110
     4 3
     5 50 20
     6 60 30
     7 70 40
     8 */
     9 #include <iostream>   
    10 #include <iomanip>   
    11 #include <fstream>   
    12 #include <sstream>   
    13 #include <algorithm>   
    14 #include <string>   
    15 #include <set>   
    16 #include <utility>   
    17 #include <queue>   
    18 #include <stack>   
    19 #include <list>   
    20 #include <vector>   
    21 #include <cstdio>   
    22 #include <cstdlib>   
    23 #include <cstring>   
    24 #include <cmath>   
    25 #include <ctime>   
    26 #include <ctype.h> 
    27 using namespace std;
    28 
    29 int main()
    30 {
    31     int t;
    32     int e,f;
    33     int n;
    34     int value[520],weight[520];
    35     int realweight;
    36     int i,k;
    37     int dp[10010];
    38     while(~scanf("%d",&t))
    39     {
    40         while(t--)
    41         {
    42             memset(value,0,sizeof(value));
    43             memset(weight,0,sizeof(weight));
    44             scanf("%d%d%d",&e,&f,&n);            
    45             realweight=f-e;
    46             for(i=0;i<=realweight;i++)
    47                 dp[i]=INT_MAX;
    48             dp[0]=0;
    49             for(i=0;i<n;i++)
    50                 scanf("%d%d",&value[i],&weight[i]);
    51             for(i=0;i<n;i++)
    52                 for(k=weight[i];k<=realweight;k++)
    53                     if((dp[k-weight[i]])!=INT_MAX)
    54                     dp[k]=min(dp[k-weight[i]]+value[i],dp[k]);
    55             if(dp[realweight]<INT_MAX) 
    56                 printf("The minimum amount of money in the piggy-bank is %d.\n",dp[realweight]);
    57             else
    58                 printf("This is impossible.\n");
    59         }
    60     }
    61     return 0;
    62 }
  • 相关阅读:
    linux file命令小记
    利用actionscript访问wfs服务
    在C/C++中static有什么用途?(请至少说明两种)
    单元测试、集成测试、系统测试的侧重点是什么?
    测试计划工作的目的是什么?测试计划文档的内容应该包括什么?其中哪些是最重要的?
    简述什么是静态测试、动态测试、黑盒测试、白盒测试、α测试&#160;β测试
    一台客户端有三百个客户与三百个客户端有三百个客户对服务器施压,有什么区别?
    BUG管理工具的跟踪过程(用BugZilla为例子)
    软件测试分为几个阶段&#160;各阶段的测试策略和要求是什么?
    软件质量保证体系是什么&#160;国家标准中与质量保证管理相关的几个标准是什么?他们的编号和全称是什么?
  • 原文地址:https://www.cnblogs.com/XBWer/p/2607668.html
Copyright © 2011-2022 走看看