# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
34413 | aome | Sterilizing Spray (JOI15_sterilizing) | C++14 | 613 ms | 8816 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 namespace std;
const int N = 100005;
int n, m, x, a[N];
long long it[2][4 * N];
void build(int i, int l, int r) {
if (l == r) {
it[0][i] = it[1][i] = a[l]; return;
}
int mid = (l + r) >> 1;
build(i << 1, l, mid), build(i << 1 | 1, mid + 1, r);
it[0][i] = it[0][i << 1] + it[0][i << 1 | 1];
it[1][i] = max(it[1][i << 1], it[1][i << 1 | 1]);
}
void upd(int i, int l, int r, int p, int x) {
if (l == r) {
it[0][i] = it[1][i] = x; return;
}
int mid = (l + r) >> 1;
if (p <= mid) upd(i << 1, l, mid, p, x);
else upd(i << 1 | 1, mid + 1, r, p, x);
it[0][i] = it[0][i << 1] + it[0][i << 1 | 1];
it[1][i] = max(it[1][i << 1], it[1][i << 1 | 1]);
}
long long get(int i, int l, int r, int u, int v) {
# | 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... |