hdu 1114 Piggy - Bank [완전 가방]
제목 링크: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): 5450 Accepted Submission(s): 2714
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
Recommend
Eddy
클래식 한 완전 가방 입문 문제.
완전 가방 문제, 할 줄 모 르 잖 아!!
제목 대의: 포장 물품 의 앞 뒤 무 게 를 달 아 최소 가 치 를 구한다.
다음 에 kb 신의 코드 를 붙 여 주세요. 강력 한 kb 신 에 게 감 사 드 립 니 다...소스 코드http://www.cnblogs.com/kuangbin/archive/2011/08/04/2127887.html kb 신
#include<stdio.h>
#include<string.h>
#define INF 0x7ffffff
#define MAXN 10000
int dp[MAXN+10];//dp[i] i
int main()
{
int w1,w2;
int P,W;
int T,n;
int i,j;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&w1,&w2);
scanf("%d",&n);
for(i=1;i<=w2-w1;i++)
dp[i]=INF;//
dp[0]=0;
while(n--)
{
scanf("%d%d",&P,&W);
for(i=W;i<=w2-w1;i++)
if(dp[i]>dp[i-W]+P)
dp[i]=dp[i-W]+P;
}
if(dp[w2-w1]==INF) printf("This is impossible.
");
else
printf("The minimum amount of money in the piggy-bank is %d.
",dp[w2-w1]);
}
return 0;
}
위의 생각 에 따라 쓴 배열 의 일반적인 코드 를 붙 여 라.
//AC 93ms 292k 15kb (by C++)
#include<stdio.h>
#include<string.h>
int p[505],w[505];
int dp[10005];
int min(int a,int b)
{
return a < b ? a : b ;
}
int main()
{
int test;
int empty,full;
int n;
int i,j,k;
scanf("%d",&test);
while(test--)
{
scanf("%d%d",&empty,&full);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d%d",&p[i],&w[i]);
memset(dp,1,sizeof(dp));
dp[0]=0;
for(i=1;i<=n;i++)
for(j=w[i];j<=full-empty;j++)////
dp[j]=min(dp[j],dp[j-w[i]]+p[i]);
if(dp[full-empty]==16843009)
printf("This is impossible.
");
else
printf("The minimum amount of money in the piggy-bank is %d.
",dp[full-empty]);
}
return 0;
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
IBM Portal에서 자동 JSP 재부팅 활성화포털 서버를 다시 시작하지 않고 주제와 외관 JSP에 대한 변경 사항을 보려면 응용 프로그램 서버에서 JSP의 새 버전을 자동으로 검사하도록 강제할 수 있습니다.이것은 개발과 테스트 목적에 이상적이지만 성능 문제로 ...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.