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 <bits/stdc++.h>
using namespace std;
long long count_swaps(std::vector<int> s) {
int n = s.size() / 2;
vector<vector<int>> posL(n+1), posR(n+1);
for (int i = 0; i < 2*n; i++) {
if (s[i] > 0) posR[s[i]].push_back(i);
else posL[-s[i]].push_back(i);
}
int ans = 0;
for (int j = 1; j <= n; j++) {
for (int k = 0; k < (int)posR[j].size(); k++) {
// cout << posL[j][k] << " " << posR[j][k] << "\n";
ans += abs(posR[j][k] - posL[j][k]) - 1;
if (posL[j][k] > posR[j][k]) ans++;
}
}
return ans;
}
# | 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... |