# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
427037 | KoD | Food Court (JOI21_foodcourt) | C++17 | 508 ms | 40260 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 ll = long long;
template <class T> using Vec = std::vector<T>;
constexpr ll INF = std::numeric_limits<ll>::max() / 2;
struct Fenwick {
Vec<ll> data;
explicit Fenwick(const int n): data(n + 1) {}
void add(int i, const ll x) {
for (++i; i < (int) data.size(); i += i & -i) {
data[i] += x;
}
}
ll get(int i) const {
ll x = 0;
for (; i > 0; i -= i & -i) {
x += data[i];
}
return x;
}
int lower_bound(ll x) const {
int i = 1, j = 0;
while (2 * i < (int) data.size()) {
i <<= 1;
}
while (i > 0) {
if (j + i < (int) data.size() and x > data[j + 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |