algo

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub kuhaku-space/algo

:heavy_check_mark: test/yosupo/data_structure/point_set_range_composite_large_array.test.cpp

Depends on

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/point_set_range_composite_large_array
#include <iostream>
#include "math/modint.hpp"
#include "segtree/dynamic_segment_tree.hpp"

using Mint = modint998;

int main(void) {
    int n, q;
    std::cin >> n >> q;
    dynamic_segment_tree<Affine<Mint>> dst(n);
    while (q--) {
        int t;
        std::cin >> t;
        if (t == 0) {
            int p, c, d;
            std::cin >> p >> c >> d;
            dst.set(p, {c, d});
        } else {
            int l, r, x;
            std::cin >> l >> r >> x;
            auto [c, d] = dst.prod(l, r);
            std::cout << c * x + d << '\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 :heavy_check_mark: AC 927 ms 4 MB
g++ dense_01 :heavy_check_mark: AC 1147 ms 4 MB
g++ dense_02 :heavy_check_mark: AC 1247 ms 13 MB
g++ example_00 :heavy_check_mark: AC 2 ms 4 MB
g++ many_query_0_00 :heavy_check_mark: AC 768 ms 21 MB
g++ many_query_0_01 :heavy_check_mark: AC 761 ms 21 MB
g++ many_query_1_00 :heavy_check_mark: AC 1364 ms 3 MB
g++ many_query_1_01 :heavy_check_mark: AC 1375 ms 4 MB
g++ max_random_00 :heavy_check_mark: AC 1177 ms 13 MB
g++ max_random_01 :heavy_check_mark: AC 1202 ms 13 MB
g++ max_random_02 :heavy_check_mark: AC 1231 ms 13 MB
g++ near_0_and_N_00 :heavy_check_mark: AC 1268 ms 9 MB
g++ near_0_and_N_01 :heavy_check_mark: AC 1178 ms 7 MB
g++ query_0_then_1_00 :heavy_check_mark: AC 1187 ms 12 MB
g++ query_0_then_1_01 :heavy_check_mark: AC 1196 ms 13 MB
g++ random_00 :heavy_check_mark: AC 1004 ms 11 MB
g++ random_01 :heavy_check_mark: AC 1092 ms 13 MB
g++ random_02 :heavy_check_mark: AC 912 ms 13 MB
g++ random_03 :heavy_check_mark: AC 95 ms 4 MB
g++ random_04 :heavy_check_mark: AC 364 ms 5 MB
g++ small_N_00 :heavy_check_mark: AC 703 ms 3 MB
g++ small_N_01 :heavy_check_mark: AC 706 ms 3 MB
g++ small_N_02 :heavy_check_mark: AC 717 ms 3 MB
g++ small_N_03 :heavy_check_mark: AC 835 ms 4 MB
g++ small_N_04 :heavy_check_mark: AC 754 ms 3 MB
Back to top page