HDU 1059 Dividing （多重背包二进制优化）

Dividing

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

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 01 0 0 0 1 10 0 0 0 0 0

 

Sample Output

Collection #1:Can't be divided.Collection #2:Can be divided.

题目意思：给出6种不同价值的石头的个数，他们的价值分别为1到6，问能否分成两份价值一样的石头。

分析：从题目可以看出是裸的多重背包问题，问的是价值一样，所以可以把容量设为总价值的一半，然后每个石头的重量设为它自己的价值。

跑一次多重背包，看dp[v]==v是否成立。

AC代码：

#include<stdio.h>#include<string.h>#include<algorithm>using namespace std; int size[222];int value[222];int dp[50200];int main(){int a[10],b[10],cas=0;while(scanf("%d%d%d%d%d%d",&a[1],&a[2],&a[3],&a[4],&a[5],&a[6])==6,a[1]+a[2]+a[3]+a[4]+a[5]+a[6]){memset(size,0,sizeof(size));memset(value,0,sizeof(value));memset(dp,0,sizeof(dp));int sum=0;int count=0;for(int i=1;i<=6;i++){b[i]=i;sum+=a[i]*b[i];}if(sum%2)printf("Collection #%d:\nCan't be divided.\n",++cas);else{int V=sum/2;for(int i=1;i<=6;i++){if(a[i]){int q=a[i];int o=1;while(o<=q){size[count]=o*b[i];value[count++]=o*b[i];q-=o;o<<=1;}if(q){size[count]=q*b[i];value[count++]=q*b[i];}}}for(int i=0;i<count;i++){for(int j=V;j>=size[i];j--){dp[j]=max(dp[j-size[i]]+value[i],dp[j]);}}if(dp[V]==V)printf("Collection #%d:\nCan be divided.\n",++cas);elseprintf("Collection #%d:\nCan't be divided.\n",++cas);}printf("\n");}}