Tifa's CP Library

:heavy_check_mark: src/test_cpverifier/library-checker/dynamic_sequence_range_affine_range_sum.test.cpp

Depends on

Code

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

#include "../../code/ds/fhq_treap_w.hpp"
#include "../../code/io/fastio.hpp"
#include "../../code/math/mint_s30.hpp"

using mint = tifa_libs::math::mint_s30<998244353>;
using T = std::pair<mint, usz>;   // sum len
using F = std::pair<mint, mint>;  // mul add

auto op(T a, T b) { return T{a.first + b.first, a.second + b.second}; }
auto e() { return T{0, 0}; }
auto mapping(F f, T a) {
  return T{f.first * a.first + f.second * a.second, a.second};
}
auto composition(F f, F g) {
  return F{f.first * g.first, f.first * g.second + f.second};
  /*
  g(x) = g.mul * x + g.add
  f(g(x)) = f.mul * (g.mul * x + g.add) + f.add = f.mul * g.mul * x + f.mul * g.add + f.add
  */
}
auto id() { return F(1, 0); }

int main() {
  u32 n, q;
  mint x, y;
  tifa_libs::fin >> n >> q;
  tifa_libs::ds::fhq_treap_w<T, op, e, F, mapping, composition, id, true> tr(n + q);
  for (u32 i = 0; i < n; ++i)
    tifa_libs::fin >> x, tr.insert(T{x, 1});
  for (u32 i = 0, opt, l, r; i < q; ++i) {
    tifa_libs::fin >> opt >> l;
    if (opt == 0) tifa_libs::fin >> x, tr.insert(T{x, 1}, l);
    else if (opt == 1) tr.erase(l);
    else if (opt == 2) tifa_libs::fin >> r, tr.reverse(l, r - 1);
    else if (opt == 3) tifa_libs::fin >> r >> x >> y, tr.update(l, r - 1, T(x, y));
    else tifa_libs::fin >> r, tifa_libs::fout << tr.query(l, r - 1).first << '\n';
  }
  return 0;
}
#line 1 "src/test_cpverifier/library-checker/dynamic_sequence_range_affine_range_sum.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/dynamic_sequence_range_affine_range_sum"

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



#line 1 "src/code/rand/gen.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/rand/gen.hpp"

namespace tifa_libs::rand {

template <class Distri>
class Gen {
  std::conditional_t<sizeof(typename Distri::result_type) <= 4, std::mt19937, std::mt19937_64> re;
  Distri dist;

 public:
  using random_engine = decltype(re);
  using distribution = Distri;
  using result_type = typename Distri::result_type;

  constexpr Gen() : re(std::random_device{}()), dist() {}
  constexpr Gen(result_type a, result_type b) : re(std::random_device{}()), dist(a, b) {}

  constexpr void set_range(result_type a, result_type b) { dist = Distri(a, b); }
  constexpr random_engine& rand_eng() { return re; }
  constexpr Distri& distrib() { return dist; }

  void reset_seed() { re.seed((result_type)std::chrono::duration_cast<std::conditional_t<sizeof(typename Distri::result_type) <= 4, std::chrono::seconds, std::chrono::nanoseconds>>(std::chrono::high_resolution_clock::now().time_since_epoch()).count()); }
  constexpr result_type operator()() { return dist(re); }
  result_type next() { return dist(re); }
};

}  // namespace tifa_libs::rand


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

namespace tifa_libs::ds {

template <class T, auto op, auto e, class F, auto mapping, auto composition, auto id,
          bool reverse_ = false, bool recovery = false>
requires requires(T val, T val_l, T val_r, F tag, F tag_l, F tag_r) {
  { e() } -> std::same_as<T>;
  { id() } -> std::same_as<F>;
  { op(val_l, val_r) } -> std::same_as<T>;
  { mapping(tag, val) } -> std::same_as<T>;
  { composition(tag_l, tag_r) } -> std::same_as<F>;
}
class fhq_treap_w {
  //! initial cnt = 1;
  struct YYZ {
    T w, val;
    F sign;
    u32 sz;
    arr<u32, 2> son{};
    i32 rad;
    bool rev;
    constexpr YYZ(T W = e(), T VAL = e(), u32 SZ = 0, i32 RAD = 0, F SIGN = id()) : w(W), val(VAL), sign(SIGN), sz(SZ), rad(RAD), rev(0) {}
  };
  rand::Gen<std::uniform_int_distribution<i32>> gen;
  vec<YYZ> t;
  vecu sta;
  u32 cnt;

