HDU 1059- Dividing

原创 2016年06月01日 23:07:56

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 eitherCan 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.

题意:给你价值分别为1-6的大理石数量,问能不能将这堆大理石平分成价值相同的两堆。用多重背包。
(注释那段超时了T T)

代码:

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <iostream>
using namespace std;
int marble[10];
int hhh;
int flag;
int dp[100000];
/*void work(int now,int num)
{
    if(now*2==hhh)
    {
    //printf("^^%d\n",now);
    flag=1;
    //return 1;
    }
    for(int i=num;i>=1;i--)
    {
        if(marble[i])
        {
            if(now+i<=hhh/2)
            {
                marble[i]--;
                work(now+i,i);
                //return 1;
                if(flag)
                {
                    break;
                }
                marble[i]++;
            }

        }
    }
//  return 0;

}*/
int main (void)
{
    int mark=0;
    int t=1;
    while(1)
    {
        mark=0;
        for(int i=1;i<=6;i++)
        {
            scanf("%d",&marble[i]);
            if(marble[i]==0)
            mark++;
        }
    //  printf("%d!!\n",mark);
        if(mark==6)
        break;
    //  int num;
    //  int t=1;
        printf("Collection #%d:\n",t++);
        hhh=0;
        for(int i=1;i<=6;i++)
        {
            hhh+=i*marble[i];
        }
        if(hhh%2!=0)
        {

        printf("Can't be divided.\n");
        printf("\n");
        continue;


        }
        int t=hhh/2;
        int sum;
        memset(dp,0,sizeof(dp));
        dp[0]=1;
        for(int i=1;i<=6;i++)
        {
            if(!marble[i])
            continue;
            for(int j=1;j<=marble[i];j*=2)
            {
                sum=j*i;
                for(int k=t;k>=sum;k--)
                {
                    if(dp[k-sum])
                    {
                        dp[k]=1;
                        printf("dp[%d]=1\n",k);
                    }
                }
                marble[i]-=j;//剩下的
            }
            sum=marble[i]*i;
            if(sum)
            {
                for(int k=t;k>=sum;k--)

                {
                    if(dp[k-sum])
                    {
                        dp[k]=1;
                        printf("dp[%d]=1\n",k);
                    }

                }
            }
        }
        if(dp[t])
        printf("Can be divided.\n");
        else
        printf("Can't be divided.\n");
        printf("\n");
    }
    return 0;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。

POJ 1014 Dividing(多重背包 + 二进制优化 + 01背包)

题目链接:POJ 1014 Dividing 多重背包 + 二进制优化 + 01背包 我是在一个在小蛛蛛的博客学习的二进制优化。 解题思路:题目给价值为1~6的六种大理石的个数若干,要求我们判断是否...
  • fobdddf
  • fobdddf
  • 2014年03月25日 15:06
  • 842

Dividing (HDU 1059) —— 多重背包

Dividing Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total...
  • jxust_tj
  • jxust_tj
  • 2014年08月15日 20:02
  • 418

HDU 1059 Dividing(多重背包)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1059 题意: 输入6个数字,表示重量分别为1  2  3  4  5  6的大理石的数量 问能不...
  • YHYYXT
  • YHYYXT
  • 2015年07月22日 21:17
  • 256

hdu——1059——Dividing(多重背包)

Problem Description Marsha and Bill own a collection of marbles. They want to split the collection a...
  • u011470356
  • u011470356
  • 2014年02月15日 13:13
  • 362

hdu 1059 Dividing(多重背包)

Dividing Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total...
  • u011699990
  • u011699990
  • 2015年05月31日 00:34
  • 643

hdu 1059 Dividing(多重背包)

Problem Description Marsha and Bill own a collection of marbles. They want to split the collection a...
  • qqchanmingdexiaji
  • qqchanmingdexiaji
  • 2016年12月25日 16:53
  • 82

[poj 1014]Dividing的DFS解法解读和DP解法

转载来源: http://blog.csdn.net/lyy289065406/article/details/6661449 这道题比较特殊,用DFS也是对的,而且可以进行优化,即使直接n[i]...
  • zhangliang011258
  • zhangliang011258
  • 2013年07月28日 17:16
  • 773

HDU Dividing (多重背包+二进制优化)

Dividing Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Tota...
  • u012860428
  • u012860428
  • 2014年04月26日 16:27
  • 557

HDU 1059 Dividing (多重背包+二进制优化)

题目链接:HDU 1059 Dividing 题意:给出6种硬币的个数,他们的价值分别是1-6。问能否按价值平均分成2份。 多重背包问题,dp[]的意义是 背包容量为i的背包,最多大的价值。判断d...
  • u012377575
  • u012377575
  • 2014年09月05日 18:03
  • 533

hdu 1059 Dividing 多重背包,二进制优化

Dividing Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total...
  • wust_ZJX
  • wust_ZJX
  • 2015年03月28日 19:32
  • 329
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 1059- Dividing
举报原因:
原因补充:

(最多只允许输入30个字)