# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
730303 | MilosMilutinovic | Dynamic Diameter (CEOI19_diameter) | C++14 | 3224 ms | 173732 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.
/**
* author: wxhtzdy
* created: 25.04.2023 16:05:28
**/
#include <bits/stdc++.h>
using namespace std;
struct segtree {
vector<long long> mx;
vector<long long> lzy;
segtree(int n) {
mx.resize(4 * n);
lzy.resize(4 * n);
fill(mx.begin(), mx.end(), 0);
fill(lzy.begin(), lzy.end(), 0);
}
void push(int v) {
if (2 * v + 1 < mx.size()) {
mx[2 * v] += lzy[v];
mx[2 * v + 1] += lzy[v];
lzy[2 * v] += lzy[v];
lzy[2 * v + 1] += lzy[v];
}
lzy[v] = 0;
}
void modify(int v, int l, int r, int ql, int qr, int x) {
if (l > qr || r < ql || l > r) {
return;
}
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... |