  constexpr u32 newnode(T val) {
    u32 ret;
    if (sta.size()) ret = *sta.rbegin(), sta.pop_back(), t[ret] = YYZ(val, val, 1, gen());
    else ret = ++cnt, t[ret] = YYZ(val, val, 1, gen());
    return ret;
  }
  constexpr void rm(u32 u) { sta.push_back(u); }
  constexpr void update(u32 u) {
    t[u].w = op(t[t[u].son[0]].w, op(t[u].val, t[t[u].son[1]].w));
    t[u].sz = t[t[u].son[0]].sz + t[t[u].son[1]].sz + 1;
  }
  constexpr void reverse__(u32 u) {
    static_assert(reverse_);
    std::swap(t[u].son[0], t[u].son[1]), t[u].rev ^= 1;
  }
  constexpr void all_update(u32 u, F f) {
    if (u) t[u].val = mapping(f, t[u].val), t[u].w = mapping(f, t[u].w), t[u].sign = composition(f, t[u].sign);
  }
  constexpr void pushdown(u32 u) {
    if (u) {
      all_update(t[u].son[0], t[u].sign), all_update(t[u].son[1], t[u].sign), t[u].sign = id();
      if constexpr (reverse_)
        if (t[u].rev) reverse__(t[u].son[0]), reverse__(t[u].son[1]), t[u].rev = 0;
    }
  }

 public:
  u32 root;

  explicit constexpr fhq_treap_w(u32 MAX_N) : gen(), t(MAX_N + 1), sta(), cnt(0), root(0) {
    if constexpr (recovery) sta.reserve(MAX_N + 1);
  }

  constexpr void split(u32 u, u32 k, u32& x, u32& y) {
    if (!u) x = y = 0;
    else {
      pushdown(u);
      if (t[t[u].son[0]].sz < k) x = u, split(t[u].son[1], k - t[t[u].son[0]].sz - 1, t[x].son[1], y), update(x);
      else y = u, split(t[u].son[0], k, x, t[y].son[0]), update(y);
    }
  }
  constexpr u32 merge(u32 x, u32 y) {
    pushdown(x), pushdown(y);
    if (x && y) {
      if (t[x].rad <= t[y].rad) {
        t[x].son[1] = merge(t[x].son[1], y), update(x);
        return x;
      } else {
        t[y].son[0] = merge(x, t[y].son[0]), update(y);
        return y;
      }
    } else return x + y;
  }
  constexpr void insert(T w, u32 id_) {
    u32 x, y;
    split(root, id_, x, y);
    root = merge(merge(x, newnode(w)), y);
  }
  constexpr void insert(T w) { insert(w, cnt); }
  constexpr void erase(u32 id_) {
    u32 x, y, z;
    split(root, id_, x, y);
    split(y, 1, z, y);
    if (recovery) rm(z);
    root = merge(x, y);
  }
  constexpr void update(u32 l, u32 r, F f) {
    u32 x, y, z;
    split(root, r + 1, x, z);
    split(x, l, x, y);
    all_update(y, f);
    root = merge(merge(x, y), z);
  }
  constexpr void reverse(u32 l, u32 r) {
    assert(reverse_);
    u32 x, y, z;
    split(root, r + 1, x, z);
    split(x, l, x, y);
    reverse__(y);
    root = merge(merge(x, y), z);
  }
  constexpr T query(u32 l, u32 r) {
    u32 x, y, z;
    split(root, r + 1, x, z);
    split(x, l, x, y);
    T ret = t[y].w;
    root = merge(merge(x, y), z);
    return ret;
  }
};

}  // namespace tifa_libs::ds


#line 1 "src/code/io/fastio.hpp"



#line 1 "src/code/fast/u32tostr.hpp"



#line 5 "src/code/fast/u32tostr.hpp"

