| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 91811 | SamAnd | Monkey and Apple-trees (IZhO12_apple) | C++17 | 187 ms | 3192 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>
#include <algorithm>
#include <cstdio>
using namespace std;
const int N=100005,M=1000000000;
int t[N*120];
int ll[N*120],rr[N*120];
int z;
void ubd(int tl,int tr,int l,int r,int pos)
{
if(t[pos]==(tr-tl+1))
return;
if(tl==l && r==tr)
{
t[pos]=r-l+1;
return;
}
int m=(tl+tr)/2;
if(r<=m)
{
if(!ll[pos])
ll[pos]=++z;
ubd(tl,m,l,r,ll[pos]);
}
else if(l>m)
{
if(!rr[pos])
rr[pos]=++z;
ubd(m+1,tr,l,r,rr[pos]);
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||