HDU 1114 Piggy-Bank 完全背包变形
来源:互联网 发布:c语言大全 pdf 编辑:程序博客网 时间:2024/06/03 22:10
Piggy-Bank
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26994 Accepted Submission(s): 13658
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!
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
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.
Source
Central Europe 1999
Recommend
Eddy | We have carefully selected several similar problems for you: 1059 1074 1024 1025 1078
题意就是有个存钱罐(长得像猪),不知道里面有多少钱,现在给你说几个硬币的价值和重量,让你判断里面最少有多少钱,如果,最小一个硬币也放不进去,那么就是impossible
就是完全背包,每一个物品无限多个,让你求
dp【】=0x3f3f3f3f
这里注意一个状态dp【0】=0;
ac代码:
#include <cstdio>#include <iostream>#include <cmath>#include <cstring>#include <string>#include <stack>#include <queue>#include <algorithm>#include <map>#define ll long long#define inf 1e18+5using namespace std;int t,e,f;int n,p[510],w[510];int dp[1000010];int main(){scanf("%d",&t);while(t--){scanf("%d%d",&e,&f);scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%d%d",&p[i],&w[i]);}int vol=f-e;memset(dp,0x3f,sizeof(dp)); dp[0]=0;for(int i=1;i<=n;i++){for(int j=w[i];j<=vol;j++){dp[j]=min(dp[j],dp[j-w[i]]+p[i]);}}if(dp[vol]==0x3f3f3f3f)printf("This is impossible.\n");elseprintf("The minimum amount of money in the piggy-bank is %d.\n",dp[vol]);}return 0;}
阅读全文
0 0
- 完全背包变形--hdu-1114-Piggy-Bank
- HDU 1114 Piggy-Bank 完全背包变形
- HDU 1114 Piggy-Bank 完全背包变形
- HDU 1114 Piggy-Bank 完全背包的变形
- HDU 1114 Piggy-Bank(完全背包动态规划+变形)
- HDU NO.1114 Piggy-Bank(完全背包变形,01背包的另一种形式)
- hdu 1114 Piggy-Bank(完全背包)
- hdu 1114 Piggy-Bank【完全背包】
- hdu 1114 Piggy-Bank(完全背包)
- HDU 1114 Piggy-Bank (完全背包)
- HDU 1114 Piggy-Bank ( 完全背包 )
- HDU 1114 Piggy-Bank完全背包
- hdu 1114 Piggy-Bank(完全背包)
- hdu 1114 Piggy-Bank(完全背包)
- hdu 1114 Piggy-Bank(完全背包)
- hdu 1114 Piggy-Bank 完全背包
- HDU 1114 Piggy-Bank 完全背包
- HDU 1114 Piggy-Bank (完全背包)
- Junit小入门
- 【Mybatis从0到1-004】模糊查询、更新、删除、添加用户
- codeforces 808C
- zcmu-1661- 近似回文词
- 数据库连接池
- HDU 1114 Piggy-Bank 完全背包变形
- MySQL查询缓存的优缺点
- 吞吐率、吞吐量、TPS、性能测试,纸上不谈兵----一步一步构建高性能 Web 站点
- 2017年8月10日提高组T1 数学
- 写给大家看的设计模式
- Python-基于OpenCV的摄像头圆心计算
- Maven编译错误:不兼容的类型的解决方案
- Solr__luence(三)检索与创建索引的API及名词解析
- HTTP协议入门