题意:就是一个序列去使一个子序列和为给定和
题解:数据特别大
The first line contains two integers, which are n(1 <= n <= 36) and s(0 <= s < 9 * 10^18)
The second line contains n integers, which are {ai}(0 < ai < 2 * 10^17).
如果直接搜这36个数字是 O(2^36)复杂的,但只有1s时间,所以折半搜索,降一半复杂度O(2*2^18)
先处理一半18位,记录搜到的所有子集和以及数字编号,再搜另一半和时候的二分找第一次处理的和加起来满足给定和就好
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e6 + 5;
const int INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
int n; int N;
ll sum;
struct node{
ll w;
int ok[20];
}na[maxn]; int cnt=0;
ll a[maxn]; int vis[maxn];
bool cmp(node a,node b){
return a.w<b.w;
}
void dfs(int i,ll k){
if(i==N){
na[cnt].w=k;
for(int j=0;j<i;j++)
na[cnt].ok[j]=vis[j];
cnt++;
return ;
}
vis[i]=1;
dfs(i+1,k+a[i]);
vis[i]=0;
dfs(i+1,k);
}
void dfs2(int i,ll k){
// cout<<"s dasd "<<cnt<<endl;
if(i==n){
ll x=sum-k;
int l=0; int r=cnt-1;
while(l<r){
int mid=(l+r)/2;
if(na[mid].w>=x) r=mid;
else l=mid+1;
}
// cout<<na[l].w<<" "<<k<<" "<<sum<<endl;
if(na[l].w+k==sum){
for(int j=0;j<n/2;j++) cout<<na[l].ok[j];
for(int j=n/2;j<n;j++) cout<<vis[j];
cout<<endl;
}
return ;
}
vis[i]=1;
dfs2(i+1,k+a[i]);
vis[i]=0;
dfs2(i+1,k);
}
int main(){
cin>>n>>sum;
for(int i=0;i<n;i++){
cin>>a[i];
}
N=n/2;
dfs(0,0);
sort(na,na+cnt,cmp);
dfs2(n/2,0);
return 0;
}