| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1400925 | gem123 | Arranging Shoes (IOI19_shoes) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(vector<int>v){
long long n=v.size()/2;
vector<int>v(n*2);
for(int i=0;i<n*2;i++){
cin>>v[i];
}
long long ans=0;
for(int i=0;i<n*2-1;i+=2){
if(abs(v[i])!=abs(v[i+1])){
for(int j=i+2;j<2*n;j++){
if(abs(v[i])!=abs(v[j])){
swap(v[i],v[j]);
ans++;
}
}
}
}
int i=0;
while(i<2*n-1){
if(v[i]<0&&v[i+1]>0){
i+=2;
}else{
i+=2;
ans++;
}
}
return ans
}