結果
| 問題 | No.2061 XOR Sort |
| ユーザー |
 tokusakurai
|
| 提出日時 | 2022-08-26 22:18:25 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 149 ms / 2,000 ms |
| コード長 | 6,848 bytes |
| コンパイル時間 | 2,174 ms |
| コンパイル使用メモリ | 200,588 KB |
| 最終ジャッジ日時 | 2025-01-31 05:03:04 |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 41 |
ソースコード
#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();}