Problem p02580 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N - 1)
#define deps(i, E, S) for (ll i = (E); i >= (S); i--)
#define dep(i, N) deps(i, N - 1, 0)
const ll INF = 1LL << 60;
const int INF_INT = 1 << 30;

template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
#define CEIL(x, y) ((x + y - 1) / (y))
struct mll {
  static ll MOD;
  ll val;
  mll(ll v = 0) : val(v % MOD) {
    if (val < 0)
      val += MOD;
  }
  mll operator-() const { return -val; }
  mll operator+(const mll &b) const { return val + b.val; }
  mll operator-(const mll &b) const { return val - b.val; }
  mll operator*(const mll &b) const { return val * b.val; }
  mll operator/(const mll &b) const { return mll(*this) /= b; }
  mll operator+(ll b) const { return *this + mll(b); }
  mll operator-(ll b) const { return *this - mll(b); }
  mll operator*(ll b) const { return *this * mll(b); }
  friend mll operator+(ll a, const mll &b) { return b + a; }
  friend mll operator-(ll a, const mll &b) { return -b + a; }
  friend mll operator*(ll a, const mll &b) { return b * a; }
  mll &operator+=(const mll &b) {
    val = (val + b.val) % MOD;
    return *this;
  }
  mll &operator-=(const mll &b) {
    val = (val + MOD - b.val) % MOD;
    return *this;
  }
  mll &operator*=(const mll &b) {
    val = (val * b.val) % MOD;
    return *this;
  }
  mll &operator/=(const mll &b) {
    ll c = b.val, d = MOD, u = 1, v = 0;
    while (d) {
      ll t = c / d;
      c -= t * d;
      swap(c, d);
      u -= t * v;
      swap(u, v);
    }
    val = val * u % MOD;
    if (val < 0)
      val += MOD;
    return *this;
  }
  mll &operator+=(ll b) { return *this += mll(b); }
  mll &operator-=(ll b) { return *this -= mll(b); }
  mll &operator*=(ll b) { return *this *= mll(b); }
  mll &operator/=(ll b) { return *this /= mll(b); }
  bool operator==(const mll &b) { return val == b.val; }
  bool operator!=(const mll &b) { return val != b.val; }
  bool operator==(ll b) { return *this == mll(b); }
  bool operator!=(ll b) { return *this != mll(b); }
  friend bool operator==(ll a, const mll &b) { return mll(a) == b.val; }
  friend bool operator!=(ll a, const mll &b) { return mll(a) != b.val; }
  friend ostream &operator<<(ostream &os, const mll &a) { return os << a.val; }
  friend istream &operator>>(istream &is, mll &a) { return is >> a.val; }
  static mll Combination(ll a, ll b) {
    chmin(b, a - b);
    if (b < 0)
      return mll(0);
    mll c = 1;
    rep(i, b) c *= a - i;
    rep(i, b) c /= i + 1;
    return c;
  }
};
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;

struct Fast {
  Fast() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
  }
} fast; // cin,cout高速化のおまじない＋桁数指定

ll mll::MOD = (ll)(1e9 + 7); // 998244353ll;

void solve() {
  ll H;
  cin >> H;
  ll W;
  cin >> W;
  ll M;
  cin >> M;
  vector<ll> h(M);
  vector<ll> w(M);
  vll numH(H);
  vll numW(W);
  vector<set<ll>> Windex(H);
  rep(i, M) {
    cin >> h[i] >> w[i];
    h[i]--;
    w[i]--;

    numH[h[i]]++;
    numW[w[i]]++;
    Windex[h[i]].insert(w[i]);
  }

  ll maxHnum = 0;
  rep(i, H) { chmax(maxHnum, numH[i]); }

  vll maxHindex(0);
  rep(i, H) {
    if (maxHnum == numH[i]) {
      maxHindex.push_back(i);
    }
  }

  ll maxWnum = 0;
  rep(i, W) { chmax(maxWnum, numW[i]); }

  vll maxWindex(0);
  rep(i, W) {
    if (maxWnum == numW[i]) {
      maxWindex.push_back(i);
    }
  }

  ll result = 0;
  ll tempRes = maxHnum + maxWnum;

  rep(i, (ll)maxHindex.size()) {
    ll iH = maxHindex[i];

    rep(j, (ll)maxWindex.size()) {
      ll iW = maxWindex[j];

      auto it = Windex[iH].find(iW);

      ll temp = tempRes;
      if (it != Windex[iH].end()) {
        temp--;
      } else {
        cout << tempRes << endl;
        return;
      }
    }
  }

  cout << tempRes - 1 << endl;
}

int main() {
#if TEST && LOCAL
  ll t;
  cin >> t;
  rep(i, t) { solve(); }
#else
  solve();
#endif
  return 0;
}


