Submission #4033558

---

Source Code Expand

#include <iostream>
#include <cmath>
#include <vector>
#include <map>
#include <string>
#include <algorithm>
#include <numeric>
#include <queue>

typedef long long ll;

template <typename T> void print(T a) {std::cout << a << std::endl;}
template <typename T> void print(std::string s, T a) {std::cout << s << " " << a << std::endl;}
template<typename Iterator> void print(Iterator begin, Iterator end)
{
  for (Iterator it = begin; it != end; it++) {
    std::cout << "[" << std::distance(begin, it) << "] " << *it << " ";
    if (std::distance(begin, it) % 50 == 49) { std::cout << std::endl; }
  }
  std::cout << std::endl;
}

int main(int argc, char* argv[])
{
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);

  ll N;
  std::cin >> N;
  std::vector< ll > va(N, 0LL);
  std::vector< ll > vx(N, 0LL);

  for (ll i = 0; i < N; i++) {
    std::cin >> va[i];
  }

  std::copy(va.begin(), va.end(), vx.begin());
  std::sort(vx.begin(), vx.end());
  vx.erase(std::unique(vx.begin(), vx.end()), vx.end());

  ll cnt = 0;
  std::map< ll, ll > mm;
  for (std::vector< ll >::iterator it = vx.begin(); it != vx.end(); it++) {
    mm[*it] = cnt;
    cnt++;
  }

  for (ll i = 0; i < N; i++) {
    print(mm[va[i]]);
  }

  return 0;
}

Submission Info

Judge Result