verify/ds/dynamic_array/persistent_dynamic_lazy_monoid_array_range_ap.test.cpp

View this file on GitHub
Last update: 2026-10-06 01:57:24+09:00
Problem: https://judge.yosupo.jp/problem/aplusb

Depends on

Code

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

#include "../../../ds/dynamic_array/persistent_dynamic_lazy_monoid_array.hpp"

#include <algorithm>
#include <cassert>
#include "../../../utilities/fast_io.hpp"
#include <numeric>
#include <random>
#include <utility>
#include <vector>

#include "../../../acted_monoid/range_ap_add_range_sum.hpp"

using AM = m1une::acted_monoid::RangeApAddRangeSum<long long>;
using Node = AM::value_type;
using Array = m1une::ds::PersistentDynamicLazyMonoidArray<AM>;

std::vector<long long> sums(const std::vector<Node>& a) {
    std::vector<long long> res;
    res.reserve(a.size());
    for (Node x : a) res.push_back(x.sum);
    return res;
}

long long sum_range(const std::vector<long long>& a, int l, int r) {
    return std::accumulate(a.begin() + l, a.begin() + r, 0LL);
}

void assert_all_ranges(const Array& a, const std::vector<long long>& expected) {
    assert(sums(a.to_vector()) == expected);
    assert(a.all_prod().sum == sum_range(expected, 0, int(expected.size())));
    for (int l = 0; l <= int(expected.size()); l++) {
        for (int r = l; r <= int(expected.size()); r++) {
            assert(a.prod(l, r).sum == sum_range(expected, l, r));
        }
    }
}

int main() {
    m1une::utilities::FastInput fast_input;
    m1une::utilities::FastOutput fast_output;

    {
        Array a(std::vector<long long>{0, 0, 0, 0});
        Array b = a.apply(1, 4, {2, 3});
        Array c = b.insert(2, AM::make(100));
        assert_all_ranges(a, {0, 0, 0, 0});
        assert_all_ranges(b, {0, 3, 5, 7});
        assert_all_ranges(c, {0, 3, 100, 5, 7});

        Array d = c.apply(1, 5, {10, 0});
        assert_all_ranges(c, {0, 3, 100, 5, 7});
        assert_all_ranges(d, {0, 3, 110, 25, 37});
    }
    {
        Array a(std::vector<long long>{0, 0, 0, 0, 0});
        Array b = a.apply(0, 5, {1, 0});
        Array c = b.insert(2, AM::make(100));
        assert_all_ranges(b, {0, 1, 2, 3, 4});
        assert_all_ranges(c, {0, 1, 100, 2, 3, 4});
    }
    {
        Array a(std::vector<long long>{0, 0, 0, 0});
        Array b = a.apply(0, 4, {1, 0}).reverse();
        Array c = b.insert(1, AM::make(9));
        Array d = c.apply(1, 4, {2, 1});
        assert_all_ranges(b, {3, 2, 1, 0});
        assert_all_ranges(c, {3, 9, 2, 1, 0});
        assert_all_ranges(d, {3, 10, 5, 6, 0});
    }
    {
        std::vector<long long> expected(16);
        std::iota(expected.begin(), expected.end(), 0LL);
        Array original(expected);
        Array base = original.apply(0, 16, AM::operator_type(2, 3)).reverse();
        for (int i = 0; i < int(expected.size()); ++i) expected[i] += 2 * i + 3;
        std::reverse(expected.begin(), expected.end());
        const std::vector<long long> base_expected = expected;
        Array inplace = base;
        Array persistent = base;
        std::mt19937 cow_rng(17);
        for (int step = 0; step < 500; ++step) {
            int l = int(cow_rng() % (expected.size() + 1));
            int r = int(cow_rng() % (expected.size() + 1));
            if (l > r) std::swap(l, r);
            if (step % 5 == 0) {
                int pos = int(cow_rng() % expected.size());
                long long value = int(cow_rng() % 101) - 50;
                inplace.set_inplace(pos, AM::make(value));
                expected[pos] = value;
                persistent = persistent.set(pos, AM::make(value));
            } else {
                long long coef = int(cow_rng() % 11) - 5;
                long long add = int(cow_rng() % 21) - 10;
                AM::operator_type action(coef, add);
                inplace.apply_inplace(l, r, action);
                persistent = persistent.apply(l, r, action);
                for (int i = l; i < r; ++i) expected[i] += coef * (i - l) + add;
            }
            assert_all_ranges(inplace, expected);
            assert_all_ranges(persistent, expected);
            assert_all_ranges(base, base_expected);
            assert_all_ranges(original, std::vector<long long>{
                0, 1, 2, 3, 4, 5, 6, 7,
                8, 9, 10, 11, 12, 13, 14, 15
            });
        }
    }

    std::mt19937 rng(4);
    std::vector<std::pair<Array, std::vector<long long>>> versions;
    versions.push_back({Array(), {}});
    for (int step = 0; step < 300; step++) {
        int id = int(rng() % versions.size());
        Array cur = versions[id].first;
        std::vector<long long> expected = versions[id].second;
        assert_all_ranges(cur, expected);

        Array next = cur;
        std::vector<long long> next_expected = expected;
        int op = int(rng() % 7);
        if (op == 0 || next_expected.empty()) {
            int pos = int(rng() % (next_expected.size() + 1));
            long long value = int(rng() % 101) - 50;
            next = cur.insert(pos, AM::make(value));
            next_expected.insert(next_expected.begin() + pos, value);
        } else if (op == 1) {
            int pos = int(rng() % next_expected.size());
            next = cur.erase(pos);
            next_expected.erase(next_expected.begin() + pos);
        } else if (op == 2) {
            int l = int(rng() % (next_expected.size() + 1));
            int r = int(rng() % (next_expected.size() + 1));
            if (l > r) std::swap(l, r);
            long long coef = int(rng() % 11) - 5;
            long long add = int(rng() % 21) - 10;
            next = cur.apply(l, r, {coef, add});
            for (int i = l; i < r; i++) next_expected[i] += coef * (i - l) + add;
        } else if (op == 3) {
            int l = int(rng() % (next_expected.size() + 1));
            int r = int(rng() % (next_expected.size() + 1));
            if (l > r) std::swap(l, r);
            next = cur.reverse(l, r);
            std::reverse(next_expected.begin() + l, next_expected.begin() + r);
        } else if (op == 4) {
            int l = int(rng() % (next_expected.size() + 1));
            int m = int(rng() % (next_expected.size() + 1));
            int r = int(rng() % (next_expected.size() + 1));
            if (l > m) std::swap(l, m);
            if (m > r) std::swap(m, r);
            if (l > m) std::swap(l, m);
            next = cur.rotate(l, m, r);
            std::rotate(next_expected.begin() + l, next_expected.begin() + m, next_expected.begin() + r);
        } else if (op == 5) {
            int pos = int(rng() % next_expected.size());
            long long value = int(rng() % 101) - 50;
            next = cur.set(pos, AM::make(value));
            next_expected[pos] = value;
        } else {
            next = cur.reverse();
            std::reverse(next_expected.begin(), next_expected.end());
        }

        assert_all_ranges(cur, expected);
        assert_all_ranges(next, next_expected);
        if (next_expected.size() <= 80) versions.push_back({next, next_expected});
    }

    long long x, y;
    fast_input >> x >> y;
    fast_output << x + y << '\n';
}

#line 1 "verify/ds/dynamic_array/persistent_dynamic_lazy_monoid_array_range_ap.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"

#line 1 "ds/dynamic_array/persistent_dynamic_lazy_monoid_array.hpp"



#include <cassert>
#include <chrono>
#include <concepts>
#include <cstddef>
#include <cstdint>
#include <initializer_list>
#include <memory>
#include <utility>
#include <vector>

#line 1 "acted_monoid/concept.hpp"



#line 5 "acted_monoid/concept.hpp"

namespace m1une {
namespace acted_monoid {

// Concept defining the requirements for an Acted Monoid.
template <typename AM>
concept IsActedMonoid = requires(typename AM::value_type a, typename AM::value_type b, typename AM::operator_type f,
                                 typename AM::operator_type g) {
    // 1. Value Monoid
    typename AM::value_type;
    { AM::id() } -> std::same_as<typename AM::value_type>;
    { AM::op(a, b) } -> std::same_as<typename AM::value_type>;

    // 2. Operator Monoid
    typename AM::operator_type;
    { AM::op_id() } -> std::same_as<typename AM::operator_type>;
    { AM::op_comp(f, g) } -> std::same_as<typename AM::operator_type>;  // Composition order: f(g(x))

    // 3. Mapping: Operator x Value -> Value
    { AM::mapping(f, a) } -> std::same_as<typename AM::value_type>;
};

// Concept for acted monoids whose value monoid is a commutative group.
// The value operation must obey commutativity and inverse laws.
template <typename AM>
concept IsCommutativeActedGroup = IsActedMonoid<AM> && requires(typename AM::value_type a) {
    { AM::inv(a) } -> std::same_as<typename AM::value_type>;
};

}  // namespace acted_monoid
}  // namespace m1une


