# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
474103 | 2021-09-16T22:11:37 Z | ValiAntonie | Arranging Shoes (IOI19_shoes) | C++14 | 0 ms | 0 KB |
#include "shoes.h" #include<bits/stdc++.h> using namespace std; long long count_swaps(vector<int> v){ indice = -1; int i = 0, nr = 0, numar = 0, j = 0, j2 = 0; int n = v.size(); for(i=indice;i<=n;i++){ if(v[i] < 0){ indice++; numar = -v[i]; for(j=i;j>indice;j--){ swap(v[j],v[j-1]); nr++; } indice++; for(j2=1;j2<=n;j2++){ if(v[j2] == numar){ for(j=i;j>indice;j--){ swap(v[j],v[j-1]); nr++; } } } i = indice; } } return nr; }