Submission #382679

#	Time	Username	Problem	Language	Result	Execution time	Memory
382679		JerryLiu06	Monkey and Apple-trees (IZhO12_apple)	C++11	100 / 100	394 ms	191084 KiB

apple

#include <bits/stdc++.h>

using namespace std;

struct Node { int sum = 0, lazy = 0, tl, tr, l = -1, r = -1; };

int M, C, timer = 2; Node tree[8000000];

void pushdown(int x) { int mid = (tree[x].tl + tree[x].tr) / 2;
    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; }

    if (!tree[x].lazy) return ; tree[x].lazy = 0;

    tree[tree[x].l].sum = tree[tree[x].l].tr - tree[tree[x].l].tl + 1; tree[tree[x].l].lazy = 1;
    tree[tree[x].r].sum = tree[tree[x].r].tr - tree[tree[x].r].tl + 1; tree[tree[x].r].lazy = 1; 
}
void update(int x, int l, int r) { int mid = (tree[x].tl + tree[x].tr) / 2;
    if (l <= tree[x].tl && tree[x].tr <= r) { tree[x].lazy = 1; tree[x].sum = tree[x].tr - tree[x].tl + 1; return ; } pushdown(x);

    if (mid >= l) update(tree[x].l, l, r); if (mid < r) update(tree[x].r, l, 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 (l <= tree[x].tl && tree[x].tr <= r) return tree[x].sum; pushdown(x);

    int res = 0; if (mid >= l) res += query(tree[x].l, l, r); if (mid < r) res += query(tree[x].r, l, r); return res;
}

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"; } else update(1, X + C, Y + C);

    }
}

Compilation message (stderr)

apple.cpp: In function 'void pushdown(int)':
apple.cpp:13:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   13 |     if (!tree[x].lazy) return ; tree[x].lazy = 0;
      |     ^~
apple.cpp:13:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   13 |     if (!tree[x].lazy) return ; tree[x].lazy = 0;
      |                                 ^~~~
apple.cpp: In function 'void update(int, int, int)':
apple.cpp:21:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   21 |     if (mid >= l) update(tree[x].l, l, r); if (mid < r) update(tree[x].r, l, r);
      |     ^~
apple.cpp:21:44: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   21 |     if (mid >= l) update(tree[x].l, l, r); if (mid < r) update(tree[x].r, l, r);
      |                                            ^~
apple.cpp: In function 'int query(int, int, int)':
apple.cpp:26:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   26 |     if (l <= tree[x].tl && tree[x].tr <= r) return tree[x].sum; pushdown(x);
      |     ^~
apple.cpp:26:65: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   26 |     if (l <= tree[x].tl && tree[x].tr <= r) return tree[x].sum; pushdown(x);
      |                                                                 ^~~~~~~~

• Subtask 1: 100 / 100