# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
676251 | dutinmeow | Two Dishes (JOI19_dishes) | C++17 | 7337 ms | 311880 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>
template<class segment_tree_template>
class lazy_segment_tree : public segment_tree_template {
using T = typename segment_tree_template::node_type;
using L = typename segment_tree_template::lazy_type;
using segment_tree_template::node_default_value;
using segment_tree_template::lazy_default_value;
using segment_tree_template::merge;
using segment_tree_template::apply;
protected:
int n;
std::vector<T> tree;
std::vector<L> lazy;
private:
void pushdown(int t, int tl, int tr) {
if (lazy[t] == lazy_default_value)
return;
int tm = (tl + tr) / 2;
apply(tree[t * 2], lazy[t * 2], lazy[t], tl, tm);
apply(tree[t * 2 + 1], lazy[t * 2 + 1], lazy[t], tm + 1, tr);
lazy[t] = lazy_default_value;
}
void insert(int i, T v, int t, int tl, int tr) {
if (tl == tr) {
tree[t] = v;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |