# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
382312 | JerryLiu06 | Monkey and Apple-trees (IZhO12_apple) | C++11 | 520 ms | 262148 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
struct Node {
int sum, l, r, lazy; Node *lc, *rc;
Node(int L, int R): sum(0), l(L), r(R), lc(NULL), rc(NULL) {}
void pushdown() {
if (!lazy) return ; sum = r - l + 1; int mid = (l + r) / 2;
if (l < r) { if (!lc) lc = new Node(l, mid); lc -> lazy = lazy; if (!rc) rc = new Node(mid + 1, r); rc -> lazy = lazy; } lazy = 0;
}
void update(int tl, int tr) { int mid = (l + r) / 2;
pushdown(); if (l > tr || r < tl) return ; if (tl <= l && r <= tr) { lazy = 1; return ; }
if (tl > mid) { if (!rc) rc = new Node(mid + 1, r); rc -> update(tl, tr); }
else if (tr <= mid) { if (!lc) lc = new Node(l, mid); lc -> update(tl, tr); }
else { if (!lc) lc = new Node(l, mid); lc -> update(tl, mid); if (!rc) rc = new Node(mid + 1, r); rc -> update(mid + 1, tr); }
if (lc) lc -> pushdown(); if (rc) rc -> pushdown();
sum = 0; if (lc) sum += lc -> sum; if (rc) sum += rc -> sum;
}
int query(int tl, int tr) { int mid = (l + r) / 2;
pushdown(); if (l > tr || r < tl) return 0; if (tl <= l && r <= tr) return sum;
if (tl > mid) { return (rc) ? (rc -> query(tl, tr)) : 0; }
else if (tr <= mid) { return (lc) ? (lc -> query(tl, tr)) : 0; }
else { return ((lc) ? (lc -> query(tl, mid)) : 0) + ((rc) ? (rc -> query(mid + 1, tr)) : 0); }
}
};
int M, C; Node *root;
int main() {
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> M; root = new Node(1, 1000000000);
for (int i = 0; i < M; i++) { int D, X, Y; cin >> D >> X >> Y;
if (D == 1) { C = root -> query(X + C, Y + C); cout << C << "\n"; }
if (D == 2) root -> update(X + C, Y + C);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |