完全背包

1.

完全背包 基础

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

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.
        
     
     

 

题意大概是，有不同种类的硬币放进一个储蓄罐，各种硬币的重量已知，请问储蓄罐中最少有多少钱？

这和普通的完全背包求最大价值不同，需要灵活变动。

c++.dp.背包.完全背包.求可能的最小值

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
#define maxn 100005
#define INF  0x07ffffff

int m1,m2,i,j,t,type,ans;
int v[maxn],m[maxn],dp[maxn];

void solve()
{
    scanf("%d%d",&m1,&m2);
	int m0=m2-m1;
	fill(dp + 1, dp + m0 + 1, INF);//类似memset将数组赋值为INF
	dp[0] = 0;
    scanf("%d",&type);
	for( i=0;i<type;i++)
		scanf("%d%d",&v[i],&m[i]);

	for( i=0;i<type;i++)
		for(j=m[i];j<=m0;j++)
			{
		      dp[j]=min(dp[j],dp[j-m[i]]+v[i]);
		    }
	if (dp[m0] == INF) puts("This is impossible.");
    else printf("The minimum amount of money in the piggy-bank is %d.\n", dp[m0]);
}

int main()
{
	scanf("%d",&t);
	while(t--) solve();
	return 0;
}

2.

完全背包

Time Limit:1000MS     Memory Limit:30000KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

John never knew he had a grand-uncle, until he received the notary's letter. He learned that his late grand-uncle had gathered a lot of money, somewhere in South-America, and that John was the only inheritor. 
John did not need that much money for the moment. But he realized that it would be a good idea to store this capital in a safe place, and have it grow until he decided to retire. The bank convinced him that a certain kind of bond was interesting for him. 
This kind of bond has a fixed value, and gives a fixed amount of yearly interest, payed to the owner at the end of each year. The bond has no fixed term. Bonds are available in different sizes. The larger ones usually give a better interest. Soon John realized that the optimal set of bonds to buy was not trivial to figure out. Moreover, after a few years his capital would have grown, and the schedule had to be re-evaluated. 
Assume the following bonds are available: 

Value	Annual interest
4000 3000	400 250

With a capital of e10 000 one could buy two bonds of $4 000, giving a yearly interest of $800. Buying two bonds of $3 000, and one of $4 000 is a better idea, as it gives a yearly interest of $900. After two years the capital has grown to $11 800, and it makes sense to sell a $3 000 one and buy a $4 000 one, so the annual interest grows to $1 050. This is where this story grows unlikely: the bank does not charge for buying and selling bonds. Next year the total sum is $12 850, which allows for three times $4 000, giving a yearly interest of $1 200. 
Here is your problem: given an amount to begin with, a number of years, and a set of bonds with their values and interests, find out how big the amount may grow in the given period, using the best schedule for buying and selling bonds.

Input

The first line contains a single positive integer N which is the number of test cases. The test cases follow. 
The first line of a test case contains two positive integers: the amount to start with (at most $1 000 000), and the number of years the capital may grow (at most 40). 
The following line contains a single number: the number d (1 <= d <= 10) of available bonds. 
The next d lines each contain the description of a bond. The description of a bond consists of two positive integers: the value of the bond, and the yearly interest for that bond. The value of a bond is always a multiple of $1 000. The interest of a bond is never more than 10% of its value.

Output

For each test case, output – on a separate line – the capital at the end of the period, after an optimal schedule of buying and selling.

Sample Input

1
10000 4
2
4000 400
3000 250

Sample Output

14050

完全背包的存钱问题：第一次提交时，runtime error,一般情况下都是内存溢出等问题，第二次将整体缩小1000倍，过了。好方法！

c++.完全背包

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
#define maxn 50005

int t,y,type,sta;
int m[11],lx[11],dp[maxn];

void solve()
{
	memset(dp,0,sizeof(dp));
    scanf("%d%d%d",&sta,&y,&type);
    for(int i=0;i<type;i++)
	scanf("%d%d",&m[i],&lx[i]),m[i]/=1000;

    int sum=sta;
while(y--)
		{
            sta/=1000;
			for(int i=0;i<type;i++)
			for(int j=m[i];j<=sta;j++)
            dp[j]=max(dp[j],dp[j-m[i]]+lx[i]);//所获得的最大利息
            sum+=dp[sta],sta=sum;
        }
			printf("%d\n",sum);
}

int main()
{
	scanf("%d",&t);
	while(t--) solve();
	return 0;
}