Tifa's CP Library

:heavy_check_mark: src/test_cpverifier/library-checker/range_affine_range_sum.segtree_old-s30.test.cpp

Depends on

Code

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

#include "../../code/ds/segtree_old.hpp"

constexpr u32 MOD = 998244353;

#include "../../code/math/mint_s30.hpp"

using mint = tifa_libs::math::mint_s30<MOD>;

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n, q;
  std::cin >> n >> q;
  vec<mint> a(n);
  for (auto &x : a) std::cin >> x;
  auto min = [](mint a, mint b) { return std::min(a, b); };
  tifa_libs::ds::segtree_old<mint, decltype(min)> segt(a);
  for (u32 i = 1; i <= q; ++i) {
    u32 opt, l, r;
    std::cin >> opt >> l >> r;
    --r;
    if (opt == 0) {
      mint x, y;
      std::cin >> x >> y;
      segt.mul(1, 0, n - 1, l, r, x);
      segt.add(1, 0, n - 1, l, r, y);
    } else {
      std::cout << segt.querys(1, 0, n - 1, l, r) << '\n';
    }
  }
  return 0;
}
#line 1 "src/test_cpverifier/library-checker/range_affine_range_sum.segtree_old-s30.test.cpp"
#define AUTO_GENERATED
#define PROBLEM "https://judge.yosupo.jp/problem/range_affine_range_sum"

#line 1 "src/code/ds/segtree_old.hpp"



#line 1 "src/code/util/util.hpp"



#include <bits/stdc++.h>

template <class T>
constexpr T abs(T x) { return x < 0 ? -x : x; }

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using i128 = __int128_t;
using isz = ptrdiff_t;

using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using u128 = __uint128_t;
using usz = size_t;

using f32 = float;
using f64 = double;
using f128 = long double;

template <class T>
using ptt = std::pair<T, T>;
template <class T>
using pt3 = std::tuple<T, T, T>;
template <class T>
using pt4 = std::tuple<T, T, T, T>;

template <class T, usz N>
using arr = std::array<T, N>;
template <class T>
using vec = std::vector<T>;
template <class T>
using vvec = vec<vec<T>>;
template <class T>
using v3ec = vec<vvec<T>>;
template <class U, class T>
using vecp = vec<std::pair<U, T>>;
template <class U, class T>
using vvecp = vvec<std::pair<U, T>>;
template <class T>
using vecpt = vec<ptt<T>>;
template <class T>
using vvecpt = vvec<ptt<T>>;

template <class T, class C = std::less<T>>
using pq = std::priority_queue<T, vec<T>, C>;
template <class T>
using pqg = std::priority_queue<T, vec<T>, std::greater<T>>;

using strn = std::string;
using strnv = std::string_view;

using vecu = vec<u32>;
using vvecu = vvec<u32>;
using v3ecu = v3ec<u32>;
using vecu64 = vec<u64>;
using vecb = vec<bool>;
using vvecb = vvec<bool>;

#ifdef ONLINE_JUDGE
#undef assert
#define assert(x) 42
#endif

using namespace std::literals;

constexpr i8 operator""_i8(unsigned long long x) { return (i8)x; }
constexpr i16 operator""_i16(unsigned long long x) { return (i16)x; }
constexpr i32 operator""_i32(unsigned long long x) { return (i32)x; }
constexpr i64 operator""_i64(unsigned long long x) { return (i64)x; }
constexpr isz operator""_iz(unsigned long long x) { return (isz)x; }

constexpr u8 operator""_u8(unsigned long long x) { return (u8)x; }
constexpr u16 operator""_u16(unsigned long long x) { return (u16)x; }
constexpr u32 operator""_u32(unsigned long long x) { return (u32)x; }
constexpr u64 operator""_u64(unsigned long long x) { return (u64)x; }
constexpr usz operator""_uz(unsigned long long x) { return (usz)x; }

inline const auto fn_0 = [](auto&&...) {};


#line 5 "src/code/ds/segtree_old.hpp"

