# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
523837 | pakhomovee | Arranging Shoes (IOI19_shoes) | C++17 | 0 ms | 204 KiB |
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 "shoes.h"
#include <cmath>
using namespace std;
long long count_swaps(std::vector<int> s) {
const int n = s.size();
long long ans = 0;
vector<vector<int>> idPlus(n);
vector<vector<int>> idMinus(n);
for (int i = 0; i < n; ++i) {
if (s[i] > 0) {
idPlus[abs(s[i])].push_back(i);
} else {
idMinus[abs(s[i])].push_back(i);
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < idPlus[i].size(); ++j) {
if (idPlus[i][j] < idMinus[i][j]) {
ans += idMinus[i][j] - idPlus[i][j];
} else {
ans += idPlus[i][j] - idMinus[i][j] + 1;
}
}
}
return ans;
}
Compilation message (stderr)
# | 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... |