test/yosupo/data_structure/range_affine_range_sum_large_array.test.cpp

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

Depends on

• Montgomery modular multiplication (lib/internal/internal_math.hpp)
• lib/math/modint.hpp
• 動的遅延評価セグメント木 (lib/segtree/dynamic_lazy_segment_tree.hpp)
• lib/segtree/monoid.hpp

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/range_affine_range_sum_large_array
#include <iostream>
#include <utility>
#include <vector>
#include "math/modint.hpp"
#include "segtree/dynamic_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 id(std::int64_t x) { return T(0, x); }
    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;
    dynamic_lazy_segment_tree<S, F> st(n);
    while (q--) {
        int c;
        std::cin >> c;
        if (c == 0) {
            int l, r, b, c;
            std::cin >> l >> r >> b >> c;
            st.apply(l, r, {b, c});
        } else {
            int l, r;
            std::cin >> l >> r;
            std::cout << st.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++	dense_00	AC	285 ms	4 MB
g++	dense_01	AC	326 ms	4 MB
g++	dense_02	AC	327 ms	29 MB
g++	example_00	AC	2 ms	4 MB
g++	many_query_0_00	AC	362 ms	201 MB
g++	many_query_0_01	AC	361 ms	201 MB
g++	many_query_1_00	AC	456 ms	201 MB
g++	many_query_1_01	AC	449 ms	201 MB
g++	max_random_00	AC	427 ms	201 MB
g++	max_random_01	AC	458 ms	201 MB
g++	max_random_02	AC	494 ms	201 MB
g++	near_0_and_N_00	AC	347 ms	54 MB
g++	near_0_and_N_01	AC	360 ms	54 MB
g++	query_0_then_1_00	AC	414 ms	201 MB
g++	query_0_then_1_01	AC	407 ms	201 MB
g++	random_00	AC	73 ms	29 MB
g++	random_01	AC	132 ms	28 MB
g++	random_02	AC	314 ms	102 MB
g++	random_03	AC	121 ms	54 MB
g++	random_04	AC	422 ms	201 MB
g++	small_N_00	AC	130 ms	4 MB
g++	small_N_01	AC	132 ms	4 MB
g++	small_N_02	AC	137 ms	4 MB
g++	small_N_03	AC	137 ms	4 MB
g++	small_N_04	AC	151 ms	3 MB
g++	small_Q_00	AC	2 ms	4 MB
g++	small_Q_01	AC	2 ms	3 MB
g++	small_Q_02	AC	2 ms	4 MB
g++	small_Q_03	AC	2 ms	4 MB
g++	small_Q_04	AC	2 ms	3 MB
g++	small_Q_05	AC	2 ms	4 MB

Back to top page