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