Piggy-Bank hdoj 1114
来源:互联网 发布:如何快速网络招商 编辑:程序博客网 时间:2024/05/16 23:51
Piggy-Bank
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 11259 Accepted Submission(s): 5689
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 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
3
10 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.
Source
Central Europe 1999
/*错误代码*/
/*#include<cstdio>
#include<stdlib.h>
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int n,e,f,p,w,m[1000],sum,s,sw,i;
scanf("%d%d",&e,&f);
sum=f-e;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&m[i]);
scanf("%d%d",&p,&w);
for(i=0,s=0;i<n;i++)
{
s+=p;
sw+=w*p/m[i];
}
if(sw<=sum)
printf("The minimum amount of money in the piggy-bank is%d.\n",s);
else
printf("This is impossible.\n");
}
system("pause");
return 0;
}*/
/*
Runtime Error(ACCESS_VIOLATION)
WA
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define M 10000
int money[M];
int wei[M];
int weight[M];
int minwei(int a,int b)
{
return a<b?a:b;
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
memset(money,0,sizeof(money));
memset(wei,0,sizeof(wei));
int E,F,N,i,j;
scanf("%d%d",&E,&F);
scanf("%d",&N);
F=F-E;
for(i=1;i<=N;i++)
scanf("%d%d",&money[i],&wei[i]);
memset(weight,0,sizeof(weight));
for(i=1;i<=N;i++)
{
for(j=wei[i];j<=F;j++)
{
if(weight[j]>0&&weight[j-wei[i]]+money[i]>0)
weight[j]=minwei(weight[j],weight[j-wei[i]]+money[i]);
else
weight[j]=weight[j-wei[i]]+money[i];
}
}
if(weight[F]<=F+E)
printf("The minimum amount of money in the piggy-bank is %d.\n",weight[F]);
else
printf("This is impossible.\n");
}
return 0;
}
*/
/*AC*/
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define M 10000 //注意范围:
#define P 10000000//尽可能大 ;
int money[M];
int wei[M];
int weight[M];
int minwei(int a,int b)
{
return a<b?a:b;
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
memset(money,0,sizeof(money));
memset(wei,0,sizeof(wei));
int E,F,N,i,j;
scanf("%d%d",&E,&F);
scanf("%d",&N);
F=F-E;
for(i=1;i<=N;i++)
scanf("%d%d",&money[i],&wei[i]);
memset(weight,0,sizeof(weight));
for(i=1;i<=F;i++)//关键
weight[i]=P; //关键
//weight[0]=0; //关键 ,发现没有这步也可以AC,???这一步是看到人家的才加上去的
for(i=1;i<=N;i++)
{
for(j=wei[i];j<=F;j++)
{
weight[j]=minwei(weight[j],weight[j-wei[i]]+money[i]);
}
}
if(weight[F]!=P)
printf("The minimum amount of money in the piggy-bank is %d.\n",weight[F]);
else
printf("This is impossible.\n");
}
return 0;
}
- HDOJ 1114 Piggy-Bank
- Piggy-Bank hdoj 1114
- hdoj 1114 Piggy-Bank
- HDOJ 1114 Piggy-Bank
- 【hdoj 1114】Piggy-Bank
- HDOJ-1114 Piggy-Bank
- HDOJ -- 1114 Piggy-Bank
- hdu/hdoj 1114 Piggy-Bank
- HDOJ HDU 1114 Piggy-Bank
- zju 2014/ hdoj 1114-Piggy-Bank
- HDOJ 1114 Piggy-Bank 完全背包
- HDOJ 1114 Piggy-Bank (完全背包)
- HDOJ 1114 Piggy-Bank (多重背包)
- HDOJ--1114--Piggy-Bank【背包问题】
- HDOJ 1114 Piggy-Bank 杭电 ACM
- HDOJ 1114 Piggy-Bank(完全背包,水)
- HDOJ-1114 Piggy-Bank 完全背包
- HDOJ 1114 Piggy-Bank(完全背包)
- 图像检索:RGBHistogram+欧几里得距离|卡方距离
- ASP.NET Web API之消息[拦截]处理
- 如何在Quartus II中设置Virtual pin
- 取消vs2013在solution中单击打开文件的功能
- android里,addContentView()动态增加view控件,并实现控件的顶部,中间,底部布局
- Piggy-Bank hdoj 1114
- 写代码的被美女老板看上——室内地图GIS
- 基于注解配置简单的SpringMVC+Mybatis
- 为VS2005添加cl.exe的环境变量
- HDU 4902 双标记线段树
- How many 杭电oj 2609 hdu2609 最小表示
- Android 通过WebView来播放flash在线视频流
- PAT 1078 Hashing (25)
- 微信创业的时代来临,你准备好了吗?