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

// clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define fore(x, c) for(auto &&x : c)
#define rep(i, a, n) for(int i = a, i##len = (int)(n); i < i##len; ++i)
#define rrep(i, a, n) for(int i = (int)(n - 1); i >= a; --i)
#define sz(c) ((int)c.size())
#define contains(c, x) (c.find(x) != end(c))
#define inseg(l, x, r) ((l) <= (x) && (x) < (r))
#define dump(...)
#define pb push_back
#define eb emplace_back
#define _ 0
const signed INF_ = 1001001001; const long long INF = 1001001001001001001LL;
const int DX[9] = {0,1,0,-1,1,1,-1,-1,0}, DY[9] = {-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os, const vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++) os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is, vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
  is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a, const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a, const U &b){return a>b?a=b,1:0;}
template <class T> void psum(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap = priority_queue<T, deque<T>, greater<T>>;
struct before_main_function {
  before_main_function() {
      cin.tie(nullptr); ios::sync_with_stdio(false);
      cout << setprecision(15) << fixed;
  }
} before_main_function;
// clang-format on
//------------------8<------------------------------------8<--------------------

int f(int X) {
  if (X == 0)
    return 0;
  int pc = __builtin_popcount(X);
  return f(X % pc) + 1;
}
signed main() {
  int N;
  cin >> N;
  string X;
  cin >> X;

  int pc = 0;
  rep(i, 0, N) {
    if (X[i] == '1')
      pc++;
  }

  auto f_first = [&](int pc) {
    int t = 0;
    int p = 1;
    rrep(i, 0, N) {
      if (X[i] == '1') {
        t = (t + p) % pc;
      }
      p = p * 2 % pc;
    }
    return t;
  };

  int pc_x = pc - 1;
  int f_x = -1;
  if (pc_x > 0)
    f_x = f_first(pc_x);

  int pc_z = pc + 1;
  int f_z = -1;
  if (pc_z > 0)
    f_z = f_first(pc_z);

  int p_x = 1, p_z = 1;
  vi ans(N);
  rrep(i, 0, N) {
    if (X[i] == '0') {
      if (pc_z == 0) {
        ans[i] = 0;
      } else {
        int t = (f_z + p_z + pc_z) % pc_z;
        ans[i] = f(t) + 1;
      }
    } else {
      if (pc_x == 0) {
        ans[i] = 0;
      } else {
        int t = (f_x - p_x + pc_x) % pc_x;
        ans[i] = f(t) + 1;
      }
    }

    if (pc_x > 0)
      p_x = p_x * 2 % pc_x;
    if (pc_z > 0)
      p_z = p_z * 2 % pc_z;
  }
  for (int x : ans)
    cout << x << endl;
  return (0 ^ _ ^ 0);
}


Error: 0

Fixed submission:

// clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define fore(x, c) for(auto &&x : c)
#define rep(i, a, n) for(int i = a, i##len = (int)(n); i < i##len; ++i)
#define rrep(i, a, n) for(int i = (int)(n - 1); i >= a; --i)
#define sz(c) ((int)c.size())
#define contains(c, x) (c.find(x) != end(c))
#define inseg(l, x, r) ((l) <= (x) && (x) < (r))
#define dump(...)
#define pb push_back
#define eb emplace_back
#define _ 0
const signed INF_ = 1001001001; const long long INF = 1001001001001001001LL;
const int DX[9] = {0,1,0,-1,1,1,-1,-1,0}, DY[9] = {-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os, const vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++) os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is, vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
  is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a, const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a, const U &b){return a>b?a=b,1:0;}
template <class T> void psum(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap = priority_queue<T, deque<T>, greater<T>>;
struct before_main_function {
  before_main_function() {
      cin.tie(nullptr); ios::sync_with_stdio(false);
      cout << setprecision(15) << fixed;
  }
} before_main_function;
// clang-format on
//------------------8<------------------------------------8<--------------------

int f(int X) {
  if (X == 0)
    return 0;
  int pc = __builtin_popcount(X);
  return f(X % pc) + 1;
}
signed main() {
  int N;
  cin >> N;
  string X;
  cin >> X;

  int pc = 0;
  rep(i, 0, N) {
    if (X[i] == '1')
      pc++;
  }

  auto f_first = [&](int pc) {
    int t = 0;
    int p = 1;
    rrep(i, 0, N) {
      if (X[i] == '1') {
        t += p;
        t %= pc;
      }
      p = p * 2 % pc;
    }
    return t;
  };

  int pc_x = pc - 1;
  int f_x = -1;
  if (pc_x > 0)
    f_x = f_first(pc_x);

  int pc_z = pc + 1;
  int f_z = -1;
  if (pc_z > 0)
    f_z = f_first(pc_z);

  int p_x = 1, p_z = 1;
  vi ans(N);
  rrep(i, 0, N) {
    int t;
    if (X[i] == '0') {
      t = (f_z + p_z + pc_z) % pc_z;
    } else {
      t = (f_x - p_x + pc_x) % pc_x;
    }
    ans[i] = f(t) + 1;

    if (pc_x > 0)
      p_x = p_x * 2 % pc_x;
    if (pc_z > 0)
      p_z = p_z * 2 % pc_z;
  }
  for (int x : ans)
    cout << x << endl;
  return (0 ^ _ ^ 0);
}