# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
872820 | rainboy | Feast (NOI19_feast) | C11 | 58 ms | 40532 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 300000
#define H_ 19 /* H_ = ceil(log2(N + 1)) */
#define N_ (1 << H_)
#define INF 0x3f3f3f3f3f3f3f3fLL
long long min(long long a, long long b) { return a < b ? a : b; }
long long max(long long a, long long b) { return a > b ? a : b; }
unsigned int X = 12345;
int rand_() {
return (X *= 3) >> 1;
}
long long ppmn[N_ * 2], ppmx[N_ * 2], ssmn[N_ * 2], ssmx[N_ * 2]; int n_;
void pul(int i) {
int l = i << 1, r = l | 1;
ppmn[i] = min(ppmn[l], ppmn[r]);
ppmx[i] = max(ppmx[l], ppmx[r]);
ssmn[i] = min(ssmn[l], ssmn[r]);
if (ppmx[l] != -INF && ppmn[r] != INF)
ssmn[i] = min(ssmn[i], ppmn[r] - ppmx[l]);
ssmx[i] = max(ssmx[l], ssmx[r]);
if (ppmn[l] != INF && ppmx[r] != -INF)
ssmx[i] = max(ssmx[i], ppmx[r] - ppmn[l]);
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |