HDOJ 1059

Dividing

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

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.
  
  

 

Source

Mid-Central European Regional Contest 1999

 

Recommend

JGShining

 

简单的多重背包，题意是给你六个数，分别代表第几个等级的石头有多少块。然后问你是否可以把他们的价值平分。

以从价值的一般为背包容量，cost和value都是石头的价值。

#include <cstdio>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <map>
#include <string>
#include <stack>
#include <cctype>
#include <vector>
#include <queue>
#include <set>
#include <iomanip>

using namespace std;
//#define Online_Judge
#define outstars cout << "***********************" << endl;
#define clr(a,b) memset(a,b,sizeof(a))
#define lson l , mid  , rt << 1
#define rson mid + 1 , r , rt << 1|1
#define FOR(i , x , n) for(int i = (x) ; i < (n) ; i++)
#define FORR(i , x , n) for(int i = (x) ; i <= (n) ; i++)
#define REP(i , x , n) for(int i = (x) ; i > (n) ; i--)
#define REPP(i ,x , n) for(int i = (x) ; i >= (n) ; i--)

#define mk make_pair
const int inf = 1 << 30;
const int MAXN = 200000 + 50;
const int maxw = 100 + 20;
const int MAXNNODE = 1000 +10;
const long long LLMAX = 0x7fffffffffffffffLL;
const long long LLMIN = 0x8000000000000000LL;
const int INF = 0x7fffffff;
const int IMIN = 0x80000000;
#define eps 1e-8
#define mod 10007
typedef long long LL;
const double PI = acos(-1.0);
typedef double D;
typedef pair<int , int> pii;
const D e = 2.718281828459;
int sum , half;
int dp[MAXN];
void ZeroOnePack(int cost)
{
    REPP(i , half , cost)dp[i] = max(dp[i] , dp[i - cost] + cost);
}
void CompletePack(int cost)
{
    FORR(i , cost , half)dp[i] = max(dp[i] , dp[i - cost] + cost);
}
void MultiPack(int cost , int num)
{
    if(num * cost >= half)CompletePack (cost);
    else
    {
        int k = 1;
        while(k < num)
        {
            ZeroOnePack(k * cost);
            num -= k;
            k <<= 1;
        }
        ZeroOnePack(num * cost);
    }
}
int a[7];
int main()
{
    //ios::sync_with_stdio(false);
#ifdef Online_Judge
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif // Online_Judge
    int kase = 1;
    while(1)
    {
        sum = 0;
        FORR(i , 1 , 6)
        {
            scanf("%d" , &a[i]);
            sum += i * a[i];
        }
        if(!sum)break;
        half = sum / 2;
        printf("Collection #%d:\n" , kase ++);
        clr(dp , 0);
        FORR(i , 1 , 6)MultiPack(i , a[i]);
        if(dp[half] * 2 != sum)puts("Can't be divided.\n");
        else puts("Can be divided.\n");
    }
    return 0;
}