HDU 1114 Piggy-Bank (完全背包水题,但注意一下时间输出)
来源:互联网 发布:java开发电商平台 编辑:程序博客网 时间:2024/05/14 05:23
Piggy-Bank
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
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.>>AC代码:完全背包问题:刚好装满 且取最小值。memset(d, 0x3f, sizeof d);//这个相当于赋值1061109567=0x3f3f3f3f,快捷#include <cstdio>#include <iostream>#include <cstring>#include <algorithm>using namespace std; int n, s, t, d[10010], p[550], w[550]; int main(){ int T; scanf("%d", &T); while(T--) { scanf("%d%d", &s, &t); scanf("%d", &n); for(int i=0; i<n; i++) scanf("%d%d", p+i, w+i); memset(d, 0x3f, sizeof d); d[s]=0; for(int i=s; i<=t; i++) for(int j=0; j<n; j++) if(i-s>=w[j]) d[i]=min(d[i], d[i-w[j]]+p[j]); if(d[t]==0x3f3f3f3f)//特别注意:d要开int类型才能判断相等,如果开longlong类型的话 由于字节数不同无法输出impossible puts("This is impossible."); else printf("The minimum amount of money in the piggy-bank is %d.\n", d[t]); } return 0;}
0 0
- HDU 1114 Piggy-Bank (完全背包水题,但注意一下时间输出)
- hdu 1114 Piggy-Bank(完全背包)
- hdu 1114 Piggy-Bank(完全背包)
- hdu 1114 Piggy-Bank(完全背包)
- HDU 1114 Piggy-Bank (完全背包)
- HDU 1114 Piggy-Bank (完全背包)
- HDU 1114 Piggy-Bank (完全背包)
- hdu 1114 Piggy-Bank(完全背包)
- hdu 1114 Piggy-Bank (完全背包)
- HDU 1114 Piggy-Bank (完全背包)
- HDU 1114 Piggy-Bank(完全背包)
- HDU - 1114 - Piggy-Bank (完全背包)
- hdu 1114 Piggy-Bank(完全背包)
- hdu 1114 Piggy-Bank(完全背包)
- HDU 1114 Piggy-Bank(完全背包)
- HDU 1114 Piggy-Bank (完全背包)
- HDU--1114 Piggy-Bank(完全背包)
- HDU 1114 Piggy-Bank (完全背包)
- HARK学习(七)--ConstantLocalization
- Mysql 字段类型属性
- 【bzoj3832】【poi2014】【Rally】【拓扑排序+线段树】
- AYIT606第七周周赛(动态规划) A - How many ways
- Android 在xml中配置 float 和 integer 值
- HDU 1114 Piggy-Bank (完全背包水题,但注意一下时间输出)
- unity3d c# 之事件
- Vim中的键映射
- 字符串、值类型引用类型
- 微信-网站 会员整合流程(会员同步登陆)
- 青云QingCloud 在不同场景化中的云计算应用
- HDU 1176 免费馅饼 (类似于数塔DP的题目,注意边界条件,细节处理)
- list4array.php
- windows下使用gvim搭建简单的IDE编译环境(支持C/C++/Python等)