#line 1 "ds/detail/persistent_binary_node_pool.hpp"



#line 6 "ds/detail/persistent_binary_node_pool.hpp"
#include <deque>
#include <limits>
#include <optional>
#line 11 "ds/detail/persistent_binary_node_pool.hpp"

namespace m1une {
namespace ds {
namespace detail {

// Node must have integer `l` and `r` members. New nodes initially have no
// owner; discard_unreferenced() removes temporary path-copy nodes after the
// result roots have been retained.
template <class Node, int null_node = -1>
struct PersistentBinaryNodePool {
   private:
    std::deque<std::optional<Node>> _nodes;
    std::vector<int> _references;
    std::vector<int> _next_free;
    std::vector<int> _unowned;
    int _first_free = -1;
    std::size_t _live_nodes = 0;

    void release_zero(int node) {
        assert(node != null_node && _nodes[node].has_value());
        int left = (*_nodes[node]).l;
        int right = (*_nodes[node]).r;
        _nodes[node].reset();
        _next_free[node] = _first_free;
        _first_free = node;
        --_live_nodes;
        if (left != null_node && --_references[left] == 0) release_zero(left);
        if (right != null_node && --_references[right] == 0) release_zero(right);
    }

   public:
    PersistentBinaryNodePool() {
        if constexpr (null_node == 0) {
            _nodes.emplace_back();
            _references.push_back(0);
            _next_free.push_back(-1);
        }
    }

    Node& operator[](int node) {
        assert(node != null_node && _nodes[node].has_value());
        return *_nodes[node];
    }

    const Node& operator[](int node) const {
        assert(node != null_node && _nodes[node].has_value());
        return *_nodes[node];
    }

    template <class... Args>
    int emplace(Args&&... args) {
        int result;
        if (_first_free == -1) {
            assert(_nodes.size() < std::size_t(std::numeric_limits<int>::max()));
            result = int(_nodes.size());
            _nodes.emplace_back(std::in_place, std::forward<Args>(args)...);
            _references.push_back(0);
            _next_free.push_back(-1);
        } else {
            result = _first_free;
            _first_free = _next_free[result];
            _nodes[result].emplace(std::forward<Args>(args)...);
            _references[result] = 0;
        }
        retain((*_nodes[result]).l);
        retain((*_nodes[result]).r);
        _unowned.push_back(result);
        ++_live_nodes;
        return result;
    }

    void retain(int node) {
        if (node != null_node) {
            assert(_nodes[node].has_value());
            ++_references[node];
        }
    }

    void release(int node) {
        if (node == null_node) return;
        assert(_nodes[node].has_value() && _references[node] > 0);
        if (--_references[node] == 0) release_zero(node);
    }

    bool unique(int node) const {
        return node == null_node || _references[node] == 1;
    }

    int clone(int node) {
        assert(node != null_node && _nodes[node].has_value());
        return emplace(*_nodes[node]);
    }

    // Returns node itself when it has one owner, otherwise an unowned clone.
    // A returned clone becomes owned when a root or parent edge retains it.
    int clone_if_shared(int node) {
        if (unique(node)) return node;
        return clone(node);
    }

    void replace(int& edge, int node) {
        if (edge == node) return;
        retain(node);
        int old = edge;
        edge = node;
        release(old);
    }

    void discard_unreferenced() {
        while (!_unowned.empty()) {
            int node = _unowned.back();
            _unowned.pop_back();
            if (_nodes[node].has_value() && _references[node] == 0) release_zero(node);
        }
    }

    void reserve(std::size_t) {}

    int next_index() const { return _first_free == -1 ? int(_nodes.size()) : _first_free; }

    std::size_t size() const { return _live_nodes; }
};

}  // namespace detail
}  // namespace ds
}  // namespace m1une


#line 16 "ds/dynamic_array/persistent_dynamic_lazy_monoid_array.hpp"

namespace m1une {
namespace ds {

template <m1une::acted_monoid::IsActedMonoid ActedMonoid>
struct PersistentDynamicLazyMonoidArray {
    using T = typename ActedMonoid::value_type;
    using F = typename ActedMonoid::operator_type;

   private:
    struct Node {
        T val, prod, rprod;
        F lazy;
        int priority;
        int count;
        int l, r;
        bool rev;
        bool has_lazy;

        Node(T value, T product, T reverse_product, F lazy_value, int node_priority, int node_count, int left,
             int right, bool reversed, bool lazy_flag)
            : val(std::move(value)),
              prod(std::move(product)),
              rprod(std::move(reverse_product)),
              lazy(std::move(lazy_value)),
              priority(node_priority),
              count(node_count),
              l(left),
              r(right),
              rev(reversed),
              has_lazy(lazy_flag) {}
    };

    struct BuildNode {
        T val;
        int priority;
        int l, r;

        BuildNode(T value, int node_priority) : val(std::move(value)), priority(node_priority), l(-1), r(-1) {}
    };

    int root;
    std::uint32_t rng_state;
    using Pool = detail::PersistentBinaryNodePool<Node>;

    std::shared_ptr<Pool> pool;

    int subtree_size(int t) const {
        return t == -1 ? 0 : (*pool)[t].count;
    }

    T node_prod(int t) const {
        return t == -1 ? ActedMonoid::id() : (*pool)[t].prod;
    }

    T node_rprod(int t) const {
        return t == -1 ? ActedMonoid::id() : (*pool)[t].rprod;
    }

    static std::uint32_t next_state(std::uint32_t state) {
        state ^= state << 13;
        state ^= state >> 17;
        state ^= state << 5;
        return state == 0 ? 1 : state;
    }

    static int next_priority(std::uint32_t& state) {
        state = next_state(state);
        return int(state);
    }

    template <typename U>
    static T make_value(const U& value) {
        if constexpr (requires(U x) { ActedMonoid::make(x); }) {
            return ActedMonoid::make(value);
        } else {
            return static_cast<T>(value);
        }
    }

    static T mapping_at(const F& f, const T& value, long long ord) {
        if constexpr (requires(F g, T x, long long i) { ActedMonoid::mapping(g, x, i); }) {
            return ActedMonoid::mapping(f, value, ord);
        } else {
            return ActedMonoid::mapping(f, value);
        }
    }

    static F shift_operator(const F& f, long long ord) {
        if constexpr (requires(F g, long long i) { ActedMonoid::op_shift(g, i); }) {
            return ActedMonoid::op_shift(f, ord);
        } else {
            return f;
        }
    }

    static F reverse_operator(const F& f, long long size) {
        if constexpr (requires(F g, long long n) { ActedMonoid::op_reverse(g, n); }) {
            return ActedMonoid::op_reverse(f, size);
        } else {
            return f;
        }
    }

    F compose_for_child(const F& inherited, int t, long long ord) const {
        F shifted = shift_operator(inherited, ord);
        const Node& node = (*pool)[t];
        if (!node.has_lazy) return shifted;
        return ActedMonoid::op_comp(shifted, shift_operator(node.lazy, ord));
    }

    int make_raw_node(T val, T prod, T rprod, F lazy, int priority, int count, bool rev, bool has_lazy, int l,
                      int r) const {
        return pool->emplace(std::move(val), std::move(prod), std::move(rprod), std::move(lazy), priority, count,
                             l, r, rev, has_lazy);
    }

    int make_node(T val, int priority, bool rev, int l, int r) const {
        T prod = ActedMonoid::op(ActedMonoid::op(node_prod(l), val), node_prod(r));
        T rprod = ActedMonoid::op(ActedMonoid::op(node_rprod(r), val), node_rprod(l));
        if (rev) std::swap(prod, rprod);
        int count = 1 + subtree_size(l) + subtree_size(r);
        return make_raw_node(std::move(val), std::move(prod), std::move(rprod), ActedMonoid::op_id(), priority,
                             count, rev, false, l, r);
    }

    int reversed_node(int t) const {
        if (t == -1) return -1;
        Node node = (*pool)[t];
        F lazy = node.has_lazy ? reverse_operator(node.lazy, node.count) : node.lazy;
        return make_raw_node(std::move(node.val), std::move(node.rprod), std::move(node.prod), std::move(lazy),
                             node.priority, node.count, !node.rev, node.has_lazy, node.l, node.r);
    }

