結果

問題 No.2762 Counting and Deleting
ユーザー pitP
提出日時 2024-05-18 14:20:09
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 979 ms / 4,000 ms
コード長 2,928 bytes
コンパイル時間 6,103 ms
コンパイル使用メモリ 331,188 KB
実行使用メモリ 43,520 KB
最終ジャッジ日時 2024-12-20 16:23:18
合計ジャッジ時間 15,831 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 15
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }
istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }
istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }
ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); } 
typedef long long ll;
typedef vector<vector<int>> Graph;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)
#define rep(i,n) for (int i = 0;i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define my_sort(x) sort(x.begin(), x.end())
#define my_max(x) *max_element(all(x))
#define my_min(x) *min_element(all(x))
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
const int INF = (1<<30) - 1;
const ll LINF = (1LL<<62) - 1;
const int MOD = 998244353;
const int MOD2 = 1e9+7;
const double PI = acos(-1);
vector<int> di = {1,0,-1,0};
vector<int> dj = {0,1,0,-1};
#ifdef LOCAL
#  include <debug_print.hpp>
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif
const int D = 3;
using mint = modint998244353;
using S = vector<vector<mint>>;
S op(S a, S b){
    vector res(D, vector<mint>(D));
    rep(i, D)rep(j, D)rep(k, D) res[i][j] += a[i][k] * b[k][j];
    return res;
}
S e(){
    vector res(D, vector<mint>(D));
    rep(i, D) res[i][i] = 1;
    return res;
}
int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    int N, Q; cin >> N >> Q;
    string T; cin >> T;
    S zero = {
        {1, 1, 0},
        {0, 1, 0},
        {0, 0, 1},
    };
    S one = {
        {1, 0, 0},
        {1, 1, 1},
        {0, 0, 1},
    };
    S eye = {
        {1, 0, 0},
        {0, 1, 0},
        {0, 0, 1},
    };
    vector dat(N, vector(D, vector<mint>(D)));
    rep(i, N){
        if(T[i] == '0') dat[N - 1 - i] = zero;
        if(T[i] == '1') dat[N - 1 - i] = one;
    }
    segtree<S,op,e> seg(dat);
    set<int> rest;
    rep(i, N) rest.insert(i);
    while(Q--){
        int f, l, r; cin >> f >> l >> r;
        l--;
        if(f == 1){
            auto itr = rest.lower_bound(l);
            while(itr != rest.end() && *itr < r){
                seg.set(N - 1 - *itr, eye);
                itr = rest.erase(itr);
            }
        }
        else{
            S res = seg.prod((N - 1) - r + 1, N - 1 - l + 1);
            cout << res[0][2] + res[1][2] << endl;
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0