背包DP hdu 1114题
来源:互联网 发布:阿里云logo 矢量 编辑:程序博客网 时间:2024/05/17 07:54
链接:http://acm.hdu.edu.cn/showproblem.php?pid=1114
Piggy-Bank
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5402 Accepted Submission(s): 2678
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.
注释:
代码一和二不同的是dp状态表示的含义不同,代码一dp[i]表示背包中所剩空间为 i,而代码二dp[i]表示已占用的空间为 i,意义不同,所以表达的方式略有不同。
代码一:
#include<stdio.h>#include<string.h>#define inf 500000005#define maxn 505int min(int a,int b){return a<b?a:b;}int main(){int i,j,k,n,m,t;int e,f;int temp;int c[maxn],v[maxn],dp[10005];scanf("%d",&t);while(t--){scanf("%d%d",&e,&f);scanf("%d",&n);for(i=1;i<=n;i++)scanf("%d%d",&v[i],&c[i]);temp=f-e;for(i=0;i<=temp;i++)dp[i]=inf;dp[temp]=0;for(i=temp;i>=0;i--)for(j=1;j<=n;j++)if(i+c[j]<=temp)dp[i]=min(dp[i],dp[i+c[j]]+v[j]);if(dp[0]==inf)printf("This is impossible.\n");elseprintf("The minimum amount of money in the piggy-bank is %d.\n",dp[0]);}return 0;}
代码二:
#include <stdio.h> #include <string.h> #define N 501 #define inf 1000000000 int dp[10001],g[10001],p[N],w[N]; int main() { int T,n,t,v,i,j; scanf("%d",&T); while (T--) { scanf("%d%d",&t,&v); for (i=1;i<=v;i++) dp[i]=inf; v-=t; dp[0]=0; scanf("%d",&n); for (i=1;i<=n;i++) scanf("%d%d",&p[i],&w[i]); for (i=1;i<=n;i++) for (j=w[i];j<=v;j++) dp[j]=dp[j]>dp[j-w[i]]+p[i]?dp[j-w[i]]+p[i]:dp[j];// if (dp[j-w[i]]+p[i]<dp[j]) dp[j]=dp[j-w[i]]+p[i]; if (dp[v]==inf) printf("This is impossible.\n"); else printf("The minimum amount of money in the piggy-bank is %d.\n",dp[v]); } return 0; }
- 背包DP hdu 1114题
- DP 完全背包 hdu 1114
- HDU 1114 完全背包dp
- [DP-完全背包] HDU 1114
- hdu 1114 Piggy-Bank(DP背包)
- HDU 1114 1248(DP,完全背包)
- 【DP|完全背包】HDU-1114 Piggy-Bank
- HDU 1114 Piggy-Bank(完全背包 DP)
- HDU 1114 Piggy-Bank(完全背包 DP)
- HDU 1114 (dp 完全背包)
- HDU 1114Piggy-Bank 背包dp
- 背包DP-HDU-1114-Piggy-Bank
- 【HDU 1114】Piggy-Bank(DP-完全背包)
- hdu 2844 DP 背包
- HDU 4901 DP背包
- DP 01背包 hdu 2602
- hdu 2602 DP 01背包
- hdu 2955(DP背包问题)
- {{JS}}URL中的Javascript
- 程序员最该看的30本书---------------------------国外编辑推荐
- .NET 调用DLL实现(带源码)
- CSDN 你好
- SQLServer数据库海量数据查询优化及分页算法
- 背包DP hdu 1114题
- Java枚举类
- 命令行下面使用ftp
- ssh
- mysql 用户管理和权限管理
- 一些其他知识学习
- poj1861
- 输入输出函数
- 那些让人惊叹的的国外创意404错误页面设计