This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub ningenMe/compro-library
#define PROBLEM "https://judge.yosupo.jp/problem/point_set_range_composite" #include <vector> #include <iostream> #include <cassert> using namespace std; #include "../../lib/10-segment-tree/SegmentTree.cpp" #include "../../lib/00-util/ModInt.cpp" #include "../../lib/99-operator/monoid/MonoidRangeCompositePointUpdate.cpp" using modint = ModInt<998244353>; int main(){ cin.tie(0);ios::sync_with_stdio(false); int N,Q; cin >> N >> Q; vector<pair<modint,modint>> A(N); for(int i = 0; i < N; ++i) { cin >> A[i].first >> A[i].second; } SegmentTree<MonoidRangeCompositePointUpdate<pair<modint,modint>>> seg(A); while(Q--){ long long q,l,r,x; cin >> q >> l >> r >> x; if(q) { auto p = seg.fold(l,r); cout << p.first*x+p.second << endl; } else seg.operate(l,{r,x}); } }
#line 1 "test/segment-tree/SegmentTree-rcq.test.cpp" #define PROBLEM "https://judge.yosupo.jp/problem/point_set_range_composite" #include <vector> #include <iostream> #include <cassert> using namespace std; #line 1 "lib/10-segment-tree/SegmentTree.cpp" /* * @title SegmentTree - 非再帰抽象化セグメント木 * @docs md/segment-tree/SegmentTree.md */ template<class Monoid> class SegmentTree { using TypeNode = typename Monoid::TypeNode; size_t length; size_t num; vector<TypeNode> node; vector<pair<int,int>> range; inline void build() { for (int i = length - 1; i >= 0; --i) node[i] = Monoid::func_fold(node[(i<<1)+0],node[(i<<1)+1]); range.resize(2 * length); for (int i = 0; i < length; ++i) range[i+length] = make_pair(i,i+1); for (int i = length - 1; i >= 0; --i) range[i] = make_pair(range[(i<<1)+0].first,range[(i<<1)+1].second); } public: //unitで初期化 SegmentTree(const size_t num): num(num) { for (length = 1; length <= num; length *= 2); node.resize(2 * length, Monoid::unit_node); build(); } //vectorで初期化 SegmentTree(const vector<TypeNode> & vec) : num(vec.size()) { for (length = 1; length <= vec.size(); length *= 2); node.resize(2 * length, Monoid::unit_node); for (int i = 0; i < vec.size(); ++i) node[i + length] = vec[i]; build(); } //同じinitで初期化 SegmentTree(const size_t num, const TypeNode init) : num(num) { for (length = 1; length <= num; length *= 2); node.resize(2 * length, Monoid::unit_node); for (int i = 0; i < length; ++i) node[i+length] = init; build(); } //[idx,idx+1) void operate(size_t idx, const TypeNode var) { if(idx < 0 || length <= idx) return; idx += length; node[idx] = Monoid::func_operate(node[idx],var); while(idx >>= 1) node[idx] = Monoid::func_fold(node[(idx<<1)+0],node[(idx<<1)+1]); } //[l,r) TypeNode fold(int l, int r) { if (l < 0 || length <= l || r < 0 || length < r) return Monoid::unit_node; TypeNode vl = Monoid::unit_node, vr = Monoid::unit_node; for(l += length, r += length; l < r; l >>=1, r >>=1) { if(l&1) vl = Monoid::func_fold(vl,node[l++]); if(r&1) vr = Monoid::func_fold(node[--r],vr); } return Monoid::func_fold(vl,vr); } //range[l,r) return [l,r] search max right int prefix_binary_search(int l, int r, TypeNode var) { assert(0 <= l && l < length && 0 < r && r <= length); TypeNode ret = Monoid::unit_node; size_t off = l; for(size_t idx = l+length; idx < 2*length && off < r; ){ if(range[idx].second<=r && !Monoid::func_check(Monoid::func_fold(ret,node[idx]),var)) { ret = Monoid::func_fold(ret,node[idx]); off = range[idx++].second; if(!(idx&1)) idx >>= 1; } else{ idx <<=1; } } return off; } //range(l,r] return [l,r] search max left int suffix_binary_search(const int l, const int r, const TypeNode var) { assert(-1 <= l && l < (int)length-1 && 0 <= r && r < length); TypeNode ret = Monoid::unit_node; int off = r; for(size_t idx = r+length; idx < 2*length && l < off; ){ if(l < range[idx].first && !Monoid::func_check(Monoid::func_fold(node[idx],ret),var)) { ret = Monoid::func_fold(node[idx],ret); off = range[idx--].first-1; if(idx&1) idx >>= 1; } else{ idx = (idx<<1)+1; } } return off; } void print(){ // cout << "node" << endl; // for(int i = 1,j = 1; i < 2*length; ++i) { // cout << node[i] << " "; // if(i==((1<<j)-1) && ++j) cout << endl; // } cout << "vector" << endl; cout << "{ " << fold(0,1); for(int i = 1; i < length; ++i) cout << ", " << fold(i,i+1); cout << " }" << endl; } }; #line 1 "lib/00-util/ModInt.cpp" /* * @title ModInt * @docs md/util/ModInt.md */ template<long long mod> class ModInt { public: long long x; constexpr ModInt():x(0) {} constexpr ModInt(long long y) : x(y>=0?(y%mod): (mod - (-y)%mod)%mod) {} constexpr ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;} constexpr ModInt &operator+=(const long long y) {ModInt p(y);if((x += p.x) >= mod) x -= mod;return *this;} constexpr ModInt &operator+=(const int y) {ModInt p(y);if((x += p.x) >= mod) x -= mod;return *this;} constexpr ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;} constexpr ModInt &operator-=(const long long y) {ModInt p(y);if((x += mod - p.x) >= mod) x -= mod;return *this;} constexpr ModInt &operator-=(const int y) {ModInt p(y);if((x += mod - p.x) >= mod) x -= mod;return *this;} constexpr ModInt &operator*=(const ModInt &p) {x = (x * p.x % mod);return *this;} constexpr ModInt &operator*=(const long long y) {ModInt p(y);x = (x * p.x % mod);return *this;} constexpr ModInt &operator*=(const int y) {ModInt p(y);x = (x * p.x % mod);return *this;} constexpr ModInt &operator^=(const ModInt &p) {x = (x ^ p.x) % mod;return *this;} constexpr ModInt &operator^=(const long long y) {ModInt p(y);x = (x ^ p.x) % mod;return *this;} constexpr ModInt &operator^=(const int y) {ModInt p(y);x = (x ^ p.x) % mod;return *this;} constexpr ModInt &operator/=(const ModInt &p) {*this *= p.inv();return *this;} constexpr ModInt &operator/=(const long long y) {ModInt p(y);*this *= p.inv();return *this;} constexpr ModInt &operator/=(const int y) {ModInt p(y);*this *= p.inv();return *this;} constexpr ModInt operator=(const int y) {ModInt p(y);*this = p;return *this;} constexpr ModInt operator=(const long long y) {ModInt p(y);*this = p;return *this;} constexpr ModInt operator-() const {return ModInt(-x); } constexpr ModInt operator++() {x++;if(x>=mod) x-=mod;return *this;} constexpr ModInt operator--() {x--;if(x<0) x+=mod;return *this;} constexpr ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } constexpr ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } constexpr ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } constexpr ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } constexpr ModInt operator^(const ModInt &p) const { return ModInt(*this) ^= p; } constexpr bool operator==(const ModInt &p) const { return x == p.x; } constexpr bool operator!=(const ModInt &p) const { return x != p.x; } // ModInt inv() const {int a=x,b=mod,u=1,v=0,t;while(b > 0) {t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);} return ModInt(u);} constexpr ModInt inv() const {int a=x,b=mod,u=1,v=0,t=0,tmp=0;while(b > 0) {t = a / b;a-=t*b;tmp=a;a=b;b=tmp;u-=t*v;tmp=u;u=v;v=tmp;} return ModInt(u);} constexpr ModInt pow(long long n) const {ModInt ret(1), mul(x);for(;n > 0;mul *= mul,n >>= 1) if(n & 1) ret *= mul;return ret;} friend ostream &operator<<(ostream &os, const ModInt &p) {return os << p.x;} friend istream &operator>>(istream &is, ModInt &a) {long long t;is >> t;a = ModInt<mod>(t);return (is);} }; constexpr long long MOD_998244353 = 998244353; constexpr long long MOD_1000000007 = 1'000'000'000LL + 7; //' #line 1 "lib/99-operator/monoid/MonoidRangeCompositePointUpdate.cpp" /* * @title MonoidRangeCompositePointUpdate - [区間一次関数, 点更新] * @docs md/operator/monoid/MonoidRangeCompositePointUpdate.md */ template<class T> struct MonoidRangeCompositePointUpdate { using TypeNode = T; inline static constexpr TypeNode unit_node = make_pair(1,0); inline static constexpr TypeNode func_fold(TypeNode l,TypeNode r){return {r.first*l.first,r.first*l.second+r.second};} inline static constexpr TypeNode func_operate(TypeNode l,TypeNode r){return r;} inline static constexpr bool func_check(TypeNode nodeVal,TypeNode var){return var == nodeVal;} }; #line 10 "test/segment-tree/SegmentTree-rcq.test.cpp" using modint = ModInt<998244353>; int main(){ cin.tie(0);ios::sync_with_stdio(false); int N,Q; cin >> N >> Q; vector<pair<modint,modint>> A(N); for(int i = 0; i < N; ++i) { cin >> A[i].first >> A[i].second; } SegmentTree<MonoidRangeCompositePointUpdate<pair<modint,modint>>> seg(A); while(Q--){ long long q,l,r,x; cin >> q >> l >> r >> x; if(q) { auto p = seg.fold(l,r); cout << p.first*x+p.second << endl; } else seg.operate(l,{r,x}); } }