# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
604302 | lunchbox | Feast (NOI19_feast) | C++17 | 815 ms | 210980 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 <bits/stdc++.h>
using namespace std;
template<class T, class F>
T last_true(T lower, T upper, const F& f) {
lower--;
assert(lower <= upper);
while (lower < upper) {
T t = lower + (upper - lower + 1) / 2;
if (f(t))
lower = t;
else
upper = t - 1;
}
return lower;
}
const int N = 300000, N_ = 1 << 19;
#define int long long
array<int, 3> add(const array<int, 3> &l, const array<int, 3> &r) {
assert(l[2] + 1 == r[1]);
return { l[0] + r[0], l[1], r[2] };
}
struct T {
array<int, 3> pref[2], suff[2], ans[2], sum[2];
int empty;
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... |