Cash Machine
Description
A Bank plans to install a machine for cash withdrawal. The machine is able to deliver appropriate @ bills for a requested cash amount. The machine uses exactly N distinct bill denominations, say Dk, k=1,N, and for each denomination Dk the machine has a supply of nk bills. For example,
N=3, n1=10, D1=100, n2=4, D2=50, n3=5, D3=10 means the machine has a supply of 10 bills of @100 each, 4 bills of @50 each, and 5 bills of @10 each. Call cash the requested amount of cash the machine should deliver and write a program that computes the maximum amount of cash less than or equal to cash that can be effectively delivered according to the available bill supply of the machine. Notes: @ is the symbol of the currency delivered by the machine. For instance, @ may stand for dollar, euro, pound etc. Input
The program input is from standard input. Each data set in the input stands for a particular transaction and has the format:
cash N n1 D1 n2 D2 ... nN DN where 0 <= cash <= 100000 is the amount of cash requested, 0 <=N <= 10 is the number of bill denominations and 0 <= nk <= 1000 is the number of available bills for the Dk denomination, 1 <= Dk <= 1000, k=1,N. White spaces can occur freely between the numbers in the input. The input data are correct. Output
For each set of data the program prints the result to the standard output on a separate line as shown in the examples below.
Sample Input 735 3 4 125 6 5 3 350 633 4 500 30 6 100 1 5 0 1 735 0 0 3 10 100 10 50 10 10 Sample Output 735 630 0 0 Hint
The first data set designates a transaction where the amount of cash requested is @735. The machine contains 3 bill denominations: 4 bills of @125, 6 bills of @5, and 3 bills of @350. The machine can deliver the exact amount of requested cash.
In the second case the bill supply of the machine does not fit the exact amount of cash requested. The maximum cash that can be delivered is @630. Notice that there can be several possibilities to combine the bills in the machine for matching the delivered cash. In the third case the machine is empty and no cash is delivered. In the fourth case the amount of cash requested is @0 and, therefore, the machine delivers no cash. Source
Southeastern Europe 2002
|
————————————————————紧张的分割线————————————————————
思路:看一看发现这道题忘记发博客了。是学习多重背包的时候做的入门题目。思路是这样的,既然是每种物品有k件,那么可能这件物品就算填满背包都无法用完——这可以看作是完全背包。否则的话,就可以利用二进制降低复杂度,也就是将有限件的物品看作是1倍的该物体、2倍的该物体、4倍的该物体……件数是1,但是价值和体积翻倍。也就是说将01背包和多重背包组合起来。
这儿有一道多重背包的模板题:HDU-2191
代码如下:
/*
ID: j.sure.1
PROG:
LANG: C++
*/
/****************************************/
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <string>
#include <iostream>
using namespace std;
/****************************************/
const int N = 100010;
int V, f[N];
void Zero_pack(int cost, int worth)
{
for(int j = V; j >= cost; j--)
f[j] = max(f[j], f[j-cost] + worth);
}
void Comp_pack(int cost, int worth)
{
for(int j = cost; j <= V; j++)
f[j] = max(f[j], f[j-cost] + worth);
}
void Mult_pack(int cost, int worth, int bag)
{
if(bag * cost >= V)
Comp_pack(cost, worth);
else {
//二进制
for(int k = 1; k < bag; k <<= 1) {
Zero_pack(k*cost, k*worth);
bag -= k;
}
Zero_pack(bag*cost, bag*worth);
}
}
int main()
{
int n, cost, bag;
while(~scanf("%d%d", &V, &n)) {
memset(f, 0, sizeof(f));
for(int i = 0; i < n; i++) {
scanf("%d%d", &bag, &cost);
Mult_pack(cost, cost, bag);
}
printf("%d\n", f[V]);
}
return 0;
}