题意:有价值为1-6的六种玻璃球,现在告诉你各种玻璃球的个数,问能否将这些玻璃球分成两份,使得两份的总价值相等
既然要等分,那么总价值必定是偶数,所以价值和为奇数是无法等分。
但价值和为偶数时,我们可以看做背包问题,背包的体积大小为sum/2,如果能够等分,则恰好可以将这个背包填满,即有dp[sum/2]=sum/2.
每种玻璃球的数量1和无穷,所以这是一个多重背包,这道题得用到二进制优化(别问我怎么知道的,TLE警告).二进制优化就是把多重背包转化为01背包,任意数都可以用多个二制数的和表示,所以将其拆分为若干个体积和价值为原来的2n的新物品,在进行01背包,复杂度为nvlg(num).
#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<vector>
#define inf 0x3f3f3f3f
using namespace std;
const int N = 2e5+50;
int dp[N], arr[10];
int sum;
vector<int> vec;
int input() {
sum = 0;
vec.clear();
for (int i = 1; i <= 6; i++) {
scanf("%d", &arr[i]);
sum += arr[i] * i;
for (int k = 1; k <= arr[i]; k<<=1) {
arr[i] -= k;
vec.push_back(k * i);
}
if (arr[i] > 0) {
vec.push_back(arr[i] * i);
}
}
return sum;
}
int main() {
int Case = 0;
while (input()!=0) {
printf("Collection #%d:\n", ++Case);
if (sum & 1) {
printf("Can't be divided.\n\n");
continue;
}
else {
memset(dp, 0, sizeof(dp));
vector<int>::iterator iter = vec.begin();
for (; iter != vec.end(); iter++) {
for (int v = sum / 2; v >= *iter; v--) {
dp[v] = max(dp[v], dp[v - *iter] + *iter);
}
}
if (dp[sum / 2] == sum / 2) {
printf("Can be divided.\n\n");
}
else {
printf("Can't be divided.\n\n");
}
}
}
}