結果

問題 No.2061 XOR Sort
ユーザー tokusakuraitokusakurai
提出日時 2022-08-26 22:18:25
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 136 ms / 2,000 ms
コード長 6,848 bytes
コンパイル時間 2,214 ms
コンパイル使用メモリ 201,136 KB
実行使用メモリ 53,492 KB
最終ジャッジ日時 2024-04-22 00:23:51
合計ジャッジ時間 4,566 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 1 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 1 ms
5,376 KB
testcase_14 AC 59 ms
28,384 KB
testcase_15 AC 55 ms
28,476 KB
testcase_16 AC 128 ms
53,216 KB
testcase_17 AC 70 ms
28,484 KB
testcase_18 AC 74 ms
28,624 KB
testcase_19 AC 73 ms
28,620 KB
testcase_20 AC 13 ms
9,644 KB
testcase_21 AC 35 ms
15,928 KB
testcase_22 AC 60 ms
28,388 KB
testcase_23 AC 4 ms
5,376 KB
testcase_24 AC 125 ms
53,364 KB
testcase_25 AC 130 ms
53,232 KB
testcase_26 AC 134 ms
53,240 KB
testcase_27 AC 136 ms
53,360 KB
testcase_28 AC 131 ms
53,492 KB
testcase_29 AC 17 ms
6,892 KB
testcase_30 AC 1 ms
5,376 KB
testcase_31 AC 3 ms
5,376 KB
testcase_32 AC 1 ms
5,376 KB
testcase_33 AC 2 ms
5,376 KB
testcase_34 AC 2 ms
5,376 KB
testcase_35 AC 1 ms
5,376 KB
testcase_36 AC 2 ms
5,376 KB
testcase_37 AC 1 ms
5,376 KB
testcase_38 AC 1 ms
5,376 KB
testcase_39 AC 1 ms
5,376 KB
testcase_40 AC 1 ms
5,376 KB
testcase_41 AC 2 ms
5,376 KB
testcase_42 AC 1 ms
5,376 KB
testcase_43 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
// const int MOD = 1000000007;
const int MOD = 998244353;

template <typename T, int MAX_LOG>
struct Binary_Trie {
    struct Node {
        array<int, 2> next;
        int count;

        Node() : next{-1, -1}, count(0) {}
    };

    vector<Node> nodes;
    vector<int> ok;

    Binary_Trie() : ok(MAX_LOG, 0) { nodes.emplace_back(); }

    void dfs(int now = 0, int d = 0) {
        auto v = nodes[now].next;
        if (v[0] != -1 && v[1] != -1) ok[d] = 1;
        if (v[0] != -1) dfs(v[0], d + 1);
        if (v[1] != -1) dfs(v[1], d + 1);
    }

    void solve() {
        dfs();
        int ans = 1;
        rep(i, MAX_LOG) {
            if (ok[i] == 1) ans *= 2;
        }
        cout << ans % MOD << '\n';
    }

    void insert(const T &x) {
        int now = 0;
        for (int i = MAX_LOG - 1; i >= 0; i--) {
            int t = (x >> i) & 1;
            int next = nodes[now].next[t];
            if (next == -1) {
                next = nodes.size();
                nodes[now].next[t] = next;
                nodes.emplace_back();
            }
            nodes[now].count++;
            now = next;
        }
        nodes[now].count++;
    }

    void erase(const T &x) {
        if (!count(x)) return;
        int now = 0;
        for (int i = MAX_LOG - 1; i >= 0; i--) {
            int t = (x >> i) & 1;
            nodes[now].count--;
            now = nodes[now].next[t];
        }
        nodes[now].count--;
    }

    int find(const T &x) const {
        int now = 0;
        for (int i = MAX_LOG - 1; i >= 0; i--) {
            int t = (x >> i) & 1;
            now = nodes[now].next[t];
            if (now == -1) return -1;
        }
        return now;
    }

    int count(const T &x) const {
        int p = find(x);
        return p == -1 ? 0 : nodes[p].count;
    }

    T max_element(const T &xor_val = 0) const {
        int now = 0;
        T ret = 0;
        for (int i = MAX_LOG - 1; i >= 0; i--) {
            int t = (xor_val >> i) & 1;
            int l = nodes[now].next[t], r = nodes[now].next[t ^ 1];
            if (r == -1 || nodes[r].count == 0) {
                now = l;
                ret |= T(t) << i;
            } else {
                now = r;
                ret |= T(t ^ 1) << i;
            }
        }
        return ret;
    }

    T min_element(const T &xor_val = 0) const {
        int now = 0;
        T ret = 0;
        for (int i = MAX_LOG - 1; i >= 0; i--) {
            int t = (xor_val >> i) & 1;
            int l = nodes[now].next[t], r = nodes[now].next[t ^ 1];
            if (l == -1 || nodes[l].count == 0) {
                now = r;
                ret |= T(t ^ 1) << i;
            } else {
                now = l;
                ret |= T(t) << i;
            }
        }
        return ret;
    }

    // k 番目 (0-indexed)
    T kth_element(int k, const T &xor_val = 0) const {
        int now = 0;
        T ret = 0;
        for (int i = MAX_LOG - 1; i >= 0; i--) {
            int t = (xor_val >> i) & 1;
            int l = nodes[now].next[t], r = nodes[now].next[t ^ 1];
            if (l == -1 || nodes[l].count <= k) {
                now = r;
                k -= (l == -1 ? 0 : nodes[l].count);
                ret |= T(t ^ 1) << i;
            } else {
                now = l;
                ret |= T(t) << i;
            }
        }
        return ret;
    }

    // x 未満の個数
    int count_less(const T &x, const T &xor_val = 0) const {
        int now = 0;
        int ret = 0;
        for (int i = MAX_LOG - 1; i >= 0; i--) {
            int t = (xor_val >> i) & 1, s = (x >> i) & 1;
            int l = nodes[now].next[t], r = nodes[now].next[t ^ 1];
            if (s != t && l != -1) ret += nodes[l].count;
            now = nodes[now].next[s];
            if (now == -1) break;
        }
        return ret;
    }
};

int main() {
    int N;
    cin >> N;

    vector<int> a(N);
    rep(i, N) cin >> a[i];

    Binary_Trie<int, 30> trie;
    rep(i, N) trie.insert(a[i]);
    trie.solve();
}
0