正确高效的解法貌似要用到二进制优化背包,但是这道题目直接用bool运算和简单优化就可快速ac。
背包模型:6件物品,每件物品可以取Ni件,每件物品费用为i。
物品较少,直接对转移方程进行优化:
F[i, j] = F[i-1, j-k*i] or F[i-1, j]
二维背包很容易用压缩一维。
#include <cstdio>
#include <cstring>
using namespace std;
int n[7];
bool f[60011];
int main() {
int cas = 1;
while ( 1 ) {
int sum = 0;
for (int i=1; i<=6; i++) {
scanf("%d", &n[i]);
sum += n[i]*i;
}
if (sum == 0) break;
if (sum % 2 == 1) {
printf("Collection #%d:\nCan't be divided.\n\n", cas++);
continue;
}
sum /= 2;
for (int i=1; i<=sum; i++) f[i] = false;
for (int i=0; i<=n[1]&&i<=sum; i++) f[i] = true;
for (int i=2; i<=6; i++)
for (int j=sum; j>=0; j--)
if (f[j]) {
for (int k=1; k<=n[i] && k*i+j<=sum; k++) {
if (f[k*i+j]) break;
f[k*i+j] = true;
}
}
if (f[sum]) printf("Collection #%d:\nCan be divided.\n\n", cas++);
else printf("Collection #%d:\nCan't be divided.\n\n", cas++);
}
return 0;
}