# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
536369 | lunchbox | Land of the Rainbow Gold (APIO17_rainbow) | C++17 | 1161 ms | 167560 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 "rainbow.h"
#include <bits/stdc++.h>
using namespace std;
#define N 200005
#define L 18
#define N_ (1 << L)
#define M (42424242)
int sum[M], ll[M], rr[M];
int node(int k = 0) {
static int _ = 1;
sum[_] = sum[k];
ll[_] = ll[k], rr[_] = rr[k];
return _++;
}
int build_(int l, int r) {
int v = node(), m;
if (l < r) {
m = (l + r) / 2;
ll[v] = build_(l, m);
rr[v] = build_(m + 1, r);
}
return 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |