poj 1276(背包问题,二进制优化技巧）

Cash Machine

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 24663		Accepted: 8645

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

这是一个多重背包问题。

使用《背包九讲》中的二进制优化技巧，优化为0-1背包：

因为这里需要同时满足两个条件：拆分成的新背包值之和不能超过nk，且必须能组成[1-nk]的所有值。

例如：13的二进制表示是 1101， 如果按照最原始的拆分方法拆成1000(8), 0100(4), 0010(2), 0001(1) 这样显然不行，因为如果同时选了这四个背包，将会超过13。 而如果只选有1的位置：1000(8), 0100(4), 0001(1) 这样尽管不会超过13， 但并不能构成值2， 所以也不可行。

因此参考背包九讲中的拆分方法：

1, 2, 4, ..., 2^(k-1), M-(2^k-1).

注意前面都是 2的次幂，最后一个数是 M-(2^k-1). 这里的k取值是使得 M-(2^k-1) > 0的最大值。

因此13的拆分方法为：

0001, 0010, 0100,  6

这里k取值为3

其实可以看出，这些拆分后的背包之和正好等于M, 而且可以组成1-M的所有取值。

因为 1 + 2 + 4 + ... + 2^(k-1) = 2^k - 1.

另外需要注意的是， <<操作的优先级是低于四则运算的，因此需要注意加括号的问题。

提交记录：

1、Accepted！

/*Source Code

Problem: 1276		User: 775700879
Memory: 1088K		Time: 94MS
Language: G++		Result: Accepted
Source Code*/
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
        
        
using namespace std;
#define MAXW 7510
struct pack {
    int weight, value;
};
vector
        
        
          v; int dp[100010]; int main() { int cash; int N; while (cin >> cash) { cin >> N; int nk, dk; v.clear(); memset(dp, 0, sizeof(dp)); int i, j, k; for (i = 0; i < N; i++) { cin >> nk >> dk; if (nk == 0) continue; if (nk == 1) { v.push_back((pack){dk, dk}); continue; } for (j = nk,k=0; j != 1; j >>= 1,k++) { v.push_back((pack){dk*(1< 
         
           = 1; j--) { if (j - v[i].weight >= 0) { dp[j] = max(dp[j], dp[j-v[i].weight] + v[i].value); } } } cout << dp[cash] << endl; } }