文章目录

潘少的 BLOG

诗酒趁年华

X

ACM刷题之-POJ-1014(Dividing)

  panjf2000

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 file describes one collection of marbles to be divided. The lines contain six non-negative integers n1 , . . . , 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 collection, 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.

我的答案

#include <iostream>
using namespace std;

#define LEN 7
#define INIT 0xffffffff
int F[60001];

int max(int x, int y)
{
	return x>y?x:y;
}

void ZeroOnePack(int cost, int weight, int V)
{
	for (int v=V; v>=cost; --v) {
		F[v] = max(F[v], F[v-cost]+weight);
	}
}

void CompletePack(int cost, int weight, int V)
{
	for (int v=cost; v<=V; ++v) {
		F[v] = max(F[v], F[v-cost]+weight);
	}
}

void MultiPack(int cost, int weight, int V, int amount)
{
	if (cost*amount>=V) {
		CompletePack(cost, weight, V);
		return;
	}
	int k = 1;
	while (k<amount) {
		ZeroOnePack(cost*k, weight*k, V);
		amount -= k;
		k *=2;
	}
	ZeroOnePack(cost*amount, weight*amount, V);
}

int main(int argc, char **argv)
{
	int index = 0;
	int num[LEN];
	while (1) {
		++index;
		int sum = 0;
		int bin = 0;
		for (int i=1; i<LEN; ++i) {
			cin>>num[i];
			sum += i * num[i];
			bin |= num[i];
		}
		if (!bin)
			break;
		if (sum&0x01)
			cout<<"Collection #"<<index<<":\n"<<"Can't be divided."<<endl<<endl;
		else {
			int V = sum>>1;
			F[0] = 0;
			for (int i=1; i<=V; ++i)
				F[i] = INIT;
			for (int i=1; i<LEN; ++i)
				MultiPack(i, i, V, num[i]);
			if(F[V]!=V)
				cout<<"Collection #"<<index<<":\n"<<"Can't be divided."<<endl<<endl;
			else
				cout<<"Collection #"<<index<<":\n"<<"Can be divided."<<endl<<endl;
		}
	}
	system("pause");
	return 0;
}


微信公众号

潘建锋

关于版权和转载

本文由 潘建锋 创作,采用 署名 4.0 国际 (CC BY 4.0) 国际许可协议进行授权。
本站文章除注明转载/出处外,均为本站原创或翻译,转载时请务必署名,否则,本人将保留一切追究责任的权利。
署名 4.0 国际 (CC BY 4.0)

转载规范

标题:ACM刷题之-POJ-1014(Dividing)
作者:潘建锋
原文:https://taohuawu.club/POJ-1014

关于留言和评论

如果您对本文《ACM刷题之-POJ-1014(Dividing)》的内容有任何疑问、补充或纠错,欢迎在下面的评论系统中留言,与作者一起交流进步,谢谢!(~ ̄▽ ̄)~