HDU--1114 Piggy-Bank（完全背包）

最新推荐文章于 2019-11-18 20:38:17 发布

原创最新推荐文章于 2019-11-18 20:38:17 发布 · 369 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

DP 专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一种使用完全背包问题解决特定场景下钱币价值估算的方法。通过给定空存钱罐与装有钱币后的重量差及各种钱币的重量与价值，求解存钱罐中钱币的最小总价值。

题意：给出空存钱罐的重量和装钱后的重量，给出几种面额的钱币和其重量，求里面最少存了多少钱。

解题思路：完全背包问题，背包要求恰好填满，初始化dp为INF，求dp[w] 即可.

定义dp[i]为重量为i时，背包内物品价值的最小值。

状态转移方程：dp[j] = min(dp[j], dp[j - w[i]] + p[i])。

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

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.

#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<list>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>

using namespace std;

int buf[10];
//整型变量快速输入输出函数
inline int readint()
{
    char c = getchar();
    while(!isdigit(c)) c = getchar();
    int x = 0;
    while(isdigit(c))
    {
        x = x * 10 + c - '0';
        c = getchar();
    }
    return x;
}

inline void writeint(int i)
{
    int p = 0;
    if(i == 0) p++;
    else while(i)
        {
            buf[p++] = i % 10;
            i /= 10;
        }
    for(int j = p - 1 ; j >= 0 ; --j) putchar('0' + buf[j]);
}
//////////////////////////////////////////////////////////////////////
#define MAX_N 505
#define MAX_W 10005
const int INF = 0x3f3f3f3f;
int p[MAX_N];
int w[MAX_N];
int dp[MAX_W];
int main()
{
    int t;
    t = readint();
    int e, f;
    while(t--)
    {
        e = readint();
        f = readint();
        int n = readint();
        for(int i = 0 ; i < n ; i++)
        {
            p[i] = readint();
            w[i] = readint();
        }
        fill(dp, dp + f - e + 1, INF);
        dp[0] = 0;
        for(int i = 0 ; i < n ; i++)
        {
            for(int j = w[i] ; j <= f -e ; j++)
            {
                dp[j] = min(dp[j], dp[j - w[i]] + p[i]);
            }
        }
        if(dp[f - e] == INF)
            printf("This is impossible.\n");
        else
            printf("The minimum amount of money in the piggy-bank is %d.\n", dp[f - e]);
    }

    return 0;
}