# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
114333 | Bruteforceman | Palembang Bridges (APIO15_bridge) | C++11 | 337 ms | 23912 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 pair <int, int> pii;
vector <pii> v;
long long pre[1000010], suf[1000010];
bool cmp(pii a, pii b) {
return a.first + a.second < b.first + b.second;
}
long long solver(vector <pii> u) {
vector <int> a;
for(auto i : u) {
a.push_back(i.first);
a.push_back(i.second);
}
sort(a.begin(), a.end());
long long ans = 0;
for(int i : a) {
ans += abs(a[a.size() / 2] - i);
}
return ans;
}
struct median_ds {
multiset <int> P, Q;
long long sumP, sumQ;
median_ds () {
sumP = sumQ = 0;
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... |