    void all_apply_to_node(int t, const F& f) const {
        Node& node = (*pool)[t];
        int left_count = node.rev ? subtree_size(node.r) : subtree_size(node.l);
        node.val = mapping_at(f, node.val, left_count);
        node.prod = mapping_at(f, node.prod, 0);
        node.rprod = mapping_at(reverse_operator(f, node.count), node.rprod, 0);
        node.lazy = ActedMonoid::op_comp(f, node.lazy);
        node.has_lazy = true;
    }

    int all_apply(int t, const F& f) const {
        if (t == -1) return -1;
        int result = pool->clone(t);
        all_apply_to_node(result, f);
        return result;
    }

    int push(int t) const {
        if (t == -1) return -1;
        const Node& stored = (*pool)[t];
        if (!stored.rev && !stored.has_lazy) return t;
        Node node = stored;
        int l = node.l;
        int r = node.r;
        if (node.rev) {
            std::swap(l, r);
            l = reversed_node(l);
            r = reversed_node(r);
        }
        if (node.has_lazy) {
            l = all_apply(l, node.lazy);
            r = all_apply(r, shift_operator(node.lazy, subtree_size(l) + 1));
        }
        return make_node(std::move(node.val), node.priority, false, l, r);
    }

    int merge(int l, int r) const {
        if (l == -1 || r == -1) return l == -1 ? r : l;
        if ((*pool)[l].priority > (*pool)[r].priority) {
            Node node = (*pool)[push(l)];
            int right = merge(node.r, r);
            return make_node(std::move(node.val), node.priority, false, node.l, right);
        }
        Node node = (*pool)[push(r)];
        int left = merge(l, node.l);
        return make_node(std::move(node.val), node.priority, false, left, node.r);
    }

    std::pair<int, int> split_node(int t, int pos) const {
        if (t == -1) return {-1, -1};
        Node node = (*pool)[push(t)];
        int left_count = subtree_size(node.l);
        if (pos <= left_count) {
            auto [a, b] = split_node(node.l, pos);
            return {a, make_node(std::move(node.val), node.priority, false, b, node.r)};
        }
        auto [a, b] = split_node(node.r, pos - left_count - 1);
        return {make_node(std::move(node.val), node.priority, false, node.l, a), b};
    }

    int set_node(int t, int pos, T val) const {
        Node node = (*pool)[push(t)];
        int left_count = subtree_size(node.l);
        if (pos < left_count) {
            int l = set_node(node.l, pos, std::move(val));
            return make_node(std::move(node.val), node.priority, false, l, node.r);
        }
        if (pos == left_count) {
            return make_node(std::move(val), node.priority, false, node.l, node.r);
        }
        int r = set_node(node.r, pos - left_count - 1, std::move(val));
        return make_node(std::move(node.val), node.priority, false, node.l, r);
    }

    void reverse_node_inplace(int t) const {
        Node& node = (*pool)[t];
        std::swap(node.prod, node.rprod);
        if (node.has_lazy) node.lazy = reverse_operator(node.lazy, node.count);
        node.rev = !node.rev;
    }

    int reverse_node_cow(int t) const {
        if (t == -1) return -1;
        t = pool->clone_if_shared(t);
        reverse_node_inplace(t);
        return t;
    }

    int all_apply_cow(int t, const F& f) const {
        if (t == -1) return -1;
        t = pool->clone_if_shared(t);
        all_apply_to_node(t, f);
        return t;
    }

    void pull(int t) const {
        Node& node = (*pool)[t];
        node.prod = ActedMonoid::op(ActedMonoid::op(node_prod(node.l), node.val), node_prod(node.r));
        node.rprod = ActedMonoid::op(ActedMonoid::op(node_rprod(node.r), node.val), node_rprod(node.l));
    }

    void push_inplace(int t) const {
        if (!(*pool)[t].rev && !(*pool)[t].has_lazy) return;
        const bool reversed = (*pool)[t].rev;
        const bool has_lazy = (*pool)[t].has_lazy;
        F lazy = (*pool)[t].lazy;
        int left = (*pool)[t].l;
        int right = (*pool)[t].r;
        if (reversed) {
            int new_left = reverse_node_cow(right);
            int new_right = reverse_node_cow(left);
            // Keep both children alive while the two owning edges are swapped.
            pool->retain(new_left);
            pool->retain(new_right);
            pool->replace((*pool)[t].l, new_left);
            pool->replace((*pool)[t].r, new_right);
            pool->release(new_left);
            pool->release(new_right);
        }
        if (has_lazy) {
            left = all_apply_cow((*pool)[t].l, lazy);
            pool->replace((*pool)[t].l, left);
            right = all_apply_cow((*pool)[t].r, shift_operator(lazy, subtree_size(left) + 1));
            pool->replace((*pool)[t].r, right);
        }
        Node& node = (*pool)[t];
        node.lazy = ActedMonoid::op_id();
        node.rev = false;
        node.has_lazy = false;
        pull(t);
    }

    int set_node_inplace(int t, int pos, T val) const {
        t = pool->clone_if_shared(t);
        push_inplace(t);
        int left_count = subtree_size((*pool)[t].l);
        if (pos < left_count) {
            int child = set_node_inplace((*pool)[t].l, pos, std::move(val));
            pool->replace((*pool)[t].l, child);
        } else if (pos == left_count) {
            (*pool)[t].val = std::move(val);
        } else {
            int child = set_node_inplace((*pool)[t].r, pos - left_count - 1, std::move(val));
            pool->replace((*pool)[t].r, child);
        }
        pull(t);
        return t;
    }

    int apply_node_inplace(int t, int offset, int query_left, int query_right, const F& f) const {
        if (t == -1 || query_right <= offset || offset + subtree_size(t) <= query_left) return t;
        t = pool->clone_if_shared(t);
        if (query_left <= offset && offset + subtree_size(t) <= query_right) {
            all_apply_to_node(t, shift_operator(f, offset - query_left));
            return t;
        }
        push_inplace(t);
        int left_count = subtree_size((*pool)[t].l);
        int child = apply_node_inplace((*pool)[t].l, offset, query_left, query_right, f);
        pool->replace((*pool)[t].l, child);
        int position = offset + left_count;
        if (query_left <= position && position < query_right) {
            (*pool)[t].val = mapping_at(shift_operator(f, position - query_left), (*pool)[t].val, 0);
        }
        child = apply_node_inplace((*pool)[t].r, position + 1, query_left, query_right, f);
        pool->replace((*pool)[t].r, child);
        pull(t);
        return t;
    }

    T get_value(int t, int pos, F inherited, bool reversed = false) const {
        while (t != -1) {
            const Node& node = (*pool)[t];
            bool cur_reversed = reversed ^ node.rev;
            int l = cur_reversed ? node.r : node.l;
            int r = cur_reversed ? node.l : node.r;
            int left_count = subtree_size(l);
            if (pos < left_count) {
                inherited = compose_for_child(inherited, t, 0);
                t = l;
                reversed = cur_reversed;
            } else if (pos == left_count) {
                return mapping_at(inherited, node.val, left_count);
            } else {
                pos -= left_count + 1;
                inherited = compose_for_child(inherited, t, left_count + 1);
                t = r;
                reversed = cur_reversed;
            }
        }
        return ActedMonoid::id();
    }

    T prod_dfs(int t, int ql, int qr, int offset, const F& inherited, bool reversed = false) const {
        if (t == -1 || qr <= offset || offset + (*pool)[t].count <= ql) return ActedMonoid::id();
        const Node& node = (*pool)[t];
        bool cur_reversed = reversed ^ node.rev;
        if (ql <= offset && offset + node.count <= qr) {
            return mapping_at(inherited, reversed ? node.rprod : node.prod, 0);
        }
        int l = cur_reversed ? node.r : node.l;
        int r = cur_reversed ? node.l : node.r;
        int left_count = subtree_size(l);
        int node_pos = offset + left_count;
        T res = prod_dfs(l, ql, qr, offset, compose_for_child(inherited, t, 0), cur_reversed);
        if (ql <= node_pos && node_pos < qr) res = ActedMonoid::op(res, mapping_at(inherited, node.val, left_count));
        return ActedMonoid::op(
            res, prod_dfs(r, ql, qr, node_pos + 1, compose_for_child(inherited, t, left_count + 1),
                          cur_reversed));
    }

    void dump_dfs(int t, std::vector<T>& res, const F& inherited, bool reversed = false) const {
        if (t == -1) return;
        const Node& node = (*pool)[t];
        bool cur_reversed = reversed ^ node.rev;
        int l = cur_reversed ? node.r : node.l;
        int r = cur_reversed ? node.l : node.r;
        int left_count = subtree_size(l);
        dump_dfs(l, res, compose_for_child(inherited, t, 0), cur_reversed);
        res.push_back(mapping_at(inherited, node.val, left_count));
        dump_dfs(r, res, compose_for_child(inherited, t, left_count + 1), cur_reversed);
    }

