#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF 1000000000000000000
#define MOD 998244353
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n, x, y, ans = 0;
cin >> n;
int a[n][2];
memset(a, 0, sizeof(a));
for(int i = 0; i < 2*n; i++) {
cin >> x >> y;
if(x < 1) {
ans += 1-x;
x = 1;
} else if(x > n) {
ans += x-n;
x = n;
}
if(y < 1) {
ans += 1-y;
y = 1;
} else if(y > 2) {
ans += y-2;
y = 2;
}
x--; y--;
a[x][y]++;
}
int a1 = 0, a2 = 0;
for(int i = 0; i < n; i++) {
a1 += a[i][0]-1;
a2 += a[i][1]-1;
if(a1 < 0 && a2 > 0) {
int tmp = -a1;
a1 += tmp; a2 -= tmp; ans += tmp;
} else if(a2 < 0 && a1 > 0) {
int tmp = -a2;
a2 += tmp; a1 -= tmp; ans += tmp;
}
ans += abs(a1) + abs(a2);
}
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
600 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
600 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
600 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
7 |
Halted |
0 ms |
0 KB |
- |