# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
636996 | imeimi2000 | Distributing Candies (IOI21_candies) | C++17 | 1307 ms | 51072 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 "candies.h"
#include <cstdio>
#include <vector>
using namespace std;
using ll = long long;
int n, q;
ll mx[1 << 19], mn[1 << 19], add[1 << 19];
void lazy(int i) {
mn[i + i] += add[i];
mn[i + i + 1] += add[i];
mx[i + i] += add[i];
mx[i + i + 1] += add[i];
add[i + i] += add[i];
add[i + i + 1] += add[i];
add[i] = 0;
}
void update(int i, int s, int e, int x, int v) {
if (e < x) return;
if (x <= s) {
mn[i] += v;
mx[i] += v;
add[i] += v;
return;
}
lazy(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... |