namespace tifa_libs {

constexpr u32 u32tostr_si16(u64 x, char *s) {
  if (x <= 9) {
    *s = (char)(x | 0x30);
    return 1;
  } else if (x <= 99) {
    u64 low = x;
    u64 ll = ((low * 103) >> 9) & 0x1E;
    low += ll * 3;
    ll = ((low & 0xF0) >> 4) | ((low & 0x0F) << 8);
    *(u16 *)s = (u16)(ll | 0x3030);
    return 2;
  }
  return 0;
}
constexpr u32 u32tostr_si32(u64 x, char *s) {
  u64 low = 0, ll = 0;
  u32 digits = 0;
  if (x <= 99) return u32tostr_si16(x, s);
  low = x;
  digits = (low > 999) ? 4 : 3;
  ll = ((low * 5243) >> 19) & 0xFF;
  low -= ll * 100;
  low = (low << 16) | ll;
  ll = ((low * 103) >> 9) & 0x1E001E;
  low += ll * 3;
  ll = ((low & 0x00F000F0) << 28) | (low & 0x000F000F) << 40;
  ll |= 0x3030303000000000;
  u8 *p = (u8 *)&ll;
  if (digits == 4) *(u32 *)s = *(u32 *)(&p[4]);
  else {
    *(u16 *)s = *(u16 *)(&p[5]);
    *(((u8 *)s) + 2) = p[7];
  }

  return digits;
}

constexpr u32 u32tostr(u64 x, char *s) {
  u64 low = 0, ll = 0;
  u32 digits = 0;
  if (x <= 9999) return u32tostr_si32(x, s);
  if (x < 100000000) {
    if ((low = x) > 999999) digits = (low > 9999999) ? 8 : 7;
    else digits = (low > 99999) ? 6 : 5;
  } else {
    u64 high = (x * 0x55E63B89) >> 57;
    low = x - (high * 100000000);
    digits = u32tostr_si16(high, s);
    digits += 8;
  }

  ll = (low * 109951163) >> 40;
  (low -= ll * 10000) |= ll << 32;
  ll = ((low * 5243) >> 19) & 0x000000FF000000FF;
  low -= ll * 100;
  low = (low << 16) | ll;
  ll = ((low * 103) >> 9) & 0x001E001E001E001E;
  low += ll * 3;
  ll = ((low & 0x00F000F000F000F0) >> 4) | (low & 0x000F000F000F000F) << 8;
  ll = (ll >> 32) | (ll << 32) | 0x3030303030303030;

  if (digits >= 8) memcpy(s + digits - 8, &ll, 8);
  else {
    u32 d = digits;
    char *s1 = s, *pll = &(((char *)&ll)[8 - digits]);
    if (d >= 4) {
      memcpy(s1, pll, 4);
      s1 += 4, pll += 4, d -= 4;
    }
    if (d >= 2) {
      memcpy(s1, pll, 2);
      s1 += 2, pll += 2, d -= 2;
    }
    if (d > 0) *(u8 *)s1 = *(u8 *)pll;
  }
  return digits;
}

}  // namespace tifa_libs


#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 6 "src/code/io/fastio.hpp"

namespace tifa_libs {
namespace fastio_impl_ {
//! UB if EOF occured during reading
template <u32 BUF>
class fastin {
  char bf_[BUF], *now_ = bf_, *end_ = bf_;
  FILE *f_;

 public:
  explicit fastin(FILE *f = stdin) : f_(f) {}

  char get() { return now_ == end_ && (end_ = (now_ = bf_) + fread(bf_, 1, BUF, f_), now_ == end_) ? EOF : *(now_)++; }
  char peek() { return now_ == end_ && (end_ = (now_ = bf_) + fread(bf_, 1, BUF, f_), now_ == end_) ? EOF : *(now_); }
  void rebind(FILE *f) {
    f_ = f;
    now_ = end_ = bf_;
  }

  bool iseof() { return peek() == EOF; }

  template <class T>
  requires(sint_c<T> && !char_c<T>)
  fastin &read(T &n) {
    bool is_neg = false;
    char ch = get();
    while (!isdigit(ch)) {
      is_neg |= ch == '-';
      ch = get();
    }
    n = 0;
    while (isdigit(ch)) {
      (n *= 10) += ch & 15;
      ch = get();
    }
    if (is_neg) n = -n;
    return *this;
  }
  template <class T>
  requires(uint_c<T> && !char_c<T>)
  fastin &read(T &n) {
    char ch = get();
    while (!isdigit(ch)) ch = get();
    n = 0;
    while (isdigit(ch)) {
      (n *= 10) += ch & 15;
      ch = get();
    }
    return *this;
  }
  template <mint_c T>
  fastin &read(T &n) {
    decltype(std::declval<T>().sval()) x;
    read(x);
    n = T(x);
    return *this;
  }
  //! ignore cntrl and space
  template <char_c T>
  fastin &read(T &n) {
    while (!isgraph(n = get()));
    return *this;
  }
  fastin &read(char *n) {
    char *n_ = n;
    while (!isgraph(*n_ = get()));
    while (isgraph(*(++n_) = get()));
    *n_ = '\0';
    return *this;
  }
  fastin &read(strn &n) {
    n.clear();
    char n_;
    while (!isgraph(n_ = get()));
    n.push_back(n_);
    while (isgraph(n_ = get())) n.push_back(n_);
    return *this;
  }
  template <class T, class U>
  fastin &read(std::pair<T, U> &p) { return read(p.first).read(p.second); }
  template <class... Ts>
  fastin &read(std::tuple<Ts...> &p) {
    std::apply([&](Ts &...targs) { ((read(targs)), ...); }, p);
    return *this;
  }
  template <container_c T>
  fastin &read(T &p) {
    if (p.begin() == p.end()) return *this;
    for (auto &i : p) read(i);
    return *this;
  }

