cp-library-cpp

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

View the Project on GitHub NotLeonian/cp-library-cpp

:heavy_check_mark: test/src/datastructure/segment_tree/persistent_segment_tree/dummy.test.cpp

Depends on

Code

#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_A"

#include <iostream>
#include <limits>

#include "library/datastructure/segment_tree/persistent_segment_tree.hpp"

template <typename T, T(*op)(T, T), T(*e)()>
struct NaiveSolutionForSegmentTree {
    NaiveSolutionForSegmentTree() = default;
    NaiveSolutionForSegmentTree(const std::vector<T> &dat) : _n(dat.size()), _dat(dat) {}

    T get(int i) const {
        assert(0 <= i and i < _n);
        return _dat[i];
    }
    void set(int i, const T& val) {
        assert(0 <= i and i < _n);
        _dat[i] = val;
    }

    T prod_all() const {
        return prod(0, _n);
    }
    T prod(int l, int r) const {
        assert(0 <= l and l <= r and r <= _n);
        T res = e();
        for (int i = l; i < r; ++i) res = op(res, _dat[i]);
        return res;
    }

    template <typename Pred>
    int max_right(int l, Pred &&pred) const {
        assert(0 <= l and l <= _n);
        T sum = e();
        for (int r = l; r < _n; ++r) {
            T next_sum = op(sum, _dat[r]);
            if (not pred(next_sum)) return r;
            sum = std::move(next_sum);
        }
        return _n;
    }

    template <typename Pred>
    int min_left(int r, Pred &&pred) const {
        assert(0 <= r and r <= _n);
        T sum = e();
        for (int l = r; l > 0; --l) {
            T next_sum = op(_dat[l - 1], sum);
            if (not pred(next_sum)) return l;
            sum = std::move(next_sum);
        }
        return 0;
    }
private:
    int _n;
    std::vector<T> _dat;
};

/**
 * Point Set Range Min
 */

constexpr int inf = std::numeric_limits<int>::max() / 2;

struct S {
    int val;
    S() : S(inf) {}
    S(int val) : val(val) {}

    bool operator==(const S &other) const {
        return val == other.val;
    }
    bool operator!=(const S &other) const {
        return not operator==(other);
    }
};

S op(S x, S y) {
    return S{ std::min(x.val, y.val) };
}
S e() {
    return S{};
}

using Tree = suisen::PersistentSegmentTree<S, op, e>;
using Naive = NaiveSolutionForSegmentTree<S, op, e>;

#include <random>
#include <algorithm>

constexpr int Q_get = 0;
constexpr int Q_set = 1;
constexpr int Q_prod = 2;
constexpr int Q_prod_all = 3;
constexpr int Q_max_right = 4;
constexpr int Q_min_left = 5;
constexpr int QueryTypeNum = 6;

void test() {
    constexpr int N = 3000, Q = 3000, MAX_VAL = inf;

    std::mt19937 rng{std::random_device{}()};

    Tree::init_pool(1000000);

    std::vector<S> init(N);
    for (int i = 0; i < N; ++i) init[i] = { int(rng() % MAX_VAL) };
    
    std::vector<Tree> ts;
    std::vector<Naive> naive_sols;

    ts.push_back(Tree{init});
    naive_sols.push_back(Naive{init});

    for (int i = 0; i < Q; ++i) {
        const int query_type = rng() % QueryTypeNum;
        const int sequence_id = rng() % ts.size();
        auto &act = ts[sequence_id];
        auto &exp = naive_sols[sequence_id];
        if (query_type == Q_get) {
            const int i = rng() % N;
            assert(act.get(i) == exp.get(i));
        } else if (query_type == Q_set) {
            const int i = rng() % N;
            const S v { int(rng() % MAX_VAL) };
            ts.push_back(act.set(i, v));
            naive_sols.push_back(exp);
            naive_sols.back().set(i, v);
        } else if (query_type == Q_prod) {
            const int l = rng() % (N + 1);
            const int r = l + rng() % (N - l + 1);
            assert(act.prod(l, r) == exp.prod(l, r));
        } else if (query_type == Q_prod_all) {
            assert(act.prod_all() == exp.prod_all());
        } else if (query_type == Q_max_right) {
            const int l = rng() % (N + 1);
            const int r = l + rng() % (N - l + 1);
            const int v = std::min(inf, exp.prod(l, r).val + int(rng() % MAX_VAL) - MAX_VAL / 2);
            auto pred = [&](const S &x) { return x.val >= v; };
            assert(act.max_right(l, pred) == exp.max_right(l, pred));
        } else if (query_type == Q_min_left) {
            const int l = rng() % (N + 1);
            const int r = l + rng() % (N - l + 1);
            const int v = std::min(inf, exp.prod(l, r).val + int(rng() % MAX_VAL) - MAX_VAL / 2);
            auto pred = [&](const S &x) { return x.val >= v; };
            assert(act.min_left(r, pred) == exp.min_left(r, pred));
        } else {
            assert(false);
        }
    }
}

