Tifa's CP Library

:heavy_check_mark: src/test_cpverifier/library-checker/set_xor_min.test.cpp

Depends on

Code

#define PROBLEM "https://judge.yosupo.jp/problem/set_xor_min/"

#include "../../code/ds/trie01.hpp"

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 q;
  std::cin >> q;
  tifa_libs::ds::trie01<> trie(30);
  for (u32 i = 0, t, x; i < q; ++i) {
    std::cin >> t >> x;
    switch (t) {
      case 0:
        if (!trie.data[trie.find(x)].val) trie.add(x);
        break;
      case 1:
        if (trie.data[trie.find(x)].val) trie.add(x, -1);
        break;
      case 2:
        std::cout << trie.kth_element(0, x).first << "\n";
    }
  }
  return 0;
}
#line 1 "src/test_cpverifier/library-checker/set_xor_min.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/set_xor_min/"

#line 1 "src/code/ds/trie01.hpp"



#line 1 "src/code/util/util.hpp"



#include <bits/stdc++.h>

template <class T>
constexpr T abs(T x) { return x < 0 ? -x : x; }

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using i128 = __int128_t;
using isz = ptrdiff_t;

using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using u128 = __uint128_t;
using usz = size_t;

using f32 = float;
using f64 = double;
using f128 = long double;

template <class T>
using ptt = std::pair<T, T>;
template <class T>
using pt3 = std::tuple<T, T, T>;
template <class T>
using pt4 = std::tuple<T, T, T, T>;

template <class T, usz N>
using arr = std::array<T, N>;
template <class T>
using vec = std::vector<T>;
template <class T>
using vvec = vec<vec<T>>;
template <class T>
using v3ec = vec<vvec<T>>;
template <class U, class T>
using vecp = vec<std::pair<U, T>>;
template <class U, class T>
using vvecp = vvec<std::pair<U, T>>;
template <class T>
using vecpt = vec<ptt<T>>;
template <class T>
using vvecpt = vvec<ptt<T>>;

template <class T, class C = std::less<T>>
using pq = std::priority_queue<T, vec<T>, C>;
template <class T>
using pqg = std::priority_queue<T, vec<T>, std::greater<T>>;

using strn = std::string;
using strnv = std::string_view;

using vecu = vec<u32>;
using vvecu = vvec<u32>;
using v3ecu = v3ec<u32>;
using vecu64 = vec<u64>;
using vecb = vec<bool>;
using vvecb = vvec<bool>;

#ifdef ONLINE_JUDGE
#undef assert
#define assert(x) 42
#endif

using namespace std::literals;

constexpr i8 operator""_i8(unsigned long long x) { return (i8)x; }
constexpr i16 operator""_i16(unsigned long long x) { return (i16)x; }
constexpr i32 operator""_i32(unsigned long long x) { return (i32)x; }
constexpr i64 operator""_i64(unsigned long long x) { return (i64)x; }
constexpr isz operator""_iz(unsigned long long x) { return (isz)x; }

constexpr u8 operator""_u8(unsigned long long x) { return (u8)x; }
constexpr u16 operator""_u16(unsigned long long x) { return (u16)x; }
constexpr u32 operator""_u32(unsigned long long x) { return (u32)x; }
constexpr u64 operator""_u64(unsigned long long x) { return (u64)x; }
constexpr usz operator""_uz(unsigned long long x) { return (usz)x; }

inline const auto fn_0 = [](auto&&...) {};


#line 5 "src/code/ds/trie01.hpp"

namespace tifa_libs::ds {

template <class T = i32, bool persistent = false>
struct trie01 {
  struct YYZ {
    u32 nxt[2];
    T val;
    vecu idxs;

    YYZ() : nxt{0, 0}, val(0), idxs() {}
  };

  const i32 MAX_DEP;
  vec<YYZ> data;
  u32 root;

  constexpr explicit trie01(i32 max_depth = 32) : MAX_DEP(max_depth), data(2), root(1) {
    assert(max_depth > 0);
    data.reserve(1_u64 << (max_depth / 2));
  }

