# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
122519 | abacaba | Street Lamps (APIO19_street_lamps) | C++14 | 1721 ms | 200512 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;
const int N = 3e5 + 15;
int n, q, fenw[N], a[N];
struct node {
node *l, *r;
int val, add, pr, key;
node() : val(0), add(0), pr(0), l(NULL), r(NULL) {}
node(int key) : key(key), val(0), add(0), pr(0), l(NULL), r(NULL) {
pr = (int)rand() * rand();
}
};
struct query {
int type, l, r;
} qs[N];
struct upd {
int l, r, val;
upd(int l, int r, int val) : l(l), r(r), val(val) {}
};
typedef node* pnode;
void push(pnode &t) {
if(t) {
if(t->l) {
t->l->add += t->add;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |