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 = (int)s.size();
long long sum = 0;
for(int i = 0; i < n; i+=2) {
int search = -s[i];
for(int j = i+1; j < n; j++) {
if(s[j] == search) {
if(search < 0)
sum += j-i;
else
sum += j-i+1;
for(int k = j; k > i; k--)
swap(s[k], s[k-1]);
j = n;
}
}
}
return sum;
}
# | 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... |