結果
| 問題 | No.2498 OX Operations |
| ユーザー |
👑  potato167
|
| 提出日時 | 2023-10-06 22:40:10 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 3,148 ms / 4,000 ms |
| コード長 | 7,100 bytes |
| コンパイル時間 | 2,513 ms |
| コンパイル使用メモリ | 234,864 KB |
| 最終ジャッジ日時 | 2025-02-17 05:22:02 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 23 |
ソースコード
#include <bits/stdc++.h>#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")using namespace std;using std::cout;using std::cin;using std::endl;using ll=long long;using ld=long double;const ll ILL=2167167167167167167;const int INF=2100000000;const int mod=998244353;#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)#define all(p) p.begin(),p.end()template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}template<class T> void vec_out(vector<T> &p,int ty=0){if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}namespace po167{template <class T,T (*op)(T,T),T(*e)()>struct segment_tree{int _n,size;std::vector<T> seg;int ceil_pow2(int a){int b=1;while(a>b){b<<=1;}return b;}void update(int k){seg[k]=op(seg[k*2],seg[k*2+1]);};segment_tree(int n) :_n(n){size=ceil_pow2(n);seg=std::vector<T>(size*2,e());}segment_tree(std::vector<T> &p) :_n((int) p.size()){size=ceil_pow2(_n);seg=std::vector<T>(size*2,e());for(int i=0;i<_n;i++) seg[i+size]=p[i];for(int i=size-1;i>0;i--) update(i);}void set(int ind,T val){assert(0<=ind&&ind<_n);ind+=size;seg[ind]=val;while(ind!=1){ind>>=1;update(ind);}}void addl(int ind,T val){set(ind,op(get(ind),val));}void addr(int ind,T val){set(ind,op(val,get(ind)));}T get(int ind){assert(0<=ind&&ind<_n);return seg[ind+size];}T query(int l,int r){assert(0<=l&&l<=r&&r<=_n);T l_val=e();T r_val=e();l+=size,r+=size;while(l<r){if(l&1) l_val=op(l_val,seg[l]),l+=1;if(r&1) r-=1,r_val=op(seg[r],r_val);r>>=1;l>>=1;}return op(l_val,r_val);}template <bool (*f)(T)> int max_right(int l) {return max_right(l, [](T x) { return f(x); });}template <class F> int max_right(int l, F f) {assert(0<=l&&l<=_n);assert(f(e()));if(f(query(l,_n))) return _n;T val=e();l+=size;while(true){while(l%2==0) l>>=1;if(!f(op(val,seg[l]))){while(l<size){l*=2;if(f(op(val,seg[l]))){val=op(val,seg[l]);l++;}}return l-size;}val=op(val,seg[l]);l++;}}template <bool (*f)(T)> int min_left(int r) {return min_left(r, [](T x) { return f(x); });}template <class F> int min_left(int r, F f) {assert(0 <= r && r <= _n);assert(f(e()));if (r == 0) return 0;r += size;T sm = e();do {r--;while (r > 1 && (r % 2)) r >>= 1;if (!f(op(seg[r], sm))) {while (r < size) {r = (2 * r + 1);if (f(op(seg[r], sm))) {sm = op(seg[r], sm);r--;}}return r + 1 - size;}sm = op(seg[r], sm);} while ((r & -r) != r);return 0;}};}using po167::segment_tree;using F= int;F op(F a,F b){return a^b;}F e(){return 0;}int target;bool f(F x){return (x%target==0);}void solve();// oddloopint main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t=1;//cin>>t;rep(i,0,t) solve();}void solve(){int N,Q;cin>>N>>Q;vector<int> M(N);rep(i,0,N) cin>>M[i];int B=30;vector G(B,vector<vector<int>>(N));vector H(B,vector<vector<int>>(N));vector<vector<int>> S(B,vector<int>(N));vector<char> C(Q);vector<int> L(Q),R(Q),X(Q);vector A(B,vector(N,vector<int>(2)));rep(i,0,Q){cin>>C[i]>>L[i]>>R[i]>>X[i];L[i]--;if(C[i]=='o'){rep(bit,0,B){if(X[i]&(1<<bit)){G[bit][L[i]].push_back(i);H[bit][R[i]-1].push_back(i);}}}}set<int> s;s.insert(-1);rep(bit,0,B){rep(i,0,N){for(auto x:G[bit][i]) s.insert(x);S[bit][i]=(*s.rbegin());for(auto x:H[bit][i]) s.erase(x);}}vector<pair<int,int>> order(N*B);rep(i,0,N) rep(j,0,B) order[i*B+j]={j,i};sort(all(order),[&](pair<int,int> l,pair<int,int> r){return S[l.first][l.second]>S[r.first][r.second];});segment_tree<F,op,e> seg(N+1);int ind=0;for(int i=Q-1;i>=0;i--){if(C[i]=='x'){seg.addl(L[i],X[i]);seg.addl(R[i],X[i]);}while(ind!=N*B){auto tmp=order[ind];if(S[tmp.first][tmp.second]!=i) break;ind++;auto val=seg.query(0,tmp.second+1);if(0==(val&(1<<tmp.first))){rep(k,0,2) A[tmp.first][tmp.second][k]=1;}}}while(ind!=N*B){auto tmp=order[ind];ind++;auto val=seg.query(0,tmp.second+1);if(0==(val&(1<<tmp.first))) A[tmp.first][tmp.second][1]=1;else A[tmp.first][tmp.second][0]=1;}vector dp(N,vector<ll>(B+1));rep(i,0,N){M[i]++;int X=0;for(int bit=B-1;bit>=0;bit--){if(M[i]&(1<<bit)){vector<int> tmp(B+1);tmp[X+A[bit][i][0]]=1;X+=A[bit][i][1];rep(k,0,bit){vector<int> n_tmp(B+1);rep(j,0,B+1){if(tmp[j]){rep(l,0,2) n_tmp[j+A[k][i][l]]+=tmp[j];}}swap(n_tmp,tmp);}rep(j,0,B+1) dp[i][j]+=tmp[j];}else X+=A[bit][i][0];}}ll ans=B;rep(i,0,N) ans=ans*M[i]%mod;vector<ll> sum(N);rep(val,0,B){ll tmp=1;rep(i,0,N) sum[i]+=dp[i][val],tmp=tmp*sum[i]%mod;ans-=tmp;}//rep(i,0,N) vec_out(dp[i]);cout<<(ans%mod+mod)%mod<<"\n";}