mmrz's library

This documentation is automatically generated by online-judge-tools/verification-helper

Project maintained by mm-rz Hosted on GitHub Pages — Theme by mattgraham

:heavy_check_mark: verify/yosupo/set_xor_min.test.cpp

Depends on

Code

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

#include "./../../template/template.hpp"
#include "./../../data_structure/binary_trie.hpp"

using namespace mmrz;

void mmrz::solve(){
	int q;
	cin >> q;
	binary_trie<int, 29> trie;
	while(q--){
		int op, x;
		cin >> op >> x;
		if(op == 0){
			if(trie.count(x) == 0)trie.add(x);
		}else if(op == 1){
			if(trie.count(x) != 0)trie.erase(x);
		}else{
			cout << trie.min_element(x).first << '\n';
		}
	}
}
#line 1 "verify/yosupo/set_xor_min.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/set_xor_min"

#line 1 "template/template.hpp"
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
ll MOD(ll x, ll m){return (x%m+m)%m; }
ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define eb emplace_back
# define exists(c, e)         ((c).find(e) != (c).end())

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

namespace mmrz {
	void solve();
}

int main(){
	mmrz::solve();
}
#line 2 "data_structure/binary_trie.hpp"

#line 6 "data_structure/binary_trie.hpp"

template<typename T, int MAX_LOG=31, typename D=int>
struct binary_trie {
	struct Node {
		Node *nxt[2];
		D exist;
		std::vector<int> accept;

		Node() : nxt{nullptr, nullptr}, exist(0) {}
	};

	Node *root;

	explicit binary_trie() : root(new Node()) {}
	explicit binary_trie(Node *_root) : root(_root) {}

	~binary_trie() { clear(root); }

	void add(const T &bit, int idx=-1, D delta=1, T xor_val=0) {
		root = add(root, bit, idx, MAX_LOG, delta, xor_val);
	}

	void erase(const T &bit, T xor_val=0) {
		add(bit, -1, -1, xor_val);
	}

	Node *find(const T &bit, T xor_val=0) {
		return find(root, bit, MAX_LOG, xor_val);
	}

	D count(const T &bit, T xor_val=0) {
		auto node = find(bit, xor_val);
		return (node ? node->exist : 0);
	}

	std::pair<T, Node *> min_element(T xor_val=0) {
		assert(root->exist > 0);
		return kth_element(0, xor_val);
	}

	std::pair<T, Node *> max_element(T xor_val=0) {
		assert(root->exist > 0);
		return kth_element(root->exist - 1, xor_val);
	}

	std::pair<T, Node *> kth_element(D k, T xor_val=0) {
		assert(0 <= k && k < root->exist);
		return kth_element(root, k, MAX_LOG, xor_val);
	}

	// [0, bit)
	D count_less(const T &bit, T xor_val=0) {
		return count_less(root, bit, MAX_LOG, xor_val);
	}
private:
	virtual Node *clone(Node *t) { return t; }

	Node *add(Node *t, T bit, int idx, int depth, D x, T xor_val, bool need=true) {
		if(need) clone(t);
		if(depth == -1){
			t->exist += x;
			if(idx >= 0) t->accept.emplace_back(idx);
		}else{
			bool f = (xor_val >> depth) & 1;
			auto &to = t->nxt[f ^ ((bit >> depth) & 1)];
			if(not to) to = new Node(), need = false;
			to = add(to, bit, idx, depth-1, x, xor_val, need);
			t->exist += x;
		}
		return t;
	}
	
	Node *find(Node *t, T bit, int depth, T xor_val) {
		if(depth == -1) {
			return t;
		}else{
			bool f = (xor_val >> depth) & 1;
			auto &to = t->nxt[f ^ ((bit >> depth) & 1)];
			return (to ? find(to, bit, depth-1, xor_val) : nullptr);
		}
	}
	
	std::pair<T, Node *> kth_element(Node *t, D k, int depth, T xor_val) {
		if(depth == -1) {
			return {0, t};
		}else{
			bool f = (xor_val >> depth) & 1;
			if((t->nxt[f] ? t->nxt[f]->exist : 0) <= k) {
				auto ret = kth_element(t->nxt[f^1], k-(t->nxt[f] ? t->nxt[f]->exist : 0), depth-1, xor_val);
				ret.first |= T(1) << depth;
				return ret;
			}else{
				return kth_element(t->nxt[f], k, depth-1, xor_val);
			}
		}
	}
	
	D count_less(Node *t, const T &bit, int depth, T xor_val) {
		if(depth == -1)return 0;
		D ret = 0;
		bool f = (xor_val >> depth) & 1;
		if((bit >> depth & 1) and t->nxt[f])ret += t->nxt[f]->exist;
		if(t->nxt[f^(bit >> depth & 1)]){
			ret += count_less(t->nxt[f^(bit >> depth & 1)], bit, depth-1, xor_val);
		}
		return ret;
	}

	void clear(Node *t) {
		if (!t) return;
		clear(t->nxt[0]);
		clear(t->nxt[1]);
		delete t;
	}
};
#line 5 "verify/yosupo/set_xor_min.test.cpp"

using namespace mmrz;

void mmrz::solve(){
	int q;
	cin >> q;
	binary_trie<int, 29> trie;
	while(q--){
		int op, x;
		cin >> op >> x;
		if(op == 0){
			if(trie.count(x) == 0)trie.add(x);
		}else if(op == 1){
			if(trie.count(x) != 0)trie.erase(x);
		}else{
			cout << trie.min_element(x).first << '\n';
		}
	}
}
Back to top page