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

D.Knapsack Cryptosystem

题目链接: https://ac.nowcoder.com/acm/contest/889/D

Problem Description

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 { a i } \{a_i\} {ai​} with length $n$, and the sum $s$.
Please find a subset of { a i } \{a_i\} {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.

Input

The first line contains two integers, which are $n(1\le n\le 36)$ and $s(0\le s<9\ast 10^{18}).$
The second line contains $n$ integers, which are { a i } ( 0 &lt; a i &lt; 2 ∗ 1 0 17 ) . \{a_i\}(0 \lt a_i \lt 2 * 10^{17} ). {ai​}(0<ai​<2∗1017).
{ a i } \{a_i\} {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

Output a $01$ sequence.
If the $i$-th digit is $1$, then $a_i$ is in the subset.
If the $i$-th digit is $0$, then $a_i$ is not in the subset.

Sample Input

8 1129
295 592 301 14 28 353 120 236

Sample Output

01100001

题意

给定$n,s$和$n$个数 { a i } ( 1 ≤ i ≤ n ) \{a_i\}(1 \leq i \leq n) {ai​}(1≤i≤n)，需要在这$n$个数中取出若干个数，使得他们的和为$s$，输出长度为$n$的$01$字符串，为$1$则代表取第$i$个数。
输入数据保证解唯一。

思路

看到题目就想到了二进制枚举啊，但是$2^{32}$有点大，所以一开始否定了这种想法，开始了$dfs$疯狂$TLE$的试探。
后来$TLE$到自闭，神奇的队友突然冒出了一个想法，$2^{32}$有点大，那把这$32$拆开再二进制枚举就可以了啊，极限$2\ast 2^{16}$是可以跑完的。
所以思路就是折半二进制枚举啦。
首先对前$n/2$个数进行二进制枚举，用$map$记录前$n/2$个数所能够凑出的总和，并映射到该情况的二进制状态。再对后$n-n/2$个数进行二进制枚举，凑出的总和此处记为$sum$，则判断一下$map$中有没有$s-sum$存在，若有则说明找到了答案，并取出此时前$n/2$个数的二进制状态，然后将前后两半部分的二进制状态转换为$01$串即可。

代码

#include <bits/stdc++.h>
#define pi acos(-1.0)
#define ll long long
#define ull unsigned long long
#define esp 1e-9
#define inf 0x3f3f3f3f
#define inff 0x3f3f3f3f3f3f3f3f
#define Pair pair<ll, ll>
#define It list<node>::iterator
   
using namespace std;

const ll N = 40;
bool flag;
ll n, s, a[N], ans[N];
map<ll, ll> mp;

int main(){
	ios::sync_with_stdio(false);
	while (cin>>n>>s){
		mp.clear();//清空map
		flag = false;//这个好像没用，是之前dfs时初始化的标记
		memset(ans, 0, sizeof(ans));//初始化ans（01串）
		for (ll i = 1; i <= n; i++){
			cin>>a[i];
		}
		ll tmp = n/2;
		for (ll i = 0; i < (1LL<<tmp); i++){//前n/2个数二进制枚举
			ll t = i, sum = 0;
			for (ll j = tmp-1; j >= 0; j--){
				if (t & 1){
					sum += a[j+1];//计算和
				}
				t >>= 1;
			}
			mp[sum] = i;//总和 映射到 二进制状态
		}
		tmp = n-tmp;
		for (ll i = 0; i < (1LL<<tmp); i++){//后n-n/2个数二进制枚举
			ll t = i, sum = 0;
			for (ll j = tmp-1; j >= 0; j--){
				if (t & 1){
					sum += a[n-tmp+j+1];//计算和
				}
				t >>= 1;
			}
			if (mp[s-sum]){//前n/2部分的某状态+sum == s（找到答案）
				t = mp[s-sum];
				for (ll j = (n-tmp)-1; j >= 0; j--){//将二进制状态转换为01串
					if (t & 1){
						ans[j+1] = 1;
					}
					t >>= 1;
				}
				t = i, sum = 0;
				for (ll j = tmp-1; j >= 0; j--){//将二进制状态转换为01串
					if (t & 1){
						ans[n-tmp+j+1] = 1;
					}
					t >>= 1;
				}
				break;
			}
		}
		for (ll i = 1; i <= n; i++){//输出01串
			cout<<ans[i];
		}
		cout<<endl;
	}
	
	return 0;
}