Submission #68240941

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std; 
#define int long long 

const int mod = 998244353;

int add(int a,int b){
  return (a+b)%mod; 
}

int sub(int a,int b) {
  return (mod+a-b)%mod; 
}

int mul(int a,int b) {
  return a*b%mod; 
}

int power(int a,int b) {
  if (b==0)return 1; 
  int u = power(a, b>>1); 
  return mul(mul(u,u),(b&1)?a:1); 
}

int inv (int a) {
  return power(a,mod-2); 
}

int divide(int a,int b) {
  assert(b!=0);
  return mul(a,inv(b));
}


class SegTree {
  
  #define mid ((l+r)>>1)
  #define left (p<<1)
  #define right (left|1)
  #define toleft left,l,mid
  #define toright right,mid+1,r
  vector<int> t; 
  vector<int> lazy; 
  int n;
  public:
  SegTree(int n): n(n), t(4*n, 0), lazy(4*n,-1) {}
  
  void build(vector<int> a) {
    assert((int)a.size()<=n); 
    
    function<void(int,int,int)> b = [&](int p,int l,int r) {
      if(l==r) {
        t[p] = a[l]; 
        return; 
      }
      b(toleft); b(toright); 
      t[p] = mer(t[left], t[right]);
    };
    b(1,0,a.size()-1); 
  }
  
  void update(int p,int l,int r,int i,int j, int val) {
    push(p,l,r); 
    if(l>=i&&r<=j) {
      lazy[p] = val; 
      push(p,l,r); 
      return; 
    }
    if(l>j || r<i)return; 
    update(toleft, i,j,val);
    update(toright,i,j,val); 
    t[p] = mer(t[left], t[right]); 
  }
  
  int query(int p,int l,int r,int i,int j) {
    push(p,l,r); 
    if(l>=i&&r<=j)return t[p]; 
    if (l>j|| r<i)return 0; 
    return mer(query(toleft,i,j), query(toright,i,j)); 
  }
  
  int mer(int a,int b) {
    return add(a,b); 
  }
  
  void push(int p,int l, int r) {
    if(lazy[p] == -1) return; 
    t[p] = mul(r-l+1, lazy[p]); 
    if(l!=r) lazy[left]=lazy[right] = lazy[p]; 
    lazy[p] = -1; 
  }
  #undef toright
  #undef toleft
  #undef mid
  #undef right
  #undef left 
};
signed main() {
  int n; 
  cin>>n; 
  int m; 
  cin>>m; 
  vector<int> a(n);
  for(int i=0;i<n;i++)cin>>a[i]; 
  
  SegTree seg(n); 
  seg.build(a); 
  
  for(int i=0;i<m;i++){
    int l,r; 
    cin>>l>>r; 
    l--; r--; 
    //cout<<l << " "<<r<<endl; 
    int sum = seg.query(1,0,n-1,l,r); 
    int invRl = inv(r-l+1); 
    int setV = mul(sum,invRl); 
    seg.update(1,0,n-1,l,r,setV); 
  }
  
  for(int i=0;i<n;i++){
    cout<<seg.query(1,0,n-1,i,i)<<" ";
  }
}

Submission Info

Compile Error

Main.cpp: In constructor ‘SegTree::SegTree(long long int)’:
Main.cpp:44:7: warning: ‘SegTree::n’ will be initialized after [-Wreorder]
   44 |   int n;
      |       ^
Main.cpp:42:15: warning:   ‘std::vector<long long int> SegTree::t’ [-Wreorder]
   42 |   vector<int> t;
      |               ^
Main.cpp:46:3: warning:   when initialized here [-Wreorder]
   46 |   SegTree(int n): n(n), t(4*n, 0), lazy(4*n,-1) {}
      |   ^~~~~~~

Judge Result