compro_library
This documentation is automatically generated by online-judge-tools/verification-helper
test/library-checker/data-structure/range-affine-point-get/lazysegtree.test.cpp
- View this file on GitHub
- Last update: 2025-12-29 15:38:26+09:00
- Problem: https://judge.yosupo.jp/problem/range_affine_point_get
Depends on
Code
#define PROBLEM "https://judge.yosupo.jp/problem/range_affine_point_get"
#include "../../../../template/template.cpp"
#include "../../../../data-structure/segtree/lazy-segtree.hpp"
#include "../../../../modint/modint.hpp"
using mint = ModInt<MOD2>;
struct MonoidAct {
struct S {
mint sum;
int len;
S() {}
S(mint sum, int len): sum(sum), len(len) {}
};
using F = pair<mint, mint>;
using value_type_S = S;
using value_type_F = F;
inline static S op(const S &a, const S &b) {
return S(a.sum + b.sum, a.len + b.len);
}
inline static S e() { return S(0, 0); }
inline static S mapping(const F &f, const S &x) {
return S(f.first * x.sum + f.second * x.len, x.len);
}
inline static F composition(const F &f, const F &g) {
return {f.first * g.first, f.first * g.second + f.second};
}
inline static F id() { return {1, 0}; }
};
int main() {
INT(N, Q);
LazySegtree<MonoidAct> seg(N);
REP(i, N) {
INT(a);
seg.set(i, MonoidAct::S(a, 1));
}
REP(qid, Q) {
INT(type);
if (type == 0) {
INT(l, r, b, c);
seg.apply(l, r, {b, c});
} else {
INT(i);
print(seg.get(i).sum);
}
}
}#line 1 "test/library-checker/data-structure/range-affine-point-get/lazysegtree.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/range_affine_point_get"
#line 1 "template/template.cpp"
#pragma region Macros
#include <bits/stdc++.h>
using namespace std;
// input output utils
namespace siro53_io {
// https://maspypy.github.io/library/other/io_old.hpp
struct has_val_impl {
template <class T>
static auto check(T &&x) -> decltype(x.val(), std::true_type{});
template <class T> static auto check(...) -> std::false_type;
};
template <class T>
class has_val : public decltype(has_val_impl::check<T>(std::declval<T>())) {
};
// debug
template <class T, enable_if_t<is_integral<T>::value, int> = 0>
void dump(const T t) {
cerr << t;
}
template <class T, enable_if_t<is_floating_point<T>::value, int> = 0>
void dump(const T t) {
cerr << t;
}
template <class T, typename enable_if<has_val<T>::value>::type * = nullptr>
void dump(const T &t) {
cerr << t.val();
}
void dump(__int128_t n) {
if(n == 0) {
cerr << '0';
return;
} else if(n < 0) {
cerr << '-';
n = -n;
}
string s;
while(n > 0) {
s += (char)('0' + n % 10);
n /= 10;
}
reverse(s.begin(), s.end());
cerr << s;
}
void dump(const string &s) { cerr << s; }
void dump(const char *s) {
int n = (int)strlen(s);
for(int i = 0; i < n; i++) cerr << s[i];
}
template <class T1, class T2> void dump(const pair<T1, T2> &p) {
cerr << '(';
dump(p.first);
cerr << ',';
dump(p.second);
cerr << ')';
}
template <class T> void dump(const vector<T> &v) {
cerr << '{';
for(int i = 0; i < (int)v.size(); i++) {
dump(v[i]);
if(i < (int)v.size() - 1) cerr << ',';
}
cerr << '}';
}
template <class T> void dump(const set<T> &s) {
cerr << '{';
for(auto it = s.begin(); it != s.end(); it++) {
dump(*it);
if(next(it) != s.end()) cerr << ',';
}
cerr << '}';
}
template <class Key, class Value> void dump(const map<Key, Value> &mp) {
cerr << '{';
for(auto it = mp.begin(); it != mp.end(); it++) {
dump(*it);
if(next(it) != mp.end()) cerr << ',';
}
cerr << '}';
}
template <class Key, class Value>
void dump(const unordered_map<Key, Value> &mp) {
cerr << '{';
for(auto it = mp.begin(); it != mp.end(); it++) {
dump(*it);
if(next(it) != mp.end()) cerr << ',';
}
cerr << '}';
}
template <class T> void dump(const deque<T> &v) {
cerr << '{';
for(int i = 0; i < (int)v.size(); i++) {
dump(v[i]);
if(i < (int)v.size() - 1) cerr << ',';
}
cerr << '}';
}
template <class T> void dump(queue<T> q) {
cerr << '{';
while(!q.empty()) {
dump(q.front());
if((int)q.size() > 1) cerr << ',';
q.pop();
}
cerr << '}';
}
void debug_print() { cerr << endl; }
template <class Head, class... Tail>
void debug_print(const Head &h, const Tail &...t) {
dump(h);
if(sizeof...(Tail)) dump(' ');
debug_print(t...);
}
// print
template <class T, enable_if_t<is_integral<T>::value, int> = 0>
void print_single(const T t) {
cout << t;
}
template <class T, enable_if_t<is_floating_point<T>::value, int> = 0>
void print_single(const T t) {
cout << t;
}
template <class T, typename enable_if<has_val<T>::value>::type * = nullptr>
void print_single(const T t) {
cout << t.val();
}
void print_single(__int128_t n) {
if(n == 0) {
cout << '0';
return;
} else if(n < 0) {
cout << '-';
n = -n;
}
string s;
while(n > 0) {
s += (char)('0' + n % 10);
n /= 10;
}
reverse(s.begin(), s.end());
cout << s;
}
void print_single(const string &s) { cout << s; }
void print_single(const char *s) {
int n = (int)strlen(s);
for(int i = 0; i < n; i++) cout << s[i];
}
template <class T1, class T2> void print_single(const pair<T1, T2> &p) {
print_single(p.first);
cout << ' ';
print_single(p.second);
}
template <class T> void print_single(const vector<T> &v) {
for(int i = 0; i < (int)v.size(); i++) {
print_single(v[i]);
if(i < (int)v.size() - 1) cout << ' ';
}
}
template <class T> void print_single(const set<T> &s) {
for(auto it = s.begin(); it != s.end(); it++) {
print_single(*it);
if(next(it) != s.end()) cout << ' ';
}
}
template <class T> void print_single(const deque<T> &v) {
for(int i = 0; i < (int)v.size(); i++) {
print_single(v[i]);
if(i < (int)v.size() - 1) cout << ' ';
}
}
template <class T> void print_single(queue<T> q) {
while(!q.empty()) {
print_single(q.front());
if((int)q.size() > 1) cout << ' ';
q.pop();
}
}
void print() { cout << '\n'; }
template <class Head, class... Tail>
void print(const Head &h, const Tail &...t) {
print_single(h);
if(sizeof...(Tail)) print_single(' ');
print(t...);
}
// input
template <class T, enable_if_t<is_integral<T>::value, int> = 0>
void input_single(T &t) {
cin >> t;
}
template <class T, enable_if_t<is_floating_point<T>::value, int> = 0>
void input_single(T &t) {
cin >> t;
}
template <class T, typename enable_if<has_val<T>::value>::type * = nullptr>
void input_single(T &t) {
cin >> t;
}
void input_single(__int128_t &n) {
string s;
cin >> s;
if(s == "0") {
n = 0;
return;
}
bool is_minus = false;
if(s[0] == '-') {
s = s.substr(1);
is_minus = true;
}
n = 0;
for(int i = 0; i < (int)s.size(); i++) n = n * 10 + (int)(s[i] - '0');
if(is_minus) n = -n;
}
void input_single(string &s) { cin >> s; }
template <class T1, class T2> void input_single(pair<T1, T2> &p) {
input_single(p.first);
input_single(p.second);
}
template <class T> void input_single(vector<T> &v) {
for(auto &e : v) input_single(e);
}
void input() {}
template <class Head, class... Tail> void input(Head &h, Tail &...t) {
input_single(h);
input(t...);
}
}; // namespace siro53_io
#ifdef DEBUG
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debug_print(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif
// io setup
struct Setup {
Setup() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} __Setup;
using namespace siro53_io;
// types
using ll = long long;
using i128 = __int128_t;
// input macros
#define INT(...) \
int __VA_ARGS__; \
input(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
input(__VA_ARGS__)
#define STRING(...) \
string __VA_ARGS__; \
input(__VA_ARGS__)
#define CHAR(...) \
char __VA_ARGS__; \
input(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
input(__VA_ARGS__)
#define LD(...) \
long double __VA_ARGS__; \
input(__VA_ARGS__)
#define UINT(...) \
unsigned int __VA_ARGS__; \
input(__VA_ARGS__)
#define ULL(...) \
unsigned long long __VA_ARGS__; \
input(__VA_ARGS__)
#define VEC(name, type, len) \
vector<type> name(len); \
input(name);
#define VEC2(name, type, len1, len2) \
vector name(len1, vector<type>(len2)); \
input(name);
// other macros
// https://trap.jp/post/1224/
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define REP1(i, n) for(int i = 0; i < int(n); i++)
#define REP2(i, a, b) for(int i = (a); i < int(b); i++)
#define REP(...) OVERLOAD3(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define SORT(v) sort(ALL(v))
#define RSORT(v) sort(RALL(v))
#define UNIQUE(v) \
sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end()), v.shrink_to_fit()
#define REV(v) reverse(ALL(v))
#define SZ(v) ((int)(v).size())
#define MIN(v) (*min_element(ALL(v)))
#define MAX(v) (*max_element(ALL(v)))
// util const
const int INF = 1 << 30;
const ll LLINF = 1LL << 60;
constexpr int MOD = 1000000007;
constexpr int MOD2 = 998244353;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
// util functions
void Case(int i) { cout << "Case #" << i << ": "; }
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
template <class T> inline bool chmax(T &a, T b) {
return (a < b ? a = b, true : false);
}
template <class T> inline bool chmin(T &a, T b) {
return (a > b ? a = b, true : false);
}
template <class T, int dim>
auto make_vector_impl(vector<int>& sizes, const T &e) {
if constexpr(dim == 1) {
return vector(sizes[0], e);
} else {
int n = sizes[dim - 1];
sizes.pop_back();
return vector(n, make_vector_impl<T, dim - 1>(sizes, e));
}
}
template <class T, int dim>
auto make_vector(const int (&sizes)[dim], const T &e = T()) {
vector<int> s(dim);
for(int i = 0; i < dim; i++) s[i] = sizes[dim - i - 1];
return make_vector_impl<T, dim>(s, e);
}
vector<int> iota_gen(int n, int start = 0) {
vector<int> ord(n);
iota(ord.begin(), ord.end(), start);
return ord;
}
template<typename T>
vector<int> ord_sort(const vector<T>& v, bool greater = false) {
auto ord = iota_gen((int)v.size());
sort(ALL(ord), [&](int i, int j) {
if(greater) return v[i] > v[j];
return v[i] < v[j];
});
return ord;
}
#pragma endregion Macros
#line 2 "data-structure/segtree/lazy-segtree.hpp"
#line 5 "data-structure/segtree/lazy-segtree.hpp"
template<class MonoidAct> class LazySegtree {
public:
using S = typename MonoidAct::value_type_S;
using F = typename MonoidAct::value_type_F;
LazySegtree(): LazySegtree(0) {}
explicit LazySegtree(int n): LazySegtree(std::vector<S>(n, MonoidAct::e())) {}
explicit LazySegtree(const std::vector<S> &v): N((int)v.size()), sz(1), lg(0) {
while(sz < N) {
sz <<= 1;
lg++;
}
node.resize(sz * 2, MonoidAct::e());
lazy.resize(sz, MonoidAct::id());
for(int i = 0; i < N; i++) node[i + sz] = v[i];
for(int i = sz - 1; i >= 1; i--) update(i);
}
void set(int pos, S val) {
assert(0 <= pos && pos < N);
pos += sz;
for(int i = lg; i >= 1; i--) propagate(pos >> i);
node[pos] = val;
for(int i = 1; i <= lg; i++) update(pos >> i);
}
S get(int pos) {
assert(0 <= pos and pos < N);
pos += sz;
for(int i = lg; i >= 1; i--) propagate(pos >> i);
return node[pos];
}
S prod(int l, int r) {
assert(0 <= l and l <= r and r <= N);
if (l == r) return MonoidAct::e();
l += sz;
r += sz;
for(int i = lg; i >= 1; i--) {
if (((l >> i) << i) != l) propagate(l >> i);
if (((r >> i) << i) != r) propagate((r - 1) >> i);
}
S vl = MonoidAct::e(), vr = MonoidAct::e();
while(l < r) {
if (l & 1) vl = MonoidAct::op(vl, node[l++]);
if (r & 1) vr = MonoidAct::op(node[--r], vr);
l >>= 1;
r >>= 1;
}
return MonoidAct::op(vl, vr);
}
S all_prod() const { return node[1]; }
void apply(int pos, F f) {
assert(0 <= pos and pos < N);
pos += sz;
for(int i = lg; i >= 1; i--) propagate(pos >> i);
node[pos] = MonoidAct::mapping(f, node[pos]);
for(int i = 1; i <= lg; i++) update(pos >> i);
}
void apply(int l, int r, F f) {
assert(0 <= l and l <= r and r <= N);
if (l == r) return;
l += sz;
r += sz;
for(int i = lg; i >= 1; i--) {
if (((l >> i) << i) != l) propagate(l >> i);
if (((r >> i) << i) != r) propagate((r - 1) >> i);
}
{
int tmp_l = l, tmp_r = r;
while(l < r) {
if (l & 1) apply_node(l++, f);
if (r & 1) apply_node(--r, f);
l >>= 1;
r >>= 1;
}
l = tmp_l, r = tmp_r;
}
for(int i = 1; i <= lg; i++) {
if (((l >> i) << i) != l) update(l >> i);
if (((r >> i) << i) != r) update((r - 1) >> i);
}
}
template <class G> int max_right(int l, G g) {
assert(0 <= l and l <= N);
assert(g(MonoidAct::e()));
if (l == N) return N;
l += sz;
for(int i = lg; i >= 1; i--) propagate(l >> i);
S now = MonoidAct::e();
do {
while ((l & 1) == 0) l >>= 1;
if (!g(MonoidAct::op(now, node[l]))) {
while (l < sz) {
propagate(l);
l <<= 1;
if (g(MonoidAct::op(now, node[l]))) {
now = MonoidAct::op(now, node[l]);
l++;
}
}
return l - sz;
}
now = MonoidAct::op(now, node[l]);
l++;
} while ((l & -l) != l);
return N;
}
template <class G> int min_left(int r, G g) {
assert(0 <= r and r <= N);
assert(g(MonoidAct::e()));
if (r == 0) return 0;
r += sz;
for(int i = lg; i >= 1; i--) propagate((r - 1) >> i);
S now = MonoidAct::e();
do {
r--;
while (r > 1 and (r & 1) == 0) r >>= 1;
if (!g(MonoidAct::op(node[r], now))) {
while (r < sz) {
propagate(r);
r = (r << 1) + 1;
if (g(MonoidAct::op(node[r], now))) {
now = MonoidAct::op(node[r], now);
r--;
}
}
return r + 1 - sz;
}
now = MonoidAct::op(node[r], now);
} while((r & -r) != r);
return 0;
}
private:
int N, sz, lg;
std::vector<S> node;
std::vector<F> lazy;
void update(int i) {
node[i] = MonoidAct::op(node[i << 1], node[(i << 1) | 1]);
}
void apply_node(int i, F f) {
node[i] = MonoidAct::mapping(f, node[i]);
if (i < sz) lazy[i] = MonoidAct::composition(f, lazy[i]);
}
void propagate(int i) {
apply_node(i << 1, lazy[i]);
apply_node(i << 1 | 1, lazy[i]);
lazy[i] = MonoidAct::id();
}
};
#line 2 "modint/modint.hpp"
#line 6 "modint/modint.hpp"
template <int mod> class ModInt {
public:
ModInt() : x(0) {}
ModInt(long long y)
: x(y >= 0 ? y % umod() : (umod() - (-y) % umod()) % umod()) {}
unsigned int val() const { return x; }
ModInt &operator+=(const ModInt &p) {
if((x += p.x) >= umod()) x -= umod();
return *this;
}
ModInt &operator-=(const ModInt &p) {
if((x += umod() - p.x) >= umod()) x -= umod();
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (unsigned int)(1ULL * x * p.x % umod());
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inv();
return *this;
}
ModInt operator-() const { return ModInt(-(long long)x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inv() const {
long long a = x, b = mod, u = 1, v = 0, t;
while(b > 0) {
t = a / b;
std::swap(a -= t * b, b);
std::swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(unsigned long long n) const {
ModInt ret(1), mul(x);
while(n > 0) {
if(n & 1) ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend std::ostream &operator<<(std::ostream &os, const ModInt &p) {
return os << p.x;
}
friend std::istream &operator>>(std::istream &is, ModInt &a) {
long long t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static constexpr int get_mod() { return mod; }
private:
unsigned int x;
static constexpr unsigned int umod() { return mod; }
};
#line 5 "test/library-checker/data-structure/range-affine-point-get/lazysegtree.test.cpp"
using mint = ModInt<MOD2>;
struct MonoidAct {
struct S {
mint sum;
int len;
S() {}
S(mint sum, int len): sum(sum), len(len) {}
};
using F = pair<mint, mint>;
using value_type_S = S;
using value_type_F = F;
inline static S op(const S &a, const S &b) {
return S(a.sum + b.sum, a.len + b.len);
}
inline static S e() { return S(0, 0); }
inline static S mapping(const F &f, const S &x) {
return S(f.first * x.sum + f.second * x.len, x.len);
}
inline static F composition(const F &f, const F &g) {
return {f.first * g.first, f.first * g.second + f.second};
}
inline static F id() { return {1, 0}; }
};
int main() {
INT(N, Q);
LazySegtree<MonoidAct> seg(N);
REP(i, N) {
INT(a);
seg.set(i, MonoidAct::S(a, 1));
}
REP(qid, Q) {
INT(type);
if (type == 0) {
INT(l, r, b, c);
seg.apply(l, r, {b, c});
} else {
INT(i);
print(seg.get(i).sum);
}
}
}