HDU1114(完全背包装满问题)
2016-07-01 15:09
387 查看
Piggy-Bank
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19849 Accepted Submission(s): 10086
[align=left]Problem Description[/align]
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!
[align=left]Input[/align]
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.
[align=left]Output[/align]
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.".
[align=left]Sample Input[/align]
3
10 110
2
1 1
30 50
10 110
2
1 1
50 30
1 6
2
10 3
20 4
[align=left]Sample Output[/align]
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 <cstdio> #include <cstring> #include <algorithm> using namespace std; const int INF=0x3f3f3f3f; const int MAXN=10005; int n,W; int v[MAXN],w[MAXN]; int dp[MAXN]; int main() { int T; scanf("%d",&T); while(T--) { int e,f; scanf("%d%d",&e,&f); scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d%d",&v[i],&w[i]); } W=f-e; for(int i=0;i<MAXN;i++) { dp[i]=INF;//大前提:背包装满.因为求获得的价值最小,所以需要将dp初始化正无穷.若求价值最大,则将dp初始化为负无穷 } dp[0]=0;//背包需要装满,则将dp[0]初始化为0 for(int i=0;i<n;i++) { for(int j=w[i];j<=W;j++) //完全背包:逆序 dp[j]=min(dp[j-w[i]]+v[i],dp[j]);//求最小的价值 } if(dp[W]==INF) { printf("This is impossible.\n"); } else { printf("The minimum amount of money in the piggy-bank is %d.\n",dp[W]); } } return 0; }
相关文章推荐
- 设计模式——工厂方法
- 数据的持久化以及主键的自动生成
- .net web开发基础知识总结
- const常量与define宏定义的区别
- 双向认证SSL原理
- php中set_time_limit()函数运用
- synchronized的使用方法
- 使用百度糯米api抓取指定范围poi数据方法
- android 基础之配置文件
- 用UIButton做出cell的点击效果《一》
- 在 Web 项目中应用 Apache Shiro
- iOS 动画(三)CABasicAnimation animationWithKeyPath 一些规定的值
- DTrace Probes in HotSpot VM----java
- select2搜索框查询加遍历
- ELK使用指南
- linux如何查看系统是多少位的?64 OR 32
- python安装cx_oracle psutil插件等问题
- 搭建windows远程ubuntu服务器全套解决方案
- Android Studio常见错误归纳
- zookeeper安装配置