namespace tifa_libs::ds {

template <class T, class F>
class segtree_old {
  struct YYZ {
    T w, sign, sign1, _min, _max;
  };
  vec<YYZ> t;

  constexpr void pushup(u32 x) {
    t[x].w = t[x * 2].w + t[x * 2 + 1].w;
    t[x]._min = std::min(t[x * 2]._min, t[x * 2 + 1]._min);
    t[x]._max = std::max(t[x * 2]._max, t[x * 2 + 1]._max);
  }
  constexpr void build(vec<T> const &a, u32 x, u32 l, u32 r) {
    t[x].sign1 = 1;
    if (l == r) return void(t[x].w = a[l]);
    u32 mid = l + (r - l) / 2;
    build(a, x * 2, l, mid), build(a, x * 2 + 1, mid + 1, r);
    pushup(x);
  }
  constexpr void pushdown(u32 x, u32 l, u32 r) {  // sign1(*) must be pushdowned before sign(+)
    if (t[x].sign1 != 1) {
      t[x * 2].w *= t[x].sign1;
      t[x * 2].sign *= t[x].sign1, t[x * 2].sign1 *= t[x].sign1;
      t[x * 2]._min *= t[x].sign1, t[x * 2]._max *= t[x].sign1;
      t[x * 2 + 1].w *= t[x].sign1;
      t[x * 2 + 1].sign *= t[x].sign1, t[x * 2 + 1].sign1 *= t[x].sign1;
      t[x * 2 + 1]._min *= t[x].sign1, t[x * 2 + 1]._max *= t[x].sign1;
      t[x].sign1 = 1;
    }
    if (t[x].sign) {
      u32 mid = l + (r - l) / 2;
      t[x * 2].w += i64(mid - l + 1) * t[x].sign, t[x * 2].sign += t[x].sign;
      t[x * 2]._min += t[x].sign, t[x * 2]._max += t[x].sign;
      t[x * 2 + 1].w += i64(r - mid) * t[x].sign, t[x * 2 + 1].sign += t[x].sign;
      t[x * 2 + 1]._min += t[x].sign, t[x * 2 + 1]._max += t[x].sign;
      t[x].sign = 0;
    }
  }

 public:
  explicit constexpr segtree_old(vec<T> const &a) : t(a.size() * 4) { build(a, 1, 0, u32(a.size() - 1)); }

  constexpr void add(u32 x, u32 l, u32 r, u32 L, u32 R, T k) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) {
      t[x].w += i64(r - l + 1) * k, t[x].sign += k;
      t[x]._min += k, t[x]._max += k;
      return;
    }
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    if (L <= mid) add(x * 2, l, mid, L, R, k);
    if (R > mid) add(x * 2 + 1, mid + 1, r, L, R, k);
    pushup(x);
  }
  constexpr void mul(u32 x, u32 l, u32 r, u32 L, u32 R, T k) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) {
      t[x].w *= k;
      t[x].sign *= k, t[x].sign1 *= k;
      t[x]._min *= k, t[x]._max *= k;
      return;
    }
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    if (L <= mid) mul(x * 2, l, mid, L, R, k);
    if (R > mid) mul(x * 2 + 1, mid + 1, r, L, R, k);
    pushup(x);
  }
  constexpr T querys(u32 x, u32 l, u32 r, u32 L, u32 R) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) return t[x].w;
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    T ret = 0;
    if (L <= mid) ret = querys(x * 2, l, mid, L, R);
    if (R > mid) ret += querys(x * 2 + 1, mid + 1, r, L, R);
    return ret;
  }
  constexpr T querym(u32 x, u32 l, u32 r, u32 L, u32 R, F f) {
    assert(R >= l && L <= r);
    if (L <= l && R >= r) return f(t[x]._min, t[x]._max);
    pushdown(x, l, r);
    u32 mid = l + (r - l) / 2;
    if (L > mid) return querym(x * 2 + 1, mid + 1, r, L, R, f);
    if (R <= mid) return querym(x * 2, l, mid, L, R, f);
    return f(querym(x * 2, l, mid, L, R, f), querym(x * 2 + 1, mid + 1, r, L, R, f));
  }
};

}  // namespace tifa_libs::ds


