HDU 1114.Piggy-Bank【背包问题(DP)】【4月24】
来源:互联网 发布:c语言教学视频哪个好 编辑:程序博客网 时间:2024/06/07 22:18
Piggy-Bank
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19098 Accepted Submission(s): 9680
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.
题意:给定一个重量(F-E)即N个重量为w价值为p的钱,求达到w的最小的p。
#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int inf = 0x3f3f3f3f;int main(){ int T, E, F, N, f[10005], p, w; scanf("%d", &T); while(T--) { memset(f, 0x3f, sizeof(f)); f[0] = 0;//别忘了 scanf("%d %d %d", &E, &F, &N); int n = F-E; for(int i = 0;i < N; ++i) { scanf("%d %d", &p, &w); for(int j = w;j <= n; ++j) { f[j] = min(f[j], f[j-w]+p);//求最小的 } } if(f[n] == inf) cout <<"This is impossible."<<endl; else cout <<"The minimum amount of money in the piggy-bank is "<< f[n] <<"."<<endl; } return 0;}
0 0
- HDU 1114.Piggy-Bank【背包问题(DP)】【4月24】
- 【HDU 1114】Piggy-Bank(dp||完全背包问题)
- hdu 1114 Piggy-Bank(DP背包)
- Piggy-Bank(dp完全背包问题)
- hdu Piggy-Bank (背包)
- HDU 1114 Piggy-Bank--DP--(裸完全背包)
- HDU 1114 Piggy-Bank(dp完全背包)
- 【DP|完全背包】HDU-1114 Piggy-Bank
- HDU 1114 Piggy-Bank(完全背包 DP)
- HDU 1114 Piggy-Bank(完全背包 DP)
- HDU 1114Piggy-Bank 背包dp
- 背包DP-HDU-1114-Piggy-Bank
- 【HDU 1114】Piggy-Bank(DP-完全背包)
- HDU 1114 Piggy-Bank(完全背包问题)
- POJ 1384 && HDU 1114 Piggy-Bank(完全背包问题)
- HDU 1114 Piggy-Bank(完全背包问题)
- hdu 1114 Piggy-Bank(完全背包问题)
- Piggy-Bank+hdu+01完全背包问题
- C++第4次作业
- 简单堆排序(大根堆)
- 所有Android开发者必须阅读的博客整理
- 动态规划算法之:最长公共子序列 & 最长公共子串(LCS)
- (SDL)(02) Differences Between SDL 1.2 And SDL 2.0
- HDU 1114.Piggy-Bank【背包问题(DP)】【4月24】
- HDU 1266 Reverse Number(模拟or数字字符串)
- 亲爱的!直接建此类传一个URL即可得到json串非常方便
- Android存储选择
- Git的使用
- 连连看 赛码网 1175
- 北京林业大学“计蒜客”杯程序设计竞赛 D. A letter from Chensg
- PHP数组学习笔记
- nodejs小问题:[1]express不是内部或外部命令