HDU 1114 完全背包
2016-04-09 15:02
267 查看
Piggy-Bank
dp[i] = min(dp[i], dp[i - w[j]] + p[j]);
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!
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 weightsare 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 weightcannot be reached exactly, print a line "This is impossible.".
Sample Input
310 110
2
1 1
30 50
10 110
2
1 1
50 30
1 6
2
10 3
20 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 <vector> #include <algorithm> #include<map> #include<vector> #include<queue> #include<string> #include<set> #include<cmath> #include<cstdio> #include<sstream> #include<cstring> #define INF 1000000000 //#pragma warning(disable:4996) using namespace std; int p[505]; int w[505]; int a[5005]; int dp[10005]; int main() { //freopen("s.txt", "r", stdin); int t; cin >> t; int e, f; while (t--) { cin >> e >> f; int n; cin >> n; for (int i = 0; i < n; i++) { cin >> p[i] >> w[i]; } for (int i = 0; i < 10004; ++i) { dp[i] = INF; } dp[e] = 0; for (int i = e + 1; i <= f; ++i) { for (int j = 0; j < n; ++j) { if (i - w[j] >= e) dp[i] = min(dp[i], dp[i - w[j]] + p[j]); } } if (dp[f] == INF) cout << "This is impossible." << endl; else cout << "The minimum amount of money in the piggy-bank is " << dp[f] << "." << endl; } return 0; }
相关文章推荐
- 使用C++实现JNI接口需要注意的事项
- 关于指针的一些事情
- c++ primer 第五版 笔记前言
- share_ptr的几个注意点
- Lua中调用C++函数示例
- Lua教程(一):在C++中嵌入Lua脚本
- Lua教程(二):C++和Lua相互传递数据示例
- C++联合体转换成C#结构的实现方法
- C++高级程序员成长之路
- C++编写简单的打靶游戏
- C++ 自定义控件的移植问题
- C++变位词问题分析
- C/C++数据对齐详细解析
- C++基于栈实现铁轨问题
- C++中引用的使用总结
- 使用Lua来扩展C++程序的方法
- C++中调用Lua函数实例
- Lua和C++的通信流程代码实例
- C与C++之间相互调用实例方法讲解
- 解析C++中派生的概念以及派生类成员的访问属性