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

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using VPII = std::vector<std::pair<int, int>>;
using PLL = std::pair<ll, ll>;
using VPLL = std::vector<std::pair<ll, ll>>;
using TI3 = std::tuple<int, int, int>;
using TI4 = std::tuple<int, int, int, int>;
using TL3 = std::tuple<ll, ll, ll>;
using TL4 = std::tuple<ll, ll, ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()
#define allpt_cr(v) (v).crbegin(), (v).crend()

const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const int mod = mod1;
const ll inf = 1e18;

const string wsp = " ";
const string tb = "\\t";
const string rt = "\\n";

template <typename T> void show1dvec(const vector<T> &v) {
  if (v.size() == 0)
    return;
  int n = v.size() - 1;
  rep(i, n) cout << v[i] << wsp;
  cout << v[n] << rt;

  return;
}

template <typename T> void show2dvec(const vector<vector<T>> &v) {
  int n = v.size();
  rep(i, n) show1dvec(v[i]);
}

template <typename T, typename S> void show1dpair(const vector<pair<T, S>> &v) {
  int n = v.size();
  rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
  return;
}

template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s) {
  int n = v.size();
  rep(i, n) {
    t.push_back(v[i].first);
    s.push_back(v[i].second);
  }
  return;
}

template <typename T> void maxvec(vector<T> &v) {
  T s = v[0];
  int n = v.size();
  rep(i, n - 1) {
    if (s > v[i + 1]) {
      v[i + 1] = s;
    }
    s = v[i + 1];
  }
}

template <typename T, typename S> bool myfind(T t, S s) {
  return find(t.cbegin(), t.cend(), s) != t.cend();
}

bool check(int y, int x, int h, int w) {
  return 0 <= y && y < h && 0 <= x && x < w;
}

template <typename T> vector<T> cumsum(const vector<T> &v) {
  T s = 0;
  vector<T> ret;

  rep(i, v.size()) {
    s += v[i];
    s %= mod;
    ret.emplace_back(s);
  }
  return ret;
}

bool iskadomatsu(int a, int b, int c) {
  return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c));
}

VS split(string s, char c) {
  VS ret;
  string part;
  s += c;
  rep(i, s.length()) {
    if (s[i] == c) {
      ret.emplace_back(part);
      part = "";
    } else if (s[i] != c) {
      part += s[i];
    }
  }
  return ret;
}

string removezero(string &s) {
  string ret;
  for (auto z : s)
    if (z != '0')
      ret += z;
  return ret;
}

ll sumdigit(ll x) {
  ll ans{0};
  while (x > 0) {
    ans += x % 10;
    x /= 10;
  }
  return ans;
}

template <typename T, typename S, typename R>
ll pow_mod(T p, S q, R mod = 1ll) {
  ll ret = 1, r = p;
  while (q) {
    if (q % 2)
      ret *= r, ret %= mod;
    r = (r * r) % mod, q /= 2;
  }
  return ret % mod;
}

template <typename T, typename S> ll pow_no_mod(T p, S q) {
  ll ret = 1, r = p;
  while (q) {
    if (q % 2)
      ret *= r;
    r = (r * r), q /= 2;
  }
  return ret;
}

void make_frac_tables(VL &frac_list, VL &frac_inv_list) {
  rep(i, frac_list.size() - 1) {
    frac_list[i + 1] *= frac_list[i] * (i + 1);
    frac_list[i + 1] %= mod;
    frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);
    frac_inv_list[i + 1] %= mod;
  }
}

ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list) {
  if (a < b)
    return 0;
  if (b < 0)
    return 0;
  ll ret = frac_list[a];
  ret *= frac_inv_list[b];
  ret %= mod;
  ret *= frac_inv_list[a - b];
  ret %= mod;
  return ret;
}

void shave(vector<int> &v, int n) {
  if (n <= 1)
    return;
  VB w(n + 1, true);
  int x;
  w[0] = w[1] = false;
  rep2(i, 2, n + 1) {
    if (w[i]) {
      x = i * 2;
      while (x <= n) {
        w[x] = false;
        x += i;
      }
    }
  }
  rep(i, n + 1) {
    if (w[i]) {
      v.emplace_back(i);
    }
  }
}

