# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
158046 | nvmdava | Street Lamps (APIO19_street_lamps) | C++17 | 1660 ms | 311492 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 ff first
#define ss second
#define N 300005
#define INF 0x3f3f3f3f3f3f3f3f
struct Node{
Node *l = NULL, *r = NULL;
int val = 0;
int query(int le, int ri, int x){
if(le == ri) return val;
int m = (le + ri) >> 1;
if(m < x)
return val + (r == NULL ? 0 : r -> query(m + 1, ri, x));
return val + (l == NULL ? 0 : l -> query(le, m, x));
}
void update(int le, int ri, int R, int v){
if(ri <= R){
val += v;
return;
}
int m = (le + ri) >> 1;
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |