제출 #212647

#제출 시각아이디문제언어결과실행 시간메모리
212647Aydarov03Arranging Shoes (IOI19_shoes)C++14
50 / 100
1094 ms3448 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

long long count_swaps(std::vector<int> a) {
  int n = a.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;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...