# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
624960 | KoD | Palembang Bridges (APIO15_bridge) | C++17 | 109 ms | 8724 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;
using std::vector;
template <class T>
constexpr T inf = std::numeric_limits<T>::max() / 2;
class slope_trick {
std::priority_queue<int> left;
std::priority_queue<int, vector<int>, std::greater<>> right;
ll min;
public:
slope_trick() : left(), right(), min(0) {}
void add(const int x) {
if (!left.empty() and x < left.top()) {
min += left.top() - x;
left.push(x);
right.push(left.top());
left.pop();
} else {
right.push(x);
}
if (!right.empty() and x > right.top()) {
min += x - right.top();
right.push(x);
left.push(right.top());
right.pop();
# | 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... |