Submission #26037341

---

Source Code Expand

#include <algorithm>
#include <cstdio>
#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, M;
  std::cin >> N >> M;

  std::vector<std::vector<int>> X(N);

  std::vector<int> P(M), Y(M);
  for (int i = 0; i < M; i++) {
    std::cin >> P[i] >> Y[i];
    X[P[i] - 1].push_back(Y[i]);
  }

  std::vector<std::vector<int>> shrink_X(N);
  for (int i = 0; i < N; i++) {
    shrink_X[i] = shrink_coordinate(X[i]);
  }

  std::vector<int> idxs(N, 0);
  for (int i = 0; i < M; i++) {
    int p = P[i];
    int num = shrink_X[p - 1][idxs[p - 1]++] + 1;

    printf("%06d%06d\n", p, num);
  }

  return 0;
}

Submission Info

Judge Result