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