# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
487983 | duyanh1704 | Palembang Bridges (APIO15_bridge) | C++14 | 41 ms | 4072 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 int long long
using namespace std;
const int maxN = 1e5;
typedef pair<int, int> ii;
int k, n;
vector<ii> v;
int f(int m){
int ret = 0;
for (auto [x, y] : v)
ret += abs(x - m) + abs(y - m) + 1;
return ret;
}
int solve(){
int l = 0, r = (int)1e9;
while (true){
if (r - l == 1){
if (f(l) < f(r)) return f(l);
return f(r);
}
int m = (l + r) >> 1;
if (f(m) > f(m + 1)) l = m;
else r = m;
}
return -1;
}
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... |