# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
703034 | rainboy | Weighting stones (IZhO11_stones) | C11 | 44 ms | 3640 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_ (1 << 17)
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
int sum[N_ * 2], mn[N_ * 2], mx[N_ * 2], n_;
void pul(int i) {
int l = i << 1, r = l | 1;
sum[i] = sum[l] + sum[r];
mn[i] = min(mn[l] + sum[r], mn[r]);
mx[i] = max(mx[l] + sum[r], mx[r]);
}
void update(int i, int x) {
i += n_;
sum[i] = x, mn[i] = min(x, 0), mx[i] = max(x, 0);
while (i > 1)
pul(i >>= 1);
}
int main() {
int n;
scanf("%d", &n);
n_ = 1;
while (n_ < n)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |