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>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
#define PB push_back
#define pb pop_back
#define in insert
#define endl "\n"
const unsigned int M = 1000000007;
ll count_swaps(vi S){
ll n = S.size();
ll swaps = 0;
for(ll i= 0; i < n; i+=2){
ll ind = -1;
for(ll j = i + 1; j < n; j++){
if(S[j] == - S[i]){
ind = j;
break;
}
}
for(ll j = ind; j > i + 1; j--){
swap(S[j], S[j-1]);
swaps++;
}
if(S[i+1] < S[i]){
swap(S[i], S[i+1]);
swaps++;
}
}
return swaps;
}
//int main(){
// vi v;
// v.PB(-2);
// v.PB(2);
// v.PB(2);
// v.PB(-2);
// cout<<count_swaps(v);
//}
# | 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... |