完全背包
来源:互联网 发布:汉聚网络可靠吗 编辑:程序博客网 时间:2024/05/29 19:58
HDU-1114
Piggy-Bank
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 27851 Accepted Submission(s): 14057
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.
#include<iostream>#include<string.h>#define INF 0x3f3f3f3fusing namespace std;int a[10005];int main(){int t;cin>>t;while(t--){int i,j,e,f,n,p,w;cin>>e>>f;memset(a,0x3f,sizeof(a));//此处很神奇a[0]=0;cin>>n;for(i=0;i<n;i++){cin>>p>>w;for(j=w;j<=f-e;j++){if(a[j]>a[j-w]+p)//关键a[j]=a[j-w]+p;}}if(a[f-e]==INF)cout<<"This is impossible."<<endl;else cout<<"The minimum amount of money in the piggy-bank is "<<a[f-e]<<"."<<endl;}}
阅读全文
0 0
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包!!
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 完全背包
- 设计模式(13)——职责链 Chain Of Responsibility
- 数据结构—AVL树
- 电路板初级知识
- Material Design学习之滑动菜单——DrawerLayout 和NavigationView(2)
- css的梳理
- 完全背包
- 基于OpenCv的四轴飞行器寻迹系统(二)——linux下QT的安装及导入OpenCv
- 简单的sort排序
- 异常
- Python实战(2)——爬取妹子图片
- ctentos下 安装nginx个人经验心得(新手看,高手忽略)
- 设计模式(15)——解释器 Interpreter
- 51nod 1414 冰雕
- Visio写E-R图