Dividing
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5887 Accepted Submission(s): 1594
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.
此题属于多重背包,数据很大,需要二进制优化,不然超时。优化后直接当做01背包来做,01背包是逆序!
链接:http://acm.hdu.edu.cn/showproblem.php?pid=1059
代码:
#include <iostream>
#include <stdio.h>
#include <memory.h>
using namespace std;
const int N = 6;
int V, total, sum;
int bag[120005];
int w[15], n[15], v[1005];
void _01_bag()
{
int i, j;
memset(bag, 0, sizeof(bag));
for(i = 0; i < total; i++)
{
for(j = sum; j >= v[i]; j--)
{
bag[j] = max(bag[j], bag[j-v[i]]+v[i]);
}
}
}
int main()
{
int i, temp, zz = 1;
while(scanf("%d %d %d %d %d %d", &n[0], &n[1], &n[2], &n[3], &n[4], &n[5]))
{
if(n[0] + n[1] + n[2] + n[3] + n[4] + n[5] == 0) break;
printf("Collection #%d:\n", zz++);
V = 0;
for(i = 0; i < N; i++)
{
w[i] = i + 1;
V += w[i]*n[i]; //求总和
}
if(V%2 == 1) //总和是奇数则不能平分
{
printf("Can't be divided.\n\n");
continue;
}
sum = V/2; total = 0;
for(i = 0; i < N; i++) //二进制压缩为——01背包
{
if(n[i] == 0) continue;
temp = 1;
while(n[i] > temp)
{
v[total++] = temp*w[i]; //将新的值赋给v[]
n[i] -= temp;
temp *= 2;
}
v[total++] = n[i]*w[i];
}
_01_bag(); //用新的v[]数组直接拿来01背包
if(bag[sum] != sum)
printf("Can't be divided.\n\n");
else
printf("Can be divided.\n\n");
}
return 0;
}
分享到:
相关推荐
HDU1059的代码
HDU的1250,主要是利用高精度加法,但是代码有点繁琐,效率不是很高
杭电ACMhdu1163
hdu1001解题报告
hdu 1574 passed sorce
HDU的一题........HDU DP动态规
hdu acm 教案 搜索入门 hdu acm 教案 搜索入门
hdu2101AC代码
搜索 dfs 解题代码 hdu1241
20世纪50年代初美国数学家R.E.Bellman等人在研究多阶段决策过程(multistep decision process)的优化问题时,提出了著名的最优化原理(principle of optimality),把多阶段过程转化为一系列单阶段问题,利用各阶段之间...
hdu acm 教案 动态规划(1) hdu acm 教案 动态规划(1)
hdu 5007 Post Robot 字符串枚举。 暴力一下就可以了。
ACM HDU题目分类,我自己总结的大概只有十来个吧
hdu1290 解题报告 献给杭电五十周年校庆的礼物 (切西瓜问题,即平面分割空间)
你活的不容易,我活的不容易,他活的也不容易。不过,如果你看了下面的故事,就会知道,有位老汉比你还不容易。
HDU最全ac代码
hdu 1166线段树代码
hdu动态规划算法集锦
hdu题目分类
自己做的HDU ACM已经AC的题目