sotanishy's code snippets for competitive programming
View the Project on GitHub sotanishy/cp-library-cpp
#define PROBLEM "https://judge.yosupo.jp/problem/range_affine_point_get" #include <bits/stdc++.h> #include "../../data-structure/segtree/dual_segment_tree.hpp" #include "../../math/modint.hpp" using namespace std; using mint = Modint<998244353>; struct AffineMonoid { using T = std::pair<mint, mint>; static T id() { return {1, 0}; } static T op(T a, T b) { return {a.first * b.first, a.second * b.first + b.second}; } }; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int N, Q; cin >> N >> Q; vector<mint> a(N); for (auto& x : a) cin >> x; DualSegmentTree<AffineMonoid> st(N); for (int i = 0; i < Q; i++) { int t; cin >> t; if (t == 0) { int l, r, b, c; cin >> l >> r >> b >> c; st.update(l, r, {b, c}); } else { int i; cin >> i; auto f = st[i]; cout << (f.first * a[i] + f.second) << "\n"; } } }
#line 1 "test/yosupo/range_affine_point_get.test.cpp" #define PROBLEM "https://judge.yosupo.jp/problem/range_affine_point_get" #include <bits/stdc++.h> #line 2 "data-structure/segtree/dual_segment_tree.hpp" #include <bit> #line 4 "data-structure/segtree/dual_segment_tree.hpp" template <typename M> class DualSegmentTree { using T = typename M::T; public: DualSegmentTree() = default; explicit DualSegmentTree(int n) : size(std::bit_ceil((unsigned int)n)), height(std::bit_width((unsigned int)size) - 1), lazy(2 * size, M::id()) {} T operator[](int k) { k += size; propagate(k); return lazy[k]; } void update(int l, int r, const T& x) { if (l >= r) return; l += size; r += size; propagate(l); propagate(r - 1); for (; l < r; l >>= 1, r >>= 1) { if (l & 1) lazy[l] = M::op(lazy[l], x), ++l; if (r & 1) --r, lazy[r] = M::op(lazy[r], x); } } private: int size, height; std::vector<T> lazy; void push(int k) { if (lazy[k] == M::id()) return; lazy[2 * k] = M::op(lazy[2 * k], lazy[k]); lazy[2 * k + 1] = M::op(lazy[2 * k + 1], lazy[k]); lazy[k] = M::id(); } void propagate(int k) { for (int i = height; i > 0; --i) push(k >> i); } }; #line 4 "math/modint.hpp" /** * @brief Mod int */ template <int m> class Modint { using mint = Modint; static_assert(m > 0, "Modulus must be positive"); public: static constexpr int mod() { return m; } constexpr Modint(long long y = 0) : x(y >= 0 ? y % m : (y % m + m) % m) {} constexpr int val() const { return x; } constexpr mint& operator+=(const mint& r) { if ((x += r.x) >= m) x -= m; return *this; } constexpr mint& operator-=(const mint& r) { if ((x += m - r.x) >= m) x -= m; return *this; } constexpr mint& operator*=(const mint& r) { x = static_cast<int>(1LL * x * r.x % m); return *this; } constexpr mint& operator/=(const mint& r) { return *this *= r.inv(); } constexpr bool operator==(const mint& r) const { return x == r.x; } constexpr mint operator+() const { return *this; } constexpr mint operator-() const { return mint(-x); } constexpr friend mint operator+(const mint& l, const mint& r) { return mint(l) += r; } constexpr friend mint operator-(const mint& l, const mint& r) { return mint(l) -= r; } constexpr friend mint operator*(const mint& l, const mint& r) { return mint(l) *= r; } constexpr friend mint operator/(const mint& l, const mint& r) { return mint(l) /= r; } constexpr mint inv() const { int a = x, b = m, u = 1, v = 0; while (b > 0) { int t = a / b; std::swap(a -= t * b, b); std::swap(u -= t * v, v); } return mint(u); } constexpr mint pow(long long n) const { mint 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 mint& r) { return os << r.x; } friend std::istream& operator>>(std::istream& is, mint& r) { long long t; is >> t; r = mint(t); return is; } private: int x; }; #line 7 "test/yosupo/range_affine_point_get.test.cpp" using namespace std; using mint = Modint<998244353>; struct AffineMonoid { using T = std::pair<mint, mint>; static T id() { return {1, 0}; } static T op(T a, T b) { return {a.first * b.first, a.second * b.first + b.second}; } }; int main() { ios_base::sync_with_stdio(false); cin.tie(0); int N, Q; cin >> N >> Q; vector<mint> a(N); for (auto& x : a) cin >> x; DualSegmentTree<AffineMonoid> st(N); for (int i = 0; i < Q; i++) { int t; cin >> t; if (t == 0) { int l, r, b, c; cin >> l >> r >> b >> c; st.update(l, r, {b, c}); } else { int i; cin >> i; auto f = st[i]; cout << (f.first * a[i] + f.second) << "\n"; } } }