Problem p02726 (C++) — buggy submission, verdict: Runtime Error

#include <algorithm>
#include <complex>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using ld = long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define rRep(i, a, b) for (ll i = a; i >= b; i--)
#define crep(i) for (char i = 'a'; i <= 'z'; ++i)
#define psortsecond(A, N)                                                      \\
  sort(A, A + N,                                                               \\
       [](const pii &a, const pii &b) { return a.second < b.second; });
#define ALL(x) (x).begin(), (x).end()
#define debug(v)                                                               \\
  cout << #v << ":";                                                           \\
  for (auto x : v) {                                                           \\
    cout << x << ' ';                                                          \\
  }                                                                            \\
  cout << endl;
#define endl '\\n'
int ctoi(const char c) {
  if ('0' <= c && c <= '9')
    return (c - '0');
  return -1;
}
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll MOD = 1000000007;
constexpr ll INF = 1000000011;
constexpr ll MOD2 = 998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS = 10e-8;
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  for (auto &&x : v)
    is >> x;
  return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first;
  is >> p.second;
  return is;
}
template <typename T, typename U>
ostream &operator>>(ostream &os, const pair<T, U> &p) {
  os << p.first << ' ' << p.second;
  return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
  for (auto i = begin(v); i != end(v); ++i) {
    if (i != begin(v))
      os << ' ';
    os << *i;
  }
  return os;
}

ll X, Y, N;

int main() {
  cin >> N >> X >> Y;
  ll a = X, b = Y - X - 1, c = N - Y + 1;
  ll R = (b + 2) / 2, L = b - R; // ここ
  Rep(k, 1, N) {
    ll Z = 0;
    Z += max(0ll, a + c - k);                                     // aa cc ac
    Z += max(0ll, a + R - k) - max(0ll, a - k) - max(0ll, R - k); // aR -aa -RR
    Z += max(0ll, c + R - k) - max(0ll, c - k) - max(0ll, R - k); // cR -cc -RR
    if (k > 1) {
      Z += max(0ll, a + 1 + L - k) - max(0ll, a + 1 - k) -
           max(0ll, L + 1 - k); // koko
      Z += max(0ll, c + 1 + L - k) - max(0ll, c + 1 - k) -
           max(0ll, L + 1 - k); // koko
    }
    if (b % 2 == 0 && b != 0) {
      if (k <= b / 2) {
        if (k == 1) {
          Z += b - 1;
        } else {
          Z += (b + 2) - 4;
        }
      }
      if (k == b / 2 + 1) {
        Z += (b + 2) / 2 - 2;
      }
    } else {
      if (k <= (b + 1) / 2) {
        if (k == 1) {
          Z += b - 1;
        } else {
          Z += (b + 2) - 4;
        }
      }
    }
    cout << Z << endl;
  }
}


Error: 0

Fixed submission:

#include <algorithm>
#include <complex>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using ld = long double;
#define pb push_back
#define mp make_pair
#define sc second
#define fr first
#define stpr setprecision
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define Rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define rrep(i, n) for (ll i = n - 1; i >= 0; i--)
#define rRep(i, a, b) for (ll i = a; i >= b; i--)
#define crep(i) for (char i = 'a'; i <= 'z'; ++i)
#define psortsecond(A, N)                                                      \\
  sort(A, A + N,                                                               \\
       [](const pii &a, const pii &b) { return a.second < b.second; });
#define ALL(x) (x).begin(), (x).end()
#define debug(v)                                                               \\
  cout << #v << ":";                                                           \\
  for (auto x : v) {                                                           \\
    cout << x << ' ';                                                          \\
  }                                                                            \\
  cout << endl;
#define endl '\\n'
int ctoi(const char c) {
  if ('0' <= c && c <= '9')
    return (c - '0');
  return -1;
}
ll gcd(ll a, ll b) { return (b == 0 ? a : gcd(b, a % b)); }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll MOD = 1000000007;
constexpr ll INF = 1000000011;
constexpr ll MOD2 = 998244353;
constexpr ll LINF = 1001002003004005006ll;
constexpr ld EPS = 10e-8;
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  for (auto &&x : v)
    is >> x;
  return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first;
  is >> p.second;
  return is;
}
template <typename T, typename U>
ostream &operator>>(ostream &os, const pair<T, U> &p) {
  os << p.first << ' ' << p.second;
  return os;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
  for (auto i = begin(v); i != end(v); ++i) {
    if (i != begin(v))
      os << ' ';
    os << *i;
  }
  return os;
}

ll X, Y, N, P[2007];

int main() {
  cin >> N >> X >> Y;
  ll a = X - 1, b = Y - X - 1, c = N - Y;
  Rep(i, 1, b + 1) { P[min(i, b + 2 - i)]++; }
  Rep(k, 1, N) {
    ll Z = 0;
    if (k == 1) { // XY
      Z++;
    }

    if (k <= a) { // aX
      Z++;
    }

    if (a + 1 >= k && k >= 2) { // aY
      Z++;
    }

    if (k <= c) { // cY
      Z++;
    }

    if (c + 1 >= k && k >= 2) { // cX
      Z++;
    }

    // bX cY
    Z += P[k] * 2;

    // aa bb cc
    Z += max(0ll, a - k) + max(0ll, b - k) + max(0ll, c - k);

    if (k > 1) {
      // ab
      Rep(i, 1, a + 1) { Z += P[k - (a - i + 1)]; }

      // bc
      Rep(i, Y + 1, Y + c + 1) { Z += P[k - (i - Y)]; }

      // ac
      Rep(i, 1, a + 1) {
        if (X - i + 2 <= k && X - i + 1 + c >= k) {
          Z++;
        }
      }
    }

    cout << Z << endl;
  }
}