verify/ds/dynamic_sequence_range_affine_range_sum_rbst.test.cpp

• View this file on GitHub
• Last update: 2024-06-15 17:22:49+08:00
• Problem: https://judge.yosupo.jp/problem/dynamic_sequence_range_affine_range_sum

Depends on

• Random Binary Search Tree (lib/ds/rbst.hpp)
• Internal Definition (lib/internal.hpp)
• Static Modint (lib/math/static_modint.hpp)
• lib/monoid/monoid_add.hpp
• lib/monoid/monoid_linear_function.hpp
• lib/monoid/monoid_trait.hpp

Code

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

#include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>

using i64 = long long;
using i128 = __int128_t;
using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = __uint128_t;

#include "lib/ds/rbst.hpp"
#include "lib/math/static_modint.hpp"
#include "lib/monoid/monoid_add.hpp"
#include "lib/monoid/monoid_linear_function.hpp"

using mint = static_modint<998'244'353>;

using SumMonoid = mono::MonoidAdd<mint>;
using LFMonoid = mono::MonoidLinearFunc<mint>;

mint act(const std::pair<mint, mint> &&a, const mint &&b, u64 &&c) { return a.first * b + a.second * c; }

int main()
{
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int n, Q;
  std::cin >> n >> Q;
  std::vector<mint> a(n);
  for (auto &i : a) {
    int v;
    std::cin >> v;
    i = v;
  }
  RBST<mono::BidirActedMonoidTrait<mono::ActedMonoidTrait<
      LFMonoid, SumMonoid, act>>>
      t(n, [&a](u32 x) { return a[x]; });

  for (int i = 0; i < Q; i++) {
    int op;
    std::cin >> op;
    if (op == 0) {
      int j, x;
      std::cin >> j >> x;
      t.insert(j, x);
    } else if (op == 1) {
      int j;
      std::cin >> j;
      t.remove(j);
    } else if (op == 2) {
      int l, r;
      std::cin >> l >> r;
      t.reverse(l, r);
    } else if (op == 3) {
      int l, r, b, c;
      std::cin >> l >> r >> b >> c;
      t.apply(l, r, {b, c});
    } else if (op == 4) {
      int l, r;
      std::cin >> l >> r;
      std::cout << t.prod(l, r).val() << "\n";
    }
  }
}

Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.10/site-packages/onlinejudge_verify/documentation/build.py", line 71, in _render_source_code_stat
    bundled_code = language.bundle(stat.path, basedir=basedir, options={'include_paths': [basedir]}).decode()
  File "/home/runner/.local/lib/python3.10/site-packages/onlinejudge_verify/languages/cplusplus.py", line 187, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.10/site-packages/onlinejudge_verify/languages/cplusplus_bundle.py", line 401, in update
    self.update(self._resolve(pathlib.Path(included), included_from=path))
  File "/home/runner/.local/lib/python3.10/site-packages/onlinejudge_verify/languages/cplusplus_bundle.py", line 401, in update
    self.update(self._resolve(pathlib.Path(included), included_from=path))
  File "/home/runner/.local/lib/python3.10/site-packages/onlinejudge_verify/languages/cplusplus_bundle.py", line 312, in update
    raise BundleErrorAt(path, i + 1, "#pragma once found in a non-first line")
onlinejudge_verify.languages.cplusplus_bundle.BundleErrorAt: lib/internal.hpp: line 4: #pragma once found in a non-first line

Back to top page