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

// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <immintrin.h>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef DEBUG
#include "./Lib/Timer.hpp"
#include "./Lib/debug_VC.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* macro */
#define FOR(i, b, e) for (ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for (ll i = (ll)(e - 1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x, c) for (const auto &x : (c))
#define REPI2(it, b, e) for (auto it = (b); it != (e); ++it)
#define REPI(it, c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it, c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for (auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(), (x).end()
#define cauto const auto &
/* macro func */
template <class T> inline auto sort(T &t) { std::sort(ALL(t)); }
template <class T> inline auto rsort(T &t) {
  std::sort((t).rbegin(), (t).rend());
}
template <class T> inline auto unique(T &t) {
  (t).erase(unique((t).begin(), (t).end()), (t).end());
}
template <class T, class S> inline auto chmax(T &t, const S &s) {
  if (s > t) {
    t = s;
    return true;
  }
  return false;
}
template <class T, class S> inline auto chmin(T &t, const S &s) {
  if (s < t) {
    t = s;
    return true;
  }
  return false;
}
inline auto BR() { std::cout << "\\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template <class T> using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\\n';
using std::bitset;
using std::cin;
using std::list;
using std::map;
using std::multimap;
using std::multiset;
using std::pair;
using std::priority_queue;
using std::queue;
using std::set;
using std::stack;
using std::string;
using std::unordered_map;
using std::unordered_multimap;
using std::unordered_multiset;
using std::unordered_set;
using std::vector;

/* Initial processing  */
struct Preprocessing {
  Preprocessing() {
    std::cin.tie(0);
    std::ios::sync_with_stdio(0);
  };
} _Preprocessing;

/* Remove the source of the bug */
signed pow(signed, signed) {
  assert(false);
  return -1;
}

/* define hash */
namespace std {
template <> class hash<std::pair<ll, ll>> {
public:
  size_t operator()(const std::pair<ll, ll> &x) const {
    return hash<ll>()(1000000000 * x.first + x.second);
  }
};
} // namespace std

/* input */
template <class T> std::istream &operator>>(std::istream &is, vector<T> &vec) {
  for (T &x : vec)
    is >> x;
  return is;
}

/* constant value */
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;

//=============================================================================================;

class ModCalculator {
  const long long m_mod;
  const std::vector<long long> m_fac;
  const std::vector<long long> m_finv;

  auto constructFac(long long s) {
    std::vector<long long> fac(s);
    fac[0] = fac[1] = 1;
    for (long long i = 2; i < s; ++i) {
      fac[i] = fac[i - 1] * i;
      if (fac[i] > m_mod) {
        fac[i] %= m_mod;
      }
    }
    return fac;
  }
  auto constructInv(long long s) {
    std::vector<long long> finv(s);
    finv[s - 1] = this->pow(m_fac[s - 1], m_mod - 2);
    for (long long i = s - 2; i >= 0; --i) {
      finv[i] = finv[i + 1] * (i + 1);
      if (finv[i] > m_mod) {
        finv[i] %= m_mod;
      }
    }
    return finv;
  }

public:
  ModCalculator(long long mod = MOD, long long size = 3 * 1e6)
      : m_mod(mod), m_fac(constructFac(size)), m_finv(constructInv(size)) {}

  long long pow(long long a, long long b) const {
    long long ans = 1;
    while (b > 0) {
      if (b & 1) {
        ans *= a;
        if (ans > m_mod) {
          ans %= m_mod;
        }
      }
      b >>= 1;
      a *= a;
      if (a > m_mod) {
        a %= m_mod;
      }
    }
    return ans;
  }

  auto C(int n, int r) const {
    long long val = m_fac[n] * m_finv[r];
    if (val > m_mod) {
      val %= m_mod;
    }
    val *= m_finv[n - r];
    ;
    if (val > m_mod) {
      val %= m_mod;
    }
    return val;
  }
};
using bit = bitset<64>;
auto solve_bit(const bit &b) {

  auto mod = [](ll val) { return val % bit(val).count(); };
  ll val = b.to_ullong();
  ll cnt = 0;
  while (val > 0) {
    val = mod(val);
    ++cnt;
  }
  return cnt;
}
auto solve_c(ll n, const string &s) {
  auto b = bit(s);

  VL ans;
  ans.reserve(n);
  RREP(i, n) {
    b[i] = !b[i];
    ans.emplace_back(solve_bit(b));
    b[i] = !b[i];
  }
  return ans;
}

auto solve(ll n, const string &s_) {
  auto s = s_;
  std::reverse(ALL(s));
  ll cnt = 0;
  REPC(c, s) if (c == '1') { ++cnt; }
  ll defm = 0;
  ll defp = 0;

  ll cm = cnt - 1;
  ll cp = cnt + 1;

  {
    ll twm = 1;
    ll twp = 1;
    REPC(c, s) {
      if (c == '1') {
        if (cm > 0) {
          defm += twm;
          if (defm >= cm) {
            defm %= cm;
          }
        }
        defp += twp;
        if (defp >= cp) {
          defp %= cp;
        }
      }
      if (cm > 0) {
        twm *= 2;
        if (twm >= cm) {
          twm %= cm;
        }
      }
      twp *= 2;
      if (twp >= cp) {
        twp %= cp;
      }
    }
  }
  VL ans;
  ans.reserve(n);
  ll twm = 1;
  ll twp = 1;
  REPC(c, s) {
    if (c == '0') {
      ll val = defp + twp;
      if (val >= cp) {
        val %= cp;
      }
      ans.emplace_back(1 + solve_bit(bit(val)));
    } else {
      if (cm == 0) {
        ans.emplace_back(0);
      } else {
        ll val = defm - twm;
        if (val < 0) {
          val += cm;
        }
        ans.emplace_back(1 + solve_bit(bit(val)));
      }
    }

    if (cm > 0) {
      twm *= 2;
      if (twm >= cm) {
        twm %= cm;
      }
    }
    twp *= 2;
    if (twp >= cp) {
      twp %= cp;
    }
  }
  std::reverse(ALL(ans));
  return ans;
}

signed main() {
  ll n;
  cin >> n;
  string s;
  cin >> s;

  auto ans = solve(n, s);
  REPC(x, ans) { cout << x << endl; }
  /*
  auto ans_c = solve_c(n, s);
  REP(i, n) if (ans[i] != ans_c[i]) {
          dump("non");

          REPC(x, ans_c) {
                  cout << x << endl;
          }
          break;
  }
  */
}


Error: 0

Fixed submission:

// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,avx512f")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <immintrin.h>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef DEBUG
#include "./Lib/Timer.hpp"
#include "./Lib/debug_VC.hpp"
#include "./Lib/sample.hpp"
#else
#define dump(...)
#endif

/* macro */
#define FOR(i, b, e) for (ll i = (ll)(b); i < (ll)(e); ++i)
#define RFOR(i, b, e) for (ll i = (ll)(e - 1); i >= (ll)(b); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define REPC(x, c) for (const auto &x : (c))
#define REPI2(it, b, e) for (auto it = (b); it != (e); ++it)
#define REPI(it, c) REPI2(it, (c).begin(), (c).end())
#define RREPI(it, c) REPI2(it, (c).rbegin(), (c).rend())
#define REPI_ERACE2(it, b, e) for (auto it = (b); it != (e);)
#define REPI_ERACE(it, c) REPI_ERACE2(it, (c).begin(), (c).end())
#define ALL(x) (x).begin(), (x).end()
#define cauto const auto &
/* macro func */
template <class T> inline auto sort(T &t) { std::sort(ALL(t)); }
template <class T> inline auto rsort(T &t) {
  std::sort((t).rbegin(), (t).rend());
}
template <class T> inline auto unique(T &t) {
  (t).erase(unique((t).begin(), (t).end()), (t).end());
}
template <class T, class S> inline auto chmax(T &t, const S &s) {
  if (s > t) {
    t = s;
    return true;
  }
  return false;
}
template <class T, class S> inline auto chmin(T &t, const S &s) {
  if (s < t) {
    t = s;
    return true;
  }
  return false;
}
inline auto BR() { std::cout << "\\n"; }

/* type define */
using ll = long long;
using PAIR = std::pair<ll, ll>;
using VS = std::vector<std::string>;
using VL = std::vector<long long>;
using VVL = std::vector<VL>;
using VVVL = std::vector<VVL>;
using VD = std::vector<double>;
template <class T> using V = std::vector<T>;

/* using std */
using std::cout;
constexpr char endl = '\\n';
using std::bitset;
using std::cin;
using std::list;
using std::map;
using std::multimap;
using std::multiset;
using std::pair;
using std::priority_queue;
using std::queue;
using std::set;
using std::stack;
using std::string;
using std::unordered_map;
using std::unordered_multimap;
using std::unordered_multiset;
using std::unordered_set;
using std::vector;

/* Initial processing  */
struct Preprocessing {
  Preprocessing() {
    std::cin.tie(0);
    std::ios::sync_with_stdio(0);
  };
} _Preprocessing;

/* Remove the source of the bug */
signed pow(signed, signed) {
  assert(false);
  return -1;
}

/* define hash */
namespace std {
template <> class hash<std::pair<ll, ll>> {
public:
  size_t operator()(const std::pair<ll, ll> &x) const {
    return hash<ll>()(1000000000 * x.first + x.second);
  }
};
} // namespace std

/* input */
template <class T> std::istream &operator>>(std::istream &is, vector<T> &vec) {
  for (T &x : vec)
    is >> x;
  return is;
}

/* constant value */
constexpr ll MOD = 1000000007;
// constexpr ll MOD = 998244353;

//=============================================================================================;

class ModCalculator {
  const long long m_mod;
  const std::vector<long long> m_fac;
  const std::vector<long long> m_finv;

  auto constructFac(long long s) {
    std::vector<long long> fac(s);
    fac[0] = fac[1] = 1;
    for (long long i = 2; i < s; ++i) {
      fac[i] = fac[i - 1] * i;
      if (fac[i] > m_mod) {
        fac[i] %= m_mod;
      }
    }
    return fac;
  }
  auto constructInv(long long s) {
    std::vector<long long> finv(s);
    finv[s - 1] = this->pow(m_fac[s - 1], m_mod - 2);
    for (long long i = s - 2; i >= 0; --i) {
      finv[i] = finv[i + 1] * (i + 1);
      if (finv[i] > m_mod) {
        finv[i] %= m_mod;
      }
    }
    return finv;
  }

public:
  ModCalculator(long long mod = MOD, long long size = 3 * 1e6)
      : m_mod(mod), m_fac(constructFac(size)), m_finv(constructInv(size)) {}

  long long pow(long long a, long long b) const {
    long long ans = 1;
    while (b > 0) {
      if (b & 1) {
        ans *= a;
        if (ans > m_mod) {
          ans %= m_mod;
        }
      }
      b >>= 1;
      a *= a;
      if (a > m_mod) {
        a %= m_mod;
      }
    }
    return ans;
  }

  auto C(int n, int r) const {
    long long val = m_fac[n] * m_finv[r];
    if (val > m_mod) {
      val %= m_mod;
    }
    val *= m_finv[n - r];
    ;
    if (val > m_mod) {
      val %= m_mod;
    }
    return val;
  }
};
using bit = bitset<64>;
auto solve_bit(const bit &b) {

  auto mod = [](ll val) { return val % bit(val).count(); };
  ll val = b.to_ullong();
  ll cnt = 0;
  while (val > 0) {
    val = mod(val);
    ++cnt;
  }
  return cnt;
}
auto solve_c(ll n, const string &s) {
  auto b = bit(s);

  VL ans;
  ans.reserve(n);
  RREP(i, n) {
    b[i] = !b[i];
    ans.emplace_back(solve_bit(b));
    b[i] = !b[i];
  }
  return ans;
}

auto solve(ll n, const string &s_) {
  auto s = s_;
  std::reverse(ALL(s));
  ll cnt = 0;
  REPC(c, s) if (c == '1') { ++cnt; }
  ll defm = 0;
  ll defp = 0;

  ll cm = cnt - 1;
  ll cp = cnt + 1;

  {
    ll twm = 1;
    ll twp = 1;
    REPC(c, s) {
      if (c == '1') {
        defm += twm;
        if (defm >= cm) {
          defm %= cm;
        }

        defp += twp;
        if (defp >= cp) {
          defp %= cp;
        }
      }
      twm *= 2;
      if (twm >= cm) {
        twm %= cm;
      }
      twp *= 2;
      if (twp >= cp) {
        twp %= cp;
      }
    }
  }
  VL ans;
  ans.reserve(n);
  ll twm = 1;
  ll twp = 1;
  REPC(c, s) {
    if (c == '0') {
      ll val = defp + twp;
      if (val >= cp) {
        val %= cp;
      }
      ans.emplace_back(1 + solve_bit(bit(val)));
    } else {
      ll val = defm - twm;
      if (val < 0) {
        val += cm;
      }
      ans.emplace_back(1 + solve_bit(bit(val)));
    }

    twm *= 2;
    if (twm >= cm) {
      twm %= cm;
    }
    twp *= 2;
    if (twp >= cp) {
      twp %= cp;
    }
  }
  std::reverse(ALL(ans));
  return ans;
}

signed main() {
  ll n;
  cin >> n;
  string s;
  cin >> s;

  auto ans = solve(n, s);
  REPC(x, ans) { cout << x << endl; }
  /*
  auto ans_c = solve_c(n, s);
  REP(i, n) if (ans[i] != ans_c[i]) {
          dump("non");

          REPC(x, ans_c) {
                  cout << x << endl;
          }
          break;
  }
  */
}