제출 #392245

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
392245		codebuster_10	Sjeckanje (COCI21_sjeckanje)	C++17	0 / 110	1 ms	332 KiB

Main

#include <bits/stdc++.h>

using namespace std ;

#define int int64_t //be careful about this 
#define endl "\n"
#define f(i,a,b) for(int i=int(a);i<int(b);++i)

#define pr pair
#define ar array
#define fr first
#define sc second
#define vt vector
#define pb push_back
#define eb emplace_back
#define LB lower_bound  
#define UB upper_bound
#define PQ priority_queue

#define sz(x) ((int)(x).size())
#define all(a) (a).begin(),(a).end()
#define allr(a) (a).rbegin(),(a).rend()
#define mem0(a) memset(a, 0, sizeof(a))
#define mem1(a) memset(a, -1, sizeof(a))

template<class A> void rd(vt<A>& v);
template<class T> void rd(T& x){ cin >> x; }
template<class H, class... T> void rd(H& h, T&... t) { rd(h) ; rd(t...) ;}
template<class A> void rd(vt<A>& x) { for(auto& a : x) rd(a) ;}

template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }

template<typename T>
void __p(T a) {
  cout<<a; 
}
template<typename T, typename F>
void __p(pair<T, F> a) {
  cout<<"{";
  __p(a.first);
  cout<<",";
  __p(a.second);
  cout<<"}\n"; 
}
template<typename T>
void __p(std::vector<T> a) {
  cout<<"{";
  for(auto it=a.begin(); it<a.end(); it++)
    __p(*it),cout<<",}\n"[it+1==a.end()]; 
}
template<typename T, typename ...Arg>
void __p(T a1, Arg ...a) {
  __p(a1);
  __p(a...);
}
template<typename Arg1>
void __f(const char *name, Arg1 &&arg1) {
  cout<<name<<" : ";
  __p(arg1);
  cout<<endl;
}
template<typename Arg1, typename ... Args>
void __f(const char *names, Arg1 &&arg1, Args &&... args) {
  int bracket=0,i=0;
  for(;; i++)
    if(names[i]==','&&bracket==0)
      break;
    else if(names[i]=='(')
      bracket++;
    else if(names[i]==')')
      bracket--;
  const char *comma=names+i;
  cout.write(names,comma-names)<<" : ";
  __p(arg1);
  cout<<" | ";
  __f(comma+1,args...);
}

void setIO(string s = "") {
  ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); 
  cin.exceptions(cin.failbit); 
	cout.precision(15);	cout << fixed;
  #ifdef ONLINE_JUDGE
  if(sz(s)){
  	freopen((s+".in").c_str(),"r",stdin);
  	freopen((s+".out").c_str(),"w",stdout);
  }
  #define __f(...) 0
  #endif
} 
const int MAX_N = 2e5 + 7;
int cum[MAX_N];
template<class T> struct SEGTREE { 
  public:  
    const T ID = 0; 
    T comb(T a,int la,int ra,T b,int lb,int rb){
    	assert(ra + 1 == lb);
    	T ans = a + b;
    	if(cum[ra] >= 0 && cum[lb] >= 0){
    		ans += cum[ra];
    	}else if(cum[ra] <= 0 && cum[lb] <= 0){
    		ans -= cum[ra];
    	}
    	return ans;
    }
    int size ;
    vector<T> seg ;
    void init(int n){ 
      size = 1 ;
      while(size < n) size *= 2 ;
      seg.assign(2*size, ID); 
    }
    void upd(int p, T val, int x, int lx, int rx) { 
      if( rx - lx == 1 ){
        seg[x] = val ;	return ;
      }
      int mid = (rx + lx)/2 ;
      if(p < mid){
        upd(p, val, 2 * x + 1, lx, mid) ;
      }else{
        upd(p, val, 2 * x + 2, mid, rx) ;
      }
      seg[x] = comb(seg[2 * x + 1], lx, mid - 1, seg[2 * x + 2], mid, rx - 1);
    }
 
    void upd(int p, T val) { 
      upd(p, val, 0, 0, size) ;
    }
};
signed main(){
  setIO() ;
  int n,q; rd(n,q);
  SEGTREE<int> st;
  st.init(n-1);
  vt<int> a(n); rd(a);
  f(i,0,n-1) cum[i] = a[i+1] - a[i];
  f(i,0,n-1) st.upd(i,cum[i]);
  while(q--){
  	int l,r,x; rd(l,r,x); --l,--r;
  	if(l > 0) cum[l-1] += x;
  	if(r < n-1) cum[r] -= x;
  	if(l > 0) st.upd(l-1,cum[l-1]);
  	if(r < n-1) st.upd(r,cum[r]);
  	cout << st.seg[0] << endl ;
  }
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 40
• Subtask 3: 0 / 55