Problem p02580 (C++) — buggy submission, verdict: Runtime Error

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include "bits/stdc++.h"

// Begin Header {{{
using namespace std;

#ifndef DEBUG
#define dump(...)
#endif

#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define reps(i, b, e)                                                          \\
  for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e)                                                          \\
  for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...)                                                         \\
  Type __VA_ARGS__;                                                            \\
  input(__VA_ARGS__)

constexpr size_t operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };

constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;

template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;

inline void input() {}
template <class Head, class... Tail>
inline void input(Head &&head, Tail &&...tail) {
  cin >> head;
  input(forward<Tail>(tail)...);
}

template <class T> inline istream &operator>>(istream &is, vector<T> &vec) {
  for (auto &e : vec) {
    is >> e;
  }
  return is;
}

inline void output() { cout << "\\n"; }
template <class Head, class... Tail>
inline void output(Head &&head, Tail &&...tail) {
  cout << head;
  if (sizeof...(tail)) {
    cout << " ";
  }
  output(forward<Tail>(tail)...);
}

template <class T>
inline ostream &operator<<(ostream &os, const vector<T> &vec) {
  static constexpr const char *delim[] = {" ", ""};
  for (const auto &e : vec) {
    os << e << delim[&e == &vec.back()];
  }
  return os;
}

template <class T> inline vector<T> makeVector(const T &initValue, size_t sz) {
  return vector<T>(sz, initValue);
}

template <class T, class... Args>
inline auto makeVector(const T &initValue, size_t sz, Args... args) {
  return vector<decltype(makeVector<T>(initValue, args...))>(
      sz, makeVector<T>(initValue, args...));
}

template <class Func> class FixPoint : Func {
public:
  explicit constexpr FixPoint(Func &&f) noexcept : Func(forward<Func>(f)) {}

  template <class... Args>
  constexpr decltype(auto) operator()(Args &&...args) const {
    return Func::operator()(*this, std::forward<Args>(args)...);
  }
};

template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func &&f) noexcept {
  return FixPoint<Func>{forward<Func>(f)};
}

template <class Container> struct reverse_t {
  Container &c;
  reverse_t(Container &c) : c(c) {}
  auto begin() { return c.rbegin(); }
  auto end() { return c.rend(); }
};

template <class Container> auto reversed(Container &c) {
  return reverse_t<Container>(c);
}

template <class T> inline bool chmax(T &a, const T &b) noexcept {
  return b > a && (a = b, true);
}

template <class T> inline bool chmin(T &a, const T &b) noexcept {
  return b < a && (a = b, true);
}

template <class T> inline T diff(const T &a, const T &b) noexcept {
  return a < b ? b - a : a - b;
}

void ioinit() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.setf(ios_base::fixed);
  cout.precision(10);
}
// End Header }}}

// Compress {{{
template <class T> class Compress {
  vector<T> xs;

public:
  Compress() = default;

  Compress(const vector<T> &vs) { add(vs); }

  void add(const vector<T> &vs) {
    copy(vs.begin(), vs.end(), back_inserter(xs));
  }

  void add(const T &x) { xs.emplace_back(x); }

  void build() {
    sort(xs.begin(), xs.end());
    xs.erase(unique(xs.begin(), xs.end()), xs.end());
  }

  vector<intmax_t> get(const vector<T> &vs) const {
    vector<intmax_t> ret;
    transform(vs.begin(), vs.end(), back_inserter(ret), [&](const T &v) {
      return distance(xs.begin(), lower_bound(xs.begin(), xs.end(), v));
    });
    return ret;
  }

  unordered_map<T, intmax_t> dict() const {
    unordered_map<T, intmax_t> ret;
    for (intmax_t i = 0; i < xs.size(); ++i) {
      ret[xs[i]] = i;
    }
    return ret;
  }

  const size_t size() const { return xs.size(); }

  const T &operator[](size_t k) const { return xs[k]; }
};
// }}}

signed main() {
  ioinit();

  var(intmax_t, H, W, M);

  vector<intmax_t> y(M), x(M);
  rep(i, 0, M) input(y[i], x[i]);

  map<pair<intmax_t, intmax_t>, intmax_t> exist;
  vector<intmax_t> cnt_row(3e5 + 1), cnt_col(3e5 + 1);
  rep(i, 0, M) {
    exist[make_pair(y[i], x[i])] = true;
    cnt_row[y[i]]++;
    cnt_col[x[i]]++;
  }

  const intmax_t best_row =
      distance(cnt_row.begin(), max_element(all(cnt_row)));
  const intmax_t best_col =
      distance(cnt_col.begin(), max_element(all(cnt_col)));
  dump(best_row, best_col);

  intmax_t maxv = 0;
  reps(c, 1, 3e5) {
    intmax_t value = cnt_row[best_row] + cnt_col[c];
    if (exist[make_pair(best_row, c)])
      value--;
    chmax(maxv, value);
  }
  reps(r, 1, 3e5) {
    intmax_t value = cnt_col[best_col] + cnt_row[r];
    if (exist[make_pair(r, best_col)])
      value--;
    chmax(maxv, value);
  }

  output(maxv);

  return 0;
}


Error: 0

Fixed submission:

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include "bits/stdc++.h"

// Begin Header {{{
using namespace std;

#ifndef DEBUG
#define dump(...)
#endif

#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define reps(i, b, e)                                                          \\
  for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e)                                                          \\
  for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...)                                                         \\
  Type __VA_ARGS__;                                                            \\
  input(__VA_ARGS__)

constexpr size_t operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };

constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;

template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;

inline void input() {}
template <class Head, class... Tail>
inline void input(Head &&head, Tail &&...tail) {
  cin >> head;
  input(forward<Tail>(tail)...);
}

template <class T> inline istream &operator>>(istream &is, vector<T> &vec) {
  for (auto &e : vec) {
    is >> e;
  }
  return is;
}

inline void output() { cout << "\\n"; }
template <class Head, class... Tail>
inline void output(Head &&head, Tail &&...tail) {
  cout << head;
  if (sizeof...(tail)) {
    cout << " ";
  }
  output(forward<Tail>(tail)...);
}

template <class T>
inline ostream &operator<<(ostream &os, const vector<T> &vec) {
  static constexpr const char *delim[] = {" ", ""};
  for (const auto &e : vec) {
    os << e << delim[&e == &vec.back()];
  }
  return os;
}

template <class T> inline vector<T> makeVector(const T &initValue, size_t sz) {
  return vector<T>(sz, initValue);
}

template <class T, class... Args>
inline auto makeVector(const T &initValue, size_t sz, Args... args) {
  return vector<decltype(makeVector<T>(initValue, args...))>(
      sz, makeVector<T>(initValue, args...));
}

template <class Func> class FixPoint : Func {
public:
  explicit constexpr FixPoint(Func &&f) noexcept : Func(forward<Func>(f)) {}

  template <class... Args>
  constexpr decltype(auto) operator()(Args &&...args) const {
    return Func::operator()(*this, std::forward<Args>(args)...);
  }
};

template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func &&f) noexcept {
  return FixPoint<Func>{forward<Func>(f)};
}

template <class Container> struct reverse_t {
  Container &c;
  reverse_t(Container &c) : c(c) {}
  auto begin() { return c.rbegin(); }
  auto end() { return c.rend(); }
};

template <class Container> auto reversed(Container &c) {
  return reverse_t<Container>(c);
}

template <class T> inline bool chmax(T &a, const T &b) noexcept {
  return b > a && (a = b, true);
}

template <class T> inline bool chmin(T &a, const T &b) noexcept {
  return b < a && (a = b, true);
}

template <class T> inline T diff(const T &a, const T &b) noexcept {
  return a < b ? b - a : a - b;
}

void ioinit() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.setf(ios_base::fixed);
  cout.precision(10);
}
// End Header }}}

// Compress {{{
template <class T> class Compress {
  vector<T> xs;

public:
  Compress() = default;

  Compress(const vector<T> &vs) { add(vs); }

  void add(const vector<T> &vs) {
    copy(vs.begin(), vs.end(), back_inserter(xs));
  }

  void add(const T &x) { xs.emplace_back(x); }

  void build() {
    sort(xs.begin(), xs.end());
    xs.erase(unique(xs.begin(), xs.end()), xs.end());
  }

  vector<intmax_t> get(const vector<T> &vs) const {
    vector<intmax_t> ret;
    transform(vs.begin(), vs.end(), back_inserter(ret), [&](const T &v) {
      return distance(xs.begin(), lower_bound(xs.begin(), xs.end(), v));
    });
    return ret;
  }

  unordered_map<T, intmax_t> dict() const {
    unordered_map<T, intmax_t> ret;
    for (intmax_t i = 0; i < xs.size(); ++i) {
      ret[xs[i]] = i;
    }
    return ret;
  }

  const size_t size() const { return xs.size(); }

  const T &operator[](size_t k) const { return xs[k]; }
};
// }}}

signed main() {
  ioinit();

  var(intmax_t, H, W, M);

  vector<intmax_t> y(M), x(M);
  rep(i, 0, M) { input(y[i], x[i]); }
  Compress<intmax_t> Y, X;
  Y.add(y);
  X.add(x);
  Y.build();
  X.build();
  y = Y.get(y);
  x = X.get(x);

  H = (intmax_t)Y.size(), W = (intmax_t)X.size();
  auto mat = makeVector<intmax_t>(0, H + 10, W + 10);
  rep(i, 0, M) { mat[y[i]][x[i]] = 1; }
  vector<intmax_t> yoko(H + 10), tate(W + 10);
  rep(i, 0, H) rep(j, 0, W) yoko[i] += mat[i][j];
  rep(j, 0, W) rep(i, 0, H) tate[j] += mat[i][j];

  intmax_t maxv = 0;
  rep(i, 0, H) rep(j, 0, W) { chmax(maxv, yoko[i] + tate[j] - mat[i][j]); }

  output(maxv);

  return 0;
}