| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 335316 | jovan_b | Monkey and Apple-trees (IZhO12_apple) | C++17 | 50 ms | 3052 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;
typedef long long ll;
typedef long double ld;
#define pb push_back
int intersect(int l, int r, int tl, int tr){
return max(0, min(tr, r)-max(l, tl)+1);
}
struct segment{
int val;
bool lazy;
segment* c[2];
segment() {c[0] = c[1] = NULL;}
void upd(int l, int r, int tl, int tr){
if(val == r-l+1) return;
if(tl <= l && r <= tr){
val = r-l+1;
return;
}
int mid = (ll(l)+r)/2;
if(intersect(l, mid, tl, tr)){
if(!c[0]) c[0] = new segment();
c[0]->upd(l, mid, tl, tr);
}
if(intersect(mid+1, r, tl, tr)){
if(!c[1]) c[1] = new segment();
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||