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

#include <iostream>
using namespace std;
int N, X, Y;
int cnt[2020];
main() {
  cin >> N >> X >> Y;
  X--, Y--;
  for (int i = 0; i < N; i++) {
    for (int j = i + 1; j < N; j++) {
      cnt[min(j - i, abs(X - i) + 1 + abs(Y - j))]++;
    }
  }
  for (int k = 1; k < N; k++)
    cout << cnt[k] << endl;
}


Error: TLE

Fixed submission:

#include <algorithm>
#include <boost/multiprecision/cpp_int.hpp>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace boost::multiprecision;
using namespace std;
#define BEGIN                                                                  \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(NULL);                                                               \\
  cout.tie(NULL)
#define END return EXIT_SUCCESS
#define rep(I, N) for (auto I = 0; I < (N); ++I)
#define up(I, A, B) for (auto I = (A); I <= (B); ++I)
#define dw(I, A, B) for (auto I = (A); I >= (B); --I)
#define all(C) (C).begin(), (C).end()
#define rall(C) (C).rbegin(), (C).rend()
#define ft first
#define sd second
#define mp make_pair
#define mt make_tuple
#define pf push_front
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define rs resize
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline void in(T &p) { cin >> p; }
template <class T1, class T2> inline void in(T1 &p1, T2 &p2) {
  cin >> p1 >> p2;
}
template <class T1, class T2, class T3> inline void in(T1 &p1, T2 &p2, T3 &p3) {
  cin >> p1 >> p2 >> p3;
}
template <class T1, class T2, class T3, class T4>
inline void in(T1 &p1, T2 &p2, T3 &p3, T4 &p4) {
  cin >> p1 >> p2 >> p3 >> p4;
}
template <class T1, class T2, class T3, class T4, class T5>
inline void in(T1 &p1, T2 &p2, T3 &p3, T4 &p4, T5 &p5) {
  cin >> p1 >> p2 >> p3 >> p4 >> p5;
}
template <class T> inline void ins(T &p) {
  for_each(all(p), in<decltype(p[0])>);
}
template <class T> inline void out(T p) { cout << p << endl; }
template <class T1, class T2> inline void out(T1 p1, T2 p2) {
  cout << p1 << " " << p2 << endl;
}
template <class T1, class T2, class T3> inline void out(T1 p1, T2 p2, T3 p3) {
  cout << p1 << " " << p2 << " " << p3 << endl;
}
template <class T1, class T2, class T3, class T4>
inline void out(T1 p1, T2 p2, T3 p3, T4 p4) {
  cout << p1 << " " << p2 << " " << p3 << " " << p4 << endl;
}
inline void out(double p) { printf("%.10f\\n", p); }
template <class T> inline void outs(T p) {
  for_each(all(p), out<decltype(p[0])>);
}
template <class T> inline void outs(vector<T> V) {
  int n = V.size();
  rep(i, n) cout << V[i] << " \\n"[i == n - 1];
}
ll G[2 << 10][2 << 10], d[2 << 10][2 << 10];
const ll INF = 1L << 30;
inline void solve(void) {
  ll N, X, Y;
  in(N, X, Y);
  X--;
  Y--;
  fill((ll *)G, (ll *)(G + (2 << 10)), INF);
  rep(i, N) G[i][i] = 0;
  rep(i, N - 1) {
    G[i][i + 1] = 1;
    G[i + 1][i] = 1;
  }
  G[X][Y] = 1;
  G[Y][X] = 1;
  rep(k, N) {
    rep(i, N) {
      rep(j, N) { chmin(G[i][j], G[i][k] + G[k][j]); }
    }
  }
  map<ll, ll> cnt;
  rep(i, N) {
    for (int j = i + 1; j < N; j++) {
      cnt[G[i][j]]++;
    }
  }
  up(k, 1, N - 1) out(cnt[k]);
}
int main(int argc, char **argv) {
  BEGIN;
  solve();
  END;
}