# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
390079 | KoD | Fortune Telling 2 (JOI14_fortune_telling2) | C++17 | 488 ms | 34408 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>;
template <class T>
void fix(Vec<T>& vec) {
std::sort(vec.begin(), vec.end());
vec.erase(std::unique(vec.begin(), vec.end()), vec.end());
}
template <class T>
int lowb(const Vec<T>& vec, const T& x) {
return std::lower_bound(vec.cbegin(), vec.cend(), x) - vec.cbegin();
}
template <class T>
int upb(const Vec<T>& vec, const T& x) {
return std::upper_bound(vec.cbegin(), vec.cend(), x) - vec.cbegin();
}
template <class T>
void setmax(T& lhs, const T& rhs) {
if (lhs < rhs) {
lhs = rhs;
}
}
struct Segtree {
int size;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |