noya2_Library
This documentation is automatically generated by online-judge-tools/verification-helper
test/data_structure/SetXorMin.test.cpp
- View this file on GitHub
- Last update: 2024-07-03 00:58:52+09:00
- Problem: https://judge.yosupo.jp/problem/set_xor_min
Depends on
- data_structure/binary_trie.hpp
- template/const.hpp
- template/inout_old.hpp
- template/template.hpp
- template/utils.hpp
Code
#define PROBLEM "https://judge.yosupo.jp/problem/set_xor_min"
#include"../../template/template.hpp"
#include"../../data_structure/binary_trie.hpp"
int main(){
binary_trie<int,31> bt;
int q; in(q);
while (q--){
int t; in(t);
int x; in(x);
if (t == 0){
bt.insert(x);
}
if (t == 1){
bt.erase(x);
}
if (t == 2){
bt.xor_all(x);
out(bt.get(0));
bt.xor_all(x);
}
}
}#line 1 "test/data_structure/SetXorMin.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/set_xor_min"
#line 2 "template/template.hpp"
using namespace std;
#include<bits/stdc++.h>
#line 1 "template/inout_old.hpp"
namespace noya2 {
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
os << p.first << " " << p.second;
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
is >> p.first >> p.second;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
int s = (int)v.size();
for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
for (auto &x : v) is >> x;
return is;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
cout << t;
if (sizeof...(u)) cout << sep;
out(u...);
}
template<typename T>
void out(const vector<vector<T>> &vv){
int s = (int)vv.size();
for (int i = 0; i < s; i++) out(vv[i]);
}
struct IoSetup {
IoSetup(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(7);
}
} iosetup_noya2;
} // namespace noya2
#line 1 "template/const.hpp"
namespace noya2{
const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 = 998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";
void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }
} // namespace noya2
#line 2 "template/utils.hpp"
#line 6 "template/utils.hpp"
namespace noya2{
unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
if (a == 0 || b == 0) return a + b;
int n = __builtin_ctzll(a); a >>= n;
int m = __builtin_ctzll(b); b >>= m;
while (a != b) {
int mm = __builtin_ctzll(a - b);
bool f = a > b;
unsigned long long c = f ? a : b;
b = f ? b : a;
a = (c - b) >> mm;
}
return a << std::min(n, m);
}
template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }
long long sqrt_fast(long long n) {
if (n <= 0) return 0;
long long x = sqrt(n);
while ((x + 1) * (x + 1) <= n) x++;
while (x * x > n) x--;
return x;
}
template<typename T> T floor_div(const T n, const T d) {
assert(d != 0);
return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}
template<typename T> T ceil_div(const T n, const T d) {
assert(d != 0);
return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}
template<typename T> void uniq(std::vector<T> &v){
std::sort(v.begin(),v.end());
v.erase(unique(v.begin(),v.end()),v.end());
}
template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }
} // namespace noya2
#line 8 "template/template.hpp"
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
namespace noya2{
/* ~ (. _________ . /) */
}
using namespace noya2;
#line 2 "data_structure/binary_trie.hpp"
#line 4 "data_structure/binary_trie.hpp"
namespace noya2 {
template<typename T, int LOG>
struct binary_trie {
struct node {
node *p;
array<node*,2> ch;
int leaf, sz;
node () : p(nullptr), ch({nullptr,nullptr}), leaf(0), sz(0) {}
};
binary_trie () : lazy(0) {}
int size(node *v){
if (v == nullptr) return 0;
return v->sz;
}
int size(){
return size(root);
}
void insert(T x){
x ^= lazy;
node *v = root;
for (int i = LOG-1; i >= 0; i--){
int j = x >> i & 1;
if (v->ch[j] == nullptr){
v->ch[j] = new node();
v->ch[j]->p = v;
}
v = v->ch[j];
}
v->leaf = 1;
update(v);
for (int i = 0; i < LOG; i++){
v = v->p;
update(v);
}
}
void erase(T x){
x ^= lazy;
node *v = root;
for (int i = LOG-1; i >= 0; i--){
int j = x >> i & 1;
if (v->ch[j] == nullptr) return ;
v = v->ch[j];
}
v->leaf = 0;
update(v);
for (int i = 0; i < LOG; i++){
node *p = v->p;
if (size(v) == 0){
(v == p->ch[0] ? p->ch[0] : p->ch[1]) = nullptr;
delete v;
}
v = p;
update(v);
}
}
int count(T x){
node *v = root;
int res = 0;
for (int i = LOG-1; i >= 0; i--){
int j = lazy >> i & 1;
if (x >> i & 1){
res += size(v->ch[j]);
v = v->ch[j^1];
}
else {
v = v->ch[j];
}
if (v == nullptr) break;
}
return res;
}
T get(int k){
if (k < 0 || k >= size()) return -1;
node *v = root;
T ans = 0;
for (int i = LOG-1; i >= 0; i--){
int j = lazy >> i & 1;
if (k < size(v->ch[j])){
v = v->ch[j];
}
else {
k -= size(v->ch[j]);
v = v->ch[j^1];
ans |= T(1) << i;
}
}
return ans;
}
T mex(){
if ((T)size() == (T(1)<<LOG)) return T(1)<<LOG;
node *v = root;
T ans = 0;
for (int i = LOG-1; i >= 0; i--){
int j = lazy >> i & 1;
if ((T)size(v->ch[j]) < (T(1)<<i)){
v = v->ch[j];
}
else {
v = v->ch[j^1];
ans |= T(1) << i;
}
if (v == nullptr) break;
}
return ans;
}
T xor_all(T x){ return lazy ^= x; }
vector<T> enumerate(){
vector<T> ans; ans.reserve(size());
auto dfs = [&](auto sfs, int i, T x, node *v) -> void {
if (i == -1){
ans.emplace_back(x^lazy);
return ;
}
if (v->ch[0] != nullptr){
sfs(sfs,i-1,x,v->ch[0]);
}
if (v->ch[1] != nullptr){
sfs(sfs,i-1,x|(T(1)<<i),v->ch[1]);
}
};
dfs(dfs,LOG-1,0,root);
return ans;
}
private:
T lazy;
node *root = new node();
void update(node *v){
v->sz = v->leaf + size(v->ch[0]) + size(v->ch[1]);
}
};
} // namespace noya2
#line 5 "test/data_structure/SetXorMin.test.cpp"
int main(){
binary_trie<int,31> bt;
int q; in(q);
while (q--){
int t; in(t);
int x; in(x);
if (t == 0){
bt.insert(x);
}
if (t == 1){
bt.erase(x);
}
if (t == 2){
bt.xor_all(x);
out(bt.get(0));
bt.xor_all(x);
}
}
}