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 int long long
int n;
const int MXN = 100005;
int x[MXN * 2], y[MXN * 2];
int at[MXN][3];
int pf[MXN][3];
int ans;
signed main() {
cin >> n;
for (int i=0; i<2*n; i++) {
int x, y;
cin >> x >> y;
if (x < 1) {
ans += (1 - x);
x = 1;
}
if (x > n) {
ans += (x - n);
x = n;
}
if (y < 1) {
ans += (1 - y);
y = 1;
}
if (y > 2) {
ans += (y - 2);
y = 2;
}
at[x][y]++;
}
int res1 = 0;
int res2 = 0;
for (int i=1; i<=n; i++) {
res1 += at[i][1] - 1;
res2 += at[i][2] - 1;
if (res1 > 0 && res2 < 0) {
int t = min(res1, -res2);
ans += t;
res1 -= t;
res2 += t;
}
if (res2 > 0 && res1 < 0) {
int t = min(res2, -res1);
ans += t;
res2 -= t;
res1 += t;
}
ans += abs(res1) + abs(res2);
}
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... |