  fastin &getline(char *n) {
    char *n_ = n;
    while (!isprint(*n_ = get()));
    while (isprint(*(++n_) = get()));
    *n_ = '\0';
    return *this;
  }
  fastin &getline(strn &n) {
    char n_;
    while (!isprint(n_ = get()));
    n.push_back(n_);
    while (isprint(n_ = get())) n.push_back(n_);
    return *this;
  }

  //! NOT ignore cntrl and space
  template <char_c T>
  fastin &strict_read(T &n) {
    n = get();
    return *this;
  }

  template <class T>
  fastin &operator>>(T &val) { return read(val); }
};
template <u32 BUF, u32 INTBUF>
class fastout {
  char int_bf_[INTBUF], *now_ib_ = int_bf_;

  FILE *f_;
  char *now_, bf_[BUF];
  const char *const end_ = bf_ + BUF;

 public:
  explicit fastout(FILE *file = stdout) : f_(file), now_(bf_) {}

  fastout &operator=(fastout const &r) {
    f_ = r.f_;
    now_ = bf_ + (r.now_ - r.bf_);
    memcpy(bf_, r.bf_, sizeof(*bf_) * (r.now_ - r.bf_));
    return *this;
  }
  fastout(fastout const &r) { *this = r; }

  ~fastout() { flush(); }

  void flush() {
    fwrite(bf_, 1, usz(now_ - bf_), f_);
    now_ = bf_;
  }
  void rebind(FILE *file) { f_ = file; }

  template <char_c T>
  fastout &write(T const &n) {
    if (now_ == end_) flush();
    *(now_++) = n;
    return *this;
  }
  fastout &write(const char *n) {
    usz len = strlen(n), l_;
    const char *n_ = n;
    while (now_ + len >= end_) {
      memcpy(now_, n_, l_ = usz(end_ - now_));
      now_ += l_;
      n_ += l_;
      len -= l_;
      flush();
    }
    memcpy(now_, n_, len);
    now_ += len;
    return *this;
  }
  template <class T>
  requires(sint_c<T> && !char_c<T>)
  fastout &write(T n) {
    if (n < 0) {
      write('-');
      n = -n;
    }
    return write(to_uint_t<T>(n));
  }
  template <class T>
  requires(uint_c<T> && !char_c<T>)
  fastout &write(T n) {
    if constexpr (sizeof(T) <= 4) {
      memset(now_ib_ = int_bf_, 0, 11);
      u32tostr(n, now_ib_);
      return write(now_ib_);
    }
    now_ib_ = int_bf_ + INTBUF - 1;
    do {
      *(--(now_ib_)) = char(n % 10) | '0';
    } while (n /= 10);
    return write(now_ib_);
  }
  template <mint_c T>
  fastout &write(T n) { return write(n.val()); }
  fastout &write(strn const &str) { return write(str.c_str()); }
  template <class T, class U>
  fastout &write(std::pair<T, U> const &p) { return write(p.first).space().write(p.second); }
  template <class... Ts>
  fastout &write(std::tuple<Ts...> const &p) {
    std::apply(
        [&](Ts const &...targs) {
          usz n{0};
          ((write(targs).space_if(++n != sizeof...(Ts))), ...);
        },
        p);
    return *this;
  }
  template <container_c T>
  fastout &write(T const &p) {
    if (p.begin() == p.end()) return *this;
    auto it = p.begin();
    write(*it++);
    for (; it != p.end(); ++it) space().write(*it);
    return *this;
  }

  fastout &linebreak() { return write('\n'); }
  fastout &linebreak_if(bool flag) { return flag ? linebreak() : *this; }
  fastout &space() { return write(' '); }
  fastout &space_if(bool flag) { return flag ? space() : *this; }

