test/yosupo/data_structure/persistent_range_affine_range_sum.test.cpp

• View this file on GitHub
• Last update: 2026-03-15 03:14:58+09:00
• Problem: https://judge.yosupo.jp/problem/persistent_range_affine_range_sum

Depends on

• Montgomery modular multiplication (lib/internal/internal_math.hpp)
• lib/math/modint.hpp
• 永続遅延評価セグメント木 (lib/persistent_ds/persistent_lazy_segment_tree.hpp)
• lib/segtree/monoid.hpp

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/persistent_range_affine_range_sum
#include <iostream>
#include <utility>
#include <vector>
#include "math/modint.hpp"
#include "persistent_ds/persistent_lazy_segment_tree.hpp"

using Mint = modint998;

struct S {
    using T = std::pair<Mint, Mint>;
    using value_type = T;
    static constexpr T id() { return T(); }
    static constexpr T op(T lhs, T rhs) { return {lhs.first + rhs.first, rhs.second + lhs.second}; }
};

struct F {
    using T = std::pair<Mint, Mint>;
    using value_type = T;
    static constexpr T id() { return T(1, 0); }
    static constexpr T op(T lhs, T rhs) {
        return {lhs.first * rhs.first, lhs.first * rhs.second + lhs.second};
    }
    template <class U>
    static constexpr U f(T lhs, U rhs) {
        return {lhs.first * rhs.first + lhs.second * rhs.second, rhs.second};
    }
};

int main(void) {
    int n, q;
    std::cin >> n >> q;
    std::vector<Mint> a(n);
    for (auto &e : a) std::cin >> e;
    std::vector<std::pair<Mint, Mint>> p(n);
    for (int i = 0; i < n; ++i) p[i] = {a[i], 1};
    std::vector<persistent_lazy_segment_tree<S, F>> st(q + 1);
    st[0] = persistent_lazy_segment_tree<S, F>(p);
    for (int i = 1; i <= q; ++i) {
        int t;
        std::cin >> t;
        if (t == 0) {
            int k, l, r, b, c;
            std::cin >> k >> l >> r >> b >> c;
            st[i] = st[k + 1].apply(l, r, {b, c});
        } else if (t == 1) {
            int k, s, l, r;
            std::cin >> k >> s >> l >> r;
            st[i] = st[k + 1].copy(l, r, st[s + 1]);
        } else {
            int k, l, r;
            std::cin >> k >> l >> r;
            std::cout << st[k + 1].prod(l, r).first << '\n';
        }
    }

    return 0;
}

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/resolver.py", line 291, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 242, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 479, in update
    self._resolve(pathlib.Path(included), included_from=path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 286, in _resolve
    raise BundleErrorAt(path, -1, "no such header")
competitive_verifier.oj.verify.languages.cplusplus_bundle.BundleErrorAt: math/modint.hpp: line -1: no such header

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	3 ms	4 MB
g++	example_01	AC	2 ms	4 MB
g++	max_less_query_types_00	AC	1005 ms	635 MB
g++	max_less_query_types_01	AC	1388 ms	979 MB
g++	max_less_query_types_02	AC	1014 ms	566 MB
g++	max_less_query_types_03	AC	1171 ms	809 MB
g++	max_less_query_types_04	AC	1480 ms	772 MB
g++	max_less_query_types_05	AC	1092 ms	601 MB
g++	max_random_00	AC	1352 ms	727 MB
g++	max_random_01	AC	1448 ms	727 MB
g++	max_random_02	AC	1457 ms	726 MB
g++	random_00	AC	707 ms	460 MB
g++	random_01	AC	226 ms	146 MB
g++	random_02	AC	587 ms	423 MB
g++	small_00	AC	5 ms	4 MB
g++	small_01	AC	5 ms	4 MB
g++	small_02	AC	5 ms	4 MB
g++	small_03	AC	5 ms	4 MB
g++	small_04	AC	5 ms	4 MB
g++	small_05	AC	6 ms	4 MB
g++	small_06	AC	6 ms	4 MB
g++	small_07	AC	6 ms	4 MB
g++	small_08	AC	6 ms	5 MB
g++	small_09	AC	6 ms	5 MB
g++	small_random_00	AC	13 ms	8 MB
g++	small_random_01	AC	11 ms	7 MB

Back to top page