hdu 5536 Chip Factory(字典树)

最新推荐文章于 2019-01-18 16:04:39 发布

mrcoderrev

最新推荐文章于 2019-01-18 16:04:39 发布

阅读量202

点赞数

分类专栏：字典树

本文链接：https://blog.csdn.net/yjf3151731373/article/details/77316006

版权

字典树专栏收录该内容

14 篇文章 0 订阅

订阅专栏

Chip Factory

Time Limit: 18000/9000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 3235 Accepted Submission(s): 1397

Problem Description

John is a manager of a CPU chip factory, the factory produces lots of chips everyday. To manage large amounts of products, every processor has a serial number. More specifically, the factory produces

n chips today, the

i -th chip produced this day has a serial number

si .

At the end of the day, he packages all the chips produced this day, and send it to wholesalers. More specially, he writes a checksum number on the package, this checksum is defined as below:

max i, j, k (s i + s j) \oplus s k

which

i,j,k are three different integers between

1 and

n . And

⊕ is symbol of bitwise XOR.

Can you help John calculate the checksum number of today?

Input

The first line of input contains an integer

T indicating the total number of test cases.

The first line of each test case is an integer

n , indicating the number of chips produced today. The next line has

n integers

s1,s2,..,sn , separated with single space, indicating serial number of each chip.

1≤T≤1000

3≤n≤1000

0≤si≤109
There are at most

10 testcases with

n>100

Output

For each test case, please output an integer indicating the checksum number in a line.

Sample Input

  
  
   
   2
3
1 2 3
3
100 200 300

Sample Output

N^2选i,j然后贪心选k，用字典树实现

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<cmath>
#include<string>
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N =1e6+100;
int node[N][3], a[N], cnt, res[N];
void add(int x,int d)
{
    int u=0;
    for(int i=30;i>=0;i--)
    {
        int v=(x>>i)&1;
        if(node[u][v]==-1)
        {
            node[u][v]=cnt;
            res[cnt]=0,node[cnt][0]=node[cnt][1]=-1;
            cnt++;
        }
        u=node[u][v];
        res[u]+=d;
    }
}
int get(int v)
{
    int ans=v, u=0;
    for(int i=30;i>=0;i--)
    {
        int d=(v>>i)&1;
        if(node[u][d^1]!=-1&&res[node[u][d^1]])
        {
            u=node[u][d^1];
            ans|=(1<<i);
        }
        else
        {
            if(node[u][d]!=-1)
            {
                if(d==1)ans^=(1<<i);
            }
            u=node[u][d];
        }
    }
    return ans;
}

int main()
{
    int t;
    scanf("%d", &t);
    while(t--)
    {
        int n;
        scanf("%d", &n);
        node[0][0]=-1,node[0][1]=-1;
        res[0]=0, cnt=1;
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
            add(a[i],1);
        }
        int ans=0;
        for(int i=0;i<n;i++)
        {
            add(a[i],-1);
            for(int j=i+1;j<n;j++)
            {
                add(a[j],-1);
                ans=max(ans,get(a[i]+a[j]));
                add(a[j],1);
            }
            add(a[i],1);
        }
        printf("%d\n",ans);
    }
    return 0;
}