Codeforces Round #112 (Div. 2) E. Compatible Numbers sosdp

传送门

题意：

思路：

以下假设$all=1<<22$。
转化问题，对于每个$a_i$我们都计算$x=a_{i}xorall$，对于所有$x$的子集都是满足条件的，所以我们用$sosdp$预处理出来所有子集信息，并且记下来是由哪个子集转移过来的，让后直接判断就好了。

// Problem: E. Compatible Numbers
// Contest: Codeforces - Codeforces Round #112 (Div. 2)
// URL: https://codeforces.com/contest/165/problem/E
// Memory Limit: 256 MB
// Time Limit: 4000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4.1,sse4.2,avx,avx2,popcnt,tune=native")
//#pragma GCC optimize(2)
#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<map>
#include<cmath>
#include<cctype>
#include<vector>
#include<set>
#include<queue>
#include<algorithm>
#include<sstream>
#include<ctime>
#include<cstdlib>
#include<random>
#include<cassert>
#define X first
#define Y second
#define L (u<<1)
#define R (u<<1|1)
#define pb push_back
#define mk make_pair
#define Mid ((tr[u].l+tr[u].r)>>1)
#define Len(u) (tr[u].r-tr[u].l+1)
#define random(a,b) ((a)+rand()%((b)-(a)+1))
#define db puts("---")
using namespace std;

//void rd_cre() { freopen("d://dp//data.txt","w",stdout); srand(time(NULL)); }
//void rd_ac() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//AC.txt","w",stdout); }
//void rd_wa() { freopen("d://dp//data.txt","r",stdin); freopen("d://dp//WA.txt","w",stdout); }

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;

const int N=10000010,mod=1e9+7,INF=0x3f3f3f3f;
const double eps=1e-6;

int n;
int a[N];
int p[N],pre[N];

int main()
{
//	ios::sync_with_stdio(false);
//	cin.tie(0);

	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]),p[a[i]]=1,pre[a[i]]=a[i];
	for(int i=0;i<22;i++) 
		for(int j=0;j<1<<22;j++) 
			if(j>>i&1) {
				if(!p[j^(1<<i)]) continue;
				p[j]|=p[j^(1<<i)];
				pre[j]=pre[j^(1<<i)];
			}
	int all=1<<22; all--;
	for(int i=1;i<=n;i++) {
		int now=all^a[i];
		if(p[now]) printf("%d ",pre[now]);
		else printf("-1 ");
	}
	puts("");
	


	return 0;
}
/*

*/