# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
53906 | SpaimaCarpatilor | Editor (BOI15_edi) | C++17 | 350 ms | 118308 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;
int N, a[300009], t[300009];
bool active[300009];
const int maxN = 15000009;
int nodes = 1, aint[maxN], l[maxN], r[maxN];
void build (int nod, int st, int dr)
{
aint[nod] = 0;
if (st == dr) return ;
int mij = (st + dr) >> 1;
l[nod] = ++nodes, build (l[nod], st, mij);
r[nod] = ++nodes, build (r[nod], mij + 1, dr);
}
void split (int nod)
{
if (l[nod] == 0)
l[nod] = ++nodes;
if (r[nod] == 0)
r[nod] = ++nodes;
if (aint[nod] > 0)
aint[l[nod]] = aint[r[nod]] = aint[nod],
aint[nod] = 0;
}
int change (int nod, int st, int dr, int x, int y, int newVal)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |