# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
989617 | AliHasanli | Monkey and Apple-trees (IZhO12_apple) | C++17 | 446 ms | 262144 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 <iostream>
using namespace std;
long long seg[10000000],L[10000000],R[10000000],lazy[10000000],ind=1;
void create(long long n,long long l,long long r)
{
if(l<r && !L[n])L[n]=++ind;
if(l<r && !R[n])R[n]=++ind;
}
void push(long long n,long long l,long long r)
{
create(n,l,r);
if(lazy[n])
{
seg[n]=r-l+1;
if(l!=r){
lazy[L[n]]=1;
lazy[R[n]]=1;}
}
lazy[n]=0;
}
void update(long long n,long long l,long long r,long long ql,long long qr)
{
push(n,l,r);
if(l>r || ql>qr || ql>r || l>qr)return;
if(ql<=l && r<=qr)
{
lazy[n]=1;
push(n,l,r);
return ;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |