# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
391560 | KoD | Pinball (JOI14_pinball) | C++17 | 162 ms | 12420 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>
template <class T>
using Vec = std::vector<T>;
using ll = long long;
constexpr ll INF = std::numeric_limits<ll>::max() / 3;
struct Segtree {
int size;
Vec<ll> min;
Segtree(const int n): size(n), min(2 * n, INF) { }
void setmin(int i, const ll x) {
i += size;
while (i > 0) {
min[i] = std::min(min[i], x);
i >>= 1;
}
}
ll fold(int l, int r) const {
ll ret = INF;
l += size;
r += size;
while (l < r) {
if (l & 1) ret = std::min(ret, min[l++]);
if (r & 1) ret = std::min(ret, min[--r]);
l >>= 1;
# | 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... |