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

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

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  ll N;
  cin >> N;
  string X;
  cin >> X;

  vector<ll> f(N + 10, 0);
  f[0] = 0;
  f[1] = 1;
  f[2] = 1;
  for (ll i = 3; i <= N; i++) {
    ll temp = i;
    ll p = 0;
    for (ll j = 0; j < N; j++) {
      p += (temp % 2);
      temp /= 2;
      if (temp == 0)
        break;
    }
    f[i] = f[(i % p)] + 1;
  }

  ll cnt = 0;
  for (ll i = 0; i < N; i++) {
    ll d = (X[i] - '0');
    cnt += d;
  }

  vector<vector<ll>> r_x(N + 10, vector<ll>(3, 0)); // 0 1 2
  vector<vector<ll>> r_2(N + 10, vector<ll>(3, 0));

  r_2[0][0] = 1;
  r_2[0][1] = 1;
  r_2[0][2] = 1;

  for (ll i = 1; i < N; i++) {
    r_2[i][2] = (r_2[i - 1][2] * 2) % (cnt + 1);
    if (cnt > 1) {
      r_2[i][0] = (r_2[i - 1][0] * 2) % (cnt - 1);
    }
  }

  ll d = X[N - 1] - '0';

  if (cnt <= 1) {
    r_x[0][0] = 0;
    r_x[0][2] = d;
  } else {
    r_x[0][0] = d % (cnt - 1);
    r_x[0][2] = d % (cnt + 1);
  }
  for (ll i = 1; i < N; i++) {
    d = X[N - 1 - i] - '0';
    r_x[i][2] = (r_x[i - 1][2] + d * r_2[i][2]) % (cnt + 1);
    if (cnt > 1) {
      r_x[i][0] = (r_x[i - 1][0] + d * r_2[i][0]) % (cnt - 1);
    }
  }

  for (ll i = 0; i < N; i++) {
    d = X[i] - '0';
    if (d == 1) {
      if (cnt == 1) {
        cout << 0 << '\\n';
      } else {
        ll cnt_temp = cnt - 1;
        ll r = (r_x[N - 1][0] - r_2[N - 1 - i][0] + cnt_temp) % cnt_temp;
        cout << (f[r % cnt_temp] + 1) << '\\n';
      }
    } else {
      ll cnt_temp = cnt + 1;
      ll r = (r_x[N - 1][2] + r_2[N - 1 - i][2] + cnt_temp) % cnt_temp;
      cout << (f[r % cnt_temp] + 1) << '\\n';
    }
  }
  return 0;
}

Error: 0

Fixed submission:

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

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);

  ll N;
  cin >> N;
  string X;
  cin >> X;

  vector<ll> f(N + 10, 0);
  f[0] = 0;
  f[1] = 1;
  f[2] = 1;
  for (ll i = 3; i <= N; i++) {
    ll temp = i;
    ll p = 0;
    for (ll j = 0; j < N; j++) {
      p += (temp % 2);
      temp /= 2;
      if (temp == 0)
        break;
    }
    f[i] = f[(i % p)] + 1;
  }

  ll cnt = 0;
  for (ll i = 0; i < N; i++) {
    ll d = (X[i] - '0');
    cnt += d;
  }

  vector<vector<ll>> r_x(N + 10, vector<ll>(3, 0)); // 0 1 2
  vector<vector<ll>> r_2(N + 10, vector<ll>(3, 0));

  r_2[0][0] = 1;
  r_2[0][1] = 1;
  r_2[0][2] = 1;

  for (ll i = 1; i < N; i++) {
    r_2[i][1] = (r_2[i - 1][1] * 2) % (cnt + 0);
    r_2[i][2] = (r_2[i - 1][2] * 2) % (cnt + 1);
    if (cnt > 1) {
      r_2[i][0] = (r_2[i - 1][0] * 2) % (cnt - 1);
    }
  }

  ll d = X[N - 1] - '0';

  if (cnt == 1) {
    r_x[0][0] = 0;
    r_x[0][1] = 0;
    r_x[0][2] = d;
  } else {
    r_x[0][0] = d % (cnt - 1);
    r_x[0][1] = d % (cnt + 0);
    r_x[0][2] = d % (cnt + 1);
  }
  for (ll i = 1; i < N; i++) {
    d = X[N - 1 - i] - '0';
    r_x[i][1] = (r_x[i - 1][1] + d * r_2[i][1]) % (cnt + 0);
    r_x[i][2] = (r_x[i - 1][2] + d * r_2[i][2]) % (cnt + 1);
    if (cnt > 1) {
      r_x[i][0] = (r_x[i - 1][0] + d * r_2[i][0]) % (cnt - 1);
    }
  }

  for (ll i = 0; i < N; i++) {
    d = X[i] - '0';
    if (d == 1) {
      if (cnt == 1) {
        cout << 0 << '\\n';
      } else {
        ll cnt_temp = cnt - 1;
        ll r = (r_x[N - 1][0] - r_2[N - 1 - i][0] + cnt_temp) % cnt_temp;
        cout << (f[r % cnt_temp] + 1) << '\\n';
      }
    } else {
      ll cnt_temp = cnt + 1;
      ll r = (r_x[N - 1][2] + r_2[N - 1 - i][2] + cnt_temp) % cnt_temp;
      cout << (f[r % cnt_temp] + 1) << '\\n';
    }
  }
  return 0;
}