# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
472078 | disastah | Monkey and Apple-trees (IZhO12_apple) | C++17 | 477 ms | 134392 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.
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ar array
using namespace std;
typedef long double ld;
typedef long long ll;
const int inf=1e9+9;
const ll linf=4e18+18;
const int N=1e9;
struct segtr {
struct node {
int x=0, l=-1, r=-1;
bool lz=0;
node() {}
};
vector<node> t;
int N;
segtr(int n): N(n) {
t={{}};
}
void push(int v, int l, int r) {
if (l+1<r) {
if (t[v].l==-1) {
t[v].l=t.size();
t.push_back({});
}
if (t[v].r==-1) {
t[v].r=t.size();
t.push_back({});
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |