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

#ifdef LOCAL
// #define _GLIBCXX_DEBUG
#endif
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<char>> VVc;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;

#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i >= (b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 1e18 + 18;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define Each(a, b) for (auto &a : b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp)                                                             \\
  cerr << #mp << ":" << endl;                                                  \\
  for (auto i = mp.begin(); i != mp.end(); ++i) {                              \\
    cerr << i->first << ":" << i->second << endl;                              \\
  }
#define dbgset(st)                                                             \\
  cerr << #st << ":" << endl;                                                  \\
  for (auto i = st.begin(); i != st.end(); ++i) {                              \\
    cerr << *i << " ";                                                         \\
  }                                                                            \\
  cerr << endl;
#define dbgarr(n, m, arr)                                                      \\
  rep(i, n) {                                                                  \\
    rep(j, m) { cerr << arr[i][j] << " "; }                                    \\
    cerr << endl;                                                              \\
  }
#define dbgdp(n, arr)                                                          \\
  rep(i, n) { cerr << arr[i] << " "; }                                         \\
  cerr << endl;
#else
#define dbg(...)
#define dbgmap(...)
#define dbgset(...)
#define dbgarr(...)
#define dbgdp(...)
#endif
#define out(a) cout << a << endl
#define out2(a, b) cout << a << " " << b << endl
#define vout(v)                                                                \\
  rep(i, v.size()) { cout << v[i] << " "; }                                    \\
  cout << endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second

template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
  return s << "(" << p.first << ", " << p.second << ")";
}

template <typename T> istream &operator>>(istream &i, vector<T> &v) {
  rep(j, v.size()) i >> v[j];
  return i;
}

// vector
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
  int len = v.size();
  for (int i = 0; i < len; ++i) {
    s << v[i];
    if (i < len - 1)
      s << "	";
  }
  return s;
}

// 2 dimentional vector
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
  int len = vv.size();
  for (int i = 0; i < len; ++i) {
    s << vv[i] << endl;
  }
  return s;
}

ll pow_mod(ll n, ll k, ll m) {
  if (k == 0) {
    return 1;
  } else if (k % 2 == 1) {
    return pow_mod(n, k - 1, m) * n % m;
  } else {
    ll t = pow_mod(n, k / 2, m);
    return t * t % m;
  }
}

int solve() {
  ll n;
  cin >> n;
  string x;
  cin >> x;
  ll cnt = 0;
  rep(i, n) {
    if (x[i] == '1') {
      cnt++;
    }
  }
  dbg(x);
  ll plus = cnt + 1;
  ll minus = cnt - 1;
  // minusが0になる場合忘れずに！！！
  Vec c = {minus, plus};
  Vec v(2);

  rep(i, n) {
    if (x[i] == '0')
      continue;
    rep(j, 2) {
      if (c[j] == 0)
        continue;
      v[j] += pow_mod(2, n - 1 - i, c[j]);
      v[j] %= c[j];
    }
    dbg(v);
  }
  dbg(c);
  dbg(v);

  auto simulate = [](ll n) {
    ll res = 0;
    while (__builtin_popcount(n) > 0) {
      ll k = __builtin_popcount(n);
      n = n % k;
      res++;
    }
    return res;
  };

  rep(i, n) {
    if (x[i] == '0') {
      // 1にする c[1]を使う
      ll tmp = v[1];
      tmp += pow_mod(2, n - 1 - i, c[1]);
      tmp %= c[1];
      dbg(tmp);
      out(simulate(tmp) + 1);
    } else {
      // 0にする c[0]を使う
      if (c[0] == 0) {
        out(0);
        continue;
      }
      ll tmp = v[0];
      tmp -= pow_mod(2, n - 1 - i, c[0]);
      tmp += c[0];
      tmp %= c[0];
      dbg(tmp);
      out(simulate(tmp) + 1);
    }
  }
  return 0;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << std::setprecision(10);
  solve();
}


Error: 0

Fixed submission:

