#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
ll count_swaps(vector<int> s) {
int n = s.size() / 2;
if (n > 8) return 0;
for (int i = 0; i < 2 * n; ++i) {
if (s[i] < 0) {
s[i] = abs(s[i]) * 2 - 1;
} else {
s[i] *= 2;
}
}
int res = 0;
while (!is_sorted(s.begin(), s.end())) {
for (int i = 0; i < 2 * n - 1; ++i) {
if (s[i] > s[i + 1]) {
swap(s[i], s[i + 1]);
++res;
}
}
}
return res;
}
// signed main() {
// cin.tie(0)->sync_with_stdio(0);
// vector<vector<int>> tc{
// {-1, 1, -2, 2}, // 0
// {-1, -2, 1, 2},
// {2, 1, -1, -2} // 4
// };
// /*
// {-1, 1, -2, 2}
// {0, 1, 2, 3}
// */
// for (auto &v : tc) {
// cout << count_swaps(v) << '\n';
// }
// }
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |