# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
698015 | Elvin_Fritl | Distributing Candies (IOI21_candies) | C++17 | 569 ms | 38100 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>
struct Seg {
struct Item {
long long min = 0, max = 0;
long long lazy = 0;
constexpr friend Item merge(Item l, Item r) {
return { std::min(l.min, r.min), std::max(l.max, r.max), l.lazy + r.lazy };
}
};
int size;
std::vector <Item> v;
Seg(int s) {
size = 1;
while (size < s) {
size <<= 1;
}
v.resize(size << 1);
}
inline void push(int now, int l, int r) {
v[now].min += v[now].lazy;
v[now].max += v[now].lazy;
if (r - l - 1) {
# | 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... |