#1178618 (C++23(gcc16)) No.2762 Counting and Deleting

• 問題: No.2762 Counting and Deleting
• ユーザー: detteiuu
• 提出日時: 2026-08-23 22:00:36
• 言語: C++23(gcc16) (gcc 16.1.0 + boost 1.92.0)
• 結果: AC
• 実行時間: 106 ms / 4,000 ms
• コード長: 2,769 bytes
• コンパイル時間: 4,893 ms
• コンパイル使用メモリ: 390,640 KB
• 実行使用メモリ: 10,368 KB
• 最終ジャッジ日時: 2026-08-23 22:00:54
• 合計ジャッジ時間: 8,650 ms
• ジャッジサーバーID （参考情報）: judge2_0 / judge3_0

ファイルパターン	結果
sample	AC * 2
other	AC * 15

ソースコード

#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;

#define pass (void)0
#define INF (1<<30)-1
#define INFLL (1LL<<60)-1
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define repr2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define YesNo(cond) cout << ((cond) ? "Yes\n" : "No\n")
#define YESNO(cond) cout << ((cond) ? "YES\n" : "NO\n")

using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;

template <typename T> void print(const T& value) { cout << value << "\n"; }
template <typename T> void print(const vector<T>& vec) { for (auto& v : vec) cout << v << " "; cout << "\n"; }
template <typename T> void input(vector<T>& vec) { for (auto& v : vec) cin >> v; };
template <typename T> bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; } return false; }
template <typename T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } return false; }

#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

using mat = array<array<mint, 3>, 3>;
mat unity = {
    array<mint, 3> {1, 0, 0},
    array<mint, 3> {0, 1, 0},
    array<mint, 3> {0, 0, 1}
};
mat zero = {
    array<mint, 3> {0, 0, 0},
    array<mint, 3> {0, 0, 0},
    array<mint, 3> {0, 0, 0}
};
mat operator* (mat& left, mat& right) {
    mat res = zero;
    rep (i, 3) {
        rep (j, 3) {
            rep (k, 3) {
                res[i][j] += left[i][k]*right[k][j];
            }
        }
    }
    return res;
}

mat op(mat left, mat right) {
    return right*left;
}

mat e() {
    return unity;
}

mat mapping(bool top, mat bottom) {
    return top ? e() : bottom;
}

bool composition(bool top, bool bottom) {
    return top|bottom;
}

bool ID() { return false; }

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);

    ll N, Q;
    cin >> N >> Q;
    string S;
    cin >> S;

    vector<mat> def(N);
    rep (i, N) {
        ll n = S[i]-'0';
        mat res = unity;
        rep (j, 3) res[j][n] = 1;
        def[i] = res;
    }

    lazy_segtree<mat, op, e, bool, mapping, composition, ID> seg(def);
    while (Q--) {
        ll t, l, r;
        cin >> t >> l >> r;
        l --; r --;
        if (t == 1) {
            seg.apply(l, r+1, true);
        } else {
            auto res = seg.prod(l, r+1);
            print(res[2][1].val());
        }
    }
}