# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
25325 | tlwpdus | Palembang Bridges (APIO15_bridge) | C++14 | 139 ms | 5824 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<int,int> pii;
struct median {
int sz;
ll sum1, sum2;
priority_queue<int> pq1;
priority_queue<int,vector<int>,greater<int> > pq2;
median() {sz = 0; sum1 = sum2 = 0;}
void cle() {
sz = 0; sum1 = sum2 = 0;
while(!pq1.empty()) pq1.pop();
while(!pq2.empty()) pq2.pop();
}
void push(int a) {
if (sz&1) {
if (a<pq1.top()) {
pq1.push(a);
sum1 += a;
pq2.push(pq1.top());
sum2 += pq1.top();
sum1 -= pq1.top();
pq1.pop();
}
else {
sum2+=a;
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... |