3021
Problem U
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 16 Accepted Submission(s) : 6
1 0 1 2 0 0 1 0 0 0 1 1 0 0 0 0 0 0
Collection #1: Can't be divided. Collection #2: Can be divided.
6种大理石,价值分别是1,2,3,4,5,6.数量需要输入。要求平分给两个人;
思路:
刚看到这题,没有想到跟背包有什么联系。
然后去网上自己找了一下,用到多重背包。注意减枝和二进制转换;
最后这题还是没有完全明白;
AC代码:
#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
int dp[100000];
int main()
{
int a[11],sum,v,i,j,k,cnt,cas = 1;
while(~scanf("%d",&a[1]))
{
sum = a[1];
for(i = 2;i<=6;i++)
{
scanf("%d",&a[i]);
sum+=i*a[i];
}
if(!sum)
break;
printf("Collection #%d:\n",cas++);
if(sum%2)//总和为奇数,必定不能平分
{
printf("Can't be divided.\n\n");
continue;
}
v = sum/2;
memset(dp,0,sizeof(dp));
dp[0] = 1;
for(i = 1;i<=6;i++)
{
if(!a[i])
continue;
for(j = 1;j<=a[i];j*=2)//二进制优化
{
cnt = j*i;
for(k = v;k>=cnt;k--)
{
if(dp[k-cnt])//必须前面的能够放入背包,现在的才能放入背包
dp[k] = 1;
}
a[i]-=j;
}
cnt = a[i]*i;//剩下的
if(cnt)
{
for(k = v;k>=cnt;k--)
{
if(dp[k-cnt])
dp[k] = 1;
}
}
}
if(dp[v])
printf("Can be divided.\n\n");
else
printf("Can't be divided.\n\n");
}
return 0;
}