# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
38739 | daniel_02 | Monkey and Apple-trees (IZhO12_apple) | C++14 | 609 ms | 122328 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 ll long long
#define OK cout << "OK" << endl;
using namespace std;
const int N = 7e6 + 7e5;
const int inf = 1e9 + 7;
struct node
{
int sum, l, r,add;
node()
{
sum = l = r = add = 0;
}
}t[N];
int m;
int cnt = 2,c;
int ty, l, r,ans;
void push (int v,int tl,int tr) {
if (t[v].add != 0) {
if (!t[v].l)
t[v].l = cnt ++;
if (!t[v].r)
t[v].r = cnt ++;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |