HDU_1114_Piggy-Bank
来源:互联网 发布:mac怎么搜索硬盘文件 编辑:程序博客网 时间:2024/05/18 00:00
Piggy-Bank
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27369 Accepted Submission(s): 13840
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 <iostream>#include <string>#include <cstdio>#include <cstring>#include <algorithm>#include <climits>#include <cmath>#include <vector>#include <queue>#include <stack>#include <set>#include <map>using namespace std;typedef long long LL ;typedef unsigned long long ULL ;const int maxn = 1e4 + 10 ;const int inf = 0x3f3f3f3f ;const int npos = -1 ;const int mod = 1e9 + 7 ;const int mxx = 100 + 5 ;const double eps = 1e-6 ;const double PI = acos(-1.0) ;int T, e, f, c, n;int w[maxn], p[maxn], dp[maxn];int main(){// freopen("in.txt","r",stdin);// freopen("out.txt","w",stdout);while(~scanf("%d",&T)){while(T--){scanf("%d %d",&e,&f);scanf("%d",&n);for(int i=0;i<n;i++)scanf("%d %d",&p[i],&w[i]);memset(dp,0x3f,sizeof(dp));dp[0]=0;c=f-e;for(int i=0;i<n;i++)for(int j=w[i];j<=c;j++)if(dp[j-w[i]]<inf)dp[j]=min(dp[j],dp[j-w[i]]+p[i]);if(dp[c]>=inf)printf("This is impossible.\n");elseprintf("The minimum amount of money in the piggy-bank is %d.\n",dp[c]);}}return 0;}
阅读全文
0 0
- HDU_1114_Piggy-Bank
- HDU_1114_Piggy-Bank(完全背包)
- bank
- bank
- bank
- Love Bank
- Physio Bank
- Mileage Bank
- channel bank
- Bank Business
- memory-bank
- ARM BANK
- BANK-1
- BANK-2
- BANK-3
- Bank Create
- bank 程序
- BANK 2.0
- 简单插入排序
- JSP表达式访问类私有成员的理解
- 字符串类/正则表达式
- 错误处理error C4996: 'fopen': This function or variable may be unsafe
- Java使用POI读取Excel操作
- HDU_1114_Piggy-Bank
- WebLogic使用总结(三)——WebLogic配置JNDI数据源
- Spring核心框架
- 解决spring4.x 版本的springmvc中提交数组时超过256个值报错问题
- 使用Spring实现读写分离( MySQL实现主从复制)
- OkHttp使用及工具类封装
- 1305:整数排序
- python基础-set
- Intersection HDU