HDU 1059 Dividing

原创 2016年08月28日 20:55:41

Dividing

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 24135    Accepted Submission(s): 6880


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
 

Recommend
JGShining   |   We have carefully selected several similar problems for you:  1024 1081 1074 1078 1160 


题目大意:输入6个数字,分别表示价值为1,2,3,4,5,6的石头的个数,判断这些石头能否分成等价值的两堆。

题目类型:多重背包+二进制思想

题目思路:先用二进制降低时间复杂度,然后就转换为了0-1背包。
dp[j]为价值为j时所能取到的最大价值,那么只要判断最后dp[m/2]是否是m/2,即可知道能否平分。


#include<stdio.h>
#include<iostream>
#include<math.h>
using namespace std;

int a[10],v[50000],dp[240000],T=1;

int main()
{
    while(1)
    {
        int t=1,i,j,m=0,d;
        for(i=1;i<=6;i++)
        {
            scanf("%d",&a[i]);
            m+=i*a[i];             //先求总价值
            d=a[i];
            for(j=1;j<=d;j=j*2)   //二进制思想
            {
                v[t]=j*i;
                t++;
                d-=j;
            }
            if(d>0)
            {
                v[t]=d*i;
                t++;
            }
        }
       // printf("m=%d ",m);



        if(a[1]==0&&a[2]==0&&a[3]==0&&a[4]==0&&a[5]==0&&a[6]==0)  break;

        for(i=0;i<=m/2;i++)
            dp[i]= -1000000;
        dp[0]=0;


        if(m%2==0)
        {

            for(i=1;i<=t-1;i++)
              for(j=m/2;j>=v[i];j--)        //这边因为是一维所以必须是倒序,因为需要还没有被更新过的数据
            dp[j]=max(dp[j],dp[j-v[i]]+v[i]);  
        }

        printf("Collection #%d:\n",T);
        if(dp[m/2]==m/2)   printf("Can be divided.\n\n");
        else              printf("Can't be divided.\n\n");

        T++;

    }
    return 0;
}

接下来是zhzq的模板:
0-1背包
二维:
for i=1...n
  for j=0...c            //这里顺着倒着无所谓
    if(j>=w[i])
       dp[i][j]=max(dp[i-1][j],dp[i-1][j-w[i]]+v[i])
    else
       dp[i][j]=dp[i-1][j];

一维:
for i=1...n
  for j=c...w[i]            //这里必须是倒着的,因为需要没有更新过的数据,这个自己带带数据就明白了
    dp[j]=max(dp[j],dp[j-w[i]]+v[i]);

完全背包:
for j=0...c
  for i=1...n
    if(j>=w[i])
      dp[j]=max(dp[j],dp[j-w[i]]+v[i]);//这里dp[i]表示容量为j时能放的最大价值


版权声明:本文为博主原创文章,未经博主允许不得转载。

HDU 1059 Dividing (多重背包模板题,条件改变,比较灵活)

链接:http://acm.hdu.edu.cn/showproblem.php?pid=1059     这道题刚一看,确实没有想到是背包类型的题目,那么我们怎么分析它是一道多重背包问题呢? ...
  • L_oser
  • L_oser
  • 2012年08月18日 17:12
  • 367

Dividing (HDU 1059) —— 多重背包

Dividing Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total...

Hdu 1059 Dividing(dp)

题目链接 Dividing Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) T...

HDU 1059 - Dividing(多重背包)

Description Marsha and Bill own a collection of marbles. They want to split the collection among ...

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

题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1059 题目大意: 有价值分别为1~6的弹珠,不同价值的弹珠有不同的数量。两个人要分成相同的价值,问...

HDU1059Dividing

题目大意: 给你6种石头,包括每种石头的个数,求是否可以将这些石头平分 ....................................... 这题很简单的多重背包!!! 具体有多简单...

HDU 1059(Dividing)多重背包

题目就是要分弹珠,一人一半,多一个少一个都不行。六种弹珠,ni表示价值i的弹珠的数量,问能不能分。 1.总价值为奇数当然不能分了。 2.总价值为偶数,利用多重背包求解,背包容量为m/2,计算dp[...

hdu 1059 Dividing 多重背包

Dividing                                                                              Time Limit: 20...

HDU-1059 Dividing(DP)

Marsha and Bill own a collection of marbles. They want to split the collection among themselves so t...

hdu 1059 Dividing(二进制转化优化) 分组背包

多重背包问题 题目 有N种物品和一个容量为V的背包。第i种物品最多有n[i]件可用,每件费用是c[i],价值是w[i]。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量,且价值总和最大。...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 1059 Dividing
举报原因:
原因补充:

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