    void dump_range_dfs(int t, int ql, int qr, int offset, std::vector<T>& res, const F& inherited,
                        bool reversed = false) const {
        if (t == -1 || qr <= offset || offset + (*pool)[t].count <= ql) return;
        const Node& node = (*pool)[t];
        bool cur_reversed = reversed ^ node.rev;
        int l = cur_reversed ? node.r : node.l;
        int r = cur_reversed ? node.l : node.r;
        int left_count = subtree_size(l);
        int node_pos = offset + left_count;
        dump_range_dfs(l, ql, qr, offset, res, compose_for_child(inherited, t, 0), cur_reversed);
        if (ql <= node_pos && node_pos < qr) res.push_back(mapping_at(inherited, node.val, left_count));
        dump_range_dfs(r, ql, qr, node_pos + 1, res, compose_for_child(inherited, t, left_count + 1),
                       cur_reversed);
    }

    int build_from_nodes(std::vector<BuildNode>& nodes, int t) const {
        if (t == -1) return -1;
        int l = build_from_nodes(nodes, nodes[t].l);
        int r = build_from_nodes(nodes, nodes[t].r);
        return make_node(std::move(nodes[t].val), nodes[t].priority, false, l, r);
    }

    int build_cartesian(std::vector<BuildNode>& nodes) const {
        if (nodes.empty()) return -1;
        std::vector<int> stack;
        stack.reserve(nodes.size());
        for (int i = 0; i < int(nodes.size()); i++) {
            int left_child = -1;
            while (!stack.empty() && nodes[stack.back()].priority < nodes[i].priority) {
                left_child = stack.back();
                stack.pop_back();
            }
            nodes[i].l = left_child;
            if (!stack.empty()) nodes[stack.back()].r = i;
            stack.push_back(i);
        }
        return build_from_nodes(nodes, stack.front());
    }

    int build_from_vector(const std::vector<T>& v, std::uint32_t& state) const {
        std::vector<BuildNode> nodes;
        nodes.reserve(v.size());
        for (const T& x : v) nodes.emplace_back(x, next_priority(state));
        return build_cartesian(nodes);
    }

    int build_from_vector(std::vector<T>&& v, std::uint32_t& state) const {
        std::vector<BuildNode> nodes;
        nodes.reserve(v.size());
        for (T& x : v) nodes.emplace_back(std::move(x), next_priority(state));
        return build_cartesian(nodes);
    }

    template <typename U>
    int build_from_values(const std::vector<U>& v, std::uint32_t& state) const {
        std::vector<BuildNode> nodes;
        nodes.reserve(v.size());
        for (const U& x : v) nodes.emplace_back(make_value(x), next_priority(state));
        return build_cartesian(nodes);
    }

    int import_node(const PersistentDynamicLazyMonoidArray& other, int t) const {
        if (t == -1) return -1;
        if (pool == other.pool) return t;
        const Node& node = (*other.pool)[t];
        int l = import_node(other, node.l);
        int r = import_node(other, node.r);
        return make_raw_node(node.val, node.prod, node.rprod, node.lazy, node.priority, node.count, node.rev,
                             node.has_lazy, l, r);
    }

    explicit PersistentDynamicLazyMonoidArray(int node, std::uint32_t state,
                                              std::shared_ptr<Pool> node_pool)
        : root(node), rng_state(state), pool(std::move(node_pool)) {
        pool->retain(root);
    }

    PersistentDynamicLazyMonoidArray make_version(int node, std::uint32_t state) const {
        PersistentDynamicLazyMonoidArray result(node, state, pool);
        pool->discard_unreferenced();
        return result;
    }

   public:
    PersistentDynamicLazyMonoidArray()
        : root(-1),
          rng_state(std::uint32_t(std::chrono::steady_clock::now().time_since_epoch().count())),
          pool(std::make_shared<Pool>()) {
        if (rng_state == 0) rng_state = 1;
    }

    explicit PersistentDynamicLazyMonoidArray(int n)
        : PersistentDynamicLazyMonoidArray(n, ActedMonoid::id()) {}

    PersistentDynamicLazyMonoidArray(int n, const T& value) : PersistentDynamicLazyMonoidArray() {
        assert(0 <= n);
        pool->reserve(n);
        std::vector<T> v(n, value);
        root = build_from_vector(std::move(v), rng_state);
        pool->retain(root);
        pool->discard_unreferenced();
    }

    explicit PersistentDynamicLazyMonoidArray(const std::vector<T>& v)
        : PersistentDynamicLazyMonoidArray() {
        pool->reserve(v.size());
        root = build_from_vector(v, rng_state);
        pool->retain(root);
        pool->discard_unreferenced();
    }

    explicit PersistentDynamicLazyMonoidArray(std::vector<T>&& v) : PersistentDynamicLazyMonoidArray() {
        pool->reserve(v.size());
        root = build_from_vector(std::move(v), rng_state);
        pool->retain(root);
        pool->discard_unreferenced();
    }

    template <typename U>
        requires(!std::same_as<U, T>) &&
                (requires(U x) { ActedMonoid::make(x); } || std::convertible_to<U, T>)
    explicit PersistentDynamicLazyMonoidArray(const std::vector<U>& v)
        : PersistentDynamicLazyMonoidArray() {
        pool->reserve(v.size());
        root = build_from_values(v, rng_state);
        pool->retain(root);
        pool->discard_unreferenced();
    }

    PersistentDynamicLazyMonoidArray(std::initializer_list<T> init)
        : PersistentDynamicLazyMonoidArray(std::vector<T>(init)) {}

    PersistentDynamicLazyMonoidArray(const PersistentDynamicLazyMonoidArray& other)
        : root(other.root), rng_state(other.rng_state), pool(other.pool) {
        if (pool) pool->retain(root);
    }

    PersistentDynamicLazyMonoidArray(PersistentDynamicLazyMonoidArray&& other) noexcept
        : root(other.root), rng_state(other.rng_state), pool(std::move(other.pool)) {
        other.root = -1;
    }

    PersistentDynamicLazyMonoidArray& operator=(const PersistentDynamicLazyMonoidArray& other) {
        if (this == &other) return *this;
        if (other.pool) other.pool->retain(other.root);
        if (pool) pool->release(root);
        root = other.root;
        rng_state = other.rng_state;
        pool = other.pool;
        return *this;
    }

    PersistentDynamicLazyMonoidArray& operator=(PersistentDynamicLazyMonoidArray&& other) noexcept {
        if (this == &other) return *this;
        if (pool) pool->release(root);
        root = other.root;
        rng_state = other.rng_state;
        pool = std::move(other.pool);
        other.root = -1;
        return *this;
    }

    ~PersistentDynamicLazyMonoidArray() {
        if (pool) pool->release(root);
    }

    int size() const {
        return subtree_size(root);
    }

    bool empty() const {
        return size() == 0;
    }

    void release() {
        if (pool) pool->release(root);
        root = -1;
        pool = std::make_shared<Pool>();
    }

    std::size_t node_count() const { return pool ? pool->size() : 0; }

    PersistentDynamicLazyMonoidArray clear() const {
        return make_version(-1, rng_state);
    }

    PersistentDynamicLazyMonoidArray insert(int pos, T value) const {
        assert(0 <= pos && pos <= size());
        std::uint32_t next = next_state(rng_state);
        int node = make_node(std::move(value), int(next), false, -1, -1);
        auto [l, r] = split_node(root, pos);
        return make_version(merge(merge(l, node), r), next);
    }

    PersistentDynamicLazyMonoidArray insert(int pos, const std::vector<T>& v) const {
        assert(0 <= pos && pos <= size());
        if (v.empty()) return *this;
        std::uint32_t next = rng_state;
        int mid = build_from_vector(v, next);
        auto [l, r] = split_node(root, pos);
        return make_version(merge(merge(l, mid), r), next);
    }

    PersistentDynamicLazyMonoidArray insert(int pos, std::vector<T>&& v) const {
        assert(0 <= pos && pos <= size());
        if (v.empty()) return *this;
        std::uint32_t next = rng_state;
        int mid = build_from_vector(std::move(v), next);
        auto [l, r] = split_node(root, pos);
        return make_version(merge(merge(l, mid), r), next);
    }

    PersistentDynamicLazyMonoidArray insert(int pos, std::initializer_list<T> init) const {
        return insert(pos, std::vector<T>(init));
    }

    PersistentDynamicLazyMonoidArray insert(int pos, const PersistentDynamicLazyMonoidArray& other) const {
        assert(0 <= pos && pos <= size());
        if (other.empty()) return *this;
        int mid = import_node(other, other.root);
        auto [l, r] = split_node(root, pos);
        return make_version(merge(merge(l, mid), r), rng_state);
    }

