# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
25506 | gabrielsimoes | Palembang Bridges (APIO15_bridge) | C++14 | 103 ms | 10912 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;
typedef long long ll;
typedef pair<ll,ll> pll;
#define med q1.top()
struct Median{
priority_queue<ll, vector<ll>, less<ll>> q1;
priority_queue<ll, vector<ll>, greater<ll>> q2;
ll sum1, sum2;
Median() : sum1(0), sum2(0) {};
void insert(ll x) {
if (!q1.empty() && x >= med) q2.push(x), sum2 += x;
else q1.push(x), sum1 += x;
if (q1.size() > q2.size()+1) {
q2.push(q1.top());
sum2 += q1.top();
sum1 -= q1.top();
q1.pop();
} else if (q1.size() < q2.size()) {
q1.push(q2.top());
sum1 += q2.top();
sum2 -= q2.top();
q2.pop();
}
}
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... |