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>
#define ll long long
#define vi vector<int>
using namespace std;
ll count_swaps(vi s) {
int n = s.size() / 2, ans = 0;
if(n == 1)
ans = (s[0] > 0);
bool ok = true;
for(int i = 1; i < 2 * n; ++i)
if(abs(s[i]) != abs(s[0]))
ok = false;
if(ok)
for(int i = 0; i < n; ++i)
if(s[2 * 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... |