test/ds/set_xor_min.binary_trie.test.cpp

• View this file on GitHub
• Last update: 2024-11-09 00:49:07+00:00
• Problem: https://judge.yosupo.jp/problem/set_xor_min

Depends on

• ds/binary_trie.hpp
• ds/hash_set.hpp
• io.hpp
• prelude.hpp
• util/pool.hpp

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/set_xor_min

#include "io.hpp"
#include "ds/hash_set.hpp"
#include "ds/binary_trie.hpp"

int main() {
  binary_trie<int, (1 << 30) - 1, pool<1 << 24>, xor_mask_enabled> trie;
  hash_set<int> s;
  int q = in;
  while (q--) {
    int cmd = in, x = in;
    if (cmd == 0) {
      if (s.insert(x).second) trie.insert(x);
    } else if (cmd == 1) {
      if (s.erase(x)) trie.erase(x);
    } else {
      trie.set_mask(x);
      out(trie.min());
      trie.set_mask(0);
    }
  }
}

#line 1 "test/ds/set_xor_min.binary_trie.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/set_xor_min

#line 2 "prelude.hpp"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using vc = vector<char>;
#define rep2(i, m, n) for (auto i = (m); i < (n); i++)
#define rep(i, n) rep2(i, 0, n)
#define repr2(i, m, n) for (auto i = (n); i-- > (m);)
#define repr(i, n) repr2(i, 0, n)
#define all(x) begin(x), end(x)
auto ndvec(int n, auto e) { return vector(n, e); }
auto ndvec(int n, auto ...e) { return vector(n, ndvec(e...)); }
auto comp_key(auto&& f) { return [&](auto&& a, auto&& b) { return f(a) < f(b); }; }
auto& max(const auto& a, const auto& b) { return a < b ? b : a; }
auto& min(const auto& a, const auto& b) { return b < a ? b : a; }
#if __cpp_lib_ranges
namespace R = std::ranges;
namespace V = std::views;
#endif
#line 3 "io.hpp"

