Submission #1047274

#TimeUsernameProblemLanguageResultExecution timeMemory
1047274vjudge1Arranging Shoes (IOI19_shoes)C++17
10 / 100
0 ms348 KiB
#include "shoes.h"
#include <bits/stdc++.h>

long long count_swaps(std::vector<int> s) {
	int n = s.size();
  std::map<int, std::vector<int>> idx;
  for (int i = n-1;i >= 0; --i) {
    idx[s[i]].push_back(i);
  }
  int64_t ans = 0;
  std::vector<bool> vis(n);
  for (int i = 0;i < n; ++i) {
    if (!vis[i]) {
      int next = idx[-s[i]].back();
      ans += next - i - (s[i] <= 0);
      vis[next] = true;
      idx[s[i]].pop_back();
      idx[-s[i]].pop_back();
    }
  }
  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...