HDU1059 Dividing(背包问题)
2016-07-23 07:58
435 查看
Dividing
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23496 Accepted Submission(s): 6686
[align=left]Problem Description[/align]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.
[align=left]Input[/align]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.
[align=left]Output[/align]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.
[align=left]Sample Input[/align]1 0 1 2 0 0
1 0 0 0 1 1
0 0 0 0 0 0 [align=left]Sample Output[/align]Collection #1:
Can't be divided.
Collection #2:
Can be divided.
[align=left]Source[/align]Mid-Central European Regional Contest 1999
[align=left]Recommend[/align]JGShining
//多重背包
//题意:价值分别为1,2,3,4,5,6的物品的个数分别为 a[1],a[2],````a[6]问能不能分成两堆价值相等的
void ZeroOnePack(int cost,int weight)//cost 为费用, weight 为价值
{
for(int i=v;i>=cost;i--)
if(f[i-cost]+weight>f[i]) f[i]=f[i-cost]+weight;
}
void CompletePack(int cost,int weight)
{
for(int i=cost;i<=v;i++)
if(f[i-cost]+weight>f[i]) f[i]=f[i-cost]+weight;
}
void MultiplePack(int cost ,int weight,int amount)
{
if(cost*amount>=v) CompletePack(cost,weight);
else
{
for(int k=1;k<amount;)
{
ZeroOnePack(k*cost,k*weight);
amount-=k;
k<<=1;
}
ZeroOnePack(amount*cost,amount*weight);
}
}
相关文章推荐
- C#使用回溯法解决背包问题实例分析
- 关于背包问题的一些理解和应用
- C++动态规划之背包问题解决方法
- C#用递归算法解决经典背包问题
- C#使用动态规划解决0-1背包问题实例分析
- 动态规划解决背包问题的核心思路
- 背包问题
- HDU 2602 动态规划01背包
- 例题分析-数学作业,魔法石的诱惑
- hdu2546
- HDU 2955
- 动态规划背包问题篇
- 简单0-1背包
- 背包九讲问题
- 背包问题knapsack的三种解法(Python 和 C)
- 动态规划问题 -- 背包问题 单价不等水果 装入固定容量背包 最大价值问题
- 背包问题knapsack的三种解法(Python 和 C)
- hihocoder #1091
- poj 3624
- poj 1976 01背包