hdu1059 dividing 多重背包 模板题

Dividing

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 29288    Accepted Submission(s): 8386


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 01 0 0 0 1 10 0 0 0 0 0
 

Sample Output
 
 
Collection #1:Can't be divided.Collection #2:Can be divided.
 

Source
#include<stdio.h>
#include<string.h>

int a[11];
int dp[20005];//此时dp[i]表示是否能把i容量的背包装满 

int main()
{
	int cnt=1;
	int i,j,k;
	while(scanf("%d%d%d%d%d%d",&a[1],&a[2],&a[3],&a[4],&a[5],&a[6])!=EOF)
	{   
		int sum=0;
		for(i=1;i<=6;i++)
		sum+=i*a[i];
		if(sum==0) 
		break;
		
		if(sum&1)//总价值为奇数,肯定不能平分 剪枝
		{	
			printf("Collection #%d:\nCan't be divided.\n\n",cnt++);
			continue;
		}
		
    	int temp=sum/2;

		memset(dp,0,sizeof(dp));   //初始化,容量为i的背包不能够被装满 
		dp[0]=1;
		
		for(i=1;i<=6;i++)//循环每种价格的珠宝
		{
			for(k=temp;k>=i;--k)//价值temp从多到少 
			{
				if(dp[temp]) //如果存在,说明已经达成目标,退出循环 
				break;
				for(j=1;j<=a[i]&&k>=i*j;j++) //多重背包 
				{
					dp[k]=dp[k-j*i]?1:0; //dp[k]表示k容量的背包是否能够装满. 
					//这个三目表达式的意思是dp[k-j*i]值是否存在,若存在那么加上j个i价值珠宝,dp[k]也可以存在 
				}
			}
		} 
	
		if(!dp[temp])
		printf("Collection #%d:\nCan't be divided.\n\n",cnt++);
		else
		printf("Collection #%d:\nCan be divided.\n\n",cnt++);
	}
	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值