Submission #382578

#TimeUsernameProblemLanguageResultExecution timeMemory
382578JerryLiu06Monkey and Apple-trees (IZhO12_apple)C++11
0 / 100
552 ms262144 KiB
#include <bits/stdc++.h> using namespace std; struct Node { int sum = 0, l = -1, r = -1, tl, tr, lazy = 0; }; int M, C, timer = 2; Node tree[6000000]; void pushdown(int x) { int mid = (tree[x].tl + tree[x].tr) / 2; if (!tree[x].lazy) return ; tree[x].sum = tree[x].tr - tree[x].tl + 1; // cout << tree[x].l << " " << tree[x].r << endl; if (tree[x].tl < tree[x].tr) { if (tree[x].l == -1) { tree[x].l = timer++; tree[tree[x].l].tl = tree[x].tl; tree[tree[x].l].tr = mid; } if (tree[x].r == -1) { tree[x].r = timer++; tree[tree[x].r].tl = mid + 1; tree[tree[x].r].tr = tree[x].tr; } tree[tree[x].l].lazy = tree[tree[x].r].lazy = 1; } tree[x].lazy = 0; } void update(int x, int l, int r) { int mid = (tree[x].tl + tree[x].tr) / 2; if (tree[x].tl > r || tree[x].tr < l) return ; pushdown(x); if (l <= tree[x].tl && tree[x].tr <= r) { tree[x].lazy = 1; return ; } // cout << tree[x].l << " " << tree[x].r << endl; if (tree[x].l == -1) { tree[x].l = timer++; tree[tree[x].l].tl = tree[x].tl; tree[tree[x].l].tr = mid; } if (tree[x].r == -1) { tree[x].r = timer++; tree[tree[x].r].tl = mid + 1; tree[tree[x].r].tr = tree[x].tr; } update(tree[x].l, l, r); update(tree[x].r, l, r); pushdown(tree[x].l); pushdown(tree[x].r); tree[x].sum = tree[tree[x].l].sum + tree[tree[x].r].sum; } int query(int x, int l, int r) { int mid = (tree[x].tl + tree[x].tr) / 2; if (tree[x].tl > r || tree[x].tr < l) return 0; pushdown(x); if (l <= tree[x].tl && tree[x].tr <= r) return tree[x].sum; if (tree[x].l == -1) { tree[x].l = timer++; tree[tree[x].l].tl = tree[x].tl; tree[tree[x].l].tr = mid; } if (tree[x].r == -1) { tree[x].r = timer++; tree[tree[x].r].tl = mid + 1; tree[tree[x].r].tr = tree[x].tr; } return query(tree[x].l, l, r) + query(tree[x].r, l, r); } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> M; tree[1].tl = 1; tree[1].tr = 1000000000; for (int i = 0; i < M; i++) { int D, X, Y; cin >> D >> X >> Y; if (D == 1) { C = query(1, X + C, Y + C); cout << C << "\n"; } if (D == 2) update(1, X + C, Y + C); } }

Compilation message (stderr)

apple.cpp: In function 'void pushdown(int)':
apple.cpp:10:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   10 |     if (!tree[x].lazy) return ; tree[x].sum = tree[x].tr - tree[x].tl + 1;
      |     ^~
apple.cpp:10:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   10 |     if (!tree[x].lazy) return ; tree[x].sum = tree[x].tr - tree[x].tl + 1;
      |                                 ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...