  template <class T>
  fastout &operator<<(T const &val) { return write(val); }
};
}  // namespace fastio_impl_

inline fastio_impl_::fastin<0x200005> fin;
inline fastio_impl_::fastout<0x200005, 41> fout;

}  // namespace tifa_libs


#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 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 6 "src/test_cpverifier/library-checker/dynamic_sequence_range_affine_range_sum.test.cpp"

using mint = tifa_libs::math::mint_s30<998244353>;
using T = std::pair<mint, usz>;   // sum len
using F = std::pair<mint, mint>;  // mul add

auto op(T a, T b) { return T{a.first + b.first, a.second + b.second}; }
auto e() { return T{0, 0}; }
auto mapping(F f, T a) {
  return T{f.first * a.first + f.second * a.second, a.second};
}
auto composition(F f, F g) {
  return F{f.first * g.first, f.first * g.second + f.second};
  /*
  g(x) = g.mul * x + g.add
  f(g(x)) = f.mul * (g.mul * x + g.add) + f.add = f.mul * g.mul * x + f.mul * g.add + f.add
  */
}
auto id() { return F(1, 0); }

int main() {
  u32 n, q;
  mint x, y;
  tifa_libs::fin >> n >> q;
  tifa_libs::ds::fhq_treap_w<T, op, e, F, mapping, composition, id, true> tr(n + q);
  for (u32 i = 0; i < n; ++i)
    tifa_libs::fin >> x, tr.insert(T{x, 1});
  for (u32 i = 0, opt, l, r; i < q; ++i) {
    tifa_libs::fin >> opt >> l;
    if (opt == 0) tifa_libs::fin >> x, tr.insert(T{x, 1}, l);
    else if (opt == 1) tr.erase(l);
    else if (opt == 2) tifa_libs::fin >> r, tr.reverse(l, r - 1);
    else if (opt == 3) tifa_libs::fin >> r >> x >> y, tr.update(l, r - 1, T(x, y));
    else tifa_libs::fin >> r, tifa_libs::fout << tr.query(l, r - 1).first << '\n';
  }
  return 0;
}

Test cases

Env Name Status Elapsed Memory
g++-12 example_00 :heavy_check_mark: AC 10 ms 6 MB
g++-12 extreme_insertion_00 :heavy_check_mark: AC 497 ms 38 MB
g++-12 extreme_insertion_01 :heavy_check_mark: AC 513 ms 37 MB
g++-12 extreme_insertion_02 :heavy_check_mark: AC 498 ms 39 MB
g++-12 max_00 :heavy_check_mark: AC 2391 ms 70 MB
g++-12 max_01 :heavy_check_mark: AC 2106 ms 69 MB
g++-12 max_02 :heavy_check_mark: AC 3532 ms 70 MB
g++-12 max_03 :heavy_check_mark: AC 3403 ms 69 MB
g++-12 max_04 :heavy_check_mark: AC 3470 ms 70 MB
g++-12 random_00 :heavy_check_mark: AC 2241 ms 57 MB
g++-12 random_01 :heavy_check_mark: AC 2407 ms 62 MB
g++-12 random_02 :heavy_check_mark: AC 1343 ms 35 MB
g++-12 random_03 :heavy_check_mark: AC 568 ms 34 MB
g++-12 random_04 :heavy_check_mark: AC 630 ms 31 MB
g++-12 small_00 :heavy_check_mark: AC 10 ms 6 MB
g++-12 small_01 :heavy_check_mark: AC 9 ms 6 MB
g++-12 small_02 :heavy_check_mark: AC 9 ms 6 MB
g++-12 small_03 :heavy_check_mark: AC 9 ms 6 MB
g++-12 small_04 :heavy_check_mark: AC 11 ms 6 MB
g++-12 small_05 :heavy_check_mark: AC 9 ms 6 MB
g++-12 small_06 :heavy_check_mark: AC 9 ms 6 MB
g++-12 small_07 :heavy_check_mark: AC 9 ms 6 MB
g++-12 small_08 :heavy_check_mark: AC 9 ms 6 MB
g++-12 small_09 :heavy_check_mark: AC 9 ms 6 MB
g++-12 wrong_avl_killer_00 :heavy_check_mark: AC 839 ms 37 MB
g++-12 wrong_avl_killer_01 :heavy_check_mark: AC 983 ms 38 MB
Back to top page