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;
typedef vector<int> vi;
int abs_(int a) { return a > 0 ? a : -a; }
long long count_swaps(vi aa) {
int n = aa.size() / 2, i, balance;
long long ans;
ans = 0, balance = 0;
for (i = 0; i < n * 2; i++) {
if (aa[i] > 0)
balance++;
else
balance--;
ans += abs_(balance + (i % 2 == 0 ? 1 : 0)) / 2;
}
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... |