    PersistentDynamicLazyMonoidArray push_back(T value) const {
        return insert(size(), std::move(value));
    }

    PersistentDynamicLazyMonoidArray push_front(T value) const {
        return insert(0, std::move(value));
    }

    PersistentDynamicLazyMonoidArray append(const std::vector<T>& v) const {
        return insert(size(), v);
    }

    PersistentDynamicLazyMonoidArray append(std::vector<T>&& v) const {
        return insert(size(), std::move(v));
    }

    PersistentDynamicLazyMonoidArray append(const PersistentDynamicLazyMonoidArray& other) const {
        return insert(size(), other);
    }

    PersistentDynamicLazyMonoidArray erase(int pos) const {
        assert(0 <= pos && pos < size());
        auto [a, b] = split_node(root, pos);
        auto [mid, c] = split_node(b, 1);
        (void)mid;
        return make_version(merge(a, c), rng_state);
    }

    PersistentDynamicLazyMonoidArray erase(int l, int r) const {
        assert(0 <= l && l <= r && r <= size());
        if (l == r) return *this;
        auto [a, b] = split_node(root, l);
        auto [mid, c] = split_node(b, r - l);
        (void)mid;
        return make_version(merge(a, c), rng_state);
    }

    PersistentDynamicLazyMonoidArray pop_back() const {
        assert(!empty());
        return erase(size() - 1);
    }

    PersistentDynamicLazyMonoidArray pop_front() const {
        assert(!empty());
        return erase(0);
    }

    T get(int pos) const {
        assert(0 <= pos && pos < size());
        return get_value(root, pos, ActedMonoid::op_id());
    }

    T operator[](int pos) const {
        return get(pos);
    }

    T front() const {
        assert(!empty());
        return get(0);
    }

    T back() const {
        assert(!empty());
        return get(size() - 1);
    }

    PersistentDynamicLazyMonoidArray set(int pos, T value) const {
        assert(0 <= pos && pos < size());
        return make_version(set_node(root, pos, std::move(value)), rng_state);
    }

    void set_inplace(int pos, T value) {
        assert(0 <= pos && pos < size());
        int next_root = set_node_inplace(root, pos, std::move(value));
        pool->replace(root, next_root);
        pool->discard_unreferenced();
    }

    PersistentDynamicLazyMonoidArray reverse(int l, int r) const {
        assert(0 <= l && l <= r && r <= size());
        if (l == r) return *this;
        auto [a, b] = split_node(root, l);
        auto [mid, c] = split_node(b, r - l);
        return make_version(merge(merge(a, reversed_node(mid)), c), rng_state);
    }

    PersistentDynamicLazyMonoidArray reverse() const {
        return make_version(reversed_node(root), rng_state);
    }

    PersistentDynamicLazyMonoidArray rotate(int l, int m, int r) const {
        assert(0 <= l && l <= m && m <= r && r <= size());
        if (l == m || m == r) return *this;
        auto [a, b] = split_node(root, l);
        auto [c, d] = split_node(b, m - l);
        auto [e, f] = split_node(d, r - m);
        return make_version(merge(merge(a, e), merge(c, f)), rng_state);
    }

    PersistentDynamicLazyMonoidArray apply(int pos, const F& f) const {
        assert(0 <= pos && pos < size());
        return apply(pos, pos + 1, f);
    }

    PersistentDynamicLazyMonoidArray apply(int l, int r, const F& f) const {
        assert(0 <= l && l <= r && r <= size());
        if (l == r) return *this;
        auto [a, b] = split_node(root, l);
        auto [mid, c] = split_node(b, r - l);
        return make_version(merge(merge(a, all_apply(mid, f)), c), rng_state);
    }

    void apply_inplace(int pos, const F& f) {
        assert(0 <= pos && pos < size());
        apply_inplace(pos, pos + 1, f);
    }

    void apply_inplace(int l, int r, const F& f) {
        assert(0 <= l && l <= r && r <= size());
        if (l == r) return;
        int next_root = apply_node_inplace(root, 0, l, r, f);
        pool->replace(root, next_root);
        pool->discard_unreferenced();
    }

    T prod(int l, int r) const {
        assert(0 <= l && l <= r && r <= size());
        if (l == r) return ActedMonoid::id();
        return prod_dfs(root, l, r, 0, ActedMonoid::op_id());
    }

    T all_prod() const {
        return root == -1 ? ActedMonoid::id() : (*pool)[root].prod;
    }

    std::pair<PersistentDynamicLazyMonoidArray, PersistentDynamicLazyMonoidArray> split(int pos) const {
        assert(0 <= pos && pos <= size());
        auto [l, r] = split_node(root, pos);
        PersistentDynamicLazyMonoidArray left(l, rng_state, pool);
        PersistentDynamicLazyMonoidArray right(r, rng_state, pool);
        pool->discard_unreferenced();
        return {std::move(left), std::move(right)};
    }

    PersistentDynamicLazyMonoidArray split_off(int pos) const {
        assert(0 <= pos && pos <= size());
        return make_version(split_node(root, pos).second, rng_state);
    }

    std::vector<T> to_vector() const {
        std::vector<T> res;
        res.reserve(size());
        dump_dfs(root, res, ActedMonoid::op_id());
        return res;
    }

    std::vector<T> to_vector(int l, int r) const {
        assert(0 <= l && l <= r && r <= size());
        std::vector<T> res;
        res.reserve(r - l);
        dump_range_dfs(root, l, r, 0, res, ActedMonoid::op_id());
        return res;
    }
};

}  // namespace ds
}  // namespace m1une


#line 4 "verify/ds/dynamic_array/persistent_dynamic_lazy_monoid_array_range_ap.test.cpp"

#include <algorithm>
#line 1 "utilities/fast_io.hpp"



#line 5 "utilities/fast_io.hpp"
#include <array>
#include <cerrno>
#include <charconv>
#line 9 "utilities/fast_io.hpp"
#include <cstdio>
#include <cstdlib>
#line 12 "utilities/fast_io.hpp"
#include <cstring>
#include <iterator>
#include <string>
#include <sys/stat.h>
#include <type_traits>
#line 18 "utilities/fast_io.hpp"
#include <unistd.h>
#line 20 "utilities/fast_io.hpp"

namespace m1une {
namespace utilities {

struct FastOutput;

namespace internal {

// Shared with the convenience helpers in template.hpp.
inline FastOutput* standard_output_instance = nullptr;

// Detect std::begin(x), std::end(x).
template <class T, class = void>
struct is_range : std::false_type {};

template <class T>
struct is_range<T, std::void_t<
    decltype(std::begin(std::declval<T&>())),
    decltype(std::end(std::declval<T&>()))
>> : std::true_type {};

template <class T>
inline constexpr bool is_range_v = is_range<T>::value;

template <class T>
using range_reference_t = decltype(*std::begin(std::declval<T&>()));

template <class T>
using range_value_t = std::remove_cv_t<std::remove_reference_t<range_reference_t<T>>>;

template <class T, class = void>
struct range_stored_value {
    using type = range_value_t<T>;
};

template <class T>
struct range_stored_value<T, std::void_t<typename std::remove_cv_t<std::remove_reference_t<T>>::value_type>> {
    using type = typename std::remove_cv_t<std::remove_reference_t<T>>::value_type;
};

template <class T>
using range_stored_value_t = typename range_stored_value<T>::type;

// Treat strings and C strings as scalar output objects, not as ranges.
template <class T>
struct is_char_array : std::false_type {};

template <class T, std::size_t N>
struct is_char_array<T[N]>
    : std::bool_constant<std::is_same_v<std::remove_cv_t<T>, char>> {};

template <class T>
struct is_string_like
    : std::bool_constant<
          std::is_same_v<std::decay_t<T>, std::string>
          || std::is_same_v<std::decay_t<T>, const char*>
          || std::is_same_v<std::decay_t<T>, char*>
          || is_char_array<std::remove_reference_t<T>>::value
      > {};

template <class T>
inline constexpr bool is_string_like_v = is_string_like<T>::value;

// ModInt-like type: x.val() is printable, and x can be assigned from long long.
template <class T, class = void>
struct has_val_method : std::false_type {};

template <class T>
struct has_val_method<T, std::void_t<decltype(std::declval<const T&>().val())>>
    : std::true_type {};

template <class T>
inline constexpr bool has_val_method_v = has_val_method<T>::value;

template <class T, class = void>
struct has_static_mod_raw : std::false_type {};

template <class T>
struct has_static_mod_raw<
    T, std::void_t<decltype(T::mod()), decltype(T::raw(std::declval<uint32_t>()))>>
    : std::true_type {};

template <class T>
inline constexpr bool has_static_mod_raw_v = has_static_mod_raw<T>::value;

// libstdc++ before GCC 16 does not classify __int128 as an integral type in
// strict ISO modes such as -std=c++23. Keep the fast-I/O interface independent
// of that implementation detail.
template <class T>
inline constexpr bool is_integral_v =
    std::is_integral_v<T>
    || std::is_same_v<std::remove_cv_t<T>, __int128_t>
    || std::is_same_v<std::remove_cv_t<T>, __uint128_t>;

template <class T>
inline constexpr bool is_signed_v =
    std::is_signed_v<T>
    || std::is_same_v<std::remove_cv_t<T>, __int128_t>;

template <class T>
struct make_unsigned {
    using type = std::make_unsigned_t<T>;
};

template <>
struct make_unsigned<__int128_t> {
    using type = __uint128_t;
};

template <>
struct make_unsigned<__uint128_t> {
    using type = __uint128_t;
};

template <class T>
using make_unsigned_t = typename make_unsigned<std::remove_cv_t<T>>::type;

}  // namespace internal

struct FastInput {
    static constexpr int buffer_size = 1 << 20;