int main() {
    test();
    std::cout << "Hello World" << std::endl;
    return 0;
}
#line 1 "test/src/datastructure/segment_tree/persistent_segment_tree/dummy.test.cpp"
#define PROBLEM "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_A"

#include <iostream>
#include <limits>

#line 1 "library/datastructure/segment_tree/persistent_segment_tree.hpp"



#include <cassert>

#line 1 "library/util/object_pool.hpp"



#include <deque>
#include <vector>

namespace suisen {
    template <typename T, bool auto_extend = false>
    struct ObjectPool {
        using value_type = T;
        using value_pointer_type = T*;

        template <typename U>
        using container_type = std::conditional_t<auto_extend, std::deque<U>, std::vector<U>>;

        container_type<value_type> pool;
        container_type<value_pointer_type> stock;
        decltype(stock.begin()) it;

        ObjectPool() : ObjectPool(0) {}
        ObjectPool(int size) : pool(size), stock(size) {
            clear();
        }

        int capacity() const { return pool.size(); }
        int size() const { return it - stock.begin(); }

        value_pointer_type alloc() {
            if constexpr (auto_extend) ensure();
            return *it++;
        }

        void free(value_pointer_type t) {
            *--it = t;
        }

        void clear() {
            int size = pool.size();
            it = stock.begin();
            for (int i = 0; i < size; i++) stock[i] = &pool[i];
        }

        void ensure() {
            if (it != stock.end()) return;
            int size = stock.size();
            for (int i = size; i <= size * 2; ++i) {
                stock.push_back(&pool.emplace_back());
            }
            it = stock.begin() + size;
        }
    };
} // namespace suisen


#line 7 "library/datastructure/segment_tree/persistent_segment_tree.hpp"

namespace suisen {
    template <typename T, T(*op)(T, T), T(*e)()>
    struct PersistentSegmentTree {
        struct Node;

        using value_type = T;

        using node_type = Node;
        using node_pointer_type = node_type*;

        struct Node {
            static inline ObjectPool<node_type> _pool;

            node_pointer_type _ch[2]{ nullptr, nullptr };
            value_type _dat;

            Node() : _dat(e()) {}

            static node_pointer_type clone(node_pointer_type node) {
                return &(*_pool.alloc() = *node);
            }

            static void update(node_pointer_type node) {
                node->_dat = op(node->_ch[0]->_dat, node->_ch[1]->_dat);
            }

            static bool is_leaf(node_pointer_type node) {
                return not node->_ch[0];
            }

            static node_pointer_type build(const std::vector<value_type>& dat) {
                auto rec = [&](auto rec, int l, int r) -> node_pointer_type {
                    node_pointer_type res = _pool.alloc();
                    if (r - l == 1) {
                        res->_dat = dat[l];
                    } else {
                        int m = (l + r) >> 1;
                        res->_ch[0] = rec(rec, l, m), res->_ch[1] = rec(rec, m, r);
                        update(res);
                    }
                    return res;
                };
                return rec(rec, 0, dat.size());
            }

