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;
int main() {
cin.tie(0)->sync_with_stdio(0);
int n;
cin >> n;
vector cnt(3, vector(n + 5, 0));
ll ans = 0;
for (int i = 1; i <= 2 * n; i++) {
ll x, y;
cin >> x >> y;
ll tarx, tary;
if (x >= 1 && x <= n) {
tarx = x;
}
else {
if (x < 1) tarx = 1;
else tarx = n;
}
if (y >= 1 && y <= 2) {
tary = y;
}
else {
if (y < 1) tary = 1;
else tary = 2;
}
++cnt[tary][tarx];
ans += abs(x - tarx) + abs(y - tary);
}
int sum = 0;
for (int i = 1; i <= n; i++) {
sum += cnt[1][i] + cnt[2][i];
int req = 2 * i;
ans += abs(req - sum);
}
int sum2 = 0;
for (int i = 1; i <= n; i++) {
sum2 += cnt[1][i];
}
ans += abs(n - sum2);
cout << ans << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |