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.
最近心很浮躁,静不下来想东西。
这是个物件划分的问题,可以转化成背包问题。这里因为每个物件个数不唯一,所以转化成完全背包,每个物品最多20000个,所以还是要用二进制优化的。
事实证明如果一直卡在某个问题上找不到bug,最好的办法就是重写一遍!
代码
#include<bits/stdc++.h>
using namespace std;
int main(){
int cnt=1;
int a[7],dp[200005],v[200005];
while(1){
int sum=0;
for(int i=1;i<=6;i++){
cin>>a[i];
sum+=a[i]*i;
}
if(sum==0) break;
else if(sum%2==1){
cout <<"Collection #" << cnt++ <<":"<<endl;
cout << "Can't be divided." <<endl;
cout <<endl;
continue;
}
int k=0;
for(int i=1;i<=6;i++){
int c=1,m=a[i];
while(m>0){
if(m-c>=0){
v[k++]=c*i;
}else{
v[k++]=m*i;
}
m-=c;
c<<=1;
}
}
int flag=0;
memset(dp,0,sizeof(dp));
for(int i=0;i<k;i++){
for(int j=sum/2;j>=v[i];j--){
dp[j]=max(dp[j],dp[j-v[i]]+v[i]);
if(dp[j]==sum/2){
flag=1;
break;
}
}
}
if(flag){
cout <<"Collection #" << cnt++ <<":"<<endl;
cout << "Can be divided." <<endl;
}else{
cout <<"Collection #" << cnt++ <<":"<<endl;
cout << "Can't be divided." <<endl;
}
cout << endl;
}
return 0;
}