template <size_t BufSize = 1 << 26> class stdin_reader {
 public: stdin_reader() { buf[fread(buf, 1, sizeof(buf), stdin)] = 0; } template <class T> enable_if_t<is_integral_v<T>> read(T& x) { skip(); [[maybe_unused]] bool neg = false; if constexpr (is_signed_v<T>) neg = *p == '-' ? (p++, true) : false; x = 0; while (*p > ' ') x = x * 10 + (*p++ & 0x0F); if constexpr (is_signed_v<T>) x = neg ? -x : x; } template <class T> void_t<decltype(&T::val)> read(T& x) { x = T((unsigned)(*this)); } void read(char &c) { skip(); c = *p++; } void read(char*& q) { skip(); q = p; while (*p > ' ') p++; *p = 0; } template <size_t N> void read(char (&s)[N]) { read(s); } void read(string& s) { skip(); char* p0 = p; while (*p > ' ') p++; s.assign(p0, p); } template <class T, void_t<decltype(tuple_size<T>::value)>* = nullptr> void read(T& x) { read_tuple_impl(x, make_index_sequence<tuple_size_v<T>>{}); } template <class T, class U> void read(pair<T, U>& x) { read(x.first), read(x.second); } template <class T, size_t N> void read(T (&a)[N]) { for (auto& e : a) read(e); } template <class T> operator T() { T x; return read(x), x; } template <class... Ts> void operator()(Ts&... xs) { (read(xs), ...); } int operator--() { return (int)*this - 1; } template <class T> T* arr(int n) { T* p = new T[n + 1]; rep(i, n) read(p[i]); return p; } template <class T> void vec(vector<T>& v, int n) { v.resize(n); for (auto& e : v) read(e); } template <class T> vector<T> vec(int n) { vector<T> v; return vec(v, n), v; } auto vi(int n) { return vec<int>(n); } auto vi1(int n) { auto v = vec<int>(n); rep(i, n) v[i]--; return v; } auto vll(int n) { return vec<ll>(n); } template <class... Ts> tuple<vector<Ts>...> vecs(int n) { tuple<vector<Ts>...> res; vecs_impl(res, n, make_index_sequence<sizeof...(Ts)>{}); return res; } template <class T> void vvec(vector<vector<T>>& v, int n, int m) { v.resize(n); for (auto& e : v) vec(e, m); } template <class T> vector<vector<T>> vvec(int n, int m) { vector<vector<T>> v; return vvec(v, n, m), v; } template <class... Ts> auto cols(int n) { return transpose(vec<tuple<Ts...>>(n)); } private: char buf[BufSize], *p = buf; void skip() { while (*p <= ' ') p++; } template <class T, size_t... Is> void read_tuple_impl(T& x, index_sequence<Is...>) { (*this)(get<Is>(x)...); } template <class T, size_t... Is> void vecs_impl(T& x, int n, index_sequence<Is...>) { (vec(get<Is>(x), n), ...); } template <class T, size_t... Is> static auto transpose_impl(const vector<T>& v, index_sequence<Is...>) { tuple<vector<decay_t<tuple_element_t<Is, T>>>...> w; (get<Is>(w).reserve(v.size()), ...); for (const auto& row : v) (get<Is>(w).push_back(get<Is>(row)), ...); return w; } template <class T> static auto transpose(const vector<T>& v) { return transpose_impl(v, make_index_sequence<tuple_size_v<T>>{}); }
};
template <size_t BufSize = 1 << 26> class stdout_writer {
 public: ~stdout_writer() { flush(); } void flush() { fwrite(buf, 1, p - buf, stdout), p = buf; } void write_char(char c) { *p++ = c; } void write() {} void write(char c) { write_char(c); } template <class T> enable_if_t<is_integral_v<T>> write(T x) { if (!x) return write_char('0'); if constexpr (is_signed_v<T>) if (x < 0) write_char('-'), x = -x; static char tmp[16]; char* q = end(tmp); while (x >= 10000) memcpy(q -= 4, digits.data + x % 10000 * 4, 4), x /= 10000; if (x < 10) write_char('0' + x); else if (x < 100) write_char('0' + (uint8_t)x / 10), write_char('0' + (uint8_t)x % 10); else if (x < 1000) memcpy(p, digits.data + x * 4 + 1, 3), p += 3; else memcpy(p, digits.data + x * 4, 4), p += 4; memcpy(p, q, end(tmp) - q), p += end(tmp) - q; } template <class T> void_t<decltype(&T::val)> write(T x) { write(x.val()); } void write(double x) { static char tmp[40]; sprintf(tmp, "%.15f", x); write(tmp); } void write(long double x) { static char tmp[40]; sprintf(tmp, "%.15Lf", x); write(tmp); } void write(const char* s) { while (*s) *p++ = *s++; } void write(const string& s) { memcpy(p, s.c_str(), s.size()), p += s.size(); } template <class T, class U> void write(const pair<T, U>& x) { write(x.first), write_char(' '), write(x.second); } template <class... Ts> void write(const tuple<Ts...>& x) { write_tuple(x, make_index_sequence<sizeof...(Ts)>{}); } template <class... Ts> void write(const Ts&... xs) { ((write(xs), write_char(' ')), ...), --p; } template <class... Ts> void writeln(const Ts&... xs) { write(xs...), write_char('\n'); } template <class... Ts> void operator()(const Ts&... xs) { writeln(xs...); } template <class It> void iter(It first, It last, char sep = ' ') { if (first == last) write_char('\n'); else { while (first != last) write(*first++), write_char(sep); p[-1] = '\n'; } } template <class It> void iter1(It first, It last, char sep = ' ') { if (first == last) write_char('\n'); else { while (first != last) write(1 + *first++), write_char(sep); p[-1] = '\n'; } } template <class T> void vec(const vector<T>& v, char sep = ' ') { iter(all(v), sep); } template <class T> void write(const vector<T>& v) { vec(v), p--; } template <class T> void vec1(const vector<T>& v, char sep = ' ') { iter1(all(v), sep); } void del() { *--p = 0; } void Yes(bool b = true) { writeln(b ? "Yes" : "No"); } void YES(bool b = true) { writeln(b ? "YES" : "NO"); } void Takahashi(bool b = true) { writeln(b ? "Takahashi" : "Aoki"); } private: char buf[BufSize], *p = buf; template <class T, size_t... Is> void write_tuple(const T& x, index_sequence<Is...>) { ((write(get<Is>(x)), write_char(' ')), ...), --p; } struct four_digits { char data[40000]; constexpr four_digits() : data() { for (int i = 0; i < 10000; i++) for (int n = i, j = 4; j--;) data[i * 4 + j] = n % 10 + '0', n /= 10; } } static constexpr digits{}; public:
#define INSTANT(s) void s() { writeln(#s); }
  INSTANT(No) INSTANT(NO) INSTANT(Aoki) INSTANT(possible) INSTANT(Possible) INSTANT(POSSIBLE) INSTANT(impossible) INSTANT(Impossible) INSTANT(IMPOSSIBLE)
#undef INSTANT
};
stdin_reader<> in;
stdout_writer<> out;
#line 3 "ds/hash_set.hpp"
#include <ext/pb_ds/assoc_container.hpp>

template <class T, class Hash = hash<T>>
using hash_set = __gnu_pbds::gp_hash_table<T, __gnu_pbds::null_type, Hash>;
#line 3 "util/pool.hpp"

template <size_t N = 1 << 20>
struct pool {
  template <class T>
  struct alloc {
    static inline T* ptr =
        (T*)new (align_val_t(alignof(T))) unsigned char[sizeof(T) * N];
    static void* operator new(size_t) noexcept { return ptr++; }
    static void operator delete(void* p) { destroy_at((T*)p); }

   private:
    alloc() = default;
    friend T;
  };
};

struct no_pool {
  template <class T>
  struct alloc {};
};
#line 3 "ds/binary_trie.hpp"

