2019 Multi-University Training Contest 9 Rikka with Stable Marriage （01字典树）

Rikka with Stable Marriage

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 524288/524288 K (Java/Others)
Total Submission(s): 259    Accepted Submission(s): 151

 

Problem Description

People in love always feel humble. Sometimes, Rikka is worried about whether she deserves love from Yuta.

Stable marriage problem is an interesting theoretical model which has a strong connection with the real world. Given n men and n women, where each person has ranked all members of the opposite sex in order of preference. We use a permutation p of length n to represent a match that the ith man gets married with the pith woman. A match is stable if and only if there are no two people of opposite sexes who would both rather have each other than their current partners, i.e., ∀i≠j,¬(ri(pj,pi)∧rpj(i,j)) where ra(b,c) represents whether person a loves b more than c.

Rikka wants to resolve the confusion in her mind by considering a special case of the stable marriage problem. Rikka uses a feature integer to represents a person's character, and for two persons with feature integers equal to x and y, Rikka defines the suitable index of them as x⊕y, where ⊕ represents binary exclusive-or.

Given n men with feature integers a1,…,an and n women with feature integers b1,…,bn. For the ith man, he loves the jth woman more than the kth woman if and only if ai⊕bj>ai⊕bk; for the ith woman, she loves the jth man more than the kth man if and only if bi⊕aj>bi⊕ak.

Rikka wants to calculate the best stable match for this problem, i.e., let P be the set of all stable match, she wants to calculate maxp∈P(∑ni=1(ai⊕bpi)). Since n is quite large, this problem is too difficult for Rikka, could you please help her find the answer?

 

 

Input

The first line of the input contains a single integer T(1≤T≤50), the number of test cases.

For each test case, the fisrt line contains a sigle integer n(1≤n≤105).

The second line contains n integers a1,…,an(1≤ai≤109) which represents the feature number of each man.

The third line contains n integers b1,…,bn(1≤bi≤109) which represents the feature number of each woman.

The input guarantees that there are no more than 5 test cases with n>104, and for any i,j∈[1,n],i≠j, ai≠aj and bi≠bj.

 

 

Output

For each test case, output a single line with a single integer, the value of the best stable match. If there is no stable match, output −1.

Hint

In the first test case, one of the best matches is (2,1,4,3). Therefore the answer is (1⊕2)+(2⊕1)+(3⊕4)+(4⊕3)=20.

 

 

Sample Input

2 4 1 2 3 4 1 2 3 4 5 10 20 30 40 50 15 25 35 45 55

 

 

Sample Output

20 289

 

 

Source

2019 Multi-University Training Contest 9

 

 

Recommend

chendu

 

 

Statistic | Submit | Discuss | Note

题目大意：给出了n个男生，n个女生，每个男生女生有一个值，求两两一伙起来的和最大，两个数ai bj能异或的条件是

在b数组中 ai异或bj是最大的。

解题思路：和之前多校的某个题目一样，放在字典树中贪心就好了。

用指针写了一发不知道为啥T了。。。。

#include<bits/stdc++.h>
using namespace std;
#define sca(x) scanf("%d",&x)
#define LL long long
#define pb(x) push_back(x)
const int N  = 1e5+5;

struct node
{
    int nt[2];
    int sz[2];
}t[N*40][2];

int a[N],b[N];
int c[N];

int root;
int tot1,tot2;

void init( )
{

    for(int i=0;i<max(tot1,tot2);i++)
    {
        t[i][0].nt[0]=t[i][0].nt[1]=0;
        t[i][0].sz[0]=t[i][0].sz[1]=0;
        t[i][1].nt[0]=t[i][1].nt[1]=0;
        t[i][1].sz[0]=t[i][1].sz[1]=0;
    }
}

int _newnode(int ty)
{
    if(ty==0)tot1++;
    else tot2++;
    int tot=(ty==0?tot1:tot2);
    t[tot][ty].nt[0]=t[tot][ty].nt[1]=0;
    t[tot][ty].sz[0]=t[tot][ty].sz[1]=0;
    return tot;
}

void _ins(int k,int ty)
{
    int now=root;
    for(int i=30;i>=0;i--){
        int id=(k>>i)&1;
        if(t[now][ty].nt[id]==0){
            t[now][ty].nt[id] = _newnode(ty);
        }
        t[now][ty].sz[id]++;
        now=t[now][ty].nt[id];
    }
}


