#528088 (C++14) No.1082 XORのXOR

• 問題: No.1082 XORのXOR
• ユーザー: masayoshi361
• 提出日時: 2020-08-11 13:27:32
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 7,575 bytes
• コンパイル時間: 2,415 ms
• コンパイル使用メモリ: 179,128 KB
• 実行使用メモリ: 6,824 KB
• 最終ジャッジ日時: 2024-10-09 11:22:09
• 合計ジャッジ時間: 3,555 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

ファイルパターン	結果
sample	AC * 2 WA * 1
other	AC * 3 WA * 26

ソースコード

/* #region header */
#ifdef LOCAL
    #include "/Users/takakurashokichi/Desktop/atcoder/cxx-prettyprint-master/prettyprint.hpp"
    #define debug(x) cout << x << endl
#else
    #define debug(...) 42
#endif

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
//types
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
typedef pair < ll , ll > Pl;        
typedef pair < int, int > Pi;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<char> vc;
template< typename T >
using mat = vector< vector< T > >;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef vector<vector<char>> vvc;

template< int mod >
struct modint {
    int x;

    modint() : x(0) {}

    modint(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    modint &operator+=(const modint &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }

    modint &operator-=(const modint &p) {
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }

    modint &operator*=(const modint &p) {
        x = (int) (1LL * x * p.x % mod);
        return *this;
    }

    modint &operator/=(const modint &p) {
        *this *= p.inverse();
        return *this;
    }

    modint operator-() const { return modint(-x); }

    modint operator+(const modint &p) const { return modint(*this) += p; }

    modint operator-(const modint &p) const { return modint(*this) -= p; }

    modint operator*(const modint &p) const { return modint(*this) *= p; }

    modint operator/(const modint &p) const { return modint(*this) /= p; }

    bool operator==(const modint &p) const { return x == p.x; }

    bool operator!=(const modint &p) const { return x != p.x; }

    modint inverse() const {
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
        t = a / b;
        swap(a -= t * b, b);
        swap(u -= t * v, v);
        }
        return modint(u);
    }

    modint pow(int64_t n) const {
        modint ret(1), mul(x);
        while(n > 0) {
        if(n & 1) ret *= mul;
        mul *= mul;
        n >>= 1;
        }
        return ret;
    }

    friend ostream &operator<<(ostream &os, const modint &p) {
        return os << p.x;
    }

    friend istream &operator>>(istream &is, modint &a) {
        int64_t t;
        is >> t;
        a = modint< mod >(t);
        return (is);
    }

    static int get_mod() { return mod; }
};
//abreviations
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep_(i, a_, b_, a, b, ...) for (ll i = (a), max_i = (b); i < max_i; i++)
#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define rrep_(i, a_, b_, a, b, ...) for (ll i = (b-1), min_i = (a); i >= min_i; i--)
#define rrep(i, ...) rrep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define SZ(x) ((int)(x).size())
#define pb(x) push_back(x)
#define eb(x) emplace_back(x)
#define mp make_pair
#define print(x) cout << x << endl
#define vprint(x) rep(i, x.size())cout << x[i] << ' '; cout << endl
#define vsum(x) accumulate(all(x), 0LL)
#define vmax(a) *max_element(all(a))
#define vmin(a) *min_element(all(a))
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
//functions
//gcd(0, x) fails.
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return a/gcd(a, b)*b;}
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template< typename T >
T mypow(T x, ll n) {
    T ret = 1;
    while(n > 0) {
        if(n & 1) (ret *= x);
        (x *= x);
        n >>= 1;
    }
    return ret;
}
ll modpow(ll x, ll n, const ll mod) {
    ll ret = 1;
    while(n > 0) {
        if(n & 1) (ret *= x);
        (x *= x);
        n >>= 1;
        x%=mod;
        ret%=mod;
    }
    return ret;
}
template< typename T >
uint64_t my_rand(void) {
    static uint64_t x = 88172645463325252ULL;
    x = x ^ (x << 13); x = x ^ (x >> 7);
    return x = x ^ (x << 17);
}
int popcnt(ull x) { return __builtin_popcountll(x); } 
//graph template
template< typename T >
struct edge {
    int src, to;
    T cost;

    edge(int to, T cost) : src(-1), to(to), cost(cost) {}

    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    edge &operator=(const int &x) {
        to = x;
        return *this;
    }

    bool operator<(const edge<T> &r) const { return cost < r.cost; }
    
    operator int() const { return to; }
};
template< typename T >
using Edges = vector< edge< T > >;
template< typename T >
using WeightedGraph = vector< Edges< T > >;
using UnWeightedGraph = vector< vector< int > >;
struct Timer { 
    clock_t start_time; 
    void start() {
        start_time = clock(); 
    }
    int lap() { 
        //return x ms.
        return (clock()-start_time)*1000 / CLOCKS_PER_SEC; 
    }
};
/* #endregion*/
//constant
#define inf 1000000005
#define INF 4000000004000000000LL
#define mod 998244353LL
//#define endl '\n'
typedef modint<mod> mint;
const long double eps = 0.00000001;
const long double PI  = 3.141592653589793;
//library
template<typename T = long long, int BitMax = 32>
struct BinaryTrie{
    struct Node{
        //子ノードのポインタ[文字の種類]
        Node* pChild[2];
        //持たせたいデータを書く
        int subtreeSize;
        Node() : subtreeSize(0), pChild{nullptr, nullptr} {}
    };
    //rootは開始文字に相当
    Node* root;
    
    BinaryTrie(){
        root = new Node;
    }

    void add(T x){
        Node* node = root;
        node->subtreeSize++;
        rrep(i, BitMax){
            if(node->pChild[(x>>i)&1]==nullptr) node->pChild[(x>>i)&1] = new Node;
            node = node->pChild[(x>>i)&1];
            node->subtreeSize++;
        }
    }

    T kth_element(int k){
        T res = 0;
        Node* node = root;
        rrep(i, BitMax){
            if(node->pChild[0]->subtreeSize > k){
                node = node->pChild[0];
            }else{
                k-=node->pChild[0]->subtreeSize;
                res+=(T)1<<i;
                node = node->pChild[1];
            }
        }
        return res;
    }

    T min_element(){
        return kth_element(0);
    }

    T max_element(){
        return kth_element(root->subtreeSize-1);
    }

    //0<=k<treeSize
    T kth_element_xor_x(int k, T x){
        T res = 0;
        Node* node = root;
        rrep(i, BitMax){
            int c = (x>>i)&1;
            if(node->pChild[c]!=nullptr){
                if(node->pChild[c]->subtreeSize > k){
                    //go to pChild[c]
                    node = node->pChild[c];
                    if(c==1)res+=(T)1<<i;
                    continue;
                }
                k-=node->pChild[c]->subtreeSize;
            }
            //go to pChild[c^1]
            node = node->pChild[c^1];
            if(c==0)res+=(T)1<<i;
        }
        return res;
    }

    T min_element_xor_x(T x){
        return kth_element_xor_x(0, x);
    }

    T max_element_xor_x(T x){
        int treeSize = root->subtreeSize;
        return kth_element_xor_x(treeSize-1, x);
    }
};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << setprecision(20);
    int n; cin>>n;
    vl a(n);
    BinaryTrie<ll, 5> bt;
    rep(i, n){
        cin>>a[i];
        bt.add(a[i]);
    }
    ll ans = 0;
    rep(i, n){
        chmax(ans, a[i]^bt.max_element_xor_x(a[i]));
    }
    print(ans);
}