# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305968 | 2020-09-24T08:03:39 Z | tengiz05 | Arranging Shoes (IOI19_shoes) | C++17 | 0 ms | 0 KB |
#include "shoes.h" #include "grader.cpp" using namespace std; long long count_swaps(vector<int> a) { int n = a.size()/2; long long ans = 0; for(int i=0;i<n;i++){ if(a[i*2]+a[i*2+1] == 0){ if(a[i*2] > 0){ ans ++; swap(a[i*2], a[i*2+1]); } continue; } int j; for(j=i*2+1; j < n*2; j++){ if(a[j] == -a[i*2]){ // found break; } } if(a[i*2] < 0){ while(j-1 > i*2){ j--; swap(a[j], a[j+1]); ans ++ ; } }else { while(j-1 >= i*2){ j--; swap(a[j], a[j+1]); ans ++ ; } } } return ans; } /* 3 -2 2 2 -2 -2 2 2 2 1 -1 -2 */