#ifdef NACHIA // #define _GLIBCXX_DEBUG #else #define NDEBUG #endif #include #include #include #include #include #include #include #include #include using namespace std; using i64 = long long; using u64 = unsigned long long; #define rep(i,n) for(i64 i=0; i<(i64)(n); i++) #define repr(i,n) for(i64 i=(i64)(n)-1; i>=0; i--) const i64 INF = 1001001001001001001; const char* yn(bool x){ return x ? "Yes" : "No"; } template void chmin(A& l, const A& r){ if(r < l) l = r; } template void chmax(A& l, const A& r){ if(l < r) l = r; } template using nega_queue = priority_queue,greater>; using Modint = atcoder::static_modint<998244353>; #include #include template struct vec; template struct seq_view{ using Ref = typename std::iterator_traits::reference; using Elem = typename std::iterator_traits::value_type; Iter a, b; Iter begin() const { return a; } Iter end() const { return b; } int size() const { return (int)(b-a); } seq_view(Iter first, Iter last) : a(first), b(last) {} seq_view sort() const { std::sort(a, b); return *this; } Ref& operator[](int x){ return *(a+x); } template, class ret = vec> ret sorti(F f = F()) const { ret x(size()); for(int i=0; i> ret col() const { return ret(begin(), end()); } template, class ret = vec>> ret rle(F eq = F()) const { auto x = ret(); for(auto& a : (*this)){ if(x.size() == 0 || !eq(x[x.size()-1].first, a)) x.emp(a, 1); else x[x.size()-1].second++; } return x; } template seq_view sort(F f) const { std::sort(a, b, f); return *this; } Iter uni() const { return std::unique(a, b); } Iter lb(const Elem& x) const { return std::lower_bound(a, b, x); } Iter ub(const Elem& x) const { return std::upper_bound(a, b, x); } int lbi(const Elem& x) const { return lb(x) - a; } int ubi(const Elem& x) const { return ub(x) - a; } seq_view bound(const Elem& l, const Elem& r) const { return { lb(l), lb(r) }; } template Iter lb(const Elem& x, F f) const { return std::lower_bound(a, b, x, f); } template Iter ub(const Elem& x, F f) const { return std::upper_bound(a, b, x, f); } template Iter when_true_to_false(F f) const { if(a == b) return a; return std::lower_bound(a, b, *a, [&](const Elem& x, const Elem&){ return f(x); }); } seq_view same(Elem x) const { return { lb(x), ub(x) }; } template auto map(F f) const { vec r; for(auto& x : *this) r.emp(f(x)); return r; } Iter max() const { return std::max_element(a, b); } Iter min() const { return std::min_element(a, b); } template> Iter min(F f) const { return std::min_element(a, b, f); } seq_view rev() const { std::reverse(a, b); return *this; } }; template struct vec { using Base = typename std::vector; using Iter = typename Base::iterator; using CIter = typename Base::const_iterator; using View = seq_view; using CView = seq_view; vec(){} explicit vec(int n, const Elem& value = Elem()) : a(0 vec(I2 first, I2 last) : a(first, last) {} vec(std::initializer_list il) : a(std::move(il)) {} vec(Base b) : a(std::move(b)) {} operator Base() const { return a; } Iter begin(){ return a.begin(); } CIter begin() const { return a.begin(); } Iter end(){ return a.end(); } CIter end() const { return a.end(); } int size() const { return a.size(); } bool empty() const { return a.empty(); } Elem& back(){ return a.back(); } const Elem& back() const { return a.back(); } vec sortunied(){ vec x = *this; x().sort(); x.a.erase(x().uni(), x.end()); return x; } Iter operator()(int x){ return a.begin() + x; } CIter operator()(int x) const { return a.begin() + x; } View operator()(int l, int r){ return { (*this)(l), (*this)(r) }; } CView operator()(int l, int r) const { return { (*this)(l), (*this)(r) }; } View operator()(){ return (*this)(0,size()); } CView operator()() const { return (*this)(0,size()); } Elem& operator[](int x){ return a[x]; } const Elem& operator[](int x) const { return a[x]; } Base& operator*(){ return a; } const Base& operator*() const { return a; } vec& push(Elem args){ a.push_back(std::move(args)); return *this; } template vec& emp(Args &&... args){ a.emplace_back(std::forward(args) ...); return *this; } template vec& app(Range& x){ for(auto& v : a) emp(v); } Elem pop(){ Elem x = std::move(a.back()); a.pop_back(); return x; } bool operator==(const vec& r) const { return a == r.a; } bool operator!=(const vec& r) const { return a != r.a; } bool operator<(const vec& r) const { return a < r.a; } bool operator<=(const vec& r) const { return a <= r.a; } bool operator>(const vec& r) const { return a > r.a; } bool operator>=(const vec& r) const { return a >= r.a; } vec> pile(int n) const { return vec>(n, *this); } template vec& filter(F f){ int p = 0; for(int q=0; q IStr& operator>>(IStr& is, vec>& v){ for(auto& x:v){ is >> x.first >> x.second; } return is; } template IStr& operator>>(IStr& is, vec& v){ for(auto& x:v){ is >> x; } return is; } template OStr& operator<<(OStr& os, const vec& v){ for(int i=0; i struct Segtree { private: int N; std::vector A; int xN; void mergev(int i){ if(i < N) A[i] = op(A[i*2], A[i*2+1]); } template int minLeft2(int r, E cmp, int a = 0, int b = 0, int i = -1) const { static S x; if(i == -1){ a=0; b=N; i=1; x=A[0]; } if(r <= a) return a; if(b <= r){ S nx = op(A[i], x); if(cmp(nx)){ x = nx; return a; } } if(b - a == 1) return b; int q = minLeft2(r, cmp, (a+b)/2, b, i*2+1); if(q > (a+b)/2) return q; return minLeft2(r, cmp, a, (a+b)/2, i*2); } template int maxRight2(int l, E cmp, int a = 0, int b = 0, int i = -1) const { static S x; if(i == -1){ a=0; b=N; i=1; x=A[0]; } if(b <= l) return b; if(l <= a){ S nx = op(x, A[i]); if(cmp(nx)){ x = nx; return b; } } if(b - a == 1) return a; int q = maxRight2(l, cmp, a, (a+b)/2, i*2); if(q < (a+b)/2) return q; return maxRight2(l, cmp, (a+b)/2, b, i*2+1); } public: Segtree() : N(0) {} Segtree(int n, S e) : xN(n) { N = 1; while (N < n) N *= 2; A.assign(N * 2, e); } Segtree(const std::vector& a, S e) : Segtree(a.size(), e){ for(int i=0; i<(int)a.size(); i++) A[i + N] = a[i]; for(int i=N-1; i>=1; i--) mergev(i); } void set(int p, S x){ p += N; A[p] = x; for(int d=1; (1<>d); } S get(int p) const { return A[N+p]; } S prod(int l, int r) const { l += N; r += N; S ql = A[0], qr = A[0]; while(l int minLeft(int r, E cmp) const { return minLeft2(r, cmp); } // bool cmp(S) template int maxRight(int l, E cmp) const { int x = maxRight2(l, cmp); return x > xN ? xN : x; } }; } // namespace nachia struct Node { i64 c01 = 0; i64 c02 = 0; i64 c03 = 0; i64 c04 = 0; i64 c05 = 0; i64 c12 = 0; i64 c13 = 0; i64 c14 = 0; i64 c15 = 0; i64 c24 = 0; i64 c25 = 0; i64 c34 = 0; i64 c35 = 0; i64 c45 = 0; }; Node nodeop(Node l, Node r){ Node a; a.c01 = r.c01 + l.c01; a.c02 = r.c02 + l.c01 * r.c12 + l.c02; a.c03 = r.c03 + l.c01 * r.c13 + l.c03; a.c04 = r.c04 + l.c01 * r.c14 + l.c02 * r.c24 + l.c03 * r.c34 + l.c04; a.c05 = r.c05 + l.c01 * r.c15 + l.c02 * r.c25 + l.c03 * r.c35 + l.c04 * r.c45 + l.c05; a.c12 = r.c12 + l.c12; a.c13 = r.c13 + l.c13; a.c14 = r.c14 + l.c12 * r.c24 + l.c13 * r.c34 + l.c14; a.c15 = r.c15 + l.c12 * r.c25 + l.c13 * r.c35 + l.c14 * r.c45 + l.c15; a.c24 = r.c24 + l.c24; a.c25 = r.c25 + l.c24 * r.c45 + l.c25; a.c34 = r.c34 + l.c34; a.c35 = r.c35 + l.c34 * r.c45 + l.c35; a.c45 = r.c45 + l.c45; return a; } Node nodee(){ Node res; return res; } void testcase(){ using Segtree = nachia::Segtree; int N, Q; cin >> N >> Q; Node a0 = nodee(); a0.c01 = a0.c02 = a0.c12 = a0.c34 = a0.c35 = a0.c45 = 1; Node a1 = nodee(); a1.c01 = a1.c03 = a1.c13 = a1.c24 = a1.c25 = a1.c45 = 1; vec buf(N); string S; cin >> S; rep(i,N) buf[i] = (S[i] == '0' ? a0 : a1); auto st = Segtree(*buf, nodee()); rep(qi,Q){ int t; cin >> t; if(t == 1){ int i; cin >> i; i--; if(S[i] == '0'){ st.set(i, a1); S[i] = '1'; } else { st.set(i, a0); S[i] = '0'; } } else { int l,r; cin >> l >> r; l--; Modint ans = st.prod(l,r).c05; cout << ans.val() << '\n'; } } } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); #ifdef NACHIA int T; cin >> T; for(int t=0; t