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"
using namespace std;
long long count_swaps(vector<int> s) {
int n = s.size();
long long ans = 0;
for (int i = 0; i < n; i += 2) {
if (s[i] == -s[i+1]){
if (s[i] > 0) ans++;
continue;
}
int k = i+1;
while (s[k] != -s[i]) k++;
for (int j = k-1; j > i; --j) {
swap(s[j], s[j+1]);
ans++;
}
if (s[i] > 0) 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... |