superxtong的博客

喝最烈的酒

HDU 1059- Dividing

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;
}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/superxtong/article/details/51559918
文章标签: HDU-1059
个人分类: dp
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

HDU 1059- Dividing

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