| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 212646 | Aydarov03 | Arranging Shoes (IOI19_shoes) | C++14 | 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>
using namespace std;
long long count_swaps(std::vector<int> a) {
  int n = s.size();
  int ans = 0;
  for (int l = 0; l < n; l += 2) {
    int lst = -1;
    if (a[l] < 0) {
      lst = l + 1;
    } else {
      lst = l;
    }
    for (int r = l + 1; r < n; r++) {
      if (a[r] == -a[l]) {
        int pos = r;
        while (pos > lst) {
          swap(a[pos], a[pos - 1]);
          pos--, ans++;
        }
        break;
      }
    }
  }
  return ans;
}
