【折半枚举】2019牛客多校第九场D

链接：https://ac.nowcoder.com/acm/contest/889/D
来源：牛客网
 

Amy asks Mr. B  problem D. Please help Mr. B to solve the following problem.

 

Amy wants to crack Merkle–Hellman knapsack cryptosystem. Please help it.

 

Given an array {ai} with length n, and the sum s.

Please find a subset of {ai}, such that the sum of the subset is s.

 

For more details about Merkle–Hellman knapsack cryptosystem Please read

https://en.wikipedia.org/wiki/Merkle%E2%80%93Hellman_knapsack_cryptosystem

https://blog.nowcoder.net/n/66ec16042de7421ea87619a72683f807

Because of some reason, you might not be able to open Wikipedia.

Whether you read it or not, this problem is solvable.

输入描述:

The first line contains two integers, which are n(1 <= n <= 36) and s(0 <= s < 9 * 1018)

The second line contains n integers, which are {ai}(0 < ai < 2 * 1017).

 

{ai} is generated like in the Merkle–Hellman knapsack cryptosystem, so there exists a solution and the solution is unique.

Also, according to the algorithm,  for any subset sum s, if there exists a solution, then the solution is unique.

输出描述:

Output a 01 sequence.

If the i-th digit is 1, then ai is in the subset.
If the i-th digit is 0, then ai is not in the subset.

示例1

输入

8 1129
295 592 301 14 28 353 120 236

输出

01100001

说明

This is the example in Wikipedia.

示例2

输入

36 68719476735
1 2 4 8 16 32 64 128 256 512 1024 2048 4096 8192 16384 32768 65536 131072 262144 524288 1048576 2097152 4194304 8388608 16777216 33554432 67108864 134217728 268435456 536870912 1073741824 2147483648 4294967296 8589934592 17179869184 34359738368

输出

111111111111111111111111111111111111

有n个数，求如何组合使之和为s，注意组合方案唯一

普通枚举复杂度为2的36次方，而折半枚举只需要2的18次方，也就是262144次

由于内部枚举每一位几乎很少，所以暂且忽略不计

这题就好比a+b+c+d=0一样，先统计所有a+b的答案，之后遍历c+d的方案的时候，查找map中是否存在和胃=为-c-d的a+b组合

注意枚举时候的边界

#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll a[50];
int main() {
    ll num;
    scanf("%lld",&num);
    ll ans;
    scanf("%lld",&ans);
    map<ll,ll>mp;
    mp.clear();
    for(int i=0; i<num; i++) {
        scanf("%lld",&a[i]);
    }
    ll now=0;
    for(int i=0; i<(1<<num/2); i++) {
        now=0;
        for(int j=0; j<num/2; j++) {
            if((i>>j)&1) {
                now+=a[j];
            }
        }
        mp[now]=i;
    }
//    cout<<mp.size()<<endl;
    for(int i=0; i<(1<<(num-num/2)); i++) {
        now=0;
        for(int j=0; j<num-num/2; j++) {
            if((i>>j)&1) {
                now+=a[num/2+j];
            }
        }
        if(mp.count(ans-now)) {
            ll res=mp[ans-now];
            for(int j=0; j<num/2; j++) {
                if((res>>j)&1) {
                    printf("1");
                }
                else
                    printf("0");
            }
            for(int j=0; j<num-num/2; j++) {
                if((i>>j)&1) {
                    printf("1");
                }
                else
                    printf("0");
            }
            printf("\n");
            break;
        }

    }

}