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;
using ll = long long;
#define ff first
#define ss second
#define pii pair<int, int>
ll f(int x, vector<pii> &v) {
ll sm = 0;
for (auto i : v) sm += abs(i.ff - x) + 1 + abs(i.ss - x);
return sm;
}
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
int k, n;
cin >> k >> n;
ll sm = 0;
vector<pii> v;
for (int i = 0; i < n; i++) {
char p, q;
int s, t;
cin >> p >> s >> q >> t;
if (p == q) sm += abs(t - s);
else v.push_back({s, t});
}
int l = 0, r = (int)1e9;
while (l <= r) {
int md = (l + r) >> 1;
if (f(md, v) >= f(md + 1, v)) l = md + 1;
else r = md - 1;
}
cout << sm + f(l, v);
}
# | 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... |