# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
823946 | rainboy | Triangle Collection (CCO23_day2problem3) | C11 | 192 ms | 16680 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 200000
#define N_ (1 << 18) /* N_ = pow2(ceil(log2(N))) */
long long min(long long a, long long b) { return a < b ? a : b; }
long long ss[N_ * 2], qq[N_ * 2]; int n_;
void pul(int i) {
int l = i << 1, r = l | 1;
ss[i] = ss[l] + ss[r];
qq[i] = min(qq[l] + ss[r], qq[r]);
}
void build(int *aa, int n) {
int i;
n_ = 1;
while (n_ < n)
n_ <<= 1;
for (i = 0; i < n; i++) {
ss[n_ + i] += aa[i] / 2;
if (aa[i] % 2 != 0)
ss[n_ + (i + 1) / 2]--;
}
for (i = 0; i < n_; i++)
qq[n_ + i] = min(ss[n_ + i], 0);
for (i = n_ - 1; i > 0; i--)
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |