Hdu 1114 Piggy-Bank, hdu1114piggy-bank

Hdu 1114 Piggy-Bank, hdu1114piggy-bank
Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission (s): 11201 Accepted Submission (s): 5657


Problem DescriptionBefore 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 shoshould 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!
 
InputThe 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 varous 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.
 
OutputPrint 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

310 11021 130 5010 11021 150 301 6210 320 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.

 
SourceCentral Europe 1999
Simple full backpack .. Because the minimum value is calculated, the initialization is the maximum value.

# Include <iostream> # include <cstdio> # include <cstring> # include <algorithm> # define M 100000000 using namespace std; struct node {int w, v ;} a [10000]; int main () {int cas, e, f, n, I, j, dp [10000]; cin> cas; while (cas --) {cin> e> f> n; int sum = f-e; for (I = 0; I <n; I ++) cin> a [I]. v> a [I]. w; dp [0] = 0; // The maximum for (I = 1; I <= sum; I ++) dp [I] = M; for (I = 0; I <n; I ++) {for (j = a [I]. w; j <= sum; j ++) {dp [j] = min (dp [j], dp [j-a [I]. w] + a [I]. v) ;}} if (dp [sum] = M) cout <"This is impossible. "<endl; else cout <" The minimum amount of money in the piggy-bank is "<dp [sum] <". "<endl;} return 0 ;}

Hang Dian ACM question 1114 and write the code to me. It is better to write the solution again, which means that I am too lazy to write it. It seems quite simple and helpful. Thank you.

This is a simple backpack DP. I suggest you go to the dynamic planning section of "computer algorithm design and analysis" first. After reading the 0-1 backpack, you can see the complete backpack, this is a complete backpack problem.
There is a similar explanation in the book about this transfer equation, which is quite long and will not be written here.

Why is a full backpack wrong with hangdian acm 1114?

It is indeed a complete backpack. Only a place is modified.
# Include <stdio. h>
# Include <limits. h>

# Define min (a, B) (a) <(B )? (A) :( B)
Int main ()
{
Int t, E, F, n;
Int p [1, 505], w [2, 505];
Int c [505];
Unsigned int f [10005]; // here, INT_MAX is causing the fault.
Int v;
Int I, j;
Scanf ("% d", & t );
While (t --)
{
Scanf ("% d", & E, & F );
V = F-E;
Scanf ("% d", & n );
For (I = 1; I <= n; I ++)
Scanf ("% d", & p [I], & w [I]);
For (I = 1; I <= v; I ++)
F [I] = INT_MAX;
F [0] = 0;
For (I = 1; I <= n; I ++)
For (j = w [I]; j <= v; j ++)
F [j] = min (f [j], f [j-w [I] + p [I]);
If (f [v]! = INT_MAX)
Printf ("The minimum amount of money in the piggy-bank is % d. \ n", f [v]);
Else
Printf ("This is impossible. \ n ");
}
Return 0;

}