template <class T>
struct xor_mask_enabled {
  void set_mask(T s2) { s = s2; }
  void add_mask(T s2) { s ^= s2; }
  T mask() const { return s; }

 private:
  T s = 0;
};

template <class T>
struct xor_mask_disabled {
  constexpr T mask() const { return 0; }
};

// [0, U]
template <
    class T, T U, class Alloc = pool<>,
    template <class> class XorMask = xor_mask_disabled>
class binary_trie : public XorMask<T> {
 private:
  struct node : Alloc::template alloc<node> {
    node *l = nullptr, *r = nullptr;
    int cnt = 0;
  };

 public:
  binary_trie() = default;

  int size() const { return root->cnt; }
  bool empty() const { return size() == 0; }
  void insert(T x) { insert(root, x, B - 1); }
  void erase(T x) { erase(root, x, B - 1); }
  int count(T x) const { return count(root, x, B - 1); }
  // returns -1 if empty
  T max() const { return empty() ? -1 : max(root, 0, B - 1); }
  // returns -1 if empty
  T min() const { return empty() ? -1 : min(root, 0, B - 1); }
  T find(int k) const { return find(root, 0, k, B - 1); }

 private:
  static constexpr int calc_b(T u) {
    int b = 0;
    while (u) u >>= 1, b++;
    return b;
  }
  static constexpr int B = calc_b(U);

  node* root = new node;

  T bit_at(T x, int i) const { return (x ^ this->mask()) >> i & 1; }
  node* insert(node* p, T x, int i) {
    if (!p)
      p = new node;
    p->cnt++;
    if (i != -1) {
      if (bit_at(x, i)) p->r = insert(p->r, x, i - 1);
      else p->l = insert(p->l, x, i - 1);
    }
    return p;
  }
  void erase(node* p, T x, int i) {
    p->cnt--;
    if (i != -1) {
      if (bit_at(x, i)) erase(p->r, x, i - 1);
      else erase(p->l, x, i - 1);
    }
  }
  int count_tree(const node* p) const { return p ? p->cnt : 0; }
  int count(const node* p, T x, int i) const {
    return !p             ? 0
           : i == -1      ? p->cnt
           : bit_at(x, i) ? count(p->r, x, i - 1)
                          : count(p->l, x, i - 1);
  }
  T max(const node* p, T x, int i) const {
    if (i == -1) return x;
    if (this->mask() >> i & 1)
      return count_tree(p->l) ? max(p->l, x | 1 << i, i - 1)
                              : max(p->r, x, i - 1);
    else
      return count_tree(p->r) ? max(p->r, x | 1 << i, i - 1)
                              : max(p->l, x, i - 1);
  }
  T min(const node* p, T x, int i) const {
    if (i == -1) return x;
    if (this->mask() >> i & 1)
      return count_tree(p->r) ? min(p->r, x, i - 1)
                              : min(p->l, x | 1 << i, i - 1);
    else
      return count_tree(p->l) ? min(p->l, x, i - 1)
                              : min(p->r, x | 1 << i, i - 1);
  }
  T find(const node* p, T x, int k, int i) const {
    if (i == -1) {
      assert(k == 0 && p->cnt != 0);
      return x;
    }
    if (this->mask() >> i & 1)
      return count_tree(p->r) < k
                 ? find(p->r, x, k, i - 1)
                 : find(p->l, x | 1 << i, k - count_tree(p->r), i - 1);
    else
      return count_tree(p->l) < k
                 ? find(p->l, x, k, i - 1)
                 : find(p->r, x | 1 << i, k - count_tree(p->l), i - 1);
  }
};
#line 6 "test/ds/set_xor_min.binary_trie.test.cpp"

int main() {
  binary_trie<int, (1 << 30) - 1, pool<1 << 24>, xor_mask_enabled> trie;
  hash_set<int> s;
  int q = in;
  while (q--) {
    int cmd = in, x = in;
    if (cmd == 0) {
      if (s.insert(x).second) trie.insert(x);
    } else if (cmd == 1) {
      if (s.erase(x)) trie.erase(x);
    } else {
      trie.set_mask(x);
      out(trie.min());
      trie.set_mask(0);
    }
  }
}

Test cases

Env	Name	Status	Elapsed	Memory
g++-12	almost_all_insert_00	AC	646 ms	182 MB
g++-12	almost_all_query_00	AC	204 ms	65 MB
g++-12	almost_all_query_close_00	AC	144 ms	65 MB
g++-12	ans_big_00	AC	80 ms	59 MB
g++-12	example_00	AC	80 ms	59 MB
g++-12	max_ans_small_00	AC	398 ms	108 MB
g++-12	max_random_00	AC	296 ms	64 MB
g++-12	max_random_01	AC	306 ms	67 MB
g++-12	max_random_02	AC	312 ms	68 MB
g++-12	random_00	AC	240 ms	63 MB
g++-12	random_01	AC	280 ms	63 MB
g++-12	random_02	AC	101 ms	59 MB

Back to top page