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

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;

double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005ll;
double PI = acos(-1);
int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};
int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1};
const ll MOD = 1000000007;

ll sum() { return 0; }
template <typename T, typename... Args> T sum(T a, Args... args) {
  return a + sum(args...);
}

#define DEBUG fprintf(stderr, "====TESTING====\\n")
#define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
#define OUT(x) cout << x << endl
#define OUTH(x) cout << x << " "
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define READ(x)                                                                \\
  for (auto &(z) : x)                                                          \\
    cin >> z;
#define FOR(a, b, c) for (int(a) = (b); (a) < (c); ++(a))
#define FORN(a, b, c) for (int(a) = (b); (a) <= (c); ++(a))
#define FORD(a, b, c) for (int(a) = (b); (a) >= (c); --(a))
#define FORSQ(a, b, c) for (int(a) = (b); (a) * (a) <= (c); ++(a))
#define FORC(a, b, c) for (char(a) = (b); (a) <= (c); ++(a))
#define EACH(a, b) for (auto &(a) : (b))
#define REP(i, n) FOR(i, 0, n)
#define REPN(i, n) FORN(i, 1, n)
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define SQR(x) ((ll)(x) * (x))
#define RESET(a, b) memset(a, b, sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr, sz) sort(ALLA(arr, sz))
#define REVERSEA(arr, sz) reverse(ALLA(arr, sz))
#define PERMUTE next_permutation
#define TC(t) while (t--)
#define FAST_INP                                                               \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(NULL)
#define what_is(x) cerr << #x << " is " << x << endl;

void solve() {}

int main() {
  FAST_INP;
  //    #ifndef ONLINE_JUDGE
  //    freopen("input.txt","r", stdin);
  //    freopen("output.txt","w", stdout);
  //    #endif

  //    int tc; cin >> tc;
  //    TC(tc) solve();
  int n, x, y;
  cin >> n;
  //	vector<pll> v;
  //	REP(i,n){
  //		cin >> x >> y;
  //		v.pb({x,y});
  //	}
  //	ll r0=INFF, c0=INFF;
  //	sort(ALL(v), [r0,c0](pll& a, pll& b){
  //		return abs(r0-a.fi)+abs(c0-a.se) < abs(r0-b.fi)+abs(c0-b.se);
  //	});
  //	ll ans=0;
  //	REP(i,n){
  //		FOR(j,i+1,n){
  //			MAX(ans, (abs(v[i].fi-v[j].fi)+abs(v[i].se-v[j].se)));
  //		}
  //	}
  //	OUT(ans);
  //	cout << v[n-1].fi << " " << v[n-1].se << endl;
  //	OUT((abs(v[0].fi-v[n-1].fi)+abs(v[0].se-v[n-1].se)));
  int miA = INT_MAX, miB = INT_MAX, mxA = INT_MIN, mxB = INT_MIN;
  REP(i, n) {
    cin >> x >> y;
    MIN(miA, x + y);
    MAX(mxA, x + y);
    MIN(miB, x - y);
    MAX(mxB, x - y);
  }
  OUT(max({abs(mxA - miA), abs(mxB - miB), miB, mxB}));
  return 0;
}

Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;

double EPS = 1e-9;
int INF = 1000000005;
long long INFF = 1000000000000000005ll;
double PI = acos(-1);
int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};
int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1};
const ll MOD = 1000000007;

ll sum() { return 0; }
template <typename T, typename... Args> T sum(T a, Args... args) {
  return a + sum(args...);
}

#define DEBUG fprintf(stderr, "====TESTING====\\n")
#define VALUE(x) cerr << "The value of " << #x << " is " << x << endl
#define OUT(x) cout << x << endl
#define OUTH(x) cout << x << " "
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define READ(x)                                                                \\
  for (auto &(z) : x)                                                          \\
    cin >> z;
#define FOR(a, b, c) for (int(a) = (b); (a) < (c); ++(a))
#define FORN(a, b, c) for (int(a) = (b); (a) <= (c); ++(a))
#define FORD(a, b, c) for (int(a) = (b); (a) >= (c); --(a))
#define FORSQ(a, b, c) for (int(a) = (b); (a) * (a) <= (c); ++(a))
#define FORC(a, b, c) for (char(a) = (b); (a) <= (c); ++(a))
#define EACH(a, b) for (auto &(a) : (b))
#define REP(i, n) FOR(i, 0, n)
#define REPN(i, n) FORN(i, 1, n)
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define SQR(x) ((ll)(x) * (x))
#define RESET(a, b) memset(a, b, sizeof(a))
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define ALLA(arr, sz) arr, arr + sz
#define SIZE(v) (int)v.size()
#define SORT(v) sort(ALL(v))
#define REVERSE(v) reverse(ALL(v))
#define SORTA(arr, sz) sort(ALLA(arr, sz))
#define REVERSEA(arr, sz) reverse(ALLA(arr, sz))
#define PERMUTE next_permutation
#define TC(t) while (t--)
#define FAST_INP                                                               \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(NULL)
#define what_is(x) cerr << #x << " is " << x << endl;

void solve() {}

int main() {
  FAST_INP;
  //    #ifndef ONLINE_JUDGE
  //    freopen("input.txt","r", stdin);
  //    freopen("output.txt","w", stdout);
  //    #endif

  //    int tc; cin >> tc;
  //    TC(tc) solve();
  int n, x, y;
  cin >> n;
  vii v;
  REP(i, n) {
    cin >> x >> y;
    v.pb({x, y});
  }
  int r0 = 0, c0 = 0;
  sort(ALL(v), [r0, c0](pii &a, pii &b) {
    return abs(r0 - a.fi) + abs(c0 - a.se) < abs(r0 - b.fi) + abs(c0 - b.se);
  });
  int ans = 0;
  REP(i, n) {
    FOR(j, i + 1, n) {
      MAX(ans, (abs(v[i].fi - v[j].fi) + abs(v[i].se - v[j].se)));
    }
  }
  OUT(ans);
  //	OUT((abs(v[0].fi-v[n-1].fi)+abs(v[0].se-v[n-1].se)));
  return 0;
}