# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
93465 | Aydarov03 | Monkey and Apple-trees (IZhO12_apple) | C++11 | 571 ms | 157536 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;
const int N = 1e5+5;
vector <int> ans;
struct st
{
int l , r , val;
bool add;
st()
{
l = r = val = add = 0;
}
}tree[N * 100];
int cnt = 1;
void push( int v , int tl , int tr )
{
if(tl != tr)
{
if( !tree[v].l )tree[v].l = ++cnt;
if( !tree[v].r )tree[v].r = ++cnt;
}
if( !tree[v].add )return;
tree[v].val = tr - tl + 1;
if( tl != tr )
tree[ tree[v].l ].add = tree[ tree[v].r ].add = 1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |