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

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

#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second

using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;

const double eps = 1e-10;

template <typename A, typename B> inline void chmin(A &a, B b) {
  if (a > b)
    a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
  if (a < b)
    a = b;
}

template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }

template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
  u = U(v...);
}

template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
  for (auto &e : u)
    fill_v<T>(e, v...);
}

int main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int64 N;
  string X;
  cin >> N >> X;

  int64 cnt = 0;
  REP(i, X.size()) cnt += X[i] == '1';
  if (cnt == 0) {
    REP(i, N) { cout << 1 << endl; }
    return 0;
  } else if (cnt == 1) {
    REP(i, N) {
      if (X[i] == '1') {
        cout << 0 << endl;
      } else {
        cout << ((i == N - 1) ? 2 : 1) << endl;
      }
    }
    return 0;
  }

  vector<int64> l(N, 0), l0(N + 1, 0);
  // l1はそのbitが1のときのそのbitの寄与 l0は逆
  int64 now[3] = {1 % (cnt - 1), 1, 1};
  REP(i, N) {
    if (X[N - i - 1] == '1') {
      l[N - i - 1] = now[0];
      l0[i] = now[0];
    } else {
      l[N - i - 1] = now[2];
      l0[i] = now[1];
    }
    REP(j, 3) { now[j] = now[j] * 2 % (cnt + j - 1); }
  }
  int64 def[3] = {0, 0, 0};
  REP(i, N) {
    REP(j, 3) { def[j] = (def[j] * 2 + (X[i] - '0')) % (cnt + j - 1); }
  }
  REP(i, N) {
    int64 num = 0;
    if (X[i] == '0') {
      num = (def[2] + l[i]) % (cnt + 1);
    } else {
      num = ((def[0] - l[i]) % (cnt - 1) + (cnt - 1)) % (cnt - 1);
    }
    int res = 1;
    while (num != 0) {
      num %= __builtin_popcountll(num);
      res++;
    }
    cout << res << endl;
  }
}


Error: 0

Fixed submission:

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

#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second

using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;

const double eps = 1e-10;

template <typename A, typename B> inline void chmin(A &a, B b) {
  if (a > b)
    a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
  if (a < b)
    a = b;
}

template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }

template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
  u = U(v...);
}

template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
  for (auto &e : u)
    fill_v<T>(e, v...);
}

int main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int64 N;
  string X;
  cin >> N >> X;

  int64 cnt = 0;
  REP(i, X.size()) cnt += X[i] == '1';
  if (cnt == 0) {
    assert(0);
    REP(i, N) { cout << 1 << endl; }
    return 0;
  } else if (cnt == 1) {
    assert(0);
    REP(i, N) {
      if (X[i] == '1') {
        cout << 0 << endl;
      } else {
        cout << 1 << endl;
      }
    }
    return 0;
  }

  vector<int64> l(N, 0), l0(N + 1, 0);
  // l1はそのbitが1のときのそのbitの寄与 l0は逆
  int64 now[3] = {1 % (cnt - 1), 1, 1};
  REP(i, N) {
    if (X[N - i - 1] == '1') {
      l[N - i - 1] = now[0];
      l0[i] = now[0];
    } else {
      l[N - i - 1] = now[2];
      l0[i] = now[1];
    }
    REP(j, 3) { now[j] = now[j] * 2 % (cnt + j - 1); }
  }
  int64 def[3] = {0, 0, 0};
  REP(i, N) {
    REP(j, 3) { def[j] = (def[j] * 2 + (X[i] - '0')) % (cnt + j - 1); }
  }
  REP(i, N) {
    int64 num = 0;
    if (X[i] == '0') {
      num = (def[2] + l[i]) % (cnt + 1);
    } else {
      num = ((def[0] - l[i]) % (cnt - 1) + (cnt - 1)) % (cnt - 1);
    }
    int res = 1;
    while (num != 0) {
      num %= __builtin_popcountll(num);
      res++;
    }
    cout << res << endl;
  }
}