# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
673312 | Cyanmond | Progression (NOI20_progression) | C++17 | 2089 ms | 77104 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 i64 = long long;
constexpr i64 inf = 1ll << 60;
template <class M>
class segtree {
int n, seg_size;
using T = typename M::T;
std::vector<T> tree;
void update(int i) {
tree[i] = M::operate(tree[2 * i], tree[2 * i + 1]);
}
public:
segtree(int n_) : n(n_) {
seg_size = 1;
while (seg_size < n) {
seg_size *= 2;
}
tree.assign(2 * seg_size, M::identity());
}
void set(int i, T v) {
i += seg_size;
tree[i] = v;
while (i != 1) {
i /= 2;
update(i);
# | 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... |