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

#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define IINF 10e8
#define INF 1 << 30
#define MOD 1000000007
#define mod 10007
#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define chmax(x, y) x = mmax(x, y)
#define chmin(x, y) x = mmin(x, y)
#define all(x) (x).begin(), (x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int, int> Pin;
typedef pair<ll, ll> Pll;
template <class T> using V = vector<T>;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int ddx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
int ddy[8] = {0, -1, 0, 1, 1, -1, 1, -1};
ll cmp(pair<ll, ll> a, pair<ll, ll> b) {
  if (a.se != b.se)
    return a.se < b.se;
  else
    return a.fi < b.fi;
}
//----------------------------------------------------------------------
ll ans[2020];
//----------------------------------------------------------------------
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  //-------------------------------
  // ll begin_time=clock();
  //-------------------------------
  ll n, x, y;
  cin >> n >> x >> y;
  x--;
  y--;
  for (ll i = 0; i < n; i++) {
    for (ll j = i + 1; j < n; j++) {
      ll mind = mmin(j - i, mmin(abs(x - i) + 1 + abs(j - y),
                                 abs(y - i) + 1 + abs(j - x)));
      ans[mind]++;
    }
  }
  for (ll k = 1; k <= n - 1; k++) {
    cout << ans[k] << endl;
  }
  //-------------------------------
  // ll end_time=clock();cout<<"time="<<end_time-begin_time<<"ms"<<endl;
  //-------------------------------
  return 0;
}
//----------------------------------------------------------------------


Error: TLE

Fixed submission:

#pragma GCC optimize("O3")
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <istream>
#include <iterator>
#include <list>
#include <map>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define IINF 10e8
#define INF 1 << 30
#define MOD 1000000007
#define mod 10007
#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define chmax(x, y) x = mmax(x, y)
#define chmin(x, y) x = mmin(x, y)
#define all(x) (x).begin(), (x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int, int> Pin;
typedef pair<ll, ll> Pll;
template <class T> using V = vector<T>;
long long GCD(long long a, long long b) { return b ? GCD(b, a % b) : a; }
long long LCM(long long a, long long b) { return a / GCD(a, b) * b; }
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
int ddx[8] = {-1, 0, 1, 0, 1, 1, -1, -1};
int ddy[8] = {0, -1, 0, 1, 1, -1, 1, -1};
ll cmp(pair<ll, ll> a, pair<ll, ll> b) {
  if (a.se != b.se)
    return a.se < b.se;
  else
    return a.fi < b.fi;
}
//----------------------------------------------------------------------

//----------------------------------------------------------------------
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  //-------------------------------
  // ll begin_time=clock();
  //-------------------------------
  ll n, x, y;
  cin >> n >> x >> y;
  x--;
  y--;
  for (ll k = 1; k <= n - 1; k++) {
    if (k == 1) {
      cout << n << endl;
      continue;
    }
    ll res = 0;
    for (ll i = 0; i < n; i++) {
      for (ll j = i + 1; j < n; j++) {
        ll mind = mmin(j - i, mmin(abs(x - i) + 1 + abs(j - y),
                                   abs(y - i) + 1 + abs(j - x)));
        if (mind == k)
          res++;
      }
    }
    cout << res << endl;
  }
  //-------------------------------
  // ll end_time=clock();cout<<"time="<<end_time-begin_time<<"ms"<<endl;
  //-------------------------------
  return 0;
}
//----------------------------------------------------------------------