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

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

inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T> inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}

typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef tuple<int, int, int> tpl;

#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define EXIST(m, v) (m).find((v)) != (m).end()
#define LB(a, x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a, x) upper_bound((a).begin(), (a).end(), x) - (a).begin()

#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define RREP(i, n) RFOR(i, n, 0)

#define en "\\n"

constexpr double EPS = 1e-9;
constexpr double PI = 3.1415926535897932;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL << 60;
constexpr long long MOD = 1000000007; // 998244353;

#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x)                                                               \\
  cerr << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \\
       << " " << __FILE__ << endl;

template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

int N;
string X;
VI p, dp;

ll rec(ll n) {
  if (dp[n] != -1)
    return dp[n];
  if (n == 0)
    return 0;

  ll nxt = n % p[n];
  ll ret = rec(nxt) + 1;
  return dp[n] = ret;
}

void Main() {
  cin >> N;
  p.resize(N + 1, 0);
  dp.resize(N + 1, -1);

  REP(i, N) {
    int k = 2 * i;
    if (k <= N)
      p[k] = p[i];
    k = 2 * i + 1;
    if (k <= N)
      p[k] = p[i] + 1;
  }

  cin >> X;
  ll k = 0;
  for (char c : X)
    if (c == '1')
      k++;

  if (k == 1 && X.back() == '1') {
    REP(i, N - 1) { cout << 2 << en; }
    cout << 0 << en;
    return;
  } else if (k == 1 && X.back() == '0') {
    REP(i, N - 1) {
      if (X[i] == '0')
        cout << 1 << en;
      else
        cout << 0 << en;
    }
    cout << 2 << en;
    return;
  } else if (k == 0) {
    REP(i, N) cout << 1 << en;
    return;
  }

  REVERSE(X);
  ll Xmod1 = 0, Xmod2 = 0;
  vector<ll> b1(N + 1, 1), b2(N + 1, 1);
  REP(i, N) b1[i + 1] = (b1[i] * 2) % (k - 1);
  REP(i, N) b2[i + 1] = (b2[i] * 2) % (k + 1);
  REP(i, N) {
    if (X[i] == '1') {
      (Xmod1 += b1[i]) %= (k - 1);
      (Xmod2 += b2[i]) %= (k + 1);
    }
  }

  VL ans(N);
  REVERSE(X);

  REP(i, N) {
    if (X[i] == '1') {
      ll n = Xmod1 - b1[N - 1 - i];
      if (n < 0)
        n += k - 1;
      ans[i] = rec(n) + 1;
    } else {
      ll n = (Xmod2 + b2[N - 1 - i]) % (k + 1);
      ans[i] = rec(n) + 1;
    }
    cout << ans[i] << en;
  }
  return;
}

int main(void) {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(15);
  int t = 1; // cin>>t;
  REP(_, t) Main();
  return 0;
}

Error: WA

Fixed submission:

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

inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T> inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}

typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef tuple<int, int, int> tpl;

#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define EXIST(m, v) (m).find((v)) != (m).end()
#define LB(a, x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a, x) upper_bound((a).begin(), (a).end(), x) - (a).begin()

#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define RREP(i, n) RFOR(i, n, 0)

#define en "\\n"

constexpr double EPS = 1e-9;
constexpr double PI = 3.1415926535897932;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL << 60;
constexpr long long MOD = 1000000007; // 998244353;

#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x)                                                               \\
  cerr << #x << " = " << (x) << " (L" << __LINE__ << ")"                       \\
       << " " << __FILE__ << endl;

template <class T> inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

int N;
string X;
VI p, dp;

ll rec(ll n) {
  if (dp[n] != -1)
    return dp[n];
  if (n == 0)
    return 0;

  ll nxt = n % p[n];
  ll ret = rec(nxt) + 1;
  return dp[n] = ret;
}

void Main() {
  cin >> N;
  N *= 10;
  p.resize(N + 1, 0);
  dp.resize(N + 1, -1);

  REP(i, N) {
    int k = 2 * i;
    if (k <= N)
      p[k] = p[i];
    k = 2 * i + 1;
    if (k <= N)
      p[k] = p[i] + 1;
  }

  cin >> X;
  ll k = 0;
  for (char c : X)
    if (c == '1')
      k++;

  if (k == 1 && X.back() == '1') {
    REP(i, N - 1) { cout << 2 << en; }
    cout << 0 << en;
    return;
  } else if (k == 1 && X.back() == '0') {
    REP(i, N) {
      if (X[i] == '0')
        cout << 1 << en;
      else
        cout << 0 << en;
    }
    return;
  } else if (k == 0) {
    REP(i, N) cout << 1 << en;
    return;
  }

  REVERSE(X);
  ll Xmod1 = 0, Xmod2 = 0;
  vector<ll> b1(N + 1, 1), b2(N + 1, 1);
  REP(i, N) b1[i + 1] = (b1[i] * 2) % (k - 1);
  REP(i, N) b2[i + 1] = (b2[i] * 2) % (k + 1);
  REP(i, N) {
    if (X[i] == '1') {
      (Xmod1 += b1[i]) %= (k - 1);
      (Xmod2 += b2[i]) %= (k + 1);
    }
  }

  VL ans(N);
  REVERSE(X);

  REP(i, N) {
    if (X[i] == '1') {
      ll n = Xmod1 - b1[N - 1 - i];
      if (n < 0)
        n += k - 1;
      ans[i] = rec(n) + 1;
    } else {
      ll n = (Xmod2 + b2[N - 1 - i]) % (k + 1);
      ans[i] = rec(n) + 1;
    }
    cout << ans[i] << en;
  }
  return;
}

int main(void) {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(15);
  int t = 1; // cin>>t;
  REP(_, t) Main();
  return 0;
}