ACM3-1018
2016-05-28 10:20
120 查看
Problem R
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 60 Accepted Submission(s) : 29
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
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.
题目大意:称出背包装物品前后的重量,求最小价值。
#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.\n");
else
printf("The minimum amount of money in the piggy-bank is %d.\n",dp[w2-w1]);
}
return 0;
}
相关文章推荐
- 机器学习界大牛林达华推荐
- 一站式学习Wireshark(五):TCP窗口与拥塞处理
- ThinkPHP的M层遇到数据表有下划线的
- ACM 搜索 hdu 2612 Find a way
- 包名下存储
- @Resource和@Autowired
- C#根据文件流判断文件类型
- 一站式学习Wireshark(四):网络性能排查之TCP重传与重复ACK
- NYOJ 矩形嵌套--16
- ThinkPHP+phpstudy2014报 no input错误
- 一站式学习Wireshark(三):应用Wireshark IO图形工具分析数据流
- windows和linux下Tomcat内存的分配与溢出的配置详解
- SD卡文件存储
- 关于解决Xcode更新7.3之后插件不能用的问题
- 为什么Actor模型是高并发事务的终极解决方案?
- 算法学习与代码实现4——冒泡排序
- SQL简介
- 异步传输与同步传输区别
- 撤销修改
- 系统联系人