zoukankan      html  css  js  c++  java
  • hdu 1114 PiggyBank(多重背包)

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

    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.
     
    多重背包直接求解:(注意初始化)
    代码:
     1 #include<iostream>
     2 using namespace std;
     3 #define INF 9999999
     4 int dp[10010],c[510],w[510];
     5 int main()
     6 {
     7     int t;
     8     scanf("%d",&t);
     9     while(t--)
    10     {
    11         int e,f,i,j,m;
    12         scanf("%d%d",&e,&f);
    13         scanf("%d",&m);
    14         for(i=1;i<=m;i++)
    15             scanf("%d%d",&w[i],&c[i]);
    16         for(i=1;i<=f-e;i++)
    17             dp[i]=INF;
    18         dp[0]=0;
    19         for(i=1;i<=m;i++)
    20             for(j=c[i];j<=f-e;j++)
    21                 if(dp[j]>dp[j-c[i]]+w[i])
    22                     dp[j]=dp[j-c[i]]+w[i];
    23         if(dp[f-e]!=INF)
    24             printf("The minimum amount of money in the piggy-bank is %d.\n",dp[f-e]);
    25         else
    26             puts("This is impossible.");
    27     }
    28     return 0;
    29 }
  • 相关阅读:
    整数转字符串
    SharePoint介绍性文章
    Disable Sharepoint 2007 show as System Account when system admin login
    通过IP地址获得主机名
    从文本文件读取信息
    数据库连接池问题[转]
    企业类库问题 public key 问题[经过自己测试]
    Google Analytics异步代码创建虚拟浏览量跟踪
    同一主机上WordPress博客更换域名简易八步骤(2)
    关于application/xwwwformurlencoded等字符编码的解释说明
  • 原文地址:https://www.cnblogs.com/crazyapple/p/2653874.html
Copyright © 2011-2022 走看看