test/binary-search-tree/RandomizedBinarySearchTreeSet-pair.test.cpp

• View this file on GitHub
• Last update: 2023-06-03 15:39:15+09:00
• Problem: https://yukicoder.me/problems/no/822

Depends on

• RandomizedBinarySearchTree - ランダム平衡二分探索木set (lib/12-binary-search-tree/RandomizedBinarySearchTreeSet.cpp)

Code

#define PROBLEM "https://yukicoder.me/problems/no/822"

#include <vector>
#include <iostream>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
#include "../../lib/12-binary-search-tree/RandomizedBinarySearchTreeSet.cpp"

template<class T> struct Monoid {
	using TypeNode = T;
	inline static constexpr TypeNode unit_node = {0,0};
	inline static constexpr TypeNode func_fold(TypeNode l,TypeNode r){return {0,0};}
};

int main() {
    int N,K; cin >> N >> K;
    if(N+1 <= K){
		cout << "INF" << endl;
		return 0;
	}
    RandomizedBinarySearchTreeSet<Monoid<pair<int,int>>> st;
    for(int i = 0; i < (1<<20); ++i) {
        if((i&N) != N) continue;
        for(int j = -K; j <= K; ++j) {
            int a = i, b = i + j;
            if(a>b) swap(a,b);
            if(0<=b && b-a<=K && ((a&b)==N) && !st.count({a,b})) st.insert({a,b});
        }
    }
    cout << st.size() << endl;
    return 0;
}

#line 1 "test/binary-search-tree/RandomizedBinarySearchTreeSet-pair.test.cpp"
#define PROBLEM "https://yukicoder.me/problems/no/822"

#include <vector>
#include <iostream>
#include <unordered_map>
#include <algorithm>
#include <numeric>
#include <cmath>
using namespace std;
#line 1 "lib/12-binary-search-tree/RandomizedBinarySearchTreeSet.cpp"
/*
 * @title RandomizedBinarySearchTree - ランダム平衡二分探索木set
 * @docs md/binary-search-tree/RandomizedBinarySearchTree.md
 */
template<class Monoid> class RandomizedBinarySearchTreeSet {
    using TypeNode = typename Monoid::TypeNode;
    unsigned int x = 123456789, y = 362436069, z = 521288629, w = 88675123;
    unsigned int xor_shift() {
        unsigned int t = (x ^ (x << 11)); x = y; y = z; z = w;
        return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
    }
    struct Node {
    private:
        void build() {left = right = nullptr;size = 1;}
    public:
        Node *left, *right;
        TypeNode value, range_value;
        int size;
        Node() : value(Monoid::unit_node), range_value(Monoid::unit_node) {build();}
        Node(TypeNode v) : value(v), range_value(v) {build();}
        friend ostream &operator<<(ostream &os, const Node* node) {return os << "{" << node->value << ", " << node->range_value << ", " << node->size << "}";}
    };
    Node* root;
    inline int size(Node *node) {return node==nullptr ? 0 : node->size;}
    inline TypeNode range_value(Node *node) {return node==nullptr ? Monoid::unit_node : node->range_value;}
    inline TypeNode get(Node *node, size_t k) {
        if (node==nullptr) return Monoid::unit_node;
        if (k == size(node->left)) return node->value;
        if (k < size(node->left)) return get(node->left, k);
        else return get(node->right, k-1 - size(node->left));
    }
    inline Node* update(Node *node) {
        node->size = size(node->left) + size(node->right) + 1;
        node->range_value = Monoid::func_fold(Monoid::func_fold(range_value(node->left),node->value),range_value(node->right));
        return node;
    }
    inline Node* merge_impl(Node *left, Node *right) {
        if (left==nullptr)  return right;
        if (right==nullptr) return left;
        if (xor_shift() % (left->size + right->size) < left->size) {
            left->right = merge_impl(left->right, right);
            return update(left);
        }
        else {
            right->left = merge_impl(left, right->left);
            return update(right);
        }
    }
    inline pair<Node*, Node*> split_impl(Node* node, int k) {
        if (node==nullptr) return make_pair(nullptr, nullptr);
        if (k <= size(node->left)) {
            pair<Node*, Node*> sub = split_impl(node->left, k);
            node->left = sub.second;
            return make_pair(sub.first, update(node));
        }
        else {
            pair<Node*, Node*> sub = split_impl(node->right, k - 1 - size(node->left));
            node->right = sub.first;
            return make_pair(update(node), sub.second);
        }
    }
    inline TypeNode fold_impl(Node *node, int l, int r) {
        if (l < 0 || size(node) <= l || r<=0 || r-l <= 0) return Monoid::unit_node;
        if (l == 0 && r == size(node)) return range_value(node);
        TypeNode value = Monoid::unit_node;
        int sl = size(node->left);
        if(sl > l) value = Monoid::func_fold(value,fold_impl(node->left,l,min(sl,r)));
        l = max(l-sl,0), r -= sl;
        if(l == 0 && r > 0) value = Monoid::func_fold(value,node->value);
        l = max(l-1,0), r -= 1;
        if(l >= 0 && r > l) value = Monoid::func_fold(value,fold_impl(node->right,l,r));
        return value;
    }
    inline int lower_bound(Node *node, TypeNode value) {
        if (node==nullptr) return 0;
        if (value <= node->value) return lower_bound(node->left, value);
        else return size(node->left) + lower_bound(node->right, value) + 1;
    }
    inline int upper_bound(Node *node, TypeNode value) {
        if (node==nullptr) return 0;
        if (value < node->value) return upper_bound(node->left, value);
        else return size(node->left) + upper_bound(node->right, value) + 1;
    }
    inline void insert_impl(const TypeNode value) {
        pair<Node*, Node*> sub = split_impl(this->root, lower_bound(this->root,value));
        this->root = this->merge_impl(this->merge_impl(sub.first, new Node(value)), sub.second);
    }
    inline void erase_impl(const TypeNode value) {
        int k1 = lower_bound(value), k2 = upper_bound(value);
        if(k1==k2) return;
        auto sub = split_impl(this->root,k1);
        this->root = merge_impl(sub.first, split_impl(sub.second, 1).second);
    }
public:
    RandomizedBinarySearchTreeSet() : root(nullptr) {}
    inline int size() {return size(this->root);}
    inline int empty(void) {return bool(size()==0);}
    inline Node* merge(Node *left, Node *right) {return merge_impl(left,right);}
    inline pair<Node*, Node*> split(int k) {return split_impl(this->root,k);}
    inline void insert(const TypeNode value) {insert_impl(value);}
    inline void erase(const TypeNode value) {erase_impl(value);}
    inline TypeNode get(size_t k) {return get(this->root, k);}
    inline TypeNode fold(int l, int r) {return fold_impl(this->root,l,r);}
    inline int lower_bound(TypeNode value) {return lower_bound(this->root,value);}
    inline int upper_bound(TypeNode value) {return upper_bound(this->root,value);}
    inline int count(TypeNode value) {return upper_bound(value) - lower_bound(value);}
    void print() {int m = size(this->root); for(int i=0;i<m;++i) cout << get(i) << " \n"[i==m-1];}
};
#line 11 "test/binary-search-tree/RandomizedBinarySearchTreeSet-pair.test.cpp"

template<class T> struct Monoid {
	using TypeNode = T;
	inline static constexpr TypeNode unit_node = {0,0};
	inline static constexpr TypeNode func_fold(TypeNode l,TypeNode r){return {0,0};}
};

int main() {
    int N,K; cin >> N >> K;
    if(N+1 <= K){
		cout << "INF" << endl;
		return 0;
	}
    RandomizedBinarySearchTreeSet<Monoid<pair<int,int>>> st;
    for(int i = 0; i < (1<<20); ++i) {
        if((i&N) != N) continue;
        for(int j = -K; j <= K; ++j) {
            int a = i, b = i + j;
            if(a>b) swap(a,b);
            if(0<=b && b-a<=K && ((a&b)==N) && !st.count({a,b})) st.insert({a,b});
        }
    }
    cout << st.size() << endl;
    return 0;
}

Back to top page