HDU1114完全背包模板
来源:互联网 发布:唐缺 知乎 编辑:程序博客网 时间:2024/05/29 09:01
Piggy-Bank
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26523 Accepted Submission(s): 13430
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
#include<cstdio>#include<iostream>#include<cstring>#include<string.h>using namespace std; int dp[10010];int x,n,e,f;int c[510],w[510];const int INF=99999999;int v;void complete(int cost,int weight){for(int i=cost;i<=v;i++)if(dp[i]>dp[i-cost]+weight)dp[i]=dp[i-cost]+weight;}int main(){int t;scanf("%d",&t);while(t--){scanf("%d%d",&e,&f);v=f-e;scanf("%d",&n);for(int i=0;i<10010;i++)dp[i]=INF;dp[0]=0;for(int i=0;i<n;i++){scanf("%d%d",&c[i],&w[i]);complete(w[i],c[i]);}if(dp[v]==INF)printf("This is impossible.\n");elseprintf("The minimum amount of money in the piggy-bank is %d.\n",dp[v]);}}
阅读全文
0 0
- HDU1114完全背包模板
- HDU1114 完全背包变形
- hdu1114 & poj1384 完全背包
- hdu1114完全背包
- HDU1114完全背包
- hdu1114(完全背包)
- hdu1114完全背包
- hdu1114(完全背包)
- HDU1114(完全背包)
- hdu1114 完全背包
- hdu1114 完全背包
- hdu1114 Piggy-Bank 完全背包
- Piggy-Bank hdu1114 完全背包
- hdu1114 Piggy-Bank (完全背包)
- HDU1114(完全背包问题)
- 简单的完全背包HDU1114
- HDU1114 Piggy-Bank 完全背包
- hdu1114 Piggy-Bank 完全背包
- 可靠消息服务在支付领域的应用
- python入门(二):字符的编码
- dede织梦调用顶级二级栏目及下三级栏目方法(数据库实现)
- Shiro集成spring--权限管理
- 从Ubuntu开始体验Linux
- HDU1114完全背包模板
- nginx之缓存补充
- P1554 梦中的统计
- 如何将view转换成bitmap
- 手机拍摄的身份证怎么制作为复印件?
- jeecg 增删改查 后台代码
- 彻底精通JSON
- window.event.keyCode值整理
- 2017 Multi-University Training Contest