# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
900661 | ozner77 | 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 "shoes.h"
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <string>
using namespace std;
long long count_swaps(std::vector<int> s) {
int e=s.size();
long long swaps=0;
for(int i=0;i<e;i++){
c=s[i+1];
if(s[i]>0){
swaps++;
}
for(int k=i+1;k<e;k++){
if(s[k]+s[i]==0){
swaps+=(k-(i+1));
s.erase(s.begin()+k);
break;
}
}
}
return swaps;
}