int _ask( )
{
    int le=0,ri=0;
    int res=0;
    for(int i=30;i>=0;i--)
    {
        int s10=t[le][0].sz[0],s11=t[le][0].sz[1];
        int s20=t[ri][1].sz[0],s21=t[ri][1].sz[1];
        if(s10 && s21)
        {
            res |= (1<<i);
            t[le][0].sz[0]--;
            t[ri][1].sz[1]--;
            le=t[le][0].nt[0];
            ri=t[ri][1].nt[1];
            continue;
        }
        if(s11 && s20)
        {
            res |= (1<<i);
            t[le][0].sz[1]--;
            t[ri][1].sz[0]--;
            le=t[le][0].nt[1];
            ri=t[ri][1].nt[0];
            continue;
        }
        if(s10 && s20)
        {
            t[le][0].sz[0]--;
            t[ri][1].sz[0]--;
            le=t[le][0].nt[0];
            ri=t[ri][1].nt[0];
            continue;
        }
        if(s11 && s21 )
        {
            t[le][0].sz[1]--;
            t[ri][1].sz[1]--;
            le=t[le][0].nt[1];
            ri=t[ri][1].nt[1];
            continue;
        }
    }
    return res;
}

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        tot1=tot2=0;
        root=0;
        int n;
        sca(n);
        for(int i=1;i<=n;i++){
            sca(a[i]);
        }
        for(int i=1;i<=n;i++){
            sca(b[i]);
        }

        for(int i=1;i<=n;i++){
            _ins(a[i],0);
            _ins(b[i],1);
        }
        LL ans=0;
        for(int i=1;i<=n;i++)
        {
            ans+=_ask( );
        }
        printf("%lld\n",ans);
        init( );
    }
}

T的代码：

#include<bits/stdc++.h>
using namespace std;
#define LL long long
const int N = 1e5+5;
typedef long long ll;

struct node
{
    node *nt[2];
    int sz;
    node()
    {
        sz=0;
        nt[0]=NULL;
        nt[1]=NULL;
    }
};

int a[N],b[N];

node *root;
node *root1;

void ins(int k,node *now)
{
    node *p = now;
    for(int i=30; i>=0; i--)
    {
        int id=(k>>i)&1;
        if(p->nt[id]==NULL)
        {
            p->nt[id]=new node;
        }
        p = p->nt[id];
        p->sz++;
    }
}

int ask(node *x, node *y)
{
    node *p = x;
    node *p1= y;
    int res=0;

    for(int i=30; i>=0; i--)
    {
        int l0=0,l1=0,r0=0,r1=0;
        if(p->nt[0]) l0=p->nt[0]->sz;
        if(p->nt[1]) l1=p->nt[1]->sz;
        if(p1->nt[0]) r0=p1->nt[0]->sz;
        if(p1->nt[1]) r1=p1->nt[1]->sz;

        if(l0 && r1)
        {
            res|=(1<<i);
            p = p->nt[0];
            p1 = p1->nt[1];
            p->sz--;
            p1->sz--;
            continue;
        }
        if(l1 && r0)
        {
            res |= (1<<i);
            p = p->nt[1];
            p1 = p1->nt[0];
            p->sz--;
            p1->sz--;
            continue;
        }
        if(l0 && r0)
        {
            p = p->nt[0];
            p1 = p1->nt[0];
            p->sz--;
            p1->sz--;
            continue;
        }
        if(l1 && r1)
        {
            p = p->nt[1];
            p1 = p1->nt[1];
            p->sz--;
            p1->sz--;
            continue;
        }
    }
    return res;
}

void del(node *p)
{
    if(p->nt[0])
    {
        del(p->nt[0]);
    }
    if(p->nt[1])
    {
        del(p->nt[1]);
    }
    free(p);
}

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        root = new node;
        root1 = new node;
        scanf("%d",&n);
        for(int i=1; i<=n; i++)
        {
            scanf("%d",&a[i]);
            ins(a[i],root);
        }
        for(int i=1; i<=n; i++)
        {
            scanf("%d", &b[i]);
            ins(b[i],root1);
        }
        int cnt=0;
        ll ans=0;
        while(cnt<n)
        {
            int tmp=ask(root,root1);
            ans += tmp;
            cnt++;
        }
        printf("%lld\n",ans);
        del(root);
        del(root1);
    }
}