Submission #4033524

---

Source Code Expand

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

typedef long long ll;
const ll INF = 1e18 + 1;
const ll MOD = 1e9 + 7;

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 > vcnt((ll)1e5+1, 0LL);
  std::map< ll, ll > mm;
  for (ll i = 0; i < N; i++) {
    std::cin >> va[i];
    vcnt[va[i]]++;
  }

  ll cnt = 0;
  for (ll i = 0; i <= 1e5; i++) {
    if (vcnt[i] > 0) {
      mm[i] = cnt;
      cnt++;
    }
  }

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

  return 0;
}

Submission Info

Judge Result