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;
typedef long long Int;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<Int> x(n + n), y(n + n);
for (int i = 0; i < n + n; i++) cin >> x[i] >> y[i];
sort(x.begin(), x.end());
sort(y.begin(), y.end());
Int answer = 0;
for (int i = 0; i < n + n; i++) {
answer += abs(x[i] - (i / 2) - 1);
answer += abs(y[i] - (i / n) - 1);
// cerr << "x : " << x[i] << " to " << (i / 2) + 1 << '\n';
// cerr << "y : " << y[i] << " to " << (i / n) + 1 << '\n';
}
cout << answer;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |