165E - Compatible Numbers - CodeForces Solution

#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = 2e5 + 7;
const int M = 1e6 + 7;
const int mod = 998244353;
#define pii pair<int, int>
#define pll pair<lli, lli>
#define tiii tuple<int, int, int>
#define all(a) a.begin(), a.end()
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
#define fi first
#define se second
#define endl '\n'
#define low(i) i & -i
#define INF 0x3f3f3f3f
#define lep(a, b, c) for (int a = b; a <= c; a++)
#define rep(a, b, c) for (int a = b; a >= c; a--)
#define debug(a, b) cout << a << " " << b << '\n'

void solve() {
    int n;
    cin >> n;
    int ma = (1 << 22);
    vector<int> F(ma, 0), A(n);
    lep(i, 1, n) cin >> A[i - 1];
    lep(i, 1, n) 
        F[A[i - 1]]=A[i-1];
    for (int i = 0; i < 22; i++)
        for (int j = 0; j < ma; j++)
            if ((j & (1 << i))){
                F[j] = max(F[j],F[j ^ (1 << i)]);
            }
    lep(i, 0, n - 1) cout << (F[ma - 1 - A[i]] ? F[ma - 1 - A[i]] : -1) << " ";
    cout<<endl;
}
signed main() {
    // cin.sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
    // int T=1;cin>>T;for(int i=0;i<T;i++)
    solve();
    return 0;
}