   private:
    std::FILE* _stream;
    char _buffer[buffer_size];
    int _position;
    int _length;
    int _file_descriptor;
    bool _streaming;

    bool refill() {
        _position = 0;
        if (_streaming) {
            ssize_t length;
            do {
                length = ::read(_file_descriptor, _buffer, buffer_size);
            } while (length < 0 && errno == EINTR);
            if (length <= 0) {
                _length = 0;
                return false;
            }
            _length = int(length);
        } else {
            _length = int(std::fread(_buffer, 1, buffer_size, _stream));
        }
        return _length != 0;
    }

    template <class T>
    bool read_integer_from_stream(T& value) {
        if (!skip_spaces()) return false;
        int c = read_char_raw();

        bool negative = false;
        if (c == '-') {
            negative = true;
            c = read_char_raw();
        }

        if constexpr (internal::is_signed_v<T>) {
            T result = 0;
            while ('0' <= c && c <= '9') {
                result = negative ? result * 10 - (c - '0')
                                  : result * 10 + (c - '0');
                c = read_char_raw();
            }
            value = result;
        } else {
            T result = 0;
            while ('0' <= c && c <= '9') {
                result = result * 10 + T(c - '0');
                c = read_char_raw();
            }
            value = negative ? T(0) - result : result;
        }
        return true;
    }

    bool prepare_number() {
        if (_length - _position >= 64) return true;
        const int remaining = _length - _position;
        if (remaining > 0) std::memmove(_buffer, _buffer + _position, remaining);
        const int added = int(std::fread(_buffer + remaining, 1, buffer_size - remaining, _stream));
        _position = 0;
        _length = remaining + added;
        if (_length < buffer_size) _buffer[_length] = '\0';
        return _length != 0;
    }

   public:
    explicit FastInput(std::FILE* stream = stdin)
        : _stream(stream),
          _position(0),
          _length(0),
          _file_descriptor(::fileno(stream)),
          _streaming([&] {
              struct stat status;
              return _file_descriptor >= 0
                     && ::fstat(_file_descriptor, &status) == 0
                     && !S_ISREG(status.st_mode);
          }()) {}

    FastInput(const FastInput&) = delete;
    FastInput& operator=(const FastInput&) = delete;

    int read_char_raw() {
        if (_position == _length && !refill()) return EOF;
        return _buffer[_position++];
    }

    bool skip_spaces() {
        int c = read_char_raw();
        while (c != EOF && c <= ' ') c = read_char_raw();
        if (c == EOF) return false;
        --_position;
        return true;
    }

    bool read(char& value) {
        if (!skip_spaces()) return false;
        value = char(read_char_raw());
        return true;
    }

    bool read(std::string& value) {
        if (!skip_spaces()) return false;
        value.clear();
        while (true) {
            const int begin = _position;
            while (_position < _length &&
                   static_cast<unsigned char>(_buffer[_position]) > ' ') {
                ++_position;
            }
            value.append(_buffer + begin, _position - begin);
            if (_position < _length) {
                ++_position;
                return true;
            }
            if (!refill()) return true;
        }
    }

    bool read(bool& value) {
        int x;
        if (!read(x)) return false;
        value = x != 0;
        return true;
    }

    template <class T>
    std::enable_if_t<
        internal::is_integral_v<T>
            && !std::is_same_v<std::remove_cv_t<T>, bool>
            && !std::is_same_v<std::remove_cv_t<T>, char>,
        bool
    >
    read(T& value) {
        if (_streaming) return read_integer_from_stream(value);
        if (!prepare_number()) return false;
        int c = static_cast<unsigned char>(_buffer[_position++]);
        while (c <= ' ') c = static_cast<unsigned char>(_buffer[_position++]);

        bool negative = false;
        if (c == '-') {
            negative = true;
            c = static_cast<unsigned char>(_buffer[_position++]);
        }

        if constexpr (internal::is_signed_v<T>) {
            T result = 0;
            while ('0' <= c && c <= '9') {
                const int first = c - '0';
                const int second = static_cast<unsigned char>(_buffer[_position]) - '0';
                if (0 <= second && second <= 9) {
                    result = negative ? result * 100 - (first * 10 + second)
                                      : result * 100 + (first * 10 + second);
                    ++_position;
                } else {
                    result = negative ? result * 10 - first : result * 10 + first;
                }
                c = static_cast<unsigned char>(_buffer[_position++]);
            }
            value = result;
        } else {
            T result = 0;
            while ('0' <= c && c <= '9') {
                const unsigned first = unsigned(c - '0');
                const int second = static_cast<unsigned char>(_buffer[_position]) - '0';
                if (0 <= second && second <= 9) {
                    result = result * 100 + T(first * 10 + unsigned(second));
                    ++_position;
                } else {
                    result = result * 10 + T(first);
                }
                c = static_cast<unsigned char>(_buffer[_position++]);
            }
            value = negative ? T(0) - result : result;
        }
        if (_position > _length) _position = _length;
        return true;
    }

    template <class T>
    std::enable_if_t<std::is_floating_point_v<T>, bool>
    read(T& value) {
        if (!skip_spaces()) return false;
        int c = read_char_raw();
        bool negative = false;
        if (c == '-' || c == '+') {
            negative = c == '-';
            c = read_char_raw();
        }

        long double result = 0;
        while ('0' <= c && c <= '9') {
            result = result * 10 + (c - '0');
            c = read_char_raw();
        }
        if (c == '.') {
            long double place = 0.1L;
            c = read_char_raw();
            while ('0' <= c && c <= '9') {
                result += (c - '0') * place;
                place *= 0.1L;
                c = read_char_raw();
            }
        }
        if (c == 'e' || c == 'E') {
            c = read_char_raw();
            bool exponent_negative = false;
            if (c == '-' || c == '+') {
                exponent_negative = c == '-';
                c = read_char_raw();
            }
            int exponent = 0;
            while ('0' <= c && c <= '9') {
                exponent = exponent * 10 + (c - '0');
                c = read_char_raw();
            }
            long double scale = 1;
            long double power = 10;
            while (exponent > 0) {
                if (exponent & 1) scale *= power;
                power *= power;
                exponent >>= 1;
            }
            result = exponent_negative ? result / scale : result * scale;
        }
        value = static_cast<T>(negative ? -result : result);
        return true;
    }

    template <class T>
    std::enable_if_t<
        internal::has_val_method_v<T>
            && !internal::is_integral_v<T>
            && !internal::is_range_v<T>,
        bool
    >
    read(T& value) {
        long long x;
        if (!read(x)) return false;
        if constexpr (internal::has_static_mod_raw_v<T>) {
            if (x >= 0 && uint64_t(x) < uint64_t(T::mod())) {
                value = T::raw(uint32_t(x));
            } else {
                value = T(x);
            }
        } else {
            value = T(x);
        }
        return true;
    }

    template <class First, class Second>
    bool read(std::pair<First, Second>& value) {
        if (!read(value.first)) return false;
        return read(value.second);
    }

    template <class Range>
    std::enable_if_t<
        internal::is_range_v<Range>
            && !internal::is_string_like_v<Range>,
        bool
    >
    read(Range& range) {
        using StoredValue = internal::range_stored_value_t<Range>;
        constexpr bool nested = internal::is_range_v<StoredValue>
                                && !internal::is_string_like_v<StoredValue>;

        for (auto&& value : range) {
            if constexpr (std::is_same_v<StoredValue, bool> && !nested) {
                bool x;
                if (!read(x)) return false;
                value = x;
            } else {
                if (!read(value)) return false;
            }
        }
        return true;
    }

