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

#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
#define ll long long
#define ld long double
#define FOR(i, l, r) for (ll i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (ll i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define pb push_back
#define eb emplace_back
#define SZ(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template <class T = ll> using V = vector<T>;
template <class T = ll> using VV = V<V<T>>;
using P = pair<ll, ll>;
#define ios                                                                    \\
  ios::sync_with_stdio(false);                                                 \\
  cin.tie(nullptr);
#define VEC(type, name, size)                                                  \\
  V<type> name(size);                                                          \\
  IN(name)
#define VVEC(type, name, h, w)                                                 \\
  VV<type> name(h, V<type>(w));                                                \\
  IN(name)
#define INT(...)                                                               \\
  int __VA_ARGS__;                                                             \\
  IN(__VA_ARGS__)
#define LL(...)                                                                \\
  ll __VA_ARGS__;                                                              \\
  IN(__VA_ARGS__)
#define STR(...)                                                               \\
  string __VA_ARGS__;                                                          \\
  IN(__VA_ARGS__)
#define CHAR(...)                                                              \\
  char __VA_ARGS__;                                                            \\
  IN(__VA_ARGS__)
#define DOUBLE(...)                                                            \\
  DOUBLE __VA_ARGS__;                                                          \\
  IN(__VA_ARGS__)
#define LD(...)                                                                \\
  LD __VA_ARGS__;                                                              \\
  IN(__VA_ARGS__)
