Piggy-Bank hd 1114 (完全背包)
来源:互联网 发布:余佳文 知乎 编辑:程序博客网 时间:2024/05/16 08:48
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.
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.
题意:有一个储钱罐,告诉储钱罐多重,然后每个分值钱币的重量,问储钱罐里最少多少钱
思路:完全背包问题,刚开始一点不会,后来看了网上的一个代码就明白了
#include<cstdio>#include<cstring>int num[10001],w[500],v[500];int main(){int n,m,e,f,t,i,j;scanf("%d",&t);while(t--){scanf("%d%d",&e,&f);m=f-e;scanf("%d",&n);for(i=0;i<n;i++){scanf("%d%d",&v[i],&w[i]);}num[0]=0;for(i=1;i<=m;i++)num[i]=-1;for(i=0;i<n;i++){for(j=w[i];j<=m;j++)<span style="white-space:pre"></span>//正序递增 和01背包的主要区别{if(num[j-w[i]]!=-1&&num[j]!=-1){if(num[j-w[i]]+v[i]<num[j])num[j]=num[j-w[i]]+v[i];}else if(num[j-w[i]]!=-1&&num[j]==-1){num[j]=num[j-w[i]]+v[i];}}}if(num[m]!=-1)printf("The minimum amount of money in the piggy-bank is %d.\n",num[m]); else printf("This is impossible.\n");}return 0;}
0 0
- Piggy-Bank hd 1114 (完全背包)
- HD Piggy-Bank完全背包
- 第二讲 完全背包问题 HD Piggy-Bank 1114
- 完全背包- Piggy-Bank
- Piggy-Bank(完全背包)
- 完全背包,piggy-bank
- Piggy-Bank (完全背包)
- Piggy-Bank完全背包
- 【完全背包】Piggy - Bank
- Piggy-Bank(完全背包)
- HDOJ 1114 Piggy-Bank 完全背包
- hdu 1114 Piggy-Bank(完全背包)
- HDOJ 1114 Piggy-Bank (完全背包)
- hdu 1114 Piggy-Bank【完全背包】
- hdu 1114 Piggy-Bank(完全背包)
- HDU 1114 Piggy-Bank (完全背包)
- HDU 1114 Piggy-Bank ( 完全背包 )
- HDU 1114 Piggy-Bank完全背包
- https安全在哪里,原理是什么?
- 我的Anrdoid之旅(十二)---RollPagerView的使用方法
- 并发编程八:volatile关键字
- atsha204a加密芯片使用攻略——配置篇
- 数组去重的两种方式
- Piggy-Bank hd 1114 (完全背包)
- java允许请求跨域访问
- C# 闭包对象
- STL之deque容器
- 1058 N的阶乘的长度
- AES加密解密算法的FPGA实现(一)
- 【杭电oj206】Picture
- java简单加密解密
- 使用Sublime Text 3的HTML-CSS-JS Prettify插件格式化代码