#include <bits/stdc++.h>
#define pb push_back
#define fs first
#define sc second
using namespace std;
int count_swaps(vector<int> a){
int n = a.size();
map<int, set<int>> mp;
for(int i = 0; i < n; i++){
mp[a[i]].insert(i);
}
int ans = 0;
for(int i = 0; i < n; i++){
if(a[i] > 0) ans += i - *mp[-a[i]].begin();
else ans += i - *mp[-a[i]].begin() - 1;
mp[-a[i]].erase(mp[-a[i]].begin());
}
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... |