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 sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
int32_t main() {
int k, n;
cin >> k >> n;
ll ans = 0;
vector<int> v;
for(int i=0; i<n; i++) {
char a, b;
int c, d;
cin >> a >> c >> b >> d;
if(a == b) {
ans += abs(c - d);
} else {
v.push_back(c);
v.push_back(d);
}
}
if(v.size() == 0) {
cout << ans << '\n';
return 0;
}
sort(all(v));
ll med = (v[v.size()/2] + v[v.size()/2-1]) / 2;
for(int &x : v) ans += abs(med - x);
cout << ans + v.size() / 2 << '\n';
return 0;
}
# | 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... |