#line 5 "src/test_cpverifier/library-checker/range_affine_range_sum.segtree_old-s30.test.cpp"

constexpr u32 MOD = 998244353;

#line 1 "src/code/math/mint_s30.hpp"



#line 1 "src/code/math/mint.hpp"



#line 1 "src/code/nt/inverse.hpp"



#line 1 "src/code/nt/inv_gcd.hpp"



#line 1 "src/code/math/safe_mod.hpp"



#line 1 "src/code/util/traits.hpp"



#line 5 "src/code/util/traits.hpp"

namespace tifa_libs {

template <class T>
concept iterable_c = requires(T v) {
  { v.begin() } -> std::same_as<typename T::iterator>;
  { v.end() } -> std::same_as<typename T::iterator>;
};

template <class T>
concept container_c = iterable_c<T> && !std::derived_from<T, std::basic_string<typename T::value_type>>;

template <class T>
constexpr bool is_char_v = std::is_same_v<T, char> || std::is_same_v<T, signed char> || std::is_same_v<T, unsigned char>;
template <class T>
concept char_c = is_char_v<T>;

template <class T>
constexpr bool is_s128_v = std::is_same_v<T, __int128_t> || std::is_same_v<T, __int128>;
template <class T>
concept s128_c = is_s128_v<T>;

template <class T>
constexpr bool is_u128_v = std::is_same_v<T, __uint128_t> || std::is_same_v<T, unsigned __int128>;
template <class T>
concept u128_c = is_u128_v<T>;

template <class T>
constexpr bool is_i128_v = is_s128_v<T> || is_u128_v<T>;
template <class T>
concept i128_c = is_u128_v<T>;

template <class T>
constexpr bool is_int_v = std::is_integral_v<T> || is_i128_v<T>;
template <class T>
concept int_c = is_int_v<T>;

template <class T>
constexpr bool is_sint_v = is_s128_v<T> || (is_int_v<T> && std::is_signed_v<T>);
template <class T>
concept sint_c = is_sint_v<T>;

template <class T>
constexpr bool is_uint_v = is_u128_v<T> || (is_int_v<T> && std::is_unsigned_v<T>);
template <class T>
concept uint_c = is_uint_v<T>;

template <class T>
concept mint_c = requires(T x) {
  { x.mod() } -> uint_c;
  { x.val() } -> uint_c;
};

template <class T>
constexpr bool is_arithm_v = std::is_arithmetic_v<T> || is_int_v<T>;
template <class T>
concept arithm_c = is_arithm_v<T>;

template <class T>
struct to_sint : std::make_signed<T> {};
template <>
struct to_sint<u128> {
  using type = u128;
};
template <>
struct to_sint<i128> {
  using type = u128;
};
template <class T>
using to_sint_t = typename to_sint<T>::type;

template <class T>
struct to_uint : std::make_unsigned<T> {};
template <>
struct to_uint<u128> {
  using type = u128;
};
template <>
struct to_uint<i128> {
  using type = u128;
};
template <class T>
using to_uint_t = typename to_uint<T>::type;

}  // namespace tifa_libs


#line 5 "src/code/math/safe_mod.hpp"

namespace tifa_libs::math {

template <sint_c T>
constexpr T safe_mod(T x, to_uint_t<T> mod) { return ((x %= (T)mod) < 0 ? x + (T)mod : x); }

}  // namespace tifa_libs::math


#line 1 "src/code/nt/exgcd.hpp"



#line 5 "src/code/nt/exgcd.hpp"

