# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
439016 | Hausdorf | Mountains (NOI20_mountains) | C++17 | 897 ms | 27460 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 ld long double
#define itn int
#define fi first
#define se second
#pragma optimizatiob ("O3")
#pragma GCC target ("avx2")
#pragma optimization ("unroll_loops")
struct segtree {
vector<int> tree;
vector<int> promise;
segtree (int n) {
tree.resize(4 * n, 0);
promise.resize(4 * n, 0);
}
void push (int id, int l, int r) {
tree[id] += (r - l) * promise[id];
if (r - l > 1) {
promise[2 * id + 1] += promise[id];
promise[2 * id + 2] += promise[id];
}
promise[id] = 0;
}
void upd (int id, int l, int r, int lq, int rq, int up) {
push(id, l, r);
if (l >= lq && r <= rq) {
promise[id] += up;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |