题解报告：hdu 1059 Dividing（多重背包、多重部分和问题）

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.

 

解题思路：用多重背包的思路来挑选若干件相同或不同的物品，最后看能否组成总价值的一半即可。

AC代码(432ms)：

 #include<bits/stdc++.h>
 using namespace std;
 int W,tol,cas=,x[],dp[];
 void ZeroOnePack(int w,int v){
     for(int j=W;j>=w;--j)
         dp[j]=max(dp[j],dp[j-w]+v);
 }
 void CompletePack(int w,int v){
     for(int j=w;j<=W;++j)
         dp[j]=max(dp[j],dp[j-w]+v);
 }
 void MultiplePack(int w,int v,int num){
     if(w*num>=W)CompletePack(w,v);
     else{
         for(int k=;k<=num;k<<=){
             ZeroOnePack(w*k,v*k);
             num-=k;
         }
         if(num>)ZeroOnePack(w*num,v*num);
     }
 }
 int main(){
     while(~scanf("%d%d%d%d%d%d",&x[],&x[],&x[],&x[],&x[],&x[])){
         tol=x[]+x[]*+x[]*+x[]*+x[]*+x[]*;
         if(!tol)break;
         else if(tol&)printf("Collection #%d:\nCan't be divided.\n\n",cas++);
         else{
             W=tol/;memset(dp,,sizeof(dp));
             for(int i=;i<=;++i)
                 MultiplePack(i,i,x[i]);
             if(dp[W]==W)printf("Collection #%d:\nCan be divided.\n\n",cas++);
             else printf("Collection #%d:\nCan't be divided.\n\n",cas++);
         }
     }
     return ;
 }

AC代码二(312ms)：单调队列稍微优化版。

 #include<bits/stdc++.h>
 using namespace std;
 int W,tol,cas=,x[],dp[];
 struct node{
     int k,v;
     node(int x,int y):k(x),v(y){}
 };
 deque<node> dq;
 void SingleDeque(int w,int v,int cnt){
     for(int r=;r<w;++r){//r=j%w
         dq.clear();
         for(int t=;t*w+r<=W;++t){//t=j/w
             int tmp=dp[t*w+r]-t*v;
             while(!dq.empty()&&tmp>=dq.back().v)dq.pop_back();
             dq.push_back(node(t,tmp));
             while(!dq.empty()&&(t-cnt>dq.front().k))dq.pop_front();
             dp[t*w+r]=dq.front().v+t*v;
         }
     }
 }
 int main(){
     while(~scanf("%d%d%d%d%d%d",&x[],&x[],&x[],&x[],&x[],&x[])){
         tol=x[]+x[]*+x[]*+x[]*+x[]*+x[]*;
         if(!tol)break;
         else if(tol&)printf("Collection #%d:\nCan't be divided.\n\n",cas++);
         else{
             W=tol/;memset(dp,,sizeof(dp));
             for(int i=;i<=;++i)
                 SingleDeque(i,i,x[i]);
             if(dp[W]==W)printf("Collection #%d:\nCan be divided.\n\n",cas++);
             else printf("Collection #%d:\nCan't be divided.\n\n",cas++);
         }
     }
     return ;
 }

AC代码三(78ms)：考虑多重部分和解法。dp[i][j]表示前i-1种数加和得到j时第i-1种数最多能剩余多少个（不能加和得到j的情况下为-1）。

 #include<bits/stdc++.h>
 using namespace std;
 int W,tol,cas=,x[],dp[];
 int main(){
     while(~scanf("%d%d%d%d%d%d",&x[],&x[],&x[],&x[],&x[],&x[])){
         tol=x[]+x[]*+x[]*+x[]*+x[]*+x[]*;
         if(!tol)break;
         else if(tol&)printf("Collection #%d:\nCan't be divided.\n\n",cas++);
         else{
             W=tol/;memset(dp,-,sizeof(dp));dp[]=;//注意：初始化加和为0剩下的个数为0
             for(int i=;i<=;++i){
                 for(int j=;j<=W;++j){
                     if(dp[j]>=)dp[j]=x[i];
                     else if(j<i||dp[j-i]<=)dp[j]=-;
                     else dp[j]=dp[j-i]-;
                 }
             }
             if(dp[W]>=)printf("Collection #%d:\nCan be divided.\n\n",cas++);
             else printf("Collection #%d:\nCan't be divided.\n\n",cas++);
         }
     }
     return ;
 }