namespace tifa_libs::math {

// @return tuple(g, x, y) s.t. g = gcd(a, b), xa + yb = g, |x| + |y| is the minimal (primary) and x <= y (secondarily)
template <sint_c T>
constexpr auto exgcd(T a, T b) {
  T x1 = 1, x2 = 0, x3 = 0, x4 = 1;
  while (b) {
    T c = a / b;
    std::tie(x1, x2, x3, x4, a, b) = std::make_tuple(x3, x4, x1 - x3 * c, x2 - x4 * c, b, a - b * c);
  }
  return std::make_tuple(to_uint_t<T>(a), x1, x2);
}

}  // namespace tifa_libs::math


#line 6 "src/code/nt/inv_gcd.hpp"

namespace tifa_libs::math {

template <uint_c T>
constexpr ptt<T> inv_gcd(T n, T mod) {
  using U = to_sint_t<T>;
  auto [g, x, y] = exgcd(U(n % mod), (U)mod);
  return {g, safe_mod(x, mod)};
}

}  // namespace tifa_libs::math


#line 5 "src/code/nt/inverse.hpp"

namespace tifa_libs::math {

template <uint_c T, uint_c U>
constexpr U inverse(T n, U mod) {
  auto [g, x] = inv_gcd(U(n % mod), mod);
  assert(g == 1);
  return x;
}

}  // namespace tifa_libs::math


#line 6 "src/code/math/mint.hpp"

namespace tifa_libs::math {

template <class D, uint_c Rt>
class mint {
  constexpr D const &d() const { return static_cast<D const &>(*this); }
  constexpr D &d() { return static_cast<D &>(*this); }

 protected:
  Rt v_{};

 public:
  constexpr mint() {}
  template <int_c T>
  constexpr mint(T v) : v_(D::mod_(v)) {}
  constexpr operator D() { return d(); }

  using raw_type = Rt;
  using sraw_type = to_sint_t<Rt>;
  static constexpr raw_type mod() { return D::mod_(); }
  static constexpr sraw_type smod() { return (sraw_type)D::mod_(); }
  constexpr raw_type val() const { return d().val_(); }
  constexpr sraw_type sval() const { return (sraw_type)d().val_(); }
  constexpr raw_type &data() { return d().data_(); }

  template <int_c T>
  explicit constexpr operator T() const { return (T)val(); }
  constexpr mint &operator+=(mint const &r) { return d().adde_(r.d()); }
  constexpr mint &operator-=(mint const &r) { return d().sube_(r.d()); }
  constexpr mint &operator*=(mint const &r) { return d().mule_(r.d()); }
  constexpr mint &operator/=(mint const &r) { return *this = *this * r.inv(); }
  constexpr mint const &operator+() const { return *this; }
  constexpr mint operator-() const { return d().neg_(); }
  constexpr mint inv() const { return inverse(val(), mod()); }
  friend constexpr mint operator+(mint l, mint const &r) { return l += r; }
  friend constexpr mint operator-(mint l, mint const &r) { return l -= r; }
  friend constexpr mint operator*(mint l, mint const &r) { return l *= r; }
  friend constexpr mint operator/(mint l, mint const &r) { return l /= r; }
  friend constexpr bool operator==(mint const &l, mint const &r) { return l.val() == r.val(); }
  friend constexpr auto operator<=>(mint const &l, mint const &r) { return l.sval() - r.sval(); }
  friend std::istream &operator>>(std::istream &is, mint &x) {
    i64 _;
    is >> _;
    x = mint(_);
    return is;
  }
  friend std::ostream &operator<<(std::ostream &os, mint const &x) { return os << x.val(); }
  friend constexpr mint abs(mint const &x) { return x.val(); }
};

}  // namespace tifa_libs::math


#line 5 "src/code/math/mint_s30.hpp"

namespace tifa_libs::math {

template <u32 MOD>
class mint_s30 : public mint<mint_s30<MOD>, u32> {
  using base = mint<mint_s30<MOD>, u32>;
  friend base;

  static constexpr u32 MOD2 = MOD << 1;
  static constexpr u32 R = []() {
    u32 t = 2, iv = MOD * (t - MOD * MOD);
    iv *= t - MOD * iv, iv *= t - MOD * iv;
    return iv * (MOD * iv - t);
  }();
  static constexpr u32 R2 = -(u64)(MOD) % MOD;

