练习三1018
来源:互联网 发布:果冻录音软件怎么样 编辑:程序博客网 时间:2024/06/05 14:38
Problem R
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 32 Accepted Submission(s) : 15
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. <br><br>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! <br>
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. <br>
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.". <br>
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.
Statistic |Submit | Back
题意:
已知储钱罐内硬币的质量,给出若干种硬币的面值及其质量,每种有无数个,问储钱罐内硬币面值的最小值。
已知储钱罐内硬币的质量,给出若干种硬币的面值及其质量,每种有无数个,问储钱罐内硬币面值的最小值。
思路:
完全背包问题,要求背包必须装满,应该赋初值为无穷,由于求最小所以赋初值为负无穷,在套公式即可。
完全背包问题,要求背包必须装满,应该赋初值为无穷,由于求最小所以赋初值为负无穷,在套公式即可。
代码:
#include<iostream>
#include<string.h>
using namespace std;
long long min(long x,long y)
{
return x<y?x:y;
}
int main()
{
int t,e,f,n,p[50005],w[10005];
long long dp[10005];
cin>>t;
while(t--)
{
dp[0]=0;
cin>>e>>f;
for(int i=1;i<=f-e;i++)
dp[i]=100000000;
cin>>n;
for(int i=0;i<n;i++)
cin>>p[i]>>w[i];
for(int i=0;i<n;i++)
{
for(int j=w[i];j<=f-e;j++)
dp[j]=min(dp[j],dp[j-w[i]]+p[i]);
}
if(dp[f-e]==100000000)
cout<<"This is impossible."<<endl;
else
cout<<"The minimum amount of money in the piggy-bank is "<<dp[f-e]
<<"."<<endl;
}
return 0;
}
#include<string.h>
using namespace std;
long long min(long x,long y)
{
return x<y?x:y;
}
int main()
{
int t,e,f,n,p[50005],w[10005];
long long dp[10005];
cin>>t;
while(t--)
{
dp[0]=0;
cin>>e>>f;
for(int i=1;i<=f-e;i++)
dp[i]=100000000;
cin>>n;
for(int i=0;i<n;i++)
cin>>p[i]>>w[i];
for(int i=0;i<n;i++)
{
for(int j=w[i];j<=f-e;j++)
dp[j]=min(dp[j],dp[j-w[i]]+p[i]);
}
if(dp[f-e]==100000000)
cout<<"This is impossible."<<endl;
else
cout<<"The minimum amount of money in the piggy-bank is "<<dp[f-e]
<<"."<<endl;
}
return 0;
}
0 0
- 练习三1018
- 练习三 1018
- SDAU练习三1018
- 练习三
- 2016SDAU编程练习三1018
- 2016SDAU课程练习三1018
- 数据库练习三
- 数据库练习三答案
- 网工练习(三)
- 网工练习(三)
- Sql语句练习三
- 练习三:字符串倒置
- 练习基础题《三》
- 查询练习(三)
- oracle练习(三)
- 指针练习三
- oracle练习(三)
- 三、Hash练习_1156_1
- 正则表达式30分钟入门教程
- 数据类型
- 第一章 JAVA入门(Android历史版本续3)
- struts2中使用注解配置Action
- 网页的渲染
- 练习三1018
- pl/sql 复合类型,游标
- spring-mybatis版本的坑
- Java ClassLoader基础及加载不同依赖 Jar 中的公共类
- acm-HD-11版
- Android Reference官方描述
- 2016"百度之星" - 初赛(Astar Round2A)1006 Gym Class(优先队列+拓扑排序)
- 第一章 JAVA入门(Android历史版本续1)
- Struts2+Hibernate+Spring 整合示例==》Spring整合Struts2简单示例==》Spring整合Hibernate简单示例