# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
670547 | birthdaycake | Arranging Shoes (IOI19_shoes) | C++17 | 0 ms | 0 KiB |
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"
using namespace std;
long long vs[1001];
long long count_swaps(vector<long long>s) {
long long n = s.size(); long long ans = 0;
for(long long i = 0; i < n; i++){
long long f = 0;
for(long long j = 0; j < i; j++){
if(!vs[j] && s[i] == -s[j]){
f = j + 1;
break;
}
}
if(f){
f--;
vs[f] = 1;
vs[f + 1] = 1;
if(s[f] < 0) ans += (i - f - 1);
else ans += (i - f);
while(i != f + 1){
swap(s[i], s[i - 1]);
i--;
}
if(s[f] > 0) swap(s[f], s[f + 1]);
}
}
return ans;
}