Problem p02580 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>

using namespace std;

/// ----------------------------- (Debug) ------------------------------
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                 \\
  sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(    \\
            c i) {
sim > struct rge {
  c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef ONLINE_JUDGE
  eni(!=) cerr << boolalpha << i;
  ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
  sim dor(const c &) { ris; }
#endif
}
;
vector<char *> tokenizer(const char *args) {
  char *token = new char[111];
  strcpy(token, args);
  token = strtok(token, ", ");
  vector<char *> v({token});
  while (token = strtok(NULL, ", "))
    v.push_back(token);
  return reverse(v.begin(), v.end()), v;
}
void debugg(vector<char *> args) { cerr << "\\b\\b "; }
template <typename Head, typename... Tail>
void debugg(vector<char *> args, Head H, Tail... T) {
  debug() << " [" << args.back() << ": " << H << "] ";
  args.pop_back();
  debugg(args, T...);
}
#define harg(...) #__VA_ARGS__
#ifndef ONLINE_JUDGE
#define dbg(...)                                                               \\
  {                                                                            \\
    debugg(tokenizer(harg(__VA_ARGS__, \\b\\t-- > Line)), __VA_ARGS__,           \\
           __LINE__);                                                          \\
    cerr << endl;                                                              \\
  }
#else
#define dbg(...)                                                               \\
  {}
#endif
/// -----------------------------------------------------------------------

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
#define IOS                                                                    \\
  ios::sync_with_stdio(0);                                                     \\
  cin.tie(0);                                                                  \\
  cout.tie(0)
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define print(x) cout << x << "\\n";
#define REP(i, a, b) for (i = a; i <= b; i++)
#define RAP(i, a, b) for (i = a; i >= b; i--)
#define spa << " " <<
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)x.size()
ll mod = 1e9 + 7;
const int MX = 0x3f3f3f3f;

int main() {
  IOS;
  int h, w, i, j, m, u, v;
  cin >> h >> w >> m;
  vi r(h), c(w);
  set<pi> s;
  REP(i, 1, m) {
    cin >> u >> v;
    u--;
    v--;
    s.insert({u, v});
    r[u]++;
    c[v]++;
  }
  int ans = 0, temp1, temp2, pos;
  temp1 = *max_element(all(r));
  pos = max_element(all(r)) - r.begin();
  temp2 = *max_element(all(c));
  REP(i, 0, w - 1) {
    if (c[i] == temp2) {
      if (s.find({pos, i}) != s.end())
        ans = max(temp1 + temp2 - 1, ans);
      else
        ans = max(ans, temp1 + temp2);
    }
  }
  temp2 = *max_element(all(r));
  pos = max_element(all(c)) - c.begin();
  temp1 = *max_element(all(c));
  REP(i, 0, h - 1) {
    if (r[i] == temp2) {
      if (s.find({i, pos}) != s.end())
        ans = max(temp1 + temp2 - 1, ans);
      else
        ans = max(ans, temp1 + temp2);
    }
  }
  cout << ans;
  return 0;
}

Error: WA

Fixed submission:

#include <bits/stdc++.h>

using namespace std;

/// ----------------------------- (Debug) ------------------------------
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                 \\
  sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(    \\
            c i) {
sim > struct rge {
  c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef ONLINE_JUDGE
  eni(!=) cerr << boolalpha << i;
  ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
  sim dor(const c &) { ris; }
#endif
}
;
vector<char *> tokenizer(const char *args) {
  char *token = new char[111];
  strcpy(token, args);
  token = strtok(token, ", ");
  vector<char *> v({token});
  while (token = strtok(NULL, ", "))
    v.push_back(token);
  return reverse(v.begin(), v.end()), v;
}
void debugg(vector<char *> args) { cerr << "\\b\\b "; }
template <typename Head, typename... Tail>
void debugg(vector<char *> args, Head H, Tail... T) {
  debug() << " [" << args.back() << ": " << H << "] ";
  args.pop_back();
  debugg(args, T...);
}
#define harg(...) #__VA_ARGS__
#ifndef ONLINE_JUDGE
#define dbg(...)                                                               \\
  {                                                                            \\
    debugg(tokenizer(harg(__VA_ARGS__, \\b\\t-- > Line)), __VA_ARGS__,           \\
           __LINE__);                                                          \\
    cerr << endl;                                                              \\
  }
#else
#define dbg(...)                                                               \\
  {}
#endif
/// -----------------------------------------------------------------------

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
#define IOS                                                                    \\
  ios::sync_with_stdio(0);                                                     \\
  cin.tie(0);                                                                  \\
  cout.tie(0)
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define print(x) cout << x << "\\n";
#define REP(i, a, b) for (i = a; i <= b; i++)
#define RAP(i, a, b) for (i = a; i >= b; i--)
#define spa << " " <<
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)x.size()
ll mod = 1e9 + 7;
const int MX = 0x3f3f3f3f;

int main() {
  IOS;
  int h, w, i, j, m, u, v;
  cin >> h >> w >> m;
  int a[h][w];
  memset(a, 0, sizeof(a));
  REP(i, 1, m) {
    cin >> u >> v;
    u--, v--;
    a[u][v] = 1;
  }
  vi r(h), c(w);
  int ans = 0, temp;
  REP(i, 0, h - 1) {
    temp = 0;
    REP(j, 0, w - 1) { temp += a[i][j]; }
    r[i] = temp;
  }
  REP(j, 0, w - 1) {
    temp = 0;
    REP(i, 0, h - 1)
    temp += a[i][j];
    c[j] = temp;
  }
  REP(i, 0, h - 1) {
    REP(j, 0, w - 1) {
      // dbg(r[i],c[j],i,j);
      ans = max(ans, r[i] + c[j] - a[i][j]);
    }
  }
  cout << ans;
  return 0;
}