#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define pii pair<int,int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T i, U ...j) {
cout << i << ' ', abc(j...);
}
template <typename T> void printv(T l, T r) {
for (; l != r; ++l)
cout << *l << " \n"[l + 1 == r];
}
#ifdef Doludu
#define test(x...) abc("[" + string(#x) + "]", x)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define test(x...) void(0)
#define owo ios::sync_with_stdio(false), cin.tie(0)
#endif
int main () {
owo;
srand(time(NULL));
int n;
cin >> n;
vector <vector <int>> cnt(n, vector <int> (2, -1));
lli ans = 0;
for (int i = 0, x, y; i < n * 2; ++i) {
cin >> x >> y, --x, --y;
if (x < 0) {
if (y <= 0)
ans += -x - y, cnt[0][0]++;
else
ans += -x + y - 1, cnt[0][1]++;
} else if (x >= n) {
if (y <= 0)
ans += x - n + 1 - y, cnt[n - 1][0]++;
else
ans += x - n + 1 + y - 1, cnt[n - 1][1]++;
} else {
if (y <= 0)
ans += -y, cnt[x][0]++;
else
ans += y - 1, cnt[x][1]++;
}
}
for (int i = 0; i < n; ++i) {
if (cnt[i][0] > 0 && cnt[i][1] < 0)
cnt[i][0]--, cnt[i][1]++, ans++;
else if (cnt[i][0] < 0 && cnt[i][1] > 0)
cnt[i][1]--, cnt[i][0]++, ans++;
}
vector <int> source[2], sink[2];
for (int i = 0; i < n; ++i) for (int j = 0; j < 2; ++j) {
if (cnt[i][j] < 0) {
if (!source[j].empty()) {
ans += i - source[j].back(); source[j].pop_back();
} else if (!source[j ^ 1].empty()) {
ans += i - source[j ^ 1].back() + 1; source[j ^ 1].pop_back();
} else {
sink[j].pb(i);
}
} else {
for (int k = 0; k < cnt[i][j]; ++k) {
if (!sink[j].empty()) {
ans += i - sink[j].back(); sink[j].pop_back();
} else if (!sink[j ^ 1].empty()) {
ans += i - sink[j ^ 1].back() + 1; sink[j ^ 1].pop_back();
} else {
source[j].pb(i);
}
}
}
}
cout << ans << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
0 ms |
204 KB |
Output is correct |
| 3 |
Correct |
0 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Incorrect |
0 ms |
204 KB |
Output isn't correct |
| 7 |
Halted |
0 ms |
0 KB |
- |
