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(vector<int> s) {
int n = s.size();
int ans = 0;
for(int i = 0; i < n; i += 2){
if(s[i] < 0){
int p = 0;
for(int j = i + 1; j < n; ++j)
if(s[j] == -1 * s[i]){
p = j;
break;
}
while(p > i + 1)
swap(s[p - 1], s[p]), --p, ++ans;
}else{
int p = 0;
for(int j = i + 1; j < n; ++j)
if(s[j] == -1 * s[i]){
p = j;
break;
}
while(p > i)
swap(s[p - 1], s[p]), --p, ++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... |