【杭电oj1114】Piggy-Bank
来源:互联网 发布:恒指期货实时行情数据 编辑:程序博客网 时间:2024/06/06 07:21
Piggy-Bank
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21041 Accepted Submission(s): 10701
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: 2191 1203 1059 1074 1024
完全背包模板题。
#include<cstdio>#include<cstring>#include<algorithm>#include<iostream>#define inf 1000000001using namespace std;const int N = 10000+10;const int M = 505;int dp[N],val[M],vol[M];//不同总质量时的总价值,单个质量,单个价值int main() {int T;scanf("%d",&T);while(T--) {int E,F,v,n;scanf("%d %d",&E,&F);v=F-E;scanf("%d",&n);for(int i=0; i<n; i++) {scanf("%d %d",&val[i],&vol[i]);}for(int i=0; i<N; i++)dp[i]=inf;dp[0]=0;for(int i=0; i<n; i++) {// for(int i=0; i<nPack; ++i) // for(int j=weight[i]; j<=nVolume; ++j) // if(record[j]>record[j-weight[i]]+value[i]) // record[j] = record[j-weight[i]]+value[i];for(int j=vol[i]; j<=v; j++) {if(dp[j]>dp[j-vol[i]]+val[i])dp[j]=dp[j-vol[i]]+val[i];}//printf("--\n");}if(dp[v]==inf)printf("This is impossible.\n");elseprintf("The minimum amount of money in the piggy-bank is %d.\n",dp[v]);}return 0;}题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1114
0 0
- 【杭电oj1114】Piggy-Bank
- 杭电OJ1114----------------Piggy-Bank ~完全背包~
- 杭电1114-Piggy-Bank
- 杭电1114Piggy-Bank
- HDOJ 1114 Piggy-Bank 杭电 ACM
- HDU--杭电--1114--Piggy-Bank--背包
- 杭电OJ 1114:Piggy-Bank
- 完全背包 杭电 1114Piggy-Bank
- 杭电-1114 Piggy-Bank(完全背包)
- 杭电OJ——1114 Piggy-Bank(完全背包)
- Piggy-Bank
- Piggy-Bank
- Piggy-Bank
- Piggy-Bank
- Piggy-Bank
- Piggy-Bank
- Piggy-Bank
- Piggy-Bank
- Effective C++ Item 12-复制对象时忽忘其每一个成分
- JS中typeof用法
- Linux下的PS和grep指令的简单使用
- RxAndroid结合Retrofit,看看谁才是最佳拍档!
- 《设计模式之装饰模式》
- 【杭电oj1114】Piggy-Bank
- Ensemble methods --Bagging meta-estimator
- 输出一个集合的所有子集
- iOS vDSP中的矢量绝对值
- xheditor的使用方法
- va_list原理及用法
- java 线程模拟文件下载
- 为什么编程时间从1970年1月1日开始?
- 设计模式总结之Command Pattern(命令模式)