template <class T> void scan(T a) { cin >> a; }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(long double &a) { cin >> a; }
void scan(char a[]) { scanf("%s", a); }
void scan(string &a) { cin >> a; }
template <class T> void scan(V<T> &);
template <class T, class L> void scan(pair<T, L> &);
template <class T> void scan(V<T> &a) {
  for (auto &i : a)
    scan(i);
}
template <class T, class L> void scan(pair<T, L> &p) {
  scan(p.first);
  scan(p.second);
}
template <class T> void scan(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
  scan(head);
  IN(tail...);
}
template <class T> inline void print(T x) { cout << x << '\\n'; }
template <class T> V<T> press(V<T> &x) {
  V<T> res = x;
  sort(all(res));
  res.erase(unique(all(res)), res.end());
  REP(i, SZ(x)) { x[i] = lower_bound(all(res), x[i]) - res.begin(); }
  return res;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline void Yes(bool b = true) { cout << (b ? "Yes" : "No") << '\\n'; }
inline void YES(bool b = true) { cout << (b ? "YES" : "NO") << '\\n'; }
inline void err(bool b = true) {
  if (b) {
    cout << -1 << '\\n';
    exit(0);
  }
}
template <class T> inline void fin(bool b = true, T e = 0) {
  if (b) {
    cout << e << '\\n';
    exit(0);
  }
}
template <class T> T Roundup_div(T x, T y) { return (x + (y - 1)) / y; }
template <typename T> T pow(T a, long long n, T e = 1) {
  T ret = e;
  while (n) {
    if (n & 1)
      ret *= a;
    a *= a;
    n >>= 1;
  }
  return ret;
}
const ll INF = 1e18;
#pragma endregion

int main() {
  ios;
  INT(h, w, m);
  V<> hv(h, 0), wv(w, 0), yoko(m), tate(m);
  REP(i, m) {
    INT(x, y);
    x--;
    y--;
    tate[i] = x, yoko[i] = y;
    hv[x]++;
    wv[y]++;
  }
  ll hc = 0, wc = 0;
  ll MAH = *max_element(all(hv)), MAW = *max_element(all(wv));
  REP(i, h) if (hv[i] == MAH) hc++;
  REP(i, w) if (wv[i] == MAW) wc++;
  ll cnt = hc * wc;
  REP(i, m) {
    if (hv[tate[i]] != MAH or wv[yoko[i]] != MAW)
      continue;
    cnt--;
  }
  if (cnt > 0)
    print(MAH + MAW);
  else
    print(MAH + MAW - 1);
}

Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
#define ll long long
#define ld long double
#define FOR(i, l, r) for (ll i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (ll i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define pb push_back
#define eb emplace_back
#define SZ(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template <class T = ll> using V = vector<T>;
template <class T = ll> using VV = V<V<T>>;
using P = pair<ll, ll>;
#define ios                                                                    \\
  ios::sync_with_stdio(false);                                                 \\
  cin.tie(nullptr);
#define VEC(type, name, size)                                                  \\
  V<type> name(size);                                                          \\
  IN(name)
#define VVEC(type, name, h, w)                                                 \\
  VV<type> name(h, V<type>(w));                                                \\
  IN(name)
#define INT(...)                                                               \\
  int __VA_ARGS__;                                                             \\
  IN(__VA_ARGS__)
#define LL(...)                                                                \\
  ll __VA_ARGS__;                                                              \\
  IN(__VA_ARGS__)
#define STR(...)                                                               \\
  string __VA_ARGS__;                                                          \\
  IN(__VA_ARGS__)
#define CHAR(...)                                                              \\
  char __VA_ARGS__;                                                            \\
  IN(__VA_ARGS__)
#define DOUBLE(...)                                                            \\
  DOUBLE __VA_ARGS__;                                                          \\
  IN(__VA_ARGS__)
#define LD(...)                                                                \\
  LD __VA_ARGS__;                                                              \\
  IN(__VA_ARGS__)
template <class T> void scan(T a) { cin >> a; }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(double &a) { cin >> a; }
void scan(long double &a) { cin >> a; }
void scan(char a[]) { scanf("%s", a); }
void scan(string &a) { cin >> a; }
template <class T> void scan(V<T> &);
template <class T, class L> void scan(pair<T, L> &);
template <class T> void scan(V<T> &a) {
  for (auto &i : a)
    scan(i);
}
template <class T, class L> void scan(pair<T, L> &p) {
  scan(p.first);
  scan(p.second);
}
template <class T> void scan(T &a) { cin >> a; }
void IN() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
  scan(head);
  IN(tail...);
}
template <class T> inline void print(T x) { cout << x << '\\n'; }
template <class T> V<T> press(V<T> &x) {
  V<T> res = x;
  sort(all(res));
  res.erase(unique(all(res)), res.end());
  REP(i, SZ(x)) { x[i] = lower_bound(all(res), x[i]) - res.begin(); }
  return res;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
inline void Yes(bool b = true) { cout << (b ? "Yes" : "No") << '\\n'; }
inline void YES(bool b = true) { cout << (b ? "YES" : "NO") << '\\n'; }
inline void err(bool b = true) {
  if (b) {
    cout << -1 << '\\n';
    exit(0);
  }
}
template <class T> inline void fin(bool b = true, T e = 0) {
  if (b) {
    cout << e << '\\n';
    exit(0);
  }
}
template <class T> T Roundup_div(T x, T y) { return (x + (y - 1)) / y; }
template <typename T> T pow(T a, long long n, T e = 1) {
  T ret = e;
  while (n) {
    if (n & 1)
      ret *= a;
    a *= a;
    n >>= 1;
  }
  return ret;
}
const ll INF = 1e18;
#pragma endregion

int main() {
  ios;
  INT(h, w, m);
  V<> hv(h, 0), wv(w, 0), yoko(m), tate(m);
  REP(i, m) {
    INT(x, y);
    x--;
    y--;
    tate[i] = x, yoko[i] = y;
    hv[x]++;
    wv[y]++;
  }
  ll hc = 0, wc = 0;
  REP(i, h) if (hv[i] == *max_element(all(hv))) hc++;
  REP(i, w) if (wv[i] == *max_element(all(wv))) wc++;
  ll cnt = hc * wc;
  REP(i, m) {
    if (hv[tate[i]] != *max_element(all(hv)) or
        wv[yoko[i]] != *max_element(all(wv)))
      continue;
    cnt--;
  }
  if (cnt > 0)
    print(*max_element(all(hv)) + *max_element(all(wv)));
  else
    print(*max_element(all(hv)) + *max_element(all(wv)) - 1);
}