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

#include "bits/stdc++.h"

#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define debug_print(var) cerr << #var << "=" << var << endl;
#define DUMP(i, v)                                                             \\
  for (ll i = 0; i < v.size(); i++)                                            \\
  cerr << v[i] << " "
#define fi first
#define se second

using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge {
  ll x, c;
};

ll mod(ll a, ll mod) {
  ll res = a % mod;
  if (res < 0)
    res = res + mod;
  return res;
}

ll modpow(ll a, ll n, ll mod) {
  ll res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}

ll modinv(ll a, ll mod) {
  ll b = mod, u = 1, v = 0;
  while (b) {
    ll t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= mod;
  if (u < 0)
    u += mod;
  return u;
}

ll gcd(ll a, ll b) {
  ll r = a % b;
  if (r == 0)
    return b;
  else
    return gcd(b, a % b);
}

bool is_prime(ll n) {
  ll i = 2;
  if (n == 1)
    return false;
  if (n == 2)
    return true;
  bool res = true;
  while (i * i < n) {
    if (n % i == 0) {
      res = false;
    }
    i = i + 1;
  }

  // if(i==1)res = false;
  if (n % i == 0)
    res = false;
  return res;
}

struct UnionFind {
  ll N;
  llvec p;
  llvec cnt;
  UnionFind(ll n) {
    N = n;
    p = llvec(N);
    cnt = llvec(N, 0);
    rep(i, N) {
      p[i] = i;
      cnt[i] = 1;
    }
  }

  void con(ll a, ll b) {
    P at = root(a);
    P bt = root(b);
    if (at.second != bt.second) {
      if (at.first > bt.first) {
        swap(at, bt);
        swap(a, b);
      }
      p[at.second] = bt.second;
      cnt[bt.second] += cnt[at.second];
      p[a] = bt.second;
    }
  }

  P root(ll a) {
    ll atmp = a;
    ll c = 0;
    while (atmp != p[atmp]) {
      atmp = p[atmp];
      c++;
    }
    p[a] = atmp;
    return {c, atmp};
  }

  bool is_con(ll a, ll b) {
    P at = root(a);
    P bt = root(b);
    return at.second == bt.second;
  }
};

struct dijkstra {
  ll N;
  llvec d;
  vector<vector<edge>> e;
  dijkstra(ll n) {
    N = n;
    // d = llvec(N, 1e18);
    e = vector<vector<edge>>(N);
  }

  void add_edge(ll from, ll to, ll cost) { e[from].push_back({to, cost}); }

  void run(ll start) {
    priority_queue<P, vector<P>, greater<P>> que;
    que.push({0, start});
    d = llvec(N, 1e18);
    d[start] = 0;
    while (!que.empty()) {
      P q = que.top();
      que.pop();
      ll dc = q.first;
      ll x = q.second;
      if (dc > d[x]) {
        continue;
      } else {
        for (auto ip : e[x]) {
          if (d[ip.x] <= d[x] + ip.c) {
            continue;
          } else {
            d[ip.x] = d[x] + ip.c;
            que.push({d[ip.x], ip.x});
          }
        }
      }
    }
  }
};

/**************************************
** A main function starts from here  **
***************************************/
int main() {
  ll h, w, m;
  cin >> h >> w >> m;
  vector<P> v(m);
  vector<ll> x(h + 1, 0);
  vector<ll> y(w + 1, 0);
  rep(i, m) {
    cin >> v[i].fi >> v[i].se;
    x[v[i].fi]++;
    y[v[i].se]++;
  }

  ll ans = 0;
  ll mx = 0;
  ll my = 0;
  rep(i, h + 1) { mx = max(x[i], mx); }
  rep(i, w + 1) { my = max(y[i], my); }

  ans = mx + my;

  ll cnt = 0;
  rep(i, m) {
    if (x[v[i].fi] + y[v[i].se] - 1 == ans) {
      cnt++;
    }
    if (x[v[i].fi] + y[v[i].se] == ans) {
      cnt--;
    }
  }

  sort(ALL(x));
  sort(ALL(y));

  for (auto ix : x) {
    cnt += (ll)(upper_bound(ALL(y), ans - ix) - lower_bound(ALL(y), ans - ix));
  }
  if (cnt == 0) {
    cout << ans - 1;
  } else {
    cout << ans;
  }

  return 0;
}


Error: TLE

Fixed submission:

#include "bits/stdc++.h"

#define MOD 1000000007
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define FOR(i, j, k) for (ll i = j; i < k; i++)
#define debug_print(var) cerr << #var << "=" << var << endl;
#define DUMP(i, v)                                                             \\
  for (ll i = 0; i < v.size(); i++)                                            \\
  cerr << v[i] << " "
#define fi first
#define se second

using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge {
  ll x, c;
};

ll mod(ll a, ll mod) {
  ll res = a % mod;
  if (res < 0)
    res = res + mod;
  return res;
}

ll modpow(ll a, ll n, ll mod) {
  ll res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}

ll modinv(ll a, ll mod) {
  ll b = mod, u = 1, v = 0;
  while (b) {
    ll t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= mod;
  if (u < 0)
    u += mod;
  return u;
}

ll gcd(ll a, ll b) {
  ll r = a % b;
  if (r == 0)
    return b;
  else
    return gcd(b, a % b);
}

bool is_prime(ll n) {
  ll i = 2;
  if (n == 1)
    return false;
  if (n == 2)
    return true;
  bool res = true;
  while (i * i < n) {
    if (n % i == 0) {
      res = false;
    }
    i = i + 1;
  }

  // if(i==1)res = false;
  if (n % i == 0)
    res = false;
  return res;
}

struct UnionFind {
  ll N;
  llvec p;
  llvec cnt;
  UnionFind(ll n) {
    N = n;
    p = llvec(N);
    cnt = llvec(N, 0);
    rep(i, N) {
      p[i] = i;
      cnt[i] = 1;
    }
  }

  void con(ll a, ll b) {
    P at = root(a);
    P bt = root(b);
    if (at.second != bt.second) {
      if (at.first > bt.first) {
        swap(at, bt);
        swap(a, b);
      }
      p[at.second] = bt.second;
      cnt[bt.second] += cnt[at.second];
      p[a] = bt.second;
    }
  }

  P root(ll a) {
    ll atmp = a;
    ll c = 0;
    while (atmp != p[atmp]) {
      atmp = p[atmp];
      c++;
    }
    p[a] = atmp;
    return {c, atmp};
  }

  bool is_con(ll a, ll b) {
    P at = root(a);
    P bt = root(b);
    return at.second == bt.second;
  }
};

struct dijkstra {
  ll N;
  llvec d;
  vector<vector<edge>> e;
  dijkstra(ll n) {
    N = n;
    // d = llvec(N, 1e18);
    e = vector<vector<edge>>(N);
  }

  void add_edge(ll from, ll to, ll cost) { e[from].push_back({to, cost}); }

  void run(ll start) {
    priority_queue<P, vector<P>, greater<P>> que;
    que.push({0, start});
    d = llvec(N, 1e18);
    d[start] = 0;
    while (!que.empty()) {
      P q = que.top();
      que.pop();
      ll dc = q.first;
      ll x = q.second;
      if (dc > d[x]) {
        continue;
      } else {
        for (auto ip : e[x]) {
          if (d[ip.x] <= d[x] + ip.c) {
            continue;
          } else {
            d[ip.x] = d[x] + ip.c;
            que.push({d[ip.x], ip.x});
          }
        }
      }
    }
  }
};

/**************************************
** A main function starts from here  **
***************************************/
int main() {
  ll h, w, m;
  cin >> h >> w >> m;
  vector<P> v(m);
  llvec x(h + 1, 0);
  llvec y(w + 1, 0);
  vector<map<ll, ll>> S(h + 1);
  rep(i, m) {
    cin >> v[i].fi >> v[i].se;
    x[v[i].fi]++;
    y[v[i].se]++;
    S[v[i].fi][v[i].se]++;
  }
  ll ans = 0;

  // 爆破物のあるマスに置くとき
  for (auto iv : v) {
    ans = max(ans, x[iv.fi] + y[iv.se] - 1);
    // cerr << ans << endl;
  }

  llvec xind, yind;
  rep(i, h + 1) { xind.push_back(i); }
  rep(i, w + 1) { yind.push_back(i); }

  sort(ALL(xind), [x](ll a, ll b) { return x[a] > x[b]; });
  sort(ALL(yind), [y](ll a, ll b) { return y[a] > y[b]; });

  rep(j, w + 1) { ans = max(ans, x[xind[0]] + y[j] - S[xind[0]][j]); }
  rep(j, h + 1) { ans = max(ans, x[j] + y[yind[0]] - S[j][yind[0]]); }
  /*
  ll ok = 0;
  ll ng = 3e5+1;
  while(abs(ok-ng)>1){
    ll m= (ok+ng)/2;
    bool flg = true;//できないflg
    for(auto ix: xind){
      flg = x[ix]+y[yind[0]]<m;//もうできない
      if(flg)break;
      for(auto iy: yind){
        if(x[ix]+y[iy]<m)break;
        if(m>=x[ix]+y[iy] - S[ix][iy]){
          flg = false;//できる
        }
        if(!flg)break;
      }
      if(!flg)break;
    }
    if(!flg){
      ok = m;
    }else{
      ng = m;
    }
    //cerr << ok << " " << ng << endl;
  }
  cout << ok << endl;
  */

  cout << ans;

  return 0;
}