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

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define in(a)                                                                  \\
  ll a;                                                                        \\
  cin >> a;
#define in2(a, b)                                                              \\
  ll a, b;                                                                     \\
  cin >> a >> b;
#define in3(a, b, c)                                                           \\
  ll a, b, c;                                                                  \\
  cin >> a >> b >> c;
#define in4(a, b, c, d)                                                        \\
  ll a, b, c, d;                                                               \\
  cin >> a >> b >> c >> d;
#define in5(a, b, c, d, e)                                                     \\
  ll a, b, c, d, e;                                                            \\
  cin >> a >> b >> c >> d >> e;
#define lelo(b)                                                                \\
  for (auto &i : b)                                                            \\
    cin >> i;
#define ff first
#define ss second
#define call(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define show(x)                                                                \\
  for (auto t : x)                                                             \\
    cout << t << " ";
#define pb push_back
#define bhar(s, v) memset(s, v, sizeof(s))
#define endl "\\n"
#define ce(x) cout << x << "\\n";
#define nl cout << endl;
#define jaldi                                                                  \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(NULL);
#define dekh_lo ce("dekh_lo");
#define sz(x) (ll) x.size()
#define re return

typedef pair<ll, ll> pii;
typedef vector<pii> vii;
typedef vector<ll> vi;

const ll mod = 1e9 + 7;
const ll N = 4e5 + 5;

void solve() {
  in3(h, w, m);

  ll s = m;
  vii cor;
  while (s--) {
    in2(x, y);
    cor.pb({x, y});
  }

  vi row(h + 1, 0), col(w + 1, 0);
  map<pii, bool> hash;

  for (ll i = 0; i < sz(cor); i++) {
    row[cor[i].ff]++;
    col[cor[i].ss]++;
    hash[{cor[i].ff, cor[i].ss}] = 1;
  }

  ll maxi1 = -1e9;
  vi ind1;
  for (ll i = 1; i <= h; i++) {
    if (row[i] > maxi1) {
      maxi1 = row[i];
    }
  }

  for (ll i = 1; i <= h; i++) {
    if (row[i] == maxi1) {
      ind1.pb(i);
    }
  }

  ll maxi2 = -1e9;
  vi ind2;
  for (ll i = 1; i <= w; i++) {
    if (col[i] > maxi2) {
      maxi2 = col[i];
    }
  }

  for (ll i = 1; i <= w; i++) {
    if (col[i] == maxi2) {
      ind2.pb(i);
    }
  }

  bool f = 1;
  for (auto j : ind1) {
    for (auto i : ind2) {
      if (!hash[{j, i}]) {
        cout << maxi2 + maxi1 << endl;
        re;
      }
    }
  }

  ce(maxi1 + maxi2 - 1);
}

int32_t main() {
  // jaldi
  ll t;
  // cin>>t;
  t = 1;
  while (t--) {
    solve();
  }
}

/*


*/


Error: TLE

Fixed submission:


#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define in(a)                                                                  \\
  ll a;                                                                        \\
  cin >> a;
#define in2(a, b)                                                              \\
  ll a, b;                                                                     \\
  cin >> a >> b;
#define in3(a, b, c)                                                           \\
  ll a, b, c;                                                                  \\
  cin >> a >> b >> c;
#define in4(a, b, c, d)                                                        \\
  ll a, b, c, d;                                                               \\
  cin >> a >> b >> c >> d;
#define in5(a, b, c, d, e)                                                     \\
  ll a, b, c, d, e;                                                            \\
  cin >> a >> b >> c >> d >> e;
#define lelo(b)                                                                \\
  for (auto &i : b)                                                            \\
    cin >> i;
#define ff first
#define ss second
#define call(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define show(x)                                                                \\
  for (auto t : x)                                                             \\
    cout << t << " ";
#define pb push_back
#define bhar(s, v) memset(s, v, sizeof(s))
#define endl "\\n"
#define ce(x) cout << x << "\\n";
#define nl cout << endl;
#define jaldi                                                                  \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(NULL);
#define dekh_lo ce("dekh_lo");
#define sz(x) (ll) x.size()
#define re return

void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\\'' << x << '\\''; }
void __print(const char *x) { cerr << '\\"' << x << '\\"'; }
void __print(const string &x) { cerr << '\\"' << x << '\\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }

template <typename T, typename V> void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T> void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x)
    cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v))
    cerr << ", ";
  _print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...)                                                            \\
  cerr << "[" << #x << "] = [";                                                \\
  _print(x)
#else
#define debug(x...)
#endif

typedef pair<ll, ll> pii;
typedef vector<pii> vii;
typedef vector<ll> vi;

const ll mod = 1e9 + 7;
const ll N = 4e5 + 5;

/*


*/

void solve() {
  in3(h, w, m);

  ll s = m;
  vii cor;
  while (s--) {
    in2(x, y);
    cor.pb({x, y});
  }

  vi row(h + 1, 0), col(w + 1, 0);
  map<pii, bool> hash;

  for (ll i = 0; i < sz(cor); i++) {
    row[cor[i].ff]++;
    col[cor[i].ss]++;
    hash[{cor[i].ff, cor[i].ss}] = 1;
  }

  debug(row, col);

  ll maxi1 = -1e9;
  vi ind1;
  for (ll i = 1; i <= h; i++) {
    if (row[i] > maxi1) {
      maxi1 = row[i];
    }
  }

  for (ll i = 1; i <= h; i++) {
    if (row[i] == maxi1) {
      ind1.pb(i);
    }
  }

  ll maxi2 = -1e9;
  vi ind2;
  for (ll i = 1; i <= w; i++) {
    if (col[i] > maxi2) {
      maxi2 = col[i];
    }
  }

  for (ll i = 1; i <= w; i++) {
    if (col[i] == maxi2) {
      ind2.pb(i);
    }
  }

  bool f = 0;
  for (auto j : ind1) {
    for (auto i : ind2) {
      if (!hash[{j, i}]) {
        f = 1;
      }
    }
  }

  ll ans = maxi1 + maxi2 - (f == 0);
  ce(ans);

  // ll ans=0;
  // for(ll i=1;i<=h;i++){
  // 	for(ll j=1;j<=w;j++){
  // 		bool f=0;
  // 		if(hash[{i,j}]){
  // 			f=1;
  // 		}
  // 		ll temp=row[i]+col[j]-(f==1);
  // 		ans=max(ans,temp);
  // 	}
  // }
}

int32_t main() {
  // jaldi
  ll t;
  // cin>>t;
  t = 1;
  while (t--) {
    solve();
  }
}

/*


*/