Hdu 1059 Dividing (多重背包)

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1059

Dividing

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 15028    Accepted Submission(s): 4187

Problem Description

Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the same value, because then they could just split the collection in half. But unfortunately, some of the marbles are larger, or more beautiful than others. So, Marsha and Bill start by assigning a value, a natural number between one and six, to each marble. Now they want to divide the marbles so that each of them gets the same total value. 
Unfortunately, they realize that it might be impossible to divide the marbles in this way (even if the total value of all marbles is even). For example, if there are one marble of value 1, one of value 3 and two of value 4, then they cannot be split into sets of equal value. So, they ask you to write a program that checks whether there is a fair partition of the marbles.

 

Input

Each line in the input describes one collection of marbles to be divided. The lines consist of six non-negative integers n1, n2, ..., n6, where ni is the number of marbles of value i. So, the example from above would be described by the input-line ``1 0 1 2 0 0''. The maximum total number of marbles will be 20000. 

The last line of the input file will be ``0 0 0 0 0 0''; do not process this line.

 

Output

For each colletcion, output ``Collection #k:'', where k is the number of the test case, and then either ``Can be divided.'' or ``Can't be divided.''. 

Output a blank line after each test case.

 

Sample Input

1 0 1 2 0 0
1 0 0 0 1 1
0 0 0 0 0 0

 

Sample Output

Collection #1:
Can't be divided.

Collection #2:
Can be divided.

 

题意：给6种石头，价值分别是1,2,3,4,5,6，每种石头给ni个，问能不能把价值平分给两个人。

分析：用sum/2做多重背包就行了，多重背包用2进制分解。

代码：

#include <stdio.h>
#include <string.h>
#include<iostream>
#include<algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define maxn 20005
int q[7] = {0,1,2,3,4,5,6};
int bin[16]={1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384};  
class node{
public:
	int c,v;
}p[200000];
int n = 0,dp[maxn*6];
void partition(int x,int j){  
    int i = 0;  
    while(x){  
        if(x >= bin[i]){  
            p[n].c = q[j]*bin[i];  
            p[n++].v = q[j]*bin[i];  
            x -= bin[i];  
            i++;  
        }else{  
            p[n].c = q[j] * x;  
            p[n++].v = q[j]*x;  
            break;  
        }  
    }  
}  
void binary_partition(int a,int b,int c,int d,int e,int f){  
    n = 0;  
    partition(a,1); partition(b,2); partition(c,3);
	partition(d,4); partition(e,5); partition(f,6);  
}  
bool ZeroOnePack(int m){  
    for (int i = 0; i < maxn*6; i++)  
		dp[i] = -INF;
    dp[0] = 0;  
    for (int i = 0; i < n; i++)  
        for(int j = m;j>=p[i].c;j--)  
            dp[j] = max(dp[j],dp[j - p[i].c]+p[i].v);
	if(dp[m] != m)return 0;
	return 1;
}
int main(){
	int a,b,c,d,e,f,sum,cas = 1;
	while(cin>>a>>b>>c>>d>>e>>f,a|b|c|d|e|f){
		binary_partition(a,b,c,d,e,f);
		sum = a*1+b*2+c*3+d*4+e*5+f*6;
		printf("Collection #%d:\n",cas++);
		if(sum & 1)printf("Can't be divided.\n\n");
		else{
			sum /= 2;
			if(ZeroOnePack(sum))printf("Can be divided.\n\n");
			else printf("Can't be divided.\n\n");
		}
	}
	return 0;
}