Submission #479322

#TimeUsernameProblemLanguageResultExecution timeMemory
479322jhhope1Monkey and Apple-trees (IZhO12_apple)C++14
100 / 100
316 ms132248 KiB
#include<bits/stdc++.h> using namespace std; int C, M; const int MAXN = 1e9; struct Node{ int set, val, l, r; Node(int val, int set):val(val),set(set),l(-1),r(-1){}; Node():val(0),set(0),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(); } if(V[v].r == -1){ V[v].r = V.size(); V.emplace_back(); } if(V[v].set){ V[V[v].l].val = V[v].set * (m-s+1); V[V[v].r].val = V[v].set * (e-m); V[V[v].l].set = V[V[v].r].set = V[v].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].set = val; return; } int m = (s+e)>>1; push_down(s, e, v); 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 main(){ ios_base::sync_with_stdio(0);cin.tie(0); cin>>M; for(int i=0,t,x,y ; i<M ; i++){ cin>>t; if(t==1){ cin>>x>>y; C = S.sum(1, MAXN, x+C, y+C, 0); cout<<C<<"\n"; } else if(t==2){ cin>>x>>y; S.update(1, MAXN, x+C, y+C, 0, 1); } } }

Compilation message (stderr)

apple.cpp: In constructor 'Node::Node(int, int)':
apple.cpp:6:14: warning: 'Node::val' will be initialized after [-Wreorder]
    6 |     int set, val, l, r;
      |              ^~~
apple.cpp:6:9: warning:   'int Node::set' [-Wreorder]
    6 |     int set, val, l, r;
      |         ^~~
apple.cpp:7:5: warning:   when initialized here [-Wreorder]
    7 |     Node(int val, int set):val(val),set(set),l(-1),r(-1){};
      |     ^~~~
apple.cpp: In constructor 'Node::Node()':
apple.cpp:6:14: warning: 'Node::val' will be initialized after [-Wreorder]
    6 |     int set, val, l, r;
      |              ^~~
apple.cpp:6:9: warning:   'int Node::set' [-Wreorder]
    6 |     int set, val, l, r;
      |         ^~~
apple.cpp:8:5: warning:   when initialized here [-Wreorder]
    8 |     Node():val(0),set(0),l(-1),r(-1){};
      |     ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...