HDU 1059 Dividing

原创 2016年08月29日 16:17:31

Question
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.'' orCan’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.
题目大意:给你6种数量6种价值的物品,问你是否能将他们价值均分
解题思路:这是一个背包问题,可以通过多重背包二进制优化解题
(http://acm.hust.edu.cn/vjudge/contest/125402#overview)

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAX=500000;
int a[10],dp[MAX],v;
void ZoroOne_Pack(int cost,int weight)   //01背包
{
    for(int i=v;i>=cost;i--)
        dp[i]=max(dp[i],dp[i-cost]+weight);
}
void Complete_Pack(int cost ,int weight)  //完全背包
{
    for(int i=cost;i<=v;i++)
        dp[i]=max(dp[i],dp[i-cost]+weight);
}
void Multi_Pack(int cost ,int weight,int amount)
{
    if(cost*amount>=v)
    {
        Complete_Pack(cost,weight);
        return ;
    }
    else    //二进制优化
    {
        int t=1;
        while (t<amount)
        {
            ZoroOne_Pack(t*cost,t*weight);
            amount-=t;
            t*=2;
        }
    }
    ZoroOne_Pack(amount*cost,amount*weight);
}
int main()
{
    int ncase=0;
    while(cin>>a[1]>>a[2]>>a[3]>>a[4]>>a[5]>>a[6],a[1]+a[2]+a[3]+a[4]+a[5]+a[6])
    {
        v=0;
        memset(dp,0,sizeof(dp));
        printf("Collection #%d:\n",++ncase);
        for(int i=1;i<=6;i++)
            v+=a[i]*i;
        if(v%2)
            printf("Can't be divided.\n");
        else
        {
            v/=2;   //对其总价值一般进行dp
            for(int i=1;i<=6;i++)
                Multi_Pack(i,i,a[i]);
            if(dp[v]==v)  //如果一半能放进价值为总价值一半的物品,则说明这些物品可以价值均分
                printf("Can be divided.\n");
            else
                printf("Can't be divided.\n");
        }
        printf("\n");  //此处注意有两个换行
    }
    return 0;
}

体会:学会了多重背包二进制优化,就不会再为了物品数量太多而超时。

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

相关文章推荐

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

Dividing (HDU 1059) —— 多重背包

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

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

多重背包问题 题目 有N种物品和一个容量为V的背包。第i种物品最多有n[i]件可用,每件费用是c[i],价值是w[i]。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量,且价值总和最大。...

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

HDU1059 Dividing(多重背包,二进制优化,模板题)

题目: Dividing Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Other...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 1059 Dividing
举报原因:
原因补充:

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