poj 1384 完全背包
来源:互联网 发布:西马智能马桶好吗 知乎 编辑:程序博客网 时间:2024/05/20 19:46
题目:
Piggy-Bank
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11989 Accepted: 5807
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!
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.
Source
Central Europe 1999
给出n种硬币的价值和重量,每一种硬币有无限多个,选中一些硬币使得它们重量之和为f-e且价值之和最小 如果不存在重量之和为f-e的情况,输出-1
分析:
完全背包问题 由于要求重量之和恰为f-e dp数组除了首元素之外其他都应该初始化为inf 如果更新之后dp[f-e]依然为inf,说明无解
代码:
#include<iostream>#include<stdio.h>using namespace std;const int inf=0x7f7f7f7f;const int maxn=10010;int val[550],cost[550],dp[maxn];int t,n,v;inline void compak(int val,int cost){ for(int i=cost;i<=v;++i){ dp[i]=min(dp[i],dp[i-cost]+val); }}int main(){ int e,f; scanf("%d",&t); while(t--){ scanf("%d%d",&e,&f); v=f-e; scanf("%d",&n); for(int i=1;i<=n;++i) scanf("%d%d",&val[i],&cost[i]); for(int i=1;i<=v;++i) dp[i]=inf; dp[0]=0;///总重量为零时价值最小值为0 而非重量为1时!!!!! for(int i=1;i<=n;++i) compak(val[i],cost[i]); if(dp[v]==inf) puts("This is impossible."); else printf("The minimum amount of money in the piggy-bank is %d.\n",dp[v]); } return 0;}
阅读全文
0 0
- POJ-1384 完全背包
- POJ 1384 完全背包
- poj 1384完全背包
- 完全背包 poj 1384
- poj 1384完全背包
- poj 1384 完全背包
- 完全背包 POJ 1384
- POJ 1384 完全背包
- POJ-1384 完全背包
- POJ 1384 【完全背包】
- POJ 1384【完全背包】
- poj 1384 完全背包
- poj 1384 完全背包问题
- POJ 1384 完全背包问题
- POJ 1384 完全背包问题
- poj 1384 Piggy-Bank 完全背包
- poj 1384Piggy-Bank(完全背包)
- POJ 1384 Piggy-Bank (完全背包)
- HTML学习笔记(Day4)
- 热修复框架Tinker最完整讲解(02)——加入Walle多渠道打包
- 润乾V5行式填报表自动插入空行
- 242. Valid Anagram
- 自解压winrar
- poj 1384 完全背包
- bzoj3884上帝与集合的正确用法 欧拉定理
- ubuntu搭建android开发环境
- xshell ping不通虚拟机
- 棋盘覆盖问题
- win10系统出现“服务主机:本地服务(无网络)(6)”占用大量内存和CPU情况的解决方案
- 第4章 Python笔记 字典
- ionic项目 js查找文件并且转换成base64
- 学习jquery源代码---$.extend