    template <class First, class Second, class... Rest>
    bool read(First& first, Second& second, Rest&... rest) {
        if (!read(first)) return false;
        return read(second, rest...);
    }

    template <class T>
    FastInput& operator>>(T& value) {
        if (!read(value)) std::abort();
        return *this;
    }
};

struct FastOutput {
    static constexpr int buffer_size = 1 << 20;

   private:
    inline static const auto digit_quads = [] {
        std::array<char, 40000> result{};
        for (int i = 0; i < 10000; i++) {
            int value = i;
            for (int j = 3; j >= 0; j--) {
                result[4 * i + j] = char('0' + value % 10);
                value /= 10;
            }
        }
        return result;
    }();

    std::FILE* _stream;
    char _buffer[buffer_size];
    int _position;
    int _precision;
    std::chars_format _float_format;
    char _range_separator;
    std::string* _capture = nullptr;

    template <class T>
    std::string format_cell(const T& value) {
        std::string result;
        struct CaptureGuard {
            std::string*& target;
            std::string* previous;
            ~CaptureGuard() { target = previous; }
        } guard{_capture, _capture};
        _capture = &result;
        write(value);
        return result;
    }

    template <class Matrix>
    void write_aligned_matrix(const Matrix& matrix) {
        std::vector<std::vector<std::string>> rows;
        std::vector<std::size_t> widths;
        for (const auto& row : matrix) {
            auto& cells = rows.emplace_back();
            std::size_t column = 0;
            for (const auto& value : row) {
                cells.push_back(format_cell(value));
                if (column == widths.size()) widths.push_back(0);
                widths[column] = std::max(widths[column], cells.back().size());
                ++column;
            }
        }
        bool first = true;
        for (const auto& row : rows) {
            if (!first) write_char('\n');
            first = false;
            for (std::size_t column = 0; column < row.size(); ++column) {
                if (column != 0) write_char(_range_separator);
                for (std::size_t padding = row[column].size();
                     padding < widths[column]; ++padding) {
                    write_char(' ');
                }
                write(row[column]);
            }
        }
    }

   public:
    explicit FastOutput(std::FILE* stream = stdout)
        : _stream(stream),
          _position(0),
          _precision(6),
          _float_format(std::chars_format::general),
          _range_separator(' ') {
        if (_stream == stdout
            && internal::standard_output_instance == nullptr) {
            internal::standard_output_instance = this;
        }
    }

    FastOutput(const FastOutput&) = delete;
    FastOutput& operator=(const FastOutput&) = delete;

    ~FastOutput() {
        flush();
        if (internal::standard_output_instance == this) {
            internal::standard_output_instance = nullptr;
        }
    }

    void flush() {
        if (_position != 0) {
            std::fwrite(_buffer, 1, _position, _stream);
            _position = 0;
        }
        std::fflush(_stream);
    }

    void write_char(char c) {
        if (_capture != nullptr) {
            _capture->push_back(c);
            return;
        }
        if (_position == buffer_size) flush();
        _buffer[_position++] = c;
    }

    void write(const char* s) {
        while (*s != '\0') write_char(*s++);
    }

    void write(const std::string& s) {
        if (_capture != nullptr) {
            _capture->append(s);
            return;
        }
        std::size_t position = 0;
        while (position < s.size()) {
            if (_position == buffer_size) flush();
            const std::size_t copied =
                std::min<std::size_t>(buffer_size - _position, s.size() - position);
            std::memcpy(_buffer + _position, s.data() + position, copied);
            _position += int(copied);
            position += copied;
        }
    }

    void write(char c) {
        write_char(c);
    }

    void write(bool value) {
        write_char(value ? '1' : '0');
    }

    template <class T>
    std::enable_if_t<std::is_floating_point_v<T>>
    write(T value) {
        char digits[128];
        auto [end, error] = std::to_chars(
            digits,
            digits + sizeof(digits),
            value,
            _float_format,
            _precision
        );
        if (error != std::errc()) std::abort();
        for (const char* pointer = digits; pointer != end; pointer++) {
            write_char(*pointer);
        }
    }

    template <class T>
    std::enable_if_t<
        internal::is_integral_v<T>
            && !std::is_same_v<std::remove_cv_t<T>, bool>
            && !std::is_same_v<std::remove_cv_t<T>, char>
    >
    write(T value) {
        using Raw = std::remove_cv_t<T>;
        using Unsigned = internal::make_unsigned_t<Raw>;

        Unsigned magnitude;
        if constexpr (internal::is_signed_v<Raw>) {
            if (value < 0) {
                write_char('-');
                magnitude = Unsigned(0) - Unsigned(value);
            } else {
                magnitude = Unsigned(value);
            }
        } else {
            magnitude = value;
        }

        if (magnitude == 0) {
            write_char('0');
            return;
        }

        unsigned chunks[16];
        int count = 0;
        while (magnitude >= 10000) {
            const Unsigned quotient = magnitude / 10000;
            chunks[count++] = unsigned(magnitude - quotient * 10000);
            magnitude = quotient;
        }
        if (_capture == nullptr && _position > buffer_size - 64) flush();
        char captured[64];
        char* const begin = _capture != nullptr ? captured : _buffer + _position;
        char* destination = begin;
        const unsigned leading = unsigned(magnitude);
        const char* first = digit_quads.data() + 4 * leading;
        int skip = leading < 10 ? 3 : leading < 100 ? 2 : leading < 1000 ? 1 : 0;
        for (; skip < 4; skip++) *destination++ = first[skip];
        while (count--) {
            const char* digits = digit_quads.data() + 4 * chunks[count];
            std::memcpy(destination, digits, 4);
            destination += 4;
        }
        if (_capture != nullptr) {
            _capture->append(begin, destination - begin);
        } else {
            _position += int(destination - begin);
        }
    }

    template <class T>
    std::enable_if_t<
        internal::has_val_method_v<T>
            && !internal::is_integral_v<T>
            && !internal::is_range_v<T>
    >
    write(const T& value) {
        write(value.val());
    }

    template <class First, class Second>
    void write(const std::pair<First, Second>& value) {
        write(value.first);
        write_char(' ');
        write(value.second);
    }

    template <class Range>
    std::enable_if_t<
        internal::is_range_v<Range>
            && !internal::is_string_like_v<Range>
    >
    write(const Range& range) {
        using StoredValue = internal::range_stored_value_t<const Range>;
        constexpr bool nested = internal::is_range_v<StoredValue>
                                && !internal::is_string_like_v<StoredValue>;

        bool first = true;
        for (const auto& value : range) {
            if (!first) write_char(nested ? '\n' : _range_separator);
            first = false;
            if constexpr (std::is_same_v<StoredValue, bool> && !nested) {
                write(static_cast<bool>(value));
            } else {
                write(value);
            }
        }
    }

    template <class First, class... Rest>
    void print(const First& first, const Rest&... rest) {
        write(first);
        ((write_char(' '), write(rest)), ...);
    }

    void println() {
        write_char('\n');
    }

    void set_precision(int precision) {
        _precision = precision;
    }

    void set_fixed(int precision = 6) {
        _float_format = std::chars_format::fixed;
        _precision = precision;
    }

    void set_general(int precision = 6) {
        _float_format = std::chars_format::general;
        _precision = precision;
    }

    void set_range_separator(char separator) {
        _range_separator = separator;
    }

    template <class Matrix>
    void write_aligned(const Matrix& matrix) {
        using Row = internal::range_stored_value_t<const Matrix>;
        using Cell = internal::range_stored_value_t<const Row>;
        static_assert(internal::is_range_v<Row> && !internal::is_string_like_v<Row>,
                      "write_aligned requires a two-dimensional range");
        static_assert(!internal::is_range_v<Cell> || internal::is_string_like_v<Cell>,
                      "write_aligned requires scalar cells");
        write_aligned_matrix(matrix);
    }

    template <class Matrix>
    void println_aligned(const Matrix& matrix) {
        write_aligned(matrix);
        write_char('\n');
    }

    template <class... Args>
    void println(const Args&... args) {
        print(args...);
        write_char('\n');
    }

    template <class T>
    FastOutput& operator<<(const T& value) {
        write(value);
        return *this;
    }
};

}  // namespace utilities
}  // namespace m1une


#line 8 "verify/ds/dynamic_array/persistent_dynamic_lazy_monoid_array_range_ap.test.cpp"
#include <numeric>
#include <random>
#line 12 "verify/ds/dynamic_array/persistent_dynamic_lazy_monoid_array_range_ap.test.cpp"

#line 1 "acted_monoid/range_ap_add_range_sum.hpp"



#line 5 "acted_monoid/range_ap_add_range_sum.hpp"

