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

#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
// setbase - cout << setbase (16); cout << 100 << endl; Prints 64
// setfill -   cout << setfill ('x') << setw (5); cout << 77 << endl; prints
// xxx77 setprecision - cout << setprecision (14) << f << endl; Prints x.xxxx
// cout.precision(x)  cout<<fixed<<val;  // prints x digits after decimal in val

using namespace std;
using namespace __gnu_pbds;
// find_by_order()  // order_of_key
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fi(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) f(i, 0, n)
#define fd(i, a, b) for (ll i = a; i >= b; i--)
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vl vector<ll>
#define ss second
#define ff first
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(a) a.size()
#define inff (1000 * 1000 * 1000 + 5)
#define all(a) a.begin(), a.end()
#define tri pair<int, pii>
#define vii vector<pii>
#define vll vector<pll>
#define viii vector<tri>
#define pqueue priority_queue<int>
#define pdqueue priority_queue<int, vi, greater<int>>
#define flush fflush(stdout)
#define primeDEN 727999983
#define SPEED                                                                  \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(NULL);                                                               \\
  cout.tie(NULL);
#define fp(i, a, n) for (ll i = n - 1; i > a; i--)
#define deb(x) cout << #x << " ---> " << x << endl;
#define X first
#define Y second
#define pia 3.1415926536
#define mod 1000000007
#define mod2 998244353

#define ml map<ll, ll>
#define mll map<pll, ll>
#define vvl vector<vl>
#define vvi vector<vi>
#define letsh(a, b) a << b
#define rigsh(a, b) a >> b
mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}

ll power(ll a, ll n) {
  ll ans = 1;
  while (n) {
    if (n & 1)
      ans = (ans * a) % mod;
    a = (a * a) % mod;
    n = n >> 1;
  }
  return ans;
}
ll power2(ll a, ll n) {
  ll ans = 1;
  while (n) {
    if (n & 1)
      ans = (ans * a);
    a = (a * a);
    n = n >> 1;
  }
  return ans;
}
ll lcm(ll a, ll b) { return a / __gcd(a, b) * b; }
#define N 3e3 + 5

bool inside(int x, int y) { return 1 <= min(x, y) && max(x, y) <= N; }

void solve() {

  int h, w, m;
  cin >> h >> w >> m;
  vector<ll> row(h + 1, 0);
  vector<ll> column(w + 1, 0);
  map<pair<int, int>, bool> cnt;
  f(i, 0, m) {
    int x, y;
    cin >> x >> y;
    row[x]++, column[y]++;
    cnt[{x, y}] = 1;
  }
  ll mx = 0, mx1 = 0;
  ll ind = 0, ind1 = 0;
  f(i, 1, h + 1) {
    if (mx < row[i]) {
      mx = row[i];
      ind = i;
    }
  }
  f(i, 1, w + 1) {
    if (mx1 < column[i]) {
      mx1 = column[i], ind1 = i;
    }
  }
  ll ans = 0;
  f(i, 1, h + 1) {
    if (cnt[{i, ind1}])
      ans = max(ans, row[i] + column[ind1] - 1);
    else
      ans = max(ans, row[i] + column[ind1]);
  }
  f(i, 1, w + 1) {
    if (cnt[{ind, i}])
      ans = max(ans, row[ind] + column[i] - 1);
    else
      ans = max(ans, row[ind] + column[i]);
  }
  cout << ans << endl;
}

int main() {
  SPEED
  int t = 1;
  while (t--)
    solve();
}

Error: TLE

Fixed submission:

#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
// setbase - cout << setbase (16); cout << 100 << endl; Prints 64
// setfill -   cout << setfill ('x') << setw (5); cout << 77 << endl; prints
// xxx77 setprecision - cout << setprecision (14) << f << endl; Prints x.xxxx
// cout.precision(x)  cout<<fixed<<val;  // prints x digits after decimal in val

using namespace std;
using namespace __gnu_pbds;
// find_by_order()  // order_of_key
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fi(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) f(i, 0, n)
#define fd(i, a, b) for (ll i = a; i >= b; i--)
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vl vector<ll>
#define ss second
#define ff first
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define sz(a) a.size()
#define inff (1000 * 1000 * 1000 + 5)
#define all(a) a.begin(), a.end()
#define tri pair<int, pii>
#define vii vector<pii>
#define vll vector<pll>
#define viii vector<tri>
#define pqueue priority_queue<int>
#define pdqueue priority_queue<int, vi, greater<int>>
#define flush fflush(stdout)
#define primeDEN 727999983
#define SPEED                                                                  \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(NULL);                                                               \\
  cout.tie(NULL);
#define fp(i, a, n) for (ll i = n - 1; i > a; i--)
#define deb(x) cout << #x << " ---> " << x << endl;
#define X first
#define Y second
#define pia 3.1415926536
#define mod 1000000007
#define mod2 998244353

#define ml map<ll, ll>
#define mll map<pll, ll>
#define vvl vector<vl>
#define vvi vector<vi>
#define letsh(a, b) a << b
#define rigsh(a, b) a >> b
mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}

ll power(ll a, ll n) {
  ll ans = 1;
  while (n) {
    if (n & 1)
      ans = (ans * a) % mod;
    a = (a * a) % mod;
    n = n >> 1;
  }
  return ans;
}
ll power2(ll a, ll n) {
  ll ans = 1;
  while (n) {
    if (n & 1)
      ans = (ans * a);
    a = (a * a);
    n = n >> 1;
  }
  return ans;
}
ll lcm(ll a, ll b) { return a / __gcd(a, b) * b; }
#define N 3e3 + 5
vll dir({{-1, 0}, {0, -1}, {1, 0}, {0, 1}});

bool inside(int x, int y) { return 1 <= min(x, y) && max(x, y) <= N; }

void solve() {
  int h, w, m;
  cin >> h >> w >> m;
  map<pair<int, int>, bool> a;

  f(i, 0, m) {
    int x, y;
    cin >> x >> y;
    a[{x, y}] = 1;
  }
  vi b(w + 1);
  vi c(h + 1);
  fi(i, 1, w + 1) {
    fi(j, 1, h + 1) { b[i] += a[{j, i}]; }
  }
  fi(i, 1, h + 1) {
    fi(j, 1, w + 1) { c[i] += a[{i, j}]; }
  }
  int ans = 0;
  fi(i, 1, h + 1) {

    fi(j, 1, w + 1) {
      int cur = a[{i, j}];
      ans = max(ans, b[j] + c[i] - cur);
    }
  }
  cout << ans << endl;
}
int main() {
  SPEED
  int t = 1;
  while (t--)
    solve();
}