  void add(u64 bit, T val = 1, int idx = -1, u64 xv = 0) { root = add_(root, bit, idx, MAX_DEP, val, xv); }
  u32 find(u64 bit, u64 xv = 0) const { return find_(root, bit, MAX_DEP, xv); }
  auto kth_element(T k, u64 xv = 0) const {
    assert(0 <= k && k < data[root].val);
    return kth_(root, k, MAX_DEP, xv);
  }
  T count_less(u64 bit, u64 xv = 0) const { return cntle_(root, bit, MAX_DEP, xv); }

 private:
  u32 add_(u32 t, u64 bit, int idx, int dep, T x, u64 xv, bool need = true) {
    if constexpr (persistent)
      if (need) t = (u32)data.size(), data.emplace_back();
    if (dep == -1) {
      data[t].val += x;
      if (idx >= 0) data[t].idxs.push_back((u32)idx);
    } else {
      if (auto &_ = data[t].nxt[(xv ^ bit) >> dep & 1]; !_) _ = (u32)data.size(), data.emplace_back(), need = false;
      data[t].nxt[(xv ^ bit) >> dep & 1] = add_(data[t].nxt[(xv ^ bit) >> dep & 1], bit, idx, dep - 1, x, xv, need);
      data[t].val += x;
    }
    return t;
  }

  u32 find_(u32 t, u64 bit, int dep, u64 xv) const {
    if (dep == -1) return t;
    auto to = data[t].nxt[(xv ^ bit) >> dep & 1];
    return to ? find_(to, bit, dep - 1, xv) : 0;
  }

  std::pair<u64, u32> kth_(u32 t, T k, int idx, u64 xv) const {
    if (idx == -1) return {0, t};
    bool f = xv >> idx & 1;
    if (auto _ = data[t].nxt[f]; (_ ? data[_].val : 0) <= k) {
      auto ret = kth_(data[t].nxt[f ^ 1], k - (_ ? data[_].val : 0), idx - 1, xv);
      ret.first |= 1_u64 << idx;
      return ret;
    } else return kth_(_, k, idx - 1, xv);
  }

  T cntle_(u32 t, u64 bit, int idx, u64 xv) const {
    if (idx == -1) return 0;
    T ret = 0;
    bool f = xv >> idx & 1;
    if ((bit >> idx & 1) && data[t].nxt[f]) ret += data[data[t].nxt[f]].val;
    if (auto _ = data[t].nxt[(xv ^ bit) >> idx & 1]; _) ret += cntle_(_, bit, idx - 1, xv);
    return ret;
  }
};

}  // namespace tifa_libs::ds


#line 4 "src/test_cpverifier/library-checker/set_xor_min.test.cpp"

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 q;
  std::cin >> q;
  tifa_libs::ds::trie01<> trie(30);
  for (u32 i = 0, t, x; i < q; ++i) {
    std::cin >> t >> x;
    switch (t) {
      case 0:
        if (!trie.data[trie.find(x)].val) trie.add(x);
        break;
      case 1:
        if (trie.data[trie.find(x)].val) trie.add(x, -1);
        break;
      case 2:
        std::cout << trie.kth_element(0, x).first << "\n";
    }
  }
  return 0;
}

Test cases

Env Name Status Elapsed Memory
g++-12 almost_all_insert_00 :heavy_check_mark: AC 351 ms 332 MB
g++-12 almost_all_query_00 :heavy_check_mark: AC 173 ms 4 MB
g++-12 almost_all_query_close_00 :heavy_check_mark: AC 116 ms 4 MB
g++-12 ans_big_00 :heavy_check_mark: AC 9 ms 4 MB
g++-12 example_00 :heavy_check_mark: AC 8 ms 4 MB
g++-12 max_ans_small_00 :heavy_check_mark: AC 328 ms 168 MB
g++-12 max_random_00 :heavy_check_mark: AC 256 ms 86 MB
g++-12 max_random_01 :heavy_check_mark: AC 260 ms 86 MB
g++-12 max_random_02 :heavy_check_mark: AC 282 ms 87 MB
g++-12 random_00 :heavy_check_mark: AC 204 ms 86 MB
g++-12 random_01 :heavy_check_mark: AC 247 ms 87 MB
g++-12 random_02 :heavy_check_mark: AC 32 ms 14 MB
Back to top page