# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
349968 | denkendoemeer | Palembang Bridges (APIO15_bridge) | C++14 | 142 ms | 5888 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;
#define ll long long
ll v[100005],s1,s2;
int mij;
vector<pair<int,int>>poz;
priority_queue<int>pq;
priority_queue<int,vector<int>,greater<int>>pq2;
void update(int x)
{
if (x<mij)
pq.push(x),s1+=x;
else
pq2.push(x),s2+=x;
if (pq.size()+2<=pq2.size()){
pq.push(mij);
s1+=mij;
mij=pq2.top();
pq2.pop();
s2-=mij;
}
else
if (pq.size()>=pq2.size()+2){
pq2.push(mij);
s2+=mij;
mij=pq.top();
pq.pop();
s1-=mij;
}
}
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... |