  static_assert(MOD & 1);
  static_assert(-R * MOD == 1);
  static_assert((MOD >> 30) == 0);
  static_assert(MOD != 1);

  static constexpr u32 reduce(u64 x) { return u32((x + u64((u32)x * R) * MOD) >> 32); }
  static constexpr u32 norm(u32 x) { return x - (MOD & -((MOD - 1 - x) >> 31)); }

 public:
  static constexpr bool FIXED_MOD = true;
  constexpr mint_s30() {}
  template <int_c T>
  constexpr mint_s30(T v) { this->v_ = mod_(v); }

 private:
  using raw_t = typename base::raw_type;
  using sraw_t = typename base::sraw_type;
  template <sint_c T>
  static constexpr raw_t mod_(T v) { return reduce(u64(v % (i32)mod_() + (i32)mod_()) * R2); }
  template <uint_c T>
  static constexpr raw_t mod_(T v) { return reduce(u64(v % mod_()) * R2); }
  static constexpr raw_t mod_() { return MOD; }
  constexpr raw_t val_() const { return norm(reduce(this->v_)); }
  constexpr raw_t &data_() { return this->v_; }

  constexpr mint_s30 neg_() const {
    mint_s30 res;
    res.v_ = (MOD2 & -(this->v_ != 0)) - this->v_;
    return res;
  }
  constexpr mint_s30 &adde_(mint_s30 const &r) {
    this->v_ += r.v_ - MOD2, this->v_ += MOD2 & -(this->v_ >> 31);
    return *this;
  }
  constexpr mint_s30 &sube_(mint_s30 const &r) {
    this->v_ -= r.v_, this->v_ += MOD2 & -(this->v_ >> 31);
    return *this;
  }
  constexpr mint_s30 &mule_(mint_s30 const &r) {
    this->v_ = reduce(u64(this->v_) * r.v_);
    return *this;
  }
};

}  // namespace tifa_libs::math


#line 9 "src/test_cpverifier/library-checker/range_affine_range_sum.segtree_old-s30.test.cpp"

using mint = tifa_libs::math::mint_s30<MOD>;

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  u32 n, q;
  std::cin >> n >> q;
  vec<mint> a(n);
  for (auto &x : a) std::cin >> x;
  auto min = [](mint a, mint b) { return std::min(a, b); };
  tifa_libs::ds::segtree_old<mint, decltype(min)> segt(a);
  for (u32 i = 1; i <= q; ++i) {
    u32 opt, l, r;
    std::cin >> opt >> l >> r;
    --r;
    if (opt == 0) {
      mint x, y;
      std::cin >> x >> y;
      segt.mul(1, 0, n - 1, l, r, x);
      segt.add(1, 0, n - 1, l, r, y);
    } else {
      std::cout << segt.querys(1, 0, n - 1, l, r) << '\n';
    }
  }
  return 0;
}

Test cases

Env Name Status Elapsed Memory
g++-12 example_00 :heavy_check_mark: AC 9 ms 4 MB
g++-12 max_random_00 :heavy_check_mark: AC 994 ms 44 MB
g++-12 max_random_01 :heavy_check_mark: AC 1008 ms 44 MB
g++-12 max_random_02 :heavy_check_mark: AC 995 ms 44 MB
g++-12 random_00 :heavy_check_mark: AC 810 ms 35 MB
g++-12 random_01 :heavy_check_mark: AC 842 ms 41 MB
g++-12 random_02 :heavy_check_mark: AC 562 ms 8 MB
g++-12 small_00 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_01 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_02 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_03 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_04 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_05 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_06 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_07 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_08 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_09 :heavy_check_mark: AC 9 ms 4 MB
g++-12 small_random_00 :heavy_check_mark: AC 10 ms 4 MB
g++-12 small_random_01 :heavy_check_mark: AC 9 ms 4 MB
Back to top page