            static value_type prod_all(node_pointer_type node) {
                return node ? node->_dat : e();
            }
            static value_type prod(node_pointer_type node, int tl, int tr, int ql, int qr) {
                if (tr <= ql or qr <= tl) return e();
                if (ql <= tl and tr <= qr) return node->_dat;
                int tm = (tl + tr) >> 1;
                return op(prod(node->_ch[0], tl, tm, ql, qr), prod(node->_ch[1], tm, tr, ql, qr));
            }

            template <bool do_update, typename F>
            static auto search_node(node_pointer_type node, int size, int i, F &&f) {
                static std::vector<node_pointer_type> path;

                node_pointer_type res = node;
                if constexpr (do_update) res = clone(res);
                node_pointer_type cur = res;

                for (int l = 0, r = size; r - l > 1;) {
                    if constexpr (do_update) path.push_back(cur);
                    int m = (l + r) >> 1;
                    if (i < m) {
                        if constexpr (do_update) cur->_ch[0] = clone(cur->_ch[0]);
                        cur = cur->_ch[0];
                        r = m;
                    } else {
                        if constexpr (do_update) cur->_ch[1] = clone(cur->_ch[1]);
                        cur = cur->_ch[1];
                        l = m;
                    }
                }
                f(cur);

                if constexpr (do_update) {
                    while (path.size()) update(path.back()), path.pop_back();
                    return res;
                } else {
                    return;
                }
            }

            static value_type get(node_pointer_type node, int size, int i) {
                value_type res;
                search_node</* do_update = */false>(node, size, i, [&](node_pointer_type i_th_node) { res = i_th_node->_dat; });
                return res;
            }
            template <typename F>
            static node_pointer_type apply(node_pointer_type node, int size, int i, F&& f) {
                return search_node</* do_update = */true>(node, size, i, [&](node_pointer_type i_th_node) { i_th_node->_dat = f(i_th_node->_dat); });
            }
            static node_pointer_type set(node_pointer_type node, int size, int i, const value_type& dat) {
                return apply(node, size, i, [&](const value_type&) { return dat; });
            }

            template <typename F>
            static int max_right(node_pointer_type node, int size, int l, F&& f) {
                assert(f(e()));
                auto rec = [&](auto rec, node_pointer_type cur, int tl, int tr, value_type& sum) -> int {
                    if (tr <= l) return tr;
                    if (l <= tl) {
                        value_type nxt_sum = op(sum, cur->_dat);
                        if (f(nxt_sum)) {
                            sum = std::move(nxt_sum);
                            return tr;
                        }
                        if (tr - tl == 1) return tl;
                    }
                    int tm = (tl + tr) >> 1;
                    int res_l = rec(rec, cur->_ch[0], tl, tm, sum);
                    return res_l != tm ? res_l : rec(rec, cur->_ch[1], tm, tr, sum);
                };
                value_type sum = e();
                return rec(rec, node, 0, size, sum);
            }
            template <typename F>
            static int min_left(node_pointer_type node, int size, int r, F&& f) {
                assert(f(e()));
                auto rec = [&](auto rec, node_pointer_type cur, int tl, int tr, value_type& sum) -> int {
                    if (r <= tl) return tl;
                    if (tr <= r) {
                        value_type nxt_sum = op(cur->_dat, sum);
                        if (f(nxt_sum)) {
                            sum = std::move(nxt_sum);
                            return tl;
                        }
                        if (tr - tl == 1) return tr;
                    }
                    int tm = (tl + tr) >> 1;
                    int res_r = rec(rec, cur->_ch[1], tm, tr, sum);
                    return res_r != tm ? res_r : rec(rec, cur->_ch[0], tl, tm, sum);
                };
                value_type sum = e();
                return rec(rec, node, 0, size, sum);
            }

