(完全背包) hdu 1114 Piggy-Bank
来源:互联网 发布:js的关键字 编辑:程序博客网 时间:2024/05/12 11:38
Piggy-Bank
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.
动态方程为: dp[ j ]=min( dp[ j ] , dp[ j-w[i] ] + p [ i ] ); j-w[ i ] 表示减去上一个硬币的重量 , dp[ j-w[i] ] + p[ i ] 表
示当前硬币的重量的最小价值
两层循环:
第一层 硬币种数 ;第二层 存钱罐重量
#include<stdio.h>#include<string.h>#define MIN(x,y)(x<y?x:y)#define inf 0x3f3f3f3fint p[510],w[510],dp[10009];int main(){int E,F,N,t;int wk;scanf("%d",&t);while(t--){memset(p,0,sizeof(p));memset(w,0,sizeof(w));scanf("%d%d",&E,&F);wk=F-E;scanf("%d",&N);for(int i=0;i<N;i++)scanf("%d%d",&p[i],&w[i]);for(int i=0;i<=wk;i++)dp[i]=inf;dp[0]=0;for(int i=0;i<N;i++){for(int j=w[i];j<=wk;j++){dp[j]=MIN(dp[j],dp[j-w[i]]+p[i]);}}if(dp[wk]>=inf)printf("This is impossible.\n"); else printf("The minimum amount of money in the piggy-bank is %d.\n",dp[wk]);}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 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 (完全背包)
- HDU 1114 Piggy-Bank (完全背包)
- 数据结构 第二章 线性表(1)顺序线性表的实现
- iOS设计模式--原型模式
- 对AnyChat录屏解决方案的调研报告
- 第1周项目3—1~m的求解任务
- android editText 软键盘enter键图标的设置
- (完全背包) hdu 1114 Piggy-Bank
- SWT入门
- FZU 1301 Matrix(深度优先搜索)
- 04-xftp实现Windows和linux文件传输
- Java JNI Demo
- python学习笔记1
- 线性回归与梯度下降算法
- Qextserialport类介绍
- 整理:统计学习-2 感知机