Error: TLE

Fixed submission:

#include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N - 1)
#define deps(i, E, S) for (ll i = (E); i >= (S); i--)
#define dep(i, N) deps(i, N - 1, 0)
const ll INF = 1LL << 60;
const int INF_INT = 1 << 30;

template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
#define CEIL(x, y) ((x + y - 1) / (y))
struct mll {
  static ll MOD;
  ll val;
  mll(ll v = 0) : val(v % MOD) {
    if (val < 0)
      val += MOD;
  }
  mll operator-() const { return -val; }
  mll operator+(const mll &b) const { return val + b.val; }
  mll operator-(const mll &b) const { return val - b.val; }
  mll operator*(const mll &b) const { return val * b.val; }
  mll operator/(const mll &b) const { return mll(*this) /= b; }
  mll operator+(ll b) const { return *this + mll(b); }
  mll operator-(ll b) const { return *this - mll(b); }
  mll operator*(ll b) const { return *this * mll(b); }
  friend mll operator+(ll a, const mll &b) { return b + a; }
  friend mll operator-(ll a, const mll &b) { return -b + a; }
  friend mll operator*(ll a, const mll &b) { return b * a; }
  mll &operator+=(const mll &b) {
    val = (val + b.val) % MOD;
    return *this;
  }
  mll &operator-=(const mll &b) {
    val = (val + MOD - b.val) % MOD;
    return *this;
  }
  mll &operator*=(const mll &b) {
    val = (val * b.val) % MOD;
    return *this;
  }
  mll &operator/=(const mll &b) {
    ll c = b.val, d = MOD, u = 1, v = 0;
    while (d) {
      ll t = c / d;
      c -= t * d;
      swap(c, d);
      u -= t * v;
      swap(u, v);
    }
    val = val * u % MOD;
    if (val < 0)
      val += MOD;
    return *this;
  }
  mll &operator+=(ll b) { return *this += mll(b); }
  mll &operator-=(ll b) { return *this -= mll(b); }
  mll &operator*=(ll b) { return *this *= mll(b); }
  mll &operator/=(ll b) { return *this /= mll(b); }
  bool operator==(const mll &b) { return val == b.val; }
  bool operator!=(const mll &b) { return val != b.val; }
  bool operator==(ll b) { return *this == mll(b); }
  bool operator!=(ll b) { return *this != mll(b); }
  friend bool operator==(ll a, const mll &b) { return mll(a) == b.val; }
  friend bool operator!=(ll a, const mll &b) { return mll(a) != b.val; }
  friend ostream &operator<<(ostream &os, const mll &a) { return os << a.val; }
  friend istream &operator>>(istream &is, mll &a) { return is >> a.val; }
  static mll Combination(ll a, ll b) {
    chmin(b, a - b);
    if (b < 0)
      return mll(0);
    mll c = 1;
    rep(i, b) c *= a - i;
    rep(i, b) c /= i + 1;
    return c;
  }
};
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;

struct Fast {
  Fast() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
  }
} fast; // cin,cout高速化のおまじない＋桁数指定

ll mll::MOD = (ll)(1e9 + 7); // 998244353ll;

void solve() {
  ll H;
  cin >> H;
  ll W;
  cin >> W;
  ll M;
  cin >> M;
  vector<ll> h(M);
  vector<ll> w(M);
  vll numH(H);
  vll numW(W);
  vector<set<ll>> Windex(H);
  rep(i, M) {
    cin >> h[i] >> w[i];
    h[i]--;
    w[i]--;

    numH[h[i]]++;
    numW[w[i]]++;
    Windex[h[i]].insert(w[i]);
  }

  ll maxHnum = 0;
  rep(i, H) { chmax(maxHnum, numH[i]); }

  vll maxHindex(0);
  rep(i, H) {
    if (maxHnum == numH[i]) {
      maxHindex.push_back(i);
    }
  }

  ll maxWnum = 0;
  rep(i, W) { chmax(maxWnum, numW[i]); }

  vll maxWindex(0);
  rep(i, W) {
    if (maxWnum == numW[i]) {
      maxWindex.push_back(i);
    }
  }

  ll result = 0;
  ll tempRes = maxHnum + maxWnum;

  rep(i, (ll)maxHindex.size()) {
    ll iH = maxHindex[i];

    rep(j, (ll)maxWindex.size()) {
      ll iW = maxWindex[j];

      auto it = Windex[iH].find(iW);

      ll temp = tempRes;
      if (it != Windex[iH].end()) {
        temp--;
      }

      chmax(result, temp);
    }
  }

  cout << result << endl;
}

int main() {
#if TEST && LOCAL
  ll t;
  cin >> t;
  rep(i, t) { solve(); }
#else
  solve();
#endif
  return 0;
}