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

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

using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end)                                                     \\
  for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end)                                                    \\
  for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif

int main() {
  lint n;
  cin >> n;
  string x;
  cin >> x;
  lint cnt = 0;
  REP(i, n) { cnt += (x[i] == '1'); }
  int v = (x[n - 1] == '1');
  lint ans, tmp;
  vector<lint> l(n + 1), r(n + 1);
  lint ll = cnt - 1, rr = cnt + 1;
  int lll = 0, rrr = 0;
  if (ll == 0) {
    ll++;
    lll = 1;
  }
  l[1] = v % (ll);
  r[1] = v % (rr);
  vector<lint> addl(n + 1), addr(n + 1);
  addl[1] = 1 % ll;
  addr[1] = 1 % rr;
  FOR(i, 1, n) {
    addl[i + 1] = (addl[i] * 2) % ll;
    addr[i + 1] = (addr[i] * 2) % rr;
    if (x[n - i - 1] == '0') {
      l[i + 1] = l[i];
      r[i + 1] = r[i];
    } else {
      if (lll == 1) {
        l[i + 1] = 0;
      } else {
        l[i + 1] = (l[i] + addl[i + 1]) % ll;
      }
      r[i + 1] = (r[i] + addr[i + 1]) % rr;
    }
  }
  /*
  FOR(i,1,n+1){
      cout << l[i] << " ";
  }
  cout << "\\n";
  FOR(i, 1, n + 1)
  {
      cout << r[i] << " ";
  }
  cout << "\\n";
  */
  vector<lint> f(n + 1), g(n + 1);
  FOR(i, 1, n + 1) {
    lint k = i;
    lint bi = __builtin_popcountl(k);
    // cout << bi << " ";
    lint tmp = (k % bi);
    if (tmp == 0) {
      g[i] = 1;
    } else {
      g[i] = g[tmp] + 1;
    }
  }
  /*
  REP(i,n+1){
      cout << g[i] << " ";
  }
  cout  << "\\n";
  */
  IFOR(i, 1, n + 1) {
    lint z;
    if (lll == 1 && x[n - i] == '1') {
      cout << 0 << "\\n";
      continue;
    }
    if (x[n - i] == '0') {
      z = (r[n] + rr + addr[i]) % rr;
    } else {
      z = (l[n] + ll - addl[i]) % ll;
    }
    // cout << z << "\\n";
    cout << g[z] + 1 << "\\n";
  }
  return 0;
}

Error: 0

Fixed submission:

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

using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end)                                                     \\
  for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end)                                                    \\
  for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif

int main() {
  lint n;
  cin >> n;
  string x;
  cin >> x;
  lint cnt = 0;
  REP(i, n) { cnt += (x[i] == '1'); }
  int v = (x[n - 1] == '1');
  lint ans, tmp;
  vector<lint> l(n + 1), r(n + 1);
  l[1] = v % (cnt - 1);
  r[1] = v % (cnt + 1);
  lint ll = cnt - 1, rr = cnt + 1;
  vector<lint> addl(n + 1), addr(n + 1);
  addl[1] = 1 % ll;
  addr[1] = 1 % rr;
  FOR(i, 1, n) {
    addl[i + 1] = (addl[i] * 2) % ll;
    addr[i + 1] = (addr[i] * 2) % rr;
    if (x[n - i - 1] == '0') {
      l[i + 1] = l[i];
      r[i + 1] = r[i];
    } else {
      l[i + 1] = (l[i] + addl[i + 1]) % ll;
      r[i + 1] = (r[i] + addr[i + 1]) % rr;
    }
  }
  vector<lint> f(n + 1), g(n + 1);
  FOR(i, 1, n + 1) {
    lint k = i;
    lint bi = __builtin_popcountl(k);
    // cout << bi << " ";
    lint tmp = (k % bi);
    if (tmp == 0) {
      g[i] = 1;
    } else {
      g[i] = g[tmp] + 1;
    }
  }
  IFOR(i, 1, n + 1) {
    lint z;
    if (x[n - i] == '0') {
      z = (r[n - 1] + rr + addr[i]) % rr;
    } else {
      z = (l[n - 1] + ll - addl[i]) % ll;
    }
    // cout << z << "\\n";
    cout << g[z] + 1 << "\\n";
  }
  return 0;
}