948D
题意 给你一个a序列 给你一个b序列 你可以让b序列调换位置 使得答案为 a 序列 和 b 序列异或得到的值字典序最小(也就是值最小
做法 我们容易想到把 b 放在一个 01字典树内 一开始忘记字典树是丛高往低插入(因为01字典树优先考虑高位的影响
这样我们从高位往低位遍历的时候就可以直接的贪心把1给最大值的位置 这样异或出来的值最小
这道题就这样做完了
/*
if you can't see the repay
Why not just work step by step
rubbish is relaxed
to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)
typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod = (int)1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 300025;
int son[MAX_N*30][2],arr[MAX_N],b[MAX_N],tot=1,sz[MAX_N*30];
void update(int x)
{
int p = 1;
for(int i = 30;~i;i--)
{
int tmp = (x>>i)&1;
if(!son[p][tmp]) son[p][tmp] = ++tot;
p = son[p][tmp];
++sz[p];
}
}
int query(int x)
{
int p = 1,res = 0;
for(int i = 30;~i;i--)
{
int tmp = (x>>i)&1;
if(sz[son[p][tmp]]) p = son[p][tmp];
else p = son[p][tmp^1],res|=(1<<i);
--sz[p];
}
return res;
}
int main()
{
//ios::sync_with_stdio(false);
//freopen("a.txt","r",stdin);
//freopen("b.txt","w",stdout);
int n;
scanf("%d",&n);
for(int i = 1;i<=n;++i) scanf("%d",&arr[i]);
for(int i = 1;i<=n;++i) scanf("%d",&b[i]),update(b[i]);
for(int i = 1;i<=n;++i) printf("%d ",query(arr[i]));
//fclose(stdin);
//fclose(stdout);
//cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
return 0;
}