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

#include <bits/stdc++.h>
using namespace std;
/*******  All Required define Pre-Processors and typedef Constants *******/
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define Dcout(a) cout << setprecision(20) << a << endl
#define ll long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pb push_back
#define eb emplace_back
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pii>
#define vpll vector<pll>
#define fi first
#define se second
using Graph = vector<vector<ll>>;
const ll INF = (1LL << 60);
const double pi = acos(-1.0);
/******************* debug ********************/
#define debug(var)                                                             \\
  do {                                                                         \\
    std::cout << #var << " : ";                                                \\
    view(var);                                                                 \\
  } while (0)
#define deb cout << "line : " << __LINE__ << " debug" << endl
template <typename T> void view(T e) { cout << e << endl; }
template <typename T> void view(const vector<T> &v) {
  for (const auto &e : v)
    cout << e << " ";
  cout << endl;
}
template <typename T> void view(const vector<vector<T>> &vv) {
  for (const auto &v : vv) {
    view(v);
  }
}
/****** Template of some basic operations *****/
struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}

template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v)
    is >> in;
  return is;
}

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename T = ll> vector<T> make_v(size_t a) { return vector<T>(a); }

template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}

template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t)
    fill_v(e, v);
}

template <typename F> struct FixPoint : F {
  FixPoint(F &&f) : F(forward<F>(f)) {}

  template <typename... Args> decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, forward<Args>(args)...);
  }
};

template <typename F> inline decltype(auto) MFP(F &&f) {
  return FixPoint<F>{forward<F>(f)};
}
/********************************************************/
/******************** Start coding ! *******************/

int main() {
  int n, x, y;
  cin >> n >> x >> y;
  x--, y--;
  vector<int> ans(n, 0);
  for (int i = 0; i < n; i++) {
    for (int j = i + 1; j < n; j++) {
      int k = min(
          j - i, min(abs(x - i) + 1 + abs(y - j), abs(y - i) + 1 + abs(x - j)));
      ans[k]++;
    }
  }
  for (int i = 1; i < n; i++)
    cout << ans[i] << endl;
}


Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define per(i, n) for (int i = n - 1; i >= 0; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define per1(i, n) for (int i = n; i >= 1; ++i)
#define debug cout << "line : " << __LINE__ << " debug" << endl
#define Dcout(N) cout << setprecision(20) << N << endl
#define Unique(v) v.erase(unique(v.begin(), v.end()), v.end()) // 被り削除
#define pb push_back
#define mp make_pair
#define F first
#define S second
// #define INF 1e9
#define MOD 1000000007
typedef long long ll;
//------------------------------------------------------------------------
typedef vector<vector<int>> Matrix;

const int INF = 100000000;
Matrix
    d; // グラフの距離を格納した2次元配列（隣接行列）
       // d[u][v]は辺e=(u,v)のコスト（辺が存在しない場合はINF、ただしd[i][i]=0）

void warshall_floyd(int n) {      // nは頂点数
  for (int i = 0; i < n; i++)     // 経由する頂点
    for (int j = 0; j < n; j++)   // 開始頂点
      for (int k = 0; k < n; k++) // 終端
        d[j][k] = min(d[j][k], d[j][i] + d[i][k]);
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int n, x, y;
  cin >> n >> x >> y;

  d = Matrix(n, vector<int>(n, INF));
  for (int i = 0; i < n; i++)
    d[i][i] = 0;

  for (int i = 0; i < n - 1; i++) {
    d[i][i + 1] = 1;
    d[i + 1][i] = 1;
  }

  d[x - 1][y - 1] = 1;
  d[y - 1][x - 1] = 1;

  warshall_floyd(n);
  vector<ll> v(1000000);
  for (int i = 0; i < n; i++) {
    for (int j = i; j < n; j++) {
      if (i != j && d[i][j] != INF)
        // cout << i << "から" << j << "へのコスト: " << d[i][j] << endl;
        v[d[i][j]]++;
    }
  }

  rep1(i, n - 1) { cout << v[i] << endl; }

  return 0;
}