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

#line 2 "header.hpp"

//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H

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

// varibable settings
const long long INF = 1e18;
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (ll i = (ll)((b)-1); i >= (ll)(a); --i)
#define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define ub upper_bound
#define lb lower_bound
#define lpos(A, x) (lower_bound(all(A), x) - A.begin())
#define upos(A, x) (upper_bound(all(A), x) - A.begin())
template <class T, class U> inline void chmax(T &a, const U &b) {
  if ((a) < (b))
    (a) = (b);
}
template <class T, class U> inline void chmin(T &a, const U &b) {
  if ((a) > (b))
    (a) = (b);
}
template <typename X, typename T> auto make_table(X x, T a) {
  return vector<T>(x, a);
}
template <typename X, typename Y, typename Z, typename... Zs>
auto make_table(X x, Y y, Z z, Zs... zs) {
  auto cont = make_table(y, z, zs...);
  return vector<decltype(cont)>(x, cont);
}

#define cdiv(a, b) (((a) + (b)-1) / (b))
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x)                                                                 \\
  sort(all(x));                                                                \\
  x.erase(unique(all(x)), x.end())
#define slice(l, r) substr(l, r - l)

typedef long long ll;
typedef long double ld;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;

template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
void check_input() {
  assert(cin.eof() == 0);
  int tmp;
  cin >> tmp;
  assert(cin.eof() == 1);
}

#if defined(PCM) || defined(LOCAL)
#else
#define dump(...) ;
#define dump_1d(...) ;
#define dump_2d(...) ;
#define cerrendl ;
#endif

#endif /* HEADER_H */
//%snippet.end()%
#line 2 "solve.cpp"
template <class T = ll> using vec = vector<T>;
struct Fast {
  Fast() {
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;

template <class T> void pairsort(vector<T> &x, vector<T> &y) {
  ll n = sz(x);
  vector<tuple<T, T>> t(n);
  rep(i, n) { t[i] = make_tuple(x[i], y[i]); }
  sort(all(t));
  rep(i, n) {
    x[i] = get<0>(t[i]);
    y[i] = get<1>(t[i]);
  }
}

int solve() {
  ll n;
  cin >> n;
  vl x(n), y(n);
  vl x2(n), y2(n);

  vl a, b, c, d;
  rep(i, n) {
    cin >> x[i] >> y[i];
    a.pb(x[i] + y[i]);
    b.pb(x[i] - y[i]);
    c.pb(-x[i] + y[i]);
    d.pb(-x[i] - y[i]);
  }
  sort(all(a));
  sort(all(b));
  sort(all(c));
  sort(all(d));
  ll ans = 0;
  chmax(ans, a[n - 1] - a[0]);
  chmax(ans, b[n - 1] - b[0]);
  chmax(ans, c[n - 1] - c[0]);
  chmax(ans, d[n - 1] - d[0]);

  cout << ans << endl;

  return 0;
}

int main() { /*{{{*/
  solve();
  check_input();
  return 0;
} /*}}}*/


Error: TLE

Fixed submission:

#line 2 "header.hpp"

//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H

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

// varibable settings
const long long INF = 1e18;
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (ll i = (ll)((b)-1); i >= (ll)(a); --i)
#define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define ub upper_bound
#define lb lower_bound
#define lpos(A, x) (lower_bound(all(A), x) - A.begin())
#define upos(A, x) (upper_bound(all(A), x) - A.begin())
template <class T, class U> inline void chmax(T &a, const U &b) {
  if ((a) < (b))
    (a) = (b);
}
template <class T, class U> inline void chmin(T &a, const U &b) {
  if ((a) > (b))
    (a) = (b);
}
template <typename X, typename T> auto make_table(X x, T a) {
  return vector<T>(x, a);
}
template <typename X, typename Y, typename Z, typename... Zs>
auto make_table(X x, Y y, Z z, Zs... zs) {
  auto cont = make_table(y, z, zs...);
  return vector<decltype(cont)>(x, cont);
}

#define cdiv(a, b) (((a) + (b)-1) / (b))
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x)                                                                 \\
  sort(all(x));                                                                \\
  x.erase(unique(all(x)), x.end())
#define slice(l, r) substr(l, r - l)

typedef long long ll;
typedef long double ld;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;

template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
void check_input() {
  assert(cin.eof() == 0);
  int tmp;
  cin >> tmp;
  assert(cin.eof() == 1);
}

#if defined(PCM) || defined(LOCAL)
#else
#define dump(...) ;
#define dump_1d(...) ;
#define dump_2d(...) ;
#define cerrendl ;
#endif

#endif /* HEADER_H */
//%snippet.end()%
#line 2 "solve.cpp"
template <class T = ll> using vec = vector<T>;
struct Fast {
  Fast() {
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;

template <class T> void pairsort(vector<T> &x, vector<T> &y) {
  ll n = sz(x);
  vector<tuple<T, T>> t(n);
  rep(i, n) { t[i] = make_tuple(x[i], y[i]); }
  sort(all(t));
  rep(i, n) {
    x[i] = get<0>(t[i]);
    y[i] = get<1>(t[i]);
  }
}

int solve() {
  ll n;
  cin >> n;
  vl x(n), y(n);
  vl x2(n), y2(n);

  rep(i, n) {
    cin >> x[i] >> y[i];
    dump(x[i], y[i]);
    x2 = x;
    y2 = y;
  }
  pairsort(x, y);
  pairsort(y2, x2);
  dump(x, y);
  dump(x2, y2);

  auto dist = [&](ll i, ll j) { return abs(x[i] - x2[j]) + abs(y[i] - y2[j]); };

  ll ans = 0;
  chmax(ans, dist(0, n - 1));
  chmax(ans, dist(n - 1, 0));
  chmax(ans, dist(n - 1, n - 1));
  chmax(ans, dist(0, 0));
  cout << ans << endl;

  return 0;
}

int main() { /*{{{*/
  solve();
  check_input();
  return 0;
} /*}}}*/