Piggy-Bank(POJ-1384 && HDU-1114)
来源:互联网 发布:手机淘宝查看五星评价 编辑:程序博客网 时间:2024/05/18 20:13
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.
题意:用m空间装最小的价值并输出;
思路:完全背包,dp[0]一定要等于0,两个for循环,外循环是第几个东西,内循环是背包容量,完全背包内循环是正循环。
ps:输出格式一定要正确,这次就少了个点,WA三发;
#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#define INF 0x3f3f3f3fusing namespace std;int a[505],b[505];int t,n,e,f;int dp[10005];int main(){ scanf("%d",&t); while(t--) { scanf("%d%d",&e,&f); scanf("%d",&n); for(int i=0; i<n; i++) { scanf("%d%d",&a[i],&b[i]); } int m=f-e; for(int i=0; i<=m; i++) //初始化,因为要求最小价值,所以初值要大; { dp[i]=INF; } dp[0]=0; //这个地方一定要有; for(int i=0; i<n; i++) for(int j=b[i]; j<=m; j++) dp[j]=min(dp[j],dp[j-b[i]]+a[i]); if(dp[m]==INF) cout<<"This is impossible."<<endl; else cout<<"The minimum amount of money in the piggy-bank is "<<dp[m]<<"."<<endl; } return 0;}
阅读全文
0 0
- Piggy-Bank(POJ-1384 && HDU-1114)
- hdu 1114 && poj 1384 Piggy-Bank
- HDU 1114 POJ 1384 Piggy-Bank
- HDU 1114 || POJ 1384 Piggy-Bank
- poj 1384 && hdu 1114 Piggy-Bank (完全背包)
- POJ 1384 && HDU 1114 Piggy-Bank(完全背包问题)
- Poj 1384 & Hdu 1114 Piggy-Bank (完全背包)
- Piggy-Bank hdu 1114 ||poj 1384 完全背包
- poj 1384 Piggy-Bank
- poj 1384 Piggy-Bank
- POJ 1384 Piggy-Bank
- poj 1384 piggy-bank
- POJ 1384 Piggy-Bank
- POJ 1384 Piggy-Bank
- poj 1384 Piggy-Bank
- POJ 1384 Piggy-Bank
- poj 1384 Piggy-Bank
- POJ 1384 Piggy-Bank
- 关于hadoop中The method XXXX is not applicable for the arguments问题的解决
- Gitlab安装使用及汉化配置
- 试试新的地方
- git使用记录
- CSS--画三角形
- Piggy-Bank(POJ-1384 && HDU-1114)
- 线程中断——学习三
- 结合TabLayout 、ViewPager 、 Fragment 实现顶部导航栏,最实用!!!
- android 查询公交车还有几站的功能实现
- nginx + tomcat 的理解
- 关于在php中cookie和session的区别
- 一个样式看起来比较丰富的弹幕demo。使用了DanmakuFlameMaster弹幕引擎
- 10分钟教你把项目保存到github仓库保管代码
- hdu 1242