# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
236298 | mahmoudbadawy | Palembang Bridges (APIO15_bridge) | C++17 | 477 ms | 13036 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>
#define F first
#define S second
using namespace std;
struct median{
multiset<int> l,r;
long long lsum,rsum;
int med;
// l < med
// r med , > med
median():lsum(0),rsum(0){}
void fix()
{
// odd: l.size() = r.size()-1 , even: l.size() = r.size() (taking larger as median)
if(l.size()>r.size())
{
med=(*l.rbegin());
lsum-=med; rsum+=med;
l.erase(l.find(*l.rbegin()));
r.insert(med);
}
if(r.size() > l.size()+1)
{
l.insert(*r.begin());
lsum+=*r.begin(); rsum-=*r.begin();
r.erase(r.begin());
med=*r.begin();
}
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... |