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>
#include "shoes.h"
// #define int long long
using namespace std;
long long count_swaps(std::vector<int> s) {
int n = s.size();
long long moves = 0;
for(int i = 0; i < n;i+=2){
int j = i+1;
while(j <= n and s[j] != -s[i]){
j++;
}
// s[i] = -s[j];
while(j != i+1){
swap(s[j], s[j-1]);
j--;
moves++;
}
if(s[i] > 0)swap(s[i], s[j]), moves++;
}
return moves;
}
# | 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... |