poj1384HDU1114Piggy-Bank（完全背包）

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.
  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  


  
  
  
  

   
   首先是完全背包，二维数组实现方式是
  
  
  
  

   
   站在第n个位置上，去判断上一个位置有没有被选择，若选择了，那么当前剩余重量发生变化，然后还是在n的位置上，再次判断上一个物品是否被选择了，dp[i][j]与dp[i + 1][j]便说明i没有被选择，因为已经开始判断下一物品，但是体积却没有变化

   
   

    
    
void solve()
{
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j <= W; j++)
        {
            if(j < w[i])
            {
                dp[i + 1]  = dp[i][j];
            }
            else
            {
                dp[i + 1][j] = max(dp[i][j], dp[i + 1][j - w[i]] + v[i]);
            }
        }
    }
    printf("%d\n", dp[n][W]);
}
   
   
   
   

    
    简化为一位数组
   
   
   
   

    
    顺序，以体积一定求最大重量为例，dp[v]是由小变大，dp[v1]选择了物品一，循环到dp[v2](v2 = v1 + 物品1的体积），v2也可以选取物品1，依次下去，能不断选择物品一，假若逆序，dp[v2] = dp[v1] + w1;dp[v1]在该物品循环中还未循环到，也就是说，此时的dp[v1]是循环完上一轮的dp[v1],并未考虑这个物品，所以在某个体积是只能选择该物品一次
   
   
   
   


   
   
   
   

    
    而且这个题目要求是重量恰好等于，相当于背包恰好装满，可以参考图片中内容理解
   
   
   
   

    
    
    
    
   
   
   
   

    
    //dp[j] = dp[j] || dp[0] + v[i]
//i = 0一圈循环下来，dp[j]变成了插入第一个元素

   
   
   
   

    
    //然后循环第二圈判断插入第一个元素还是插入第二个元素小
   
   
   
   

    
    

     
     
#include 
       
       
        
        
#include 
        
        
         
         
#include 
         
         
          
          
#include 
          
          
           
           
#define INF 10000000
#define maxnn 10010
#define maxn 510

int e,f;
int n;
int v[maxn], w[maxn];
int dp[maxnn];
using namespace std;

int main()
{
    int t;
    while(~scanf("%d", &t))
    {
        while(t--)
        {
            scanf("%d%d%d", &e, &f, &n);
            for(int i = 1; i <= (f - e); i++)
            {
                dp[i] = INF;
            }
            dp[0] = 0;
            for(int i = 0; i < n; i++)
            {
                scanf("%d%d", &v[i], &w[i]);
            }
            int vo = f - e;
            for(int i = 0; i < n; i++)
            {
                for(int j = w[i]; j <= vo; j++)
                {
                    dp[j] = min(dp[j], dp[j - w[i]] + v[i]);
                }
            }
            if(dp[vo] >= INF)
                printf("This is impossible.\n");
            else
                printf("The minimum amount of money in the piggy-bank is %d.\n", dp[vo]);
        }
    }
    return 0;
}