| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 409355 | danielliu04 | Monkey and Apple-trees (IZhO12_apple) | C++17 | 575 ms | 262148 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;
#define ll long long
#define INF 1e18
// #define lc 2*node+1
// #define rc 2*node+2
int q;
int MAX = 1e9+1;
struct Node{
int sum, lazy, left, right;
Node *lc = nullptr, *rc = nullptr;
Node() : sum(0), lazy(0), left(-1), right(-1){}
Node(int l, int r) : sum(0), lazy(0){
left = l; right = r;
}
void addLeft(){
int mid = (left + right) / 2;
if(!lc){
lc = new Node(left, mid);
}
}
void addRight(){
int mid = (left + right) / 2;
if(!rc){
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||