Submission #26035909

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>

template <class T> std::vector<int> shrink_coordinate(std::vector<T> &a) {
  std::vector<T> b = a;

  std::sort(b.begin(), b.end());
  b.erase(std::unique(b.begin(), b.end()), b.end());

  int N = a.size();

  std::vector<int> res(N);
  for (int i = 0; i < N; i++) {
    res[i] = std::lower_bound(b.begin(), b.end(), a[i]) - b.begin();
  }

  return res;
}

int main() {
  int N;
  std::cin >> N;

  std::vector<int> a(N);
  for (int i = 0; i < N; i++) {
    std::cin >> a[i];
  }

  std::vector<int> b = shrink_coordinate(a);
  for (int i = 0; i < N; i++) {
    std::cout << b[i] << "\n";
  }

  return 0;
}

Submission Info

Judge Result