            template <typename OutputIterator>
            static void dump(node_pointer_type node, OutputIterator it) {
                if (not node) return;
                auto rec = [&](auto rec, node_pointer_type cur) -> void {
                    if (is_leaf(cur)) {
                        *it++ = cur->_dat;
                    } else {
                        rec(rec, cur->_ch[0]), rec(rec, cur->_ch[1]);
                    }
                };
                rec(rec, node);
            }
            static std::vector<value_type> dump(node_pointer_type node) {
                std::vector<value_type> res;
                dump(node, std::back_inserter(res));
                return res;
            }
        };

        PersistentSegmentTree() : _n(0), _root(nullptr) {}
        explicit PersistentSegmentTree(int n) : PersistentSegmentTree(std::vector<value_type>(n, e())) {}
        PersistentSegmentTree(const std::vector<value_type>& dat) : _n(dat.size()), _root(node_type::build(dat)) {}

        static void init_pool(int size) {
            node_type::_pool = ObjectPool<node_type>(size);
        }
        static void clear_pool() {
            node_type::_pool.clear();
        }

        value_type prod_all() {
            return node_type::prod_all(_root);
        }
        value_type prod(int l, int r) {
            assert(0 <= l and l <= r and r <= _n);
            return node_type::prod(_root, 0, _n, l, r);
        }
        value_type operator()(int l, int r) {
            return prod(l, r);
        }

        value_type get(int i) {
            assert(0 <= i and i < _n);
            return node_type::get(_root, _n, i);
        }
        value_type operator[](int i) {
            return get(i);
        }

        template <typename F>
        PersistentSegmentTree apply(int i, F&& f) {
            assert(0 <= i and i < _n);
            return PersistentSegmentTree(_n, node_type::apply(_root, _n, i, std::forward<F>(f)));
        }
        PersistentSegmentTree set(int i, const value_type& v) {
            assert(0 <= i and i < _n);
            return PersistentSegmentTree(_n, node_type::set(_root, _n, i, v));
        }

        template <typename F>
        int max_right(int l, F&& f) {
            assert(0 <= l and l <= _n);
            return node_type::max_right(_root, _n, l, std::forward<F>(f));
        }
        template <bool(*pred)(value_type)>
        static int max_right(int l) {
            return max_right(l, pred);
        }
        template <typename F>
        int min_left(int r, F&& f) {
            assert(0 <= r and r <= _n);
            return node_type::min_left(_root, _n, r, std::forward<F>(f));
        }
        template <bool(*pred)(value_type)>
        static int min_left(int r) {
            return min_left(r, pred);
        }

        template <typename OutputIterator>
        void dump(OutputIterator it) {
            node_type::dump(_root, it);
        }
        std::vector<value_type> dump() {
            return node_type::dump(_root);
        }

    private:
        int _n;
        node_pointer_type _root;
        PersistentSegmentTree(int n, node_pointer_type root) : _n(n), _root(root) {}
    };
}


#line 7 "test/src/datastructure/segment_tree/persistent_segment_tree/dummy.test.cpp"

template <typename T, T(*op)(T, T), T(*e)()>
struct NaiveSolutionForSegmentTree {
    NaiveSolutionForSegmentTree() = default;
    NaiveSolutionForSegmentTree(const std::vector<T> &dat) : _n(dat.size()), _dat(dat) {}

    T get(int i) const {
        assert(0 <= i and i < _n);
        return _dat[i];
    }
    void set(int i, const T& val) {
        assert(0 <= i and i < _n);
        _dat[i] = val;
    }

    T prod_all() const {
        return prod(0, _n);
    }
    T prod(int l, int r) const {
        assert(0 <= l and l <= r and r <= _n);
        T res = e();
        for (int i = l; i < r; ++i) res = op(res, _dat[i]);
        return res;
    }

