# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90181 | popovicirobert | Monkey and Apple-trees (IZhO12_apple) | C++14 | 389 ms | 152728 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>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#define ld long double
// 217
// 44
using namespace std;
struct Aint {
Aint *st, *dr;
int cnt;
bool lazy;
Aint() {
st = dr = NULL;
cnt = lazy = 0;
}
};
Aint *root = new Aint;
inline void solve_lazy(Aint *nod, int l, int r) {
if(nod != NULL && nod -> lazy == 1) {
if(l < r) {
if(nod -> st == NULL) {
nod -> st = new Aint;
}
if(nod -> dr == NULL) {
nod -> dr = new Aint;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |