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

#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor                                                                \\
  int test;                                                                    \\
  scanf("%d", &test);                                                          \\
  while (test--)
#define INT(...)                                                               \\
  int __VA_ARGS__;                                                             \\
  in(__VA_ARGS__)
#define LL(...)                                                                \\
  ll __VA_ARGS__;                                                              \\
  in(__VA_ARGS__)
#define yn(ans)                                                                \\
  if (ans)                                                                     \\
    printf("Yes\\n");                                                           \\
  else                                                                         \\
    printf("No\\n")
#define YN(ans)                                                                \\
  if (ans)                                                                     \\
    printf("YES\\n");                                                           \\
  else                                                                         \\
    printf("NO\\n")
#define vector1d(type, name, ...) vector<type> name(__VA_ARGS__)
#define vector2d(type, name, h, ...)                                           \\
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
// 入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
  for (auto &&it : vec)
    scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
  scan(head);
  in(tail...);
}
// 出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
  if (vec.empty())
    return;
  print(vec[0]);
  for (auto it = vec.begin(); ++it != vec.end();) {
    putchar(' ');
    print(*it);
  }
}
void out() { putchar('\\n'); }
template <class T> void out(const T &t) {
  print(t);
  putchar('\\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
  print(head);
  putchar(' ');
  out(tail...);
}
// デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
  if (vec.empty())
    return;
  cerr << vec[0];
  for (auto it = vec.begin(); ++it != vec.end();) {
    cerr << " " << *it;
  }
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
  dprint(t);
  cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
  dprint(head);
  cerr << " ";
  debug(tail...);
}

int main() {
  INT(h, w, m);
  set<pair<int, int>> yxpoint;
  vector<pair<int, int>> ynum(h + 1), xnum(w + 1);
  rep(i, h + 1) {
    ynum[i].first = 0;
    ynum[i].second = i;
  }
  rep(i, w + 1) {
    xnum[i].first = 0;
    xnum[i].second = i;
  }
  int x, y;
  rep(i, m) {
    in(y, x);
    yxpoint.insert(make_pair(y, x));
    ynum[y].first++;
    xnum[x].first++;
  }
  sort(rall(ynum));
  sort(rall(xnum));
  ll d = 0, ans = 0;
  for (int i = 0; i < h; i++) {
    if (ynum[i].first < ynum[0].first)
      break;
    for (int j = 0; j < w; j++) {
      if (xnum[j].first < xnum[0].first)
        break;
      d = xnum[j].first + ynum[i].first -
          yxpoint.count(make_pair(ynum[i].second, xnum[j].second));
      ans = max(ans, d);
      if (ans == xnum[0].first + ynum[0].first)
        goto skip;
    }
  }
skip:
  out(ans);
}

Error: TLE

Fixed submission:

#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define codefor                                                                \\
  int test;                                                                    \\
  scanf("%d", &test);                                                          \\
  while (test--)
#define INT(...)                                                               \\
  int __VA_ARGS__;                                                             \\
  in(__VA_ARGS__)
#define LL(...)                                                                \\
  ll __VA_ARGS__;                                                              \\
  in(__VA_ARGS__)
#define yn(ans)                                                                \\
  if (ans)                                                                     \\
    printf("Yes\\n");                                                           \\
  else                                                                         \\
    printf("No\\n")
#define YN(ans)                                                                \\
  if (ans)                                                                     \\
    printf("YES\\n");                                                           \\
  else                                                                         \\
    printf("NO\\n")
#define vector1d(type, name, ...) vector<type> name(__VA_ARGS__)
#define vector2d(type, name, h, ...)                                           \\
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD = 1000000007;
// 入力系
void scan(int &a) { scanf("%d", &a); }
void scan(long long &a) { scanf("%lld", &a); }
template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &vec) {
  for (auto &&it : vec)
    scan(it);
}
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
  scan(head);
  in(tail...);
}
// 出力系
void print(const int &a) { printf("%d", a); }
void print(const long long &a) { printf("%lld", a); }
void print(const double &a) { printf("%.15lf", a); }
template <class T> void print(const T &a) { cout << a; }
template <class T> void print(const vector<T> &vec) {
  if (vec.empty())
    return;
  print(vec[0]);
  for (auto it = vec.begin(); ++it != vec.end();) {
    putchar(' ');
    print(*it);
  }
}
void out() { putchar('\\n'); }
template <class T> void out(const T &t) {
  print(t);
  putchar('\\n');
}
template <class Head, class... Tail>
void out(const Head &head, const Tail &...tail) {
  print(head);
  putchar(' ');
  out(tail...);
}
// デバッグ系
template <class T> void dprint(const T &a) { cerr << a; }
template <class T> void dprint(const vector<T> &vec) {
  if (vec.empty())
    return;
  cerr << vec[0];
  for (auto it = vec.begin(); ++it != vec.end();) {
    cerr << " " << *it;
  }
}
void debug() { cerr << endl; }
template <class T> void debug(const T &t) {
  dprint(t);
  cerr << endl;
}
template <class Head, class... Tail>
void debug(const Head &head, const Tail &...tail) {
  dprint(head);
  cerr << " ";
  debug(tail...);
}

int main() {
  INT(h, w, m);
  umap<int, int> mapx, mapy;
  set<pair<int, int>> yxpoint;
  uset<int> setx, sety;
  vector<pair<int, int>> ynum(h + 1), xnum(w + 1);
  rep(i, h + 1) {
    ynum[i].first = 0;
    ynum[i].second = i;
  }
  rep(i, w + 1) {
    xnum[i].first = 0;
    xnum[i].second = i;
  }
  // vector<pair<int,int>> vec(m);
  int x, y;
  rep(i, m) {
    in(y, x);
    yxpoint.insert(make_pair(y, x));
    if (mapy.count(y)) {
      mapy[y]++;
    } else {
      mapy[y] = 1;
    }
    if (mapx.count(x)) {
      mapx[x]++;
    } else {
      mapx[x] = 1;
    }
    ynum[y].first++;
    xnum[x].first++;
  }
  sort(rall(ynum));
  sort(rall(xnum));
  rep(i, h + 1) {
    if (ynum[i].first >= ynum[0].first - 1) {
      sety.insert(ynum[i].second);
    } else {
      break;
    }
  }
  rep(i, w + 1) {
    if (xnum[i].first >= xnum[0].first - 1) {
      setx.insert(xnum[i].second);
    } else {
      break;
    }
  }
  ll maxvx = 0, maxvy = 0, d, ans = 0, ypoint;
  for (auto y : sety) {
    for (auto x : setx) {
      d = mapx[x] + mapy[y];
      if (d <= ans - 2)
        continue;
      d -= yxpoint.count(make_pair(y, x));
      ans = max(ans, d);
    }
  }
  out(ans);
}