| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 920649 | vjudge1 | Monkey and Apple-trees (IZhO12_apple) | C++17 | 306 ms | 172296 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;
struct SegmentTree{
vector<int>sTree, L, R;
int nxt = 2;
SegmentTree(int n){
sTree.resize(144 * n);
L.resize(144 * n);
R.resize(144 * n);
}
void Propagate(int node, int l, int r){
if(sTree[node] != r - l + 1)return;
if(l != r){
if(L[node] == 0)L[node] = nxt++;
if(R[node] == 0)R[node] = nxt++;
int mid = (l + r) >> 1;
sTree[L[node]] = mid - l + 1;
sTree[R[node]] = r - mid;
}
}
void R_Update(int node, int l, int r, int ql, int qr){
Propagate(node, l, r);
if(ql <= l && r <= qr){
sTree[node] = r - l + 1;
Propagate(node, l, r);
return;
}
if(ql > r || l > qr)return;
int mid = (l + r) >> 1;
if(L[node] == 0)L[node] = nxt++;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||