    template <typename Pred>
    int max_right(int l, Pred &&pred) const {
        assert(0 <= l and l <= _n);
        T sum = e();
        for (int r = l; r < _n; ++r) {
            T next_sum = op(sum, _dat[r]);
            if (not pred(next_sum)) return r;
            sum = std::move(next_sum);
        }
        return _n;
    }

    template <typename Pred>
    int min_left(int r, Pred &&pred) const {
        assert(0 <= r and r <= _n);
        T sum = e();
        for (int l = r; l > 0; --l) {
            T next_sum = op(_dat[l - 1], sum);
            if (not pred(next_sum)) return l;
            sum = std::move(next_sum);
        }
        return 0;
    }
private:
    int _n;
    std::vector<T> _dat;
};

/**
 * Point Set Range Min
 */

constexpr int inf = std::numeric_limits<int>::max() / 2;

struct S {
    int val;
    S() : S(inf) {}
    S(int val) : val(val) {}

    bool operator==(const S &other) const {
        return val == other.val;
    }
    bool operator!=(const S &other) const {
        return not operator==(other);
    }
};

S op(S x, S y) {
    return S{ std::min(x.val, y.val) };
}
S e() {
    return S{};
}

using Tree = suisen::PersistentSegmentTree<S, op, e>;
using Naive = NaiveSolutionForSegmentTree<S, op, e>;

#include <random>
#include <algorithm>

constexpr int Q_get = 0;
constexpr int Q_set = 1;
constexpr int Q_prod = 2;
constexpr int Q_prod_all = 3;
constexpr int Q_max_right = 4;
constexpr int Q_min_left = 5;
constexpr int QueryTypeNum = 6;

void test() {
    constexpr int N = 3000, Q = 3000, MAX_VAL = inf;

    std::mt19937 rng{std::random_device{}()};

    Tree::init_pool(1000000);

    std::vector<S> init(N);
    for (int i = 0; i < N; ++i) init[i] = { int(rng() % MAX_VAL) };
    
    std::vector<Tree> ts;
    std::vector<Naive> naive_sols;

    ts.push_back(Tree{init});
    naive_sols.push_back(Naive{init});

    for (int i = 0; i < Q; ++i) {
        const int query_type = rng() % QueryTypeNum;
        const int sequence_id = rng() % ts.size();
        auto &act = ts[sequence_id];
        auto &exp = naive_sols[sequence_id];
        if (query_type == Q_get) {
            const int i = rng() % N;
            assert(act.get(i) == exp.get(i));
        } else if (query_type == Q_set) {
            const int i = rng() % N;
            const S v { int(rng() % MAX_VAL) };
            ts.push_back(act.set(i, v));
            naive_sols.push_back(exp);
            naive_sols.back().set(i, v);
        } else if (query_type == Q_prod) {
            const int l = rng() % (N + 1);
            const int r = l + rng() % (N - l + 1);
            assert(act.prod(l, r) == exp.prod(l, r));
        } else if (query_type == Q_prod_all) {
            assert(act.prod_all() == exp.prod_all());
        } else if (query_type == Q_max_right) {
            const int l = rng() % (N + 1);
            const int r = l + rng() % (N - l + 1);
            const int v = std::min(inf, exp.prod(l, r).val + int(rng() % MAX_VAL) - MAX_VAL / 2);
            auto pred = [&](const S &x) { return x.val >= v; };
            assert(act.max_right(l, pred) == exp.max_right(l, pred));
        } else if (query_type == Q_min_left) {
            const int l = rng() % (N + 1);
            const int r = l + rng() % (N - l + 1);
            const int v = std::min(inf, exp.prod(l, r).val + int(rng() % MAX_VAL) - MAX_VAL / 2);
            auto pred = [&](const S &x) { return x.val >= v; };
            assert(act.min_left(r, pred) == exp.min_left(r, pred));
        } else {
            assert(false);
        }
    }
}

int main() {
    test();
    std::cout << "Hello World" << std::endl;
    return 0;
}
Back to top page