#include <cmath>
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;
bool isvalid(vector<int> s){
for (int i = 0; i < s.size(); i += 2) {
if (!(abs(s[i]) == s[i + 1] && s[i] < s[i + 1])) {
return false;
}
}
return true;
}
long long count_swaps(vector<int> s) {
int cnt = 0;
for (int i = 0; i < s.size(); i += 2) {
if (!(abs(s[i]) == s[i + 1] && s[i] < s[i + 1])) {
swap(s[i], s[i + 1]);
cnt++;
}
}
return cnt;
}
# | 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... |