# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
114946 | Mercenary | Palembang Bridges (APIO15_bridge) | C++14 | 92 ms | 6384 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 taskname "A"
#define pb push_back
#define mp make_pair
#ifndef LOCAL
#define cerr if(0)cout
#endif
typedef long double ld;
typedef long long ll;
typedef pair<int,int> ii;
const int maxn = 1e5 + 5;
int k , n;
vector<ii> a;
namespace Median_heap{
ll lsum , hsum;
priority_queue<int,vector<int>,greater<int>> h;
priority_queue<int> l;
void add(int a , int b){
if(a > b)swap(a,b);
l.push(a);h.push(b);
lsum += a , hsum += b;
while(l.top() > h.top()){
int u = l.top();int v = h.top();
lsum += v - u;
hsum += u - v;
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... |