# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
557023 | rainboy | Sterilizing Spray (JOI15_sterilizing) | C11 | 5084 ms | 5324 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 <stdio.h>
#define N 100000
#define N_ (1 << 17) /* N_ = pow2(ceil(log2(N))) */
long long st[N_ * 2]; int n_, d;
void pul(int i) {
st[i] = st[i << 1 | 0] + st[i << 1 | 1];
}
void build(int *aa, int n) {
int i;
n_ = 1;
while (n_ < n)
n_ <<= 1;
for (i = 0; i < n; i++)
st[n_ + i] = aa[i];
for (i = n_ - 1; i > 0; i--)
pul(i);
}
void upd(int i, int x) {
i += n_;
st[i] = x;
while (i > 1)
pul(i >>= 1);
}
void update_(int i) {
if (st[i] == 0)
return;
if (i >= n_) {
st[i] /= d;
return;
}
update_(i << 1 | 0), update_(i << 1 | 1);
pul(i);
}
void update(int l, int r) {
for (l += n_, r += n_; l <= r; l >>= 1, r >>= 1) {
if ((l & 1) == 1)
update_(l++);
if ((r & 1) == 0)
update_(r--);
}
}
long long query(int l, int r) {
long long x = 0;
for (l += n_, r += n_; l <= r; l >>= 1, r >>= 1) {
if ((l & 1) == 1)
x += st[l++];
if ((r & 1) == 0)
x += st[r--];
}
return x;
}
int main() {
static int aa[N];
int n, q, i;
scanf("%d%d%d", &n, &q, &d);
for (i = 0; i < n; i++)
scanf("%d", &aa[i]);
build(aa, n);
while (q--) {
int t, x, l, r;
scanf("%d", &t);
if (t == 1) {
scanf("%d%d", &i, &x), i--;
upd(i, x);
aa[i] = x;
} else {
scanf("%d%d", &l, &r), l--, r--;
if (t == 2) {
if (d > 1)
update(l, r);
for (i = l; i <= r; i++)
aa[i] /= d;
} else {
long long sum;
sum = 0;
for (i = l; i <= r; i++)
sum += aa[i];
printf("%lld\n", sum);
}
}
}
return 0;
}
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... |