# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
978417 | nnin | Palembang Bridges (APIO15_bridge) | C++17 | 34 ms | 4904 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 pii pair<int,int>
using ll = long long;
#define f first
#define s second
vector<pii> cross;
int N, K;
ll check1(int bridge) {
ll ret = 0;
for(auto [st, en]:cross) {
if(bridge<st) ret += (ll)st-bridge+en-bridge;
else if(bridge>en) ret += (ll)bridge-st+bridge-en;
else ret += (ll)en-st;
}
return ret;
}
ll check2(int br1, int br2) {
ll ret = 0;
for(auto [st, en]:cross) {
if((st<=br1&&br1<=en) || (st<=br2&&br2<=en)) ret += (ll)en-st;
else if(br2<st) ret += (ll)st-br2+en-br2;
else if(br1>en) ret += (ll)br1-st+br1-en;
else ret += min((ll)st-br1+en-br1, (ll)br2-st+br2-en);
}
return ret;
}
# | 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... |