2019牛客暑期多校训练营（第九场） D Knapsack Cryptosystem 哈希

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

Knapsack Cryptosystem

时间限制：C/C++ 2秒，其他语言4秒
空间限制：C/C++ 262144K，其他语言524288K
64bit IO Format: %lld

题目描述

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、

题解：分成两组，第一组先预处理保存，记录下能出现sum的，然后保存下哪个出现过，可以状压下保存，第二组找到最后看看剩余的在第一组中有没有出现

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m;
ll s;
ll a[20], b[20];
map<ll , int> mp1;
int flag;
void dfs1(int pos, ll sum, int state) {
    if(flag) return;
    if(pos == n + 1) {
        mp1[sum] = state;
        if(sum == s) {
            for(int i = 0; i < n; i++, sum /= 2)
                printf("%d", sum % 2);
            for(int i = 0; i < m; i++)
                printf("0");
            printf("\n");
            flag = 1;
            return;
        }
        return;
    }
    dfs1(pos + 1, sum, state);
     
    dfs1(pos + 1, sum + a[pos], state + (1 << (pos - 1)));
}
void dfs2(int pos, ll sum, int state) {
    if(flag) return;
    if(sum > s) return;
    if(pos == m + 1) {
        if(sum == s) {
            for(int i = 0; i < n; i++) printf("0");
            for(int i = 0; i < m; i++, state /= 2)
                printf("%d", state % 2);
            printf("\n");
            flag = 1;
            return;
        }
        if(mp1[s - sum]) {
            ll cnt = mp1[s - sum];
            for(int i = 0; i < n; i++, cnt /= 2)
                printf("%d", cnt % 2);
            for(int i = 0; i < m; i++, state /= 2)
                printf("%d", state % 2);
            printf("\n");
            flag = 1;
            return;
        }
        return;
    }
    dfs2(pos + 1, sum, state);
    dfs2(pos + 1, sum + b[pos], state + (1 << (pos - 1)));
}
int main() {
    scanf("%d %lld", &n, &s);
    for(int i = 1; i <= n / 2; i ++) scanf("%lld", &a[i]);
    for(int i = 1; i <= n - n / 2; i++) scanf("%lld", &b[i]);
    m = n - n / 2;
    n = n / 2;
    dfs1(1, 0, 0);
    dfs2(1, 0, 0);
    return 0;
}