Submission #912513

#	Time	Username	Problem	Language	Result	Execution time	Memory
912513		agusss	Arranging Shoes (IOI19_shoes)	C++14	50 / 100	1075 ms	3264 KiB

shoes

#include "vector"
#include "stdio.h"
#include "iostream"

using namespace std;

long long count_swaps(std::vector<int> s) {
  vector<bool> used(s.size(), false);
  long long cnt = 0;
  // cout << "size:" << s.size() << "\n";
  for (int i = 0; i < (int)s.size(); i++) {
    int j;
    if (used[i]) {
      continue;
    }
    // cout << "to pair" << i << "\n";
    int cnt_used = 0;
    for (j = i + 1; j < (int)s.size(); j++) {
      cnt_used += used[j];
      if (s[j] == -s[i] and !used[j]) {
        used[j] = true;
        break;
      }
    }
    if (j < (int)s.size()) {
      // cout << i << ": " << s[i] << " , "<< j << ": " << s[j] << "\n";
      long long distance = j - i - (s[i] < 0 ? 1 : 0) - cnt_used;
      cnt += distance;
    }
  }
	return cnt;
}

int mani() {
  int n;
  if (scanf("%d\n", &n));
  vector<int> A(n << 1);
  for (int i = 0; i < n << 1; i++) {
    if (scanf("%d", &A[i]));
  }
  printf("%lld\n", count_swaps(A));

  return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 20 / 20
• Subtask 6: 0 / 15