void solve(ll x, ll y) {
  int counter = 1, p, q;
  while (true) {
    // cout << x << wsp << y << rt;
    if (x % y == 0) {
      cout << counter << rt;
      return;
    } else {
      x %= y;
      p = 0, q = x;
      while (q > 0) {
        if (q % 2) {
          p++;
        }
        q /= 2;
      }
      y = p;
      counter++;
    }
  }
}

int main() {

  cin.tie(0);
  ios::sync_with_stdio(false);

#ifdef DEBUG
  cout << "DEBUG MODE" << endl;
  ifstream in("input.txt"); // for debug
  cin.rdbuf(in.rdbuf());    // for debug
#endif

  int n, pops, popsless, popsmore;
  ll moretotal{0}, lesstotal{0}, morepart, lesspart;
  string s;
  cin >> n >> s;
  pops = count(allpt_c(s), '1');
  popsless = pops - 1;
  popsmore = pops + 1;
  // cout << popsless << wsp << popsmore << rt;
  VI morelist(n), lesslist(n);
  morelist[0] = 1 % popsmore;
  if (popsless != 0) {
    lesslist[0] = 1 % popsless;
  } else {
    lesslist[0] = 0;
  }
  rep(i, n - 1) { morelist[i + 1] = (morelist[i] * 2) % popsmore; }
  rep(i, n - 1) {
    if (popsless != 0) {
      lesslist[i + 1] = (lesslist[i] * 2) % popsless;
    } else {
      lesslist[i + 1] = 0;
    }
  }

  reverse(allpt(morelist));
  reverse(allpt(lesslist));

  // show1dvec(morelist);
  // show1dvec(lesslist);

  rep(i, n) {
    if (s[i] == '1') {
      moretotal += morelist[i];
      lesstotal += lesslist[i];
    }
  }

  // cout << moretotal << wsp << lesstotal << rt;

  rep(i, n) {
    if (s[i] == '0') {
      morepart = moretotal + morelist[i];
      // cout << morepart << rt;
      solve(morepart, popsmore);
    }
    if (s[i] == '1' && popsless != 0) {
      lesspart = lesstotal - lesslist[i];
      // cout << lesspart << rt;
      solve(lesspart, popsless);
    }
    if (s[i] == '1' && popsless == 0) {
      cout << 0 << rt;
    }
  }

  return 0;
}


Error: 0

Fixed submission:

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using VPII = std::vector<std::pair<int, int>>;
using PLL = std::pair<ll, ll>;
using VPLL = std::vector<std::pair<ll, ll>>;
using TI3 = std::tuple<int, int, int>;
using TI4 = std::tuple<int, int, int, int>;
using TL3 = std::tuple<ll, ll, ll>;
using TL4 = std::tuple<ll, ll, ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()
#define allpt_cr(v) (v).crbegin(), (v).crend()

const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const int mod = mod1;
const ll inf = 1e18;

const string wsp = " ";
const string tb = "\\t";
const string rt = "\\n";

template <typename T> void show1dvec(const vector<T> &v) {
  if (v.size() == 0)
    return;
  int n = v.size() - 1;
  rep(i, n) cout << v[i] << wsp;
  cout << v[n] << rt;

  return;
}

template <typename T> void show2dvec(const vector<vector<T>> &v) {
  int n = v.size();
  rep(i, n) show1dvec(v[i]);
}

template <typename T, typename S> void show1dpair(const vector<pair<T, S>> &v) {
  int n = v.size();
  rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
  return;
}

template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s) {
  int n = v.size();
  rep(i, n) {
    t.push_back(v[i].first);
    s.push_back(v[i].second);
  }
  return;
}

template <typename T> void maxvec(vector<T> &v) {
  T s = v[0];
  int n = v.size();
  rep(i, n - 1) {
    if (s > v[i + 1]) {
      v[i + 1] = s;
    }
    s = v[i + 1];
  }
}

template <typename T, typename S> bool myfind(T t, S s) {
  return find(t.cbegin(), t.cend(), s) != t.cend();
}

bool check(int y, int x, int h, int w) {
  return 0 <= y && y < h && 0 <= x && x < w;
}

template <typename T> vector<T> cumsum(const vector<T> &v) {
  T s = 0;
  vector<T> ret;

  rep(i, v.size()) {
    s += v[i];
    s %= mod;
    ret.emplace_back(s);
  }
  return ret;
}

