# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
45535 | gnoor | Palembang Bridges (APIO15_bridge) | C++17 | 341 ms | 34688 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 <cstdio>
#include <set>
#include <algorithm>
using namespace std;
pair<int,int> ei[100100];
long long tmp[100100];
template <typename T,typename U>
long long work(T first, T last, U op) {
op(first,0);
multiset<int> ms;
multiset<int>::iterator mid;
ms.insert(first->first);
ms.insert(first->second);
mid = ms.begin();
long long sum=first->second-first->first;
op(++first,sum);
while (first!=last) {
ms.insert(first->first);
ms.insert(first->second);
sum+=abs(*mid-first->first);
sum+=abs(*mid-first->second);
if (first->second<*mid) {
mid--;
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... |