# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
808635 | KemalK | Arranging Shoes (IOI19_shoes) | C++17 | 1 ms | 300 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 <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int n;
long long count_swaps(std::vector<int> s) {
n = s.size();
if (n == 2){
if (s[0] < 0){
return 0;
}
return 1;
}
map <int, vector<int>> pos_right;
map <int, vector<int>> pos_left;
for (int i = 0; i < n; i++){
if (s[i] > 0){
pos_right[s[i]].push_back(i);
}
else{
pos_left[s[i]].push_back(i);
}
}
ll ans = 0;
for (auto x: pos_right){
for (int i = 0; i < x.second.size(); i++){
if (x.second[i] > pos_left[-x.first][i]){
ans += x.second[i] - pos_left[-x.first][i] - 1ll;
}
else{
ans += abs(x.second[i] - pos_left[-x.first][i]);
}
}
}
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... |