結果

問題 No.2498 OX Operations
ユーザー woodywoodywoodywoody
提出日時 2023-10-06 23:44:13
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 3,450 ms / 4,000 ms
コード長 7,947 bytes
コンパイル時間 4,068 ms
コンパイル使用メモリ 247,268 KB
実行使用メモリ 37,760 KB
最終ジャッジ日時 2024-07-26 17:21:32
合計ジャッジ時間 37,517 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 1 ms
6,944 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 1 ms
6,944 KB
testcase_11 AC 4 ms
6,940 KB
testcase_12 AC 12 ms
6,940 KB
testcase_13 AC 11 ms
6,944 KB
testcase_14 AC 17 ms
6,940 KB
testcase_15 AC 2,249 ms
30,240 KB
testcase_16 AC 3,156 ms
33,716 KB
testcase_17 AC 1,748 ms
28,740 KB
testcase_18 AC 2,731 ms
37,284 KB
testcase_19 AC 2,228 ms
36,688 KB
testcase_20 AC 2,947 ms
37,328 KB
testcase_21 AC 3,376 ms
37,252 KB
testcase_22 AC 1,781 ms
14,904 KB
testcase_23 AC 1,636 ms
12,444 KB
testcase_24 AC 3,443 ms
37,756 KB
testcase_25 AC 3,427 ms
37,756 KB
testcase_26 AC 3,450 ms
37,760 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define assertmle(x) if (!x) {vi v(3e8);}
#define asserttle(x) if (!x) {while(1){}}
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#include "./debug/localDebug.cpp"
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show1(a) cerr<<#a<<" = "<<a<<endl
#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl
#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl
#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl
#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl
#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}
#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}
#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}
#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}
#else
#define showp(p)
#define show1(a)
#define show2(a,b)
#define show3(a,b,c)
#define show4(a,b,c,d)
#define show5(a,b,c,d,e)
#define DEBUG_LINE
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#define showmat(v)
#define showmatm(v)
#endif
#define overload5(a,b,c,d,e,f, ...) f
#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)

ll op(ll a,ll b){
    return max(a,b);
}
 
ll e(){
    return 0;
}
 
ll mapping(pll p,ll a){
    return a*p.fi + p.se;
}
 
pll composition(pll p,pll q){
    return {p.fi*q.fi , p.fi*q.se + p.se};
}
 
pll id(){
    return {1 , 0};
}


void solve(){
    int n,q; cin>>n>>q;
    vvi a(n,vi(31));
    vi m(n); rep(i,n) cin>>m[i];
    vector<char> c(q);
    vi l(q),r(q),x(q);
    rep(i,q){
        cin>>c[i]>>l[i]>>r[i]>>x[i];
        l[i]--; r[i]--;
    }

    // 2を決定
    {
        rep(ii,31){
            lazy_segtree<ll , op , e , pll , mapping , composition , id> ls(n);
            rep(i,q){
                int a = (x[i]>>ii&1);
                if (a==0) continue;
                if (c[i] == 'o'){
                    ls.apply(l[i],r[i]+1,{0,-q-1});
                }else{
                    ls.apply(l[i],r[i]+1,{1,1});
                }
            }
            rep(i,n) if (ls.get(i)>=0) a[i][ii] = ls.get(i)%2 + 2;
        }
    }

    // 0,1を決定
    {
        rep(ii,31){
            lazy_segtree<ll , op , e , pll , mapping , composition , id> ls(n);
            rep(i,q){
                int a = (x[i]>>ii&1);
                if (a==0) continue;
                if (c[i] == 'o'){
                    ls.apply(l[i],r[i]+1,{0,1});
                }else{
                    ls.apply(l[i],r[i]+1,{-1,1});
                }
            }
            rep(i,n) if (a[i][ii]<2 && ls.get(i)==1) a[i][ii] = 1;
        }
    }
    vvm cnt(n,vm(31));
    rep(i,n){
        vvm dp(2,vm(31));
        dp[0][0] = 1;
        rrep(j,31){
            int b = (m[i]>>j&1);
            vvm tmp(2,vm(31));
            swap(dp, tmp);
            rep(ii,31){ // tmp[ii]
                if (a[i][j] == 0 || a[i][j] == 1){
                    rep(jj,2){
                        int np = a[i][j];
                        int nii = ii+np;
                        if (b == 0){
                            if (jj==0 && nii<31) dp[0][nii] += tmp[0][ii];
                            if (nii<31) dp[1][nii] += tmp[1][ii];
                        }else{
                            if (jj==1 && nii<31) dp[0][nii] += tmp[0][ii];
                            if (jj==0 && nii<31) dp[1][nii] += tmp[0][ii];
                            if (nii<31) dp[1][nii] += tmp[1][ii];
                        }
                    }
                }
                
                if (a[i][j] >= 2){
                    rep(jj,2){
                        int np = jj;
                        if (a[i][j]==3) np ^= 1;
                        int nii = ii+np;
                        if (b == 0){
                            if (jj==0 && nii<31) dp[0][nii] += tmp[0][ii];
                            if (nii<31) dp[1][nii] += tmp[1][ii];
                        }else{
                            if (jj==1 && nii<31) dp[0][nii] += tmp[0][ii];
                            if (jj==0 && nii<31) dp[1][nii] += tmp[0][ii];
                            if (nii<31) dp[1][nii] += tmp[1][ii];
                        }
                    }
                }
            }
        }
        rep(ii,31){
            if (ii) cnt[i][ii] += cnt[i][ii-1];
            cnt[i][ii] += dp[0][ii]+dp[1][ii];
        }
    }
    mint ans = 0;
    rep1(i,31){
        mint tmp1 = 1;
        mint tmp2 = 1;
        rep(j,n){
            tmp1 *= cnt[j][i];
            tmp2 *= cnt[j][i-1];
        }
        ans += (tmp1-tmp2) * i;
    }
    outm;
    

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}
0