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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long count_swaps(vector<int> s) {
int n = s.size() / 2;
ll ans = 0;
for (int i = 0; i < 2 * n; i += 2) {
int j;
for (j = i + 1; j < 2 * n; j++) {
if (s[j] == -s[i]) break;
}
if (s[i] < 0)
ans += j - i - 1;
else
ans += j - i;
for (; j > i; j--) swap(s[j], s[j - 1]);
}
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... |