# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
971819 | Halym2007 | Palembang Bridges (APIO15_bridge) | C++17 | 1 ms | 600 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 ll long long
#define pb push_back
#define sz size()
const int N = 1e5 + 5;
ll jogap, a[N], b[N];
int n, k;
char oy[N], of[N];
vector <ll> v;
ll hasapla (ll x, ll y) {
ll ret = 0;
for (int i = 1; i <= n; ++i) {
if (oy[i] == of[i]) {
ret += abs (a[i] - b[i]);
}
else {
ll gosh = abs (a[i] - x) + abs (x - b[i]) + 1;
ll gosh1 = 2e18;
if (k > 1)
gosh1 = abs (a[i] - y) + abs (y - b[i]) + 1;
ret += min (gosh, gosh1);
}
}
return ret;
}
int main () {
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
// freopen ("input.txt", "r", stdin);
cin >> k >> n;
for (int i = 1; i <= n; ++i) {
cin >> oy[i] >> a[i] >> of[i] >> b[i];
}
ll goshmaly = 0;
jogap = 2e18;
for (int i = 1; i <= n; ++i) {
if (oy[i] == of[i]) {
goshmaly += abs (a[i] - b[i]);
}
else v.pb (a[i]);v.pb (b[i]);
}
sort (v.begin(), v.end());
jogap = hasapla (v[(int)v.sz / 2 - 1], -1);
cout << jogap;
}
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... |