#ifdef LOCAL
// #define _GLIBCXX_DEBUG
#endif
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
typedef vector<vector<char>> VVc;
typedef vector<vector<vector<ll>>> VVV;
typedef vector<vector<vector<vector<ll>>>> VVVV;

#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define PER(i, a, b) for (ll i = (a); i >= (b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 1e18 + 18;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define Each(a, b) for (auto &a : b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#ifdef LOCAL
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp)                                                             \\
  cerr << #mp << ":" << endl;                                                  \\
  for (auto i = mp.begin(); i != mp.end(); ++i) {                              \\
    cerr << i->first << ":" << i->second << endl;                              \\
  }
#define dbgset(st)                                                             \\
  cerr << #st << ":" << endl;                                                  \\
  for (auto i = st.begin(); i != st.end(); ++i) {                              \\
    cerr << *i << " ";                                                         \\
  }                                                                            \\
  cerr << endl;
#define dbgarr(n, m, arr)                                                      \\
  rep(i, n) {                                                                  \\
    rep(j, m) { cerr << arr[i][j] << " "; }                                    \\
    cerr << endl;                                                              \\
  }
#define dbgdp(n, arr)                                                          \\
  rep(i, n) { cerr << arr[i] << " "; }                                         \\
  cerr << endl;
#else
#define dbg(...)
#define dbgmap(...)
#define dbgset(...)
#define dbgarr(...)
#define dbgdp(...)
#endif
#define out(a) cout << a << endl
#define out2(a, b) cout << a << " " << b << endl
#define vout(v)                                                                \\
  rep(i, v.size()) { cout << v[i] << " "; }                                    \\
  cout << endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second

template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
  return s << "(" << p.first << ", " << p.second << ")";
}

template <typename T> istream &operator>>(istream &i, vector<T> &v) {
  rep(j, v.size()) i >> v[j];
  return i;
}

// vector
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
  int len = v.size();
  for (int i = 0; i < len; ++i) {
    s << v[i];
    if (i < len - 1)
      s << "	";
  }
  return s;
}

// 2 dimentional vector
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
  int len = vv.size();
  for (int i = 0; i < len; ++i) {
    s << vv[i] << endl;
  }
  return s;
}

ll pow_mod(ll n, ll k, ll m) {
  if (k == 0) {
    return 1;
  } else if (k % 2 == 1) {
    return pow_mod(n, k - 1, m) * n % m;
  } else {
    ll t = pow_mod(n, k / 2, m);
    return t * t % m;
  }
}

int solve() {
  ll n;
  cin >> n;
  string x;
  cin >> x;
  ll cnt = 0;
  rep(i, n) {
    if (x[i] == '1') {
      cnt++;
    }
  }
  ll plus = cnt + 1;
  ll minus = cnt - 1;
  // minusが0になる場合忘れずに！！！
  Vec c = {minus, plus};
  Vec v(2);

  rep(i, n) {
    if (x[i] == '0')
      continue;
    rep(j, 2) {
      v[j] += pow_mod(2, n - 1 - i, c[j]);
      v[j] %= c[j];
    }
    dbg(v);
  }
  dbg(c);
  dbg(v);

  auto simulate = [](ll n) {
    ll res = 0;
    while (__builtin_popcount(n) > 0) {
      ll k = __builtin_popcount(n);
      n = n % k;
      res++;
    }
    return res;
  };

  rep(i, n) {
    if (x[i] == '0') {
      // 1にする c[1]を使う
      ll tmp = v[1];
      tmp += pow_mod(2, n - 1 - i, c[1]);
      tmp %= c[1];
      dbg(tmp);
      out(simulate(tmp) + 1);
    } else {
      // 0にする c[0]を使う
      if (c[0] == 0) {
        out(0);
        continue;
      }
      ll tmp = v[0];
      tmp -= pow_mod(2, n - 1 - i, c[0]);
      tmp += c[0];
      tmp %= c[0];
      dbg(tmp);
      out(simulate(tmp) + 1);
    }
  }
  return 0;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << std::setprecision(10);
  solve();
}