Submission #479275

#TimeUsernameProblemLanguageResultExecution timeMemory
479275jhhope1Monkey and Apple-trees (IZhO12_apple)C++14
0 / 100
1 ms292 KiB
#include<bits/stdc++.h> using namespace std; int N, C; const int MAXN = 1e9; struct Node{ int val; int lazy_set; int l, r; Node(int val, int lazy_set):val(val),lazy_set(lazy_set),l(-1),r(-1){}; }; struct Seg{ vector<Node> V; Seg(){ V.emplace_back(0, 0); } void push_down(int s, int e, int v){ int m = (s+e)>>1; if(V[v].l == -1){ V[v].l = V.size(); V.emplace_back(V[v].lazy_set*(m-s+1), V[v].lazy_set); } if(V[v].r == -1){ V[v].r = V.size(); V.emplace_back(V[v].lazy_set*(e-m), V[v].lazy_set); } } void update(int s, int e, int l, int r, int v, int val){ if(e<l || r<s){ return; } if(l<=s && e<=r){ V[v].val = val * (e-s+1); V[v].lazy_set = val; return; } push_down(s, e, v); int m = (s+e)>>1; update(s, m, l, r, V[v].l, val); update(m+1, e, l, r, V[v].r, val); V[v].val = V[V[v].l].val + V[V[v].r].val; } int sum(int s, int e, int l, int r, int v){ if(e<l || r<s){ return 0; } if(l<=s && e<=r){ return V[v].val; } push_down(s, e, v); int m = (s+e)>>1; return sum(s, m, l, r, V[v].l) + sum(m+1, e, l, r, V[v].r); } }S; int M; int main(){ cin>>M; for(int i=0,t,x,y,val ; i<M ; i++){ cin>>t; if(t==1){ cin>>x>>y; C = S.sum(1, MAXN, x+C, y+C, 0); cout<<C; } else if(t==2){ cin>>x>>y; S.update(1, MAXN, x+C, y+C, 0, 1); } } }

Compilation message (stderr)

apple.cpp: In function 'int main()':
apple.cpp:57:23: warning: unused variable 'val' [-Wunused-variable]
   57 |     for(int i=0,t,x,y,val ; i<M ; i++){
      |                       ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...