namespace m1une {
namespace acted_monoid {

template <typename T>
struct RangeApAddRangeSumNode {
    T sum;
    long long size;
    T ord_sum;
};

template <typename T>
struct RangeApAddRangeSum {
    using value_type = RangeApAddRangeSumNode<T>;
    using operator_type = std::pair<T, T>;  // {a, b} for adding a * i + b
    static constexpr bool commutative = false;
    static constexpr bool operator_commutative = true;

    // Value Monoid (Sum)
    static constexpr value_type id() {
        return {T(0), 0, T(0)};
    }
    static constexpr value_type op(const value_type& a, const value_type& b) {
        return {a.sum + b.sum, a.size + b.size, a.ord_sum + b.ord_sum + T(a.size) * T(b.size)};
    }

    // Operator Monoid (Add)
    static constexpr operator_type op_id() {
        return {T(0), T(0)};
    }
    static constexpr operator_type op_comp(const operator_type& f, const operator_type& g) {
        return {f.first + g.first, f.second + g.second};
    }

    static constexpr value_type mapping(const operator_type& f, const value_type& x) {
        return mapping(f, x, 0);
    }

    static constexpr value_type mapping(const operator_type& f, const value_type& x, long long ord) {
        return {x.sum + f.first * (x.ord_sum + T(ord) * T(x.size)) + f.second * T(x.size), x.size, x.ord_sum};
    }

    static constexpr operator_type op_shift(const operator_type& f, long long ord) {
        return {f.first, f.second + f.first * T(ord)};
    }

    static constexpr operator_type op_reverse(const operator_type& f, long long size) {
        return {-f.first, f.second + f.first * T(size - 1)};
    }

    static constexpr value_type make(const T& val) {
        return {val, 1, T(0)};
    }
};

}  // namespace acted_monoid
}  // namespace m1une


#line 14 "verify/ds/dynamic_array/persistent_dynamic_lazy_monoid_array_range_ap.test.cpp"

using AM = m1une::acted_monoid::RangeApAddRangeSum<long long>;
using Node = AM::value_type;
using Array = m1une::ds::PersistentDynamicLazyMonoidArray<AM>;

std::vector<long long> sums(const std::vector<Node>& a) {
    std::vector<long long> res;
    res.reserve(a.size());
    for (Node x : a) res.push_back(x.sum);
    return res;
}

long long sum_range(const std::vector<long long>& a, int l, int r) {
    return std::accumulate(a.begin() + l, a.begin() + r, 0LL);
}

void assert_all_ranges(const Array& a, const std::vector<long long>& expected) {
    assert(sums(a.to_vector()) == expected);
    assert(a.all_prod().sum == sum_range(expected, 0, int(expected.size())));
    for (int l = 0; l <= int(expected.size()); l++) {
        for (int r = l; r <= int(expected.size()); r++) {
            assert(a.prod(l, r).sum == sum_range(expected, l, r));
        }
    }
}

int main() {
    m1une::utilities::FastInput fast_input;
    m1une::utilities::FastOutput fast_output;

    {
        Array a(std::vector<long long>{0, 0, 0, 0});
        Array b = a.apply(1, 4, {2, 3});
        Array c = b.insert(2, AM::make(100));
        assert_all_ranges(a, {0, 0, 0, 0});
        assert_all_ranges(b, {0, 3, 5, 7});
        assert_all_ranges(c, {0, 3, 100, 5, 7});

        Array d = c.apply(1, 5, {10, 0});
        assert_all_ranges(c, {0, 3, 100, 5, 7});
        assert_all_ranges(d, {0, 3, 110, 25, 37});
    }
    {
        Array a(std::vector<long long>{0, 0, 0, 0, 0});
        Array b = a.apply(0, 5, {1, 0});
        Array c = b.insert(2, AM::make(100));
        assert_all_ranges(b, {0, 1, 2, 3, 4});
        assert_all_ranges(c, {0, 1, 100, 2, 3, 4});
    }
    {
        Array a(std::vector<long long>{0, 0, 0, 0});
        Array b = a.apply(0, 4, {1, 0}).reverse();
        Array c = b.insert(1, AM::make(9));
        Array d = c.apply(1, 4, {2, 1});
        assert_all_ranges(b, {3, 2, 1, 0});
        assert_all_ranges(c, {3, 9, 2, 1, 0});
        assert_all_ranges(d, {3, 10, 5, 6, 0});
    }
    {
        std::vector<long long> expected(16);
        std::iota(expected.begin(), expected.end(), 0LL);
        Array original(expected);
        Array base = original.apply(0, 16, AM::operator_type(2, 3)).reverse();
        for (int i = 0; i < int(expected.size()); ++i) expected[i] += 2 * i + 3;
        std::reverse(expected.begin(), expected.end());
        const std::vector<long long> base_expected = expected;
        Array inplace = base;
        Array persistent = base;
        std::mt19937 cow_rng(17);
        for (int step = 0; step < 500; ++step) {
            int l = int(cow_rng() % (expected.size() + 1));
            int r = int(cow_rng() % (expected.size() + 1));
            if (l > r) std::swap(l, r);
            if (step % 5 == 0) {
                int pos = int(cow_rng() % expected.size());
                long long value = int(cow_rng() % 101) - 50;
                inplace.set_inplace(pos, AM::make(value));
                expected[pos] = value;
                persistent = persistent.set(pos, AM::make(value));
            } else {
                long long coef = int(cow_rng() % 11) - 5;
                long long add = int(cow_rng() % 21) - 10;
                AM::operator_type action(coef, add);
                inplace.apply_inplace(l, r, action);
                persistent = persistent.apply(l, r, action);
                for (int i = l; i < r; ++i) expected[i] += coef * (i - l) + add;
            }
            assert_all_ranges(inplace, expected);
            assert_all_ranges(persistent, expected);
            assert_all_ranges(base, base_expected);
            assert_all_ranges(original, std::vector<long long>{
                0, 1, 2, 3, 4, 5, 6, 7,
                8, 9, 10, 11, 12, 13, 14, 15
            });
        }
    }

    std::mt19937 rng(4);
    std::vector<std::pair<Array, std::vector<long long>>> versions;
    versions.push_back({Array(), {}});
    for (int step = 0; step < 300; step++) {
        int id = int(rng() % versions.size());
        Array cur = versions[id].first;
        std::vector<long long> expected = versions[id].second;
        assert_all_ranges(cur, expected);

        Array next = cur;
        std::vector<long long> next_expected = expected;
        int op = int(rng() % 7);
        if (op == 0 || next_expected.empty()) {
            int pos = int(rng() % (next_expected.size() + 1));
            long long value = int(rng() % 101) - 50;
            next = cur.insert(pos, AM::make(value));
            next_expected.insert(next_expected.begin() + pos, value);
        } else if (op == 1) {
            int pos = int(rng() % next_expected.size());
            next = cur.erase(pos);
            next_expected.erase(next_expected.begin() + pos);
        } else if (op == 2) {
            int l = int(rng() % (next_expected.size() + 1));
            int r = int(rng() % (next_expected.size() + 1));
            if (l > r) std::swap(l, r);
            long long coef = int(rng() % 11) - 5;
            long long add = int(rng() % 21) - 10;
            next = cur.apply(l, r, {coef, add});
            for (int i = l; i < r; i++) next_expected[i] += coef * (i - l) + add;
        } else if (op == 3) {
            int l = int(rng() % (next_expected.size() + 1));
            int r = int(rng() % (next_expected.size() + 1));
            if (l > r) std::swap(l, r);
            next = cur.reverse(l, r);
            std::reverse(next_expected.begin() + l, next_expected.begin() + r);
        } else if (op == 4) {
            int l = int(rng() % (next_expected.size() + 1));
            int m = int(rng() % (next_expected.size() + 1));
            int r = int(rng() % (next_expected.size() + 1));
            if (l > m) std::swap(l, m);
            if (m > r) std::swap(m, r);
            if (l > m) std::swap(l, m);
            next = cur.rotate(l, m, r);
            std::rotate(next_expected.begin() + l, next_expected.begin() + m, next_expected.begin() + r);
        } else if (op == 5) {
            int pos = int(rng() % next_expected.size());
            long long value = int(rng() % 101) - 50;
            next = cur.set(pos, AM::make(value));
            next_expected[pos] = value;
        } else {
            next = cur.reverse();
            std::reverse(next_expected.begin(), next_expected.end());
        }

        assert_all_ranges(cur, expected);
        assert_all_ranges(next, next_expected);
        if (next_expected.size() <= 80) versions.push_back({next, next_expected});
    }

    long long x, y;
    fast_input >> x >> y;
    fast_output << x + y << '\n';
}

m1une's library

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

verify/ds/dynamic_array/persistent_dynamic_lazy_monoid_array_range_ap.test.cpp

Depends on

Code