# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
616932 | Hanksburger | Monkey and Apple-trees (IZhO12_apple) | C++17 | 368 ms | 123056 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;
int seg[10000005], lazy[10000005], tl[10000005], tr[10000005], cnt=1;
void push(int i, int l, int r)
{
if (lazy[i])
{
lazy[i]=0;
seg[i]=r-l+1;
if (!tl[i])
tl[i]=++cnt;
if (!tr[i])
tr[i]=++cnt;
lazy[tl[i]]=lazy[tr[i]]=1;
}
}
void update(int i, int l, int r, int ql, int qr)
{
push(i, l, r);
if (ql<=l && r<=qr)
{
lazy[i]=1;
push(i, l, r);
return;
}
if (!tl[i])
tl[i]=++cnt;
if (!tr[i])
tr[i]=++cnt;
int m=(l+r)/2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |