LeetCode - 1059（多重背包二进制优化） - Dividing

最新推荐文章于 2024-10-13 07:15:00 发布

原创最新推荐文章于 2024-10-13 07:15:00 发布 · 1.4k 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

dp 专栏收录该内容

36 篇文章

订阅专栏

解决一个关于如何将具有不同价值的硬币公平地分配给两个人的问题。通过使用二进制拆分法将多重背包问题转化为0/1背包问题。

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 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.

多重背包，给出价值1,2,3,4,5,6的硬币的数量，问两个人能不能平分这笔钱。

小狐狸说，最好不要把背包分开来，他们本身就是一个整体。研究了一波多重背包，确实可以转化为0/1背包做，只是一个一个数容易超时，这时候就要需要来优化，二进制拆分法。比如给你一个数量13，拆完以后就是1,2,4,6，这几个数字可以构成1~13任意的数。拆完后就是一个0/1背包问题了。

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#define INF 0x3f3f3f3f3f3f3f
using namespace std;
const int MAXN = 2e5 + 10;

int a[10];
int dp[MAXN];
int val[100];

int main()
{
    int casi = 1;
    while (scanf("%d", &a[1]) != EOF) {
        int sum = a[1];
        for (int i = 2; i <= 6; ++i) {
            scanf("%d", &a[i]);
            sum += a[i] * i;
        }
        if (sum == 0) break;
        if (sum % 2) {
            printf("Collection #%d:\nCan't be divided.\n\n", casi++);
            continue;
        }
        sum /= 2;
        int cnt = 0;
        for (int i = 1; i <= 6; ++i) {
            int temp = 1;
            for (; temp <= a[i]; temp *= 2) {
                val[cnt++] = i * temp;
                a[i] -= temp;
            }
            if (a[i]) {
                val[cnt++] = i * a[i];
            }
        }
        memset(dp, -1, sizeof(dp));
        dp[0] = 0;
        for (int i = 0; i < cnt; ++i) {
            for (int j = sum; j >= val[i]; --j) {
                dp[j] = max(dp[j], dp[j-val[i]]+val[i]);
            }
        }
        if (dp[sum] == sum)	//dp[sum]处的价值刚好等于sum，才满足条件
            printf("Collection #%d:\nCan be divided.\n\n", casi++);
        else
            printf("Collection #%d:\nCan't be divided.\n\n", casi++);
    }
    return 0;
}