bool iskadomatsu(int a, int b, int c) {
  return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c));
}

VS split(string s, char c) {
  VS ret;
  string part;
  s += c;
  rep(i, s.length()) {
    if (s[i] == c) {
      ret.emplace_back(part);
      part = "";
    } else if (s[i] != c) {
      part += s[i];
    }
  }
  return ret;
}

string removezero(string &s) {
  string ret;
  for (auto z : s)
    if (z != '0')
      ret += z;
  return ret;
}

ll sumdigit(ll x) {
  ll ans{0};
  while (x > 0) {
    ans += x % 10;
    x /= 10;
  }
  return ans;
}

template <typename T, typename S, typename R>
ll pow_mod(T p, S q, R mod = 1ll) {
  ll ret = 1, r = p;
  while (q) {
    if (q % 2)
      ret *= r, ret %= mod;
    r = (r * r) % mod, q /= 2;
  }
  return ret % mod;
}

template <typename T, typename S> ll pow_no_mod(T p, S q) {
  ll ret = 1, r = p;
  while (q) {
    if (q % 2)
      ret *= r;
    r = (r * r), q /= 2;
  }
  return ret;
}

void make_frac_tables(VL &frac_list, VL &frac_inv_list) {
  rep(i, frac_list.size() - 1) {
    frac_list[i + 1] *= frac_list[i] * (i + 1);
    frac_list[i + 1] %= mod;
    frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);
    frac_inv_list[i + 1] %= mod;
  }
}

ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list) {
  if (a < b)
    return 0;
  if (b < 0)
    return 0;
  ll ret = frac_list[a];
  ret *= frac_inv_list[b];
  ret %= mod;
  ret *= frac_inv_list[a - b];
  ret %= mod;
  return ret;
}

void shave(vector<int> &v, int n) {
  if (n <= 1)
    return;
  VB w(n + 1, true);
  int x;
  w[0] = w[1] = false;
  rep2(i, 2, n + 1) {
    if (w[i]) {
      x = i * 2;
      while (x <= n) {
        w[x] = false;
        x += i;
      }
    }
  }
  rep(i, n + 1) {
    if (w[i]) {
      v.emplace_back(i);
    }
  }
}

void solve(ll x, ll y) {
  int counter = 1, p, q;
  while (true) {
    // cout << x << wsp << y << rt;
    if (x % y == 0) {
      cout << counter << rt;
      return;
    } else {
      x %= y;
      p = 0, q = x;
      while (q > 0) {
        if (q % 2) {
          p++;
        }
        q /= 2;
      }
      y = p;
      counter++;
    }
  }
}

int main() {

  cin.tie(0);
  ios::sync_with_stdio(false);

#ifdef DEBUG
  cout << "DEBUG MODE" << endl;
  ifstream in("input.txt"); // for debug
  cin.rdbuf(in.rdbuf());    // for debug
#endif

  int n, pops, popsless, popsmore;
  ll moretotal{0}, lesstotal{0}, morepart, lesspart;
  string s;
  cin >> n >> s;
  pops = count(allpt_c(s), '1');
  popsless = pops - 1;
  popsmore = pops + 1;
  // cout << popsless << wsp << popsmore << rt;
  VI morelist(n, 1 % popsmore), lesslist(n, 1 % popsless);
  rep(i, n) {
    morelist[i + 1] = (morelist[i] * 2) % popsmore;
    lesslist[i + 1] = (lesslist[i] * 2) % popsless;
  }
  reverse(allpt(morelist));
  reverse(allpt(lesslist));

  // show1dvec(morelist);
  // show1dvec(lesslist);

  rep(i, n) {
    if (s[i] == '1') {
      moretotal += morelist[i];
      lesstotal += lesslist[i];
    }
  }

  // cout << moretotal << wsp << lesstotal << rt;

  rep(i, n) {
    if (s[i] == '0') {
      morepart = moretotal + morelist[i];
      // cout << morepart << rt;
      solve(morepart, popsmore);
    }
    if (s[i] == '1') {
      lesspart = lesstotal - lesslist[i];
      // cout << lesspart << rt;
      solve(lesspart, popsless);
    }
  }

  return 0;
}