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

#include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL << 60;
const long long int Mod = 1000000007;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define rp(i, N) for (ll i = 0; i < (ll)N; i++)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
template <class T> bool chmax(T &former, const T &b) {
  if (former < b) {
    former = b;
    return true;
  }
  return false;
}
template <class T> bool chmin(T &former, const T &b) {
  if (b < former) {
    former = b;
    return true;
  }
  return false;
}
template <class T> T sqar(T x) { return x * x; } // sqrt(x)は平方根;
#define Sort(v)                                                                \\
  std::sort(v.begin(), v.end(),                                                \\
            std::greater<decltype(v[0])>()) // 降順でVをソート
#define p_queue(v) priority_queue<v, vector<v>, greater<v>>
template <class T> inline void princ(T x) { cout << x << " "; };
template <class T> inline void print(T x) { cout << x << "\\n"; };
template <class T> inline void Yes(T condition) {
  if (condition)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
template <class T> inline void YES(T condition) {
  if (condition)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
///////////////////////////////////////////////////////////////////////////////////

void solve() {
  ll h, w, m;
  cin >> h >> w >> m;
  Vi hor(h, 0), ver(w, 0);
  map<PLL, int> ma;
  rp(i, m) {
    ll h, w;
    cin >> h >> w;
    h--;
    w--;
    hor[h]++;
    ver[w]++;
    ma[mp(h, w)] = 1;
  }
  ll hmax = 0, vmax = 0;
  rp(i, h) chmax(hmax, hor[i]);
  rp(i, w) chmax(vmax, ver[i]);
  Vi hpos, vpos;
  rp(i, h) {
    if (hmax == hor[i])
      hpos.pb(i);
  }
  rp(i, w) {
    if (vmax == ver[i])
      vpos.pb(i);
  }
  bool inter = true;
  for (auto hh : hpos) {
    for (auto vv : vpos) {
      if (!ma.count(mp(hh, vv))) {
        inter = false;
        break;
      }
    }
    if (!inter)
      break;
  }
  if (inter)
    print(hmax + vmax - 1);
  else
    print(hmax + vmax);
  return;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  std::cout << std::fixed << std::setprecision(30);
  solve();
  return 0;
}

Error: 0

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL << 60;
const long long int Mod = 1000000007;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
using matrix = vector<vector<ll>>;
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define rp(i, N) for (ll i = 0; i < (ll)N; i++)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
template <class T> bool chmax(T &former, const T &b) {
  if (former < b) {
    former = b;
    return true;
  }
  return false;
}
template <class T> bool chmin(T &former, const T &b) {
  if (b < former) {
    former = b;
    return true;
  }
  return false;
}
template <class T> T sqar(T x) { return x * x; } // sqrt(x)は平方根;
#define Sort(v)                                                                \\
  std::sort(v.begin(), v.end(),                                                \\
            std::greater<decltype(v[0])>()) // 降順でVをソート
#define p_queue(v) priority_queue<v, vector<v>, greater<v>>
template <class T> inline void princ(T x) { cout << x << " "; };
template <class T> inline void print(T x) { cout << x << "\\n"; };
template <class T> inline void Yes(T condition) {
  if (condition)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
template <class T> inline void YES(T condition) {
  if (condition)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
///////////////////////////////////////////////////////////////////////////////////

void solve() {
  ll h, w, m;
  cin >> h >> w >> m;
  Vi hor(h, 0), ver(w, 0);
  matrix mat(h, Vi(w, 0));
  rp(i, m) {
    ll h, w;
    cin >> h >> w;
    h--;
    w--;
    hor[h]++;
    ver[w]++;
    mat[h][w]++;
  }
  ll hmax = 0, vmax = 0;
  rp(i, h) chmax(hmax, hor[i]);
  rp(i, w) chmax(vmax, ver[i]);
  Vi hpos, vpos;
  rp(i, h) {
    if (hmax == hor[i])
      hpos.pb(i);
  }
  rp(i, w) {
    if (vmax == ver[i])
      vpos.pb(i);
  }
  bool inter = true;
  for (auto hh : hpos) {
    for (auto vv : vpos) {
      if (mat[hh][vv] == 0) {
        inter = false;
        break;
      }
    }
    if (!inter)
      break;
  }
  if (inter)
    print(hmax + vmax - 1);
  else
    print(hmax + vmax);
  return;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  std::cout << std::fixed << std::setprecision(30);
  solve();
  return 0;
}