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

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

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : (x))
#define all(x) x.begin(), x.end() // sort(all(x))
#define sz(x) (int)(x).size()
#define mp(x, y) make_pair((x), (y))

typedef long long ll;

typedef double T;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> tiii;

typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<T> vt;
typedef vector<vt> vvt;
typedef vector<pii> vpi;
typedef vector<pii> vpl;
typedef vector<vpi> graph;
typedef complex<T> Pt;
typedef pair<Pt, Pt> Line;

const ll MOD = 1e9 + 7; // 998244353;
const T EPS = 1e-10;
const int INF = 1e9 + 1;

/* Mod Library */

struct Mod {
  ll x;
  Mod(ll x = 0) : x(x) {}
  Mod operator+(Mod b) { return Mod((x + b.x) % MOD); }
  Mod operator-(Mod b) { return Mod((x - b.x + MOD) % MOD); }
  Mod operator*(Mod b) { return Mod((x * b.x) % MOD); }
  Mod operator/(Mod b) { return *this * inverse(b); }
  Mod operator%(Mod b) { return Mod(x % b.x); }

  static ll euclid(ll a, ll b, ll &x, ll &y) {
    if (b) {
      ll d = euclid(b, a % b, y, x);
      y -= a / b * x;
      return d;
    }
    x = 1;
    y = 0;
    return a;
  }

  Mod inverse(Mod a) {
    ll x, y, g = euclid(a.x, MOD, x, y);
    assert(g == 1);
    return Mod((x + MOD) % MOD);
  }

  Mod operator^(ll e) {
    if (!e)
      return Mod(1);
    Mod r = *this ^ (e / 2);
    r = r * r;
    return e & 1 ? *this * r : r;
  }
};

/* Input Library */
template <typename A, typename B>
istream &operator>>(istream &in, pair<A, B> &p) {
  in >> p.first >> p.second;
  return in;
}

template <typename A, typename B>
ostream &operator<<(ostream &out, pair<A, B> &p) {
  out << p.first << " " << p.second;
  return out;
}

template <typename I> istream &operator>>(istream &in, vector<I> &a) {
  trav(i, a) in >> i;
  return in;
}

template <typename I> ostream &operator<<(ostream &out, vector<I> &a) {
  rep(i, 0, sz(a)) {
    if (i)
      out << " ";
    out << a[i];
  }
  return out;
}

void fast_io() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  // cout.tie(0);
  cin.exceptions(cin.failbit);
}

void solve_test() {
  int n;
  string x;
  cin >> n >> x;

  int pc = 0;
  for (auto el : x) {
    pc += (el == '1');
  }

  if (pc == 0) {
    for (int i = 0; i < n; ++i) {
      cout << 1 << endl;
    }
    return;
  }

  map<int, int> pcs;
  pcs[pc - 1] = 0;
  pcs[pc] = 0;
  pcs[pc + 1] = 0;

  map<int, int> two;
  two[pc - 1] = 1;
  two[pc] = 1;
  two[pc + 1] = 1;
  for (int i = n - 1; i >= 0; --i) {
    for (auto &p : two) {
      if (p.first == 0) {
        continue;
      }
      if (x[i] == '1') {
        pcs[p.first] = (pcs[p.first] + p.second) % p.first;
      }
      p.second = p.second * 2 % p.first;
    }
  }

  two[pc - 1] = 1;
  two[pc] = 1;
  two[pc + 1] = 1;
  vector<int> ans(n);
  for (int i = n - 1; i >= 0; --i) {
    int m = (x[i] == '1' ? pc - 1 : pc + 1);
    int r = (x[i] == '1' ? (m - two[m]) : two[m]);
    if (m == 0) {
      m = 1;
      ans[i]--;
    }
    r = (pcs[m] + r) % m;
    ans[i]++;
    while (r) {
      r = r % __builtin_popcount(r);
      ++ans[i];
    }
    for (auto &p : two) {
      if (p.first == 0) {
        continue;
      }
      p.second = p.second * 2 % p.first;
    }
  }

  for (auto el : ans) {
    cout << el << endl;
  }
}

void setup() {}

int main() {
  setup();
  srand(time(0));
  fast_io();
  int t = 1;
  // cin >> t;
  while (t--) {
    solve_test();
  }
}


Error: 0

Fixed submission:

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

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : (x))
#define all(x) x.begin(), x.end() // sort(all(x))
#define sz(x) (int)(x).size()
#define mp(x, y) make_pair((x), (y))

typedef long long ll;

typedef double T;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> tiii;

typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<T> vt;
typedef vector<vt> vvt;
typedef vector<pii> vpi;
typedef vector<pii> vpl;
typedef vector<vpi> graph;
typedef complex<T> Pt;
typedef pair<Pt, Pt> Line;

const ll MOD = 1e9 + 7; // 998244353;
const T EPS = 1e-10;
const int INF = 1e9 + 1;

/* Mod Library */

struct Mod {
  ll x;
  Mod(ll x = 0) : x(x) {}
  Mod operator+(Mod b) { return Mod((x + b.x) % MOD); }
  Mod operator-(Mod b) { return Mod((x - b.x + MOD) % MOD); }
  Mod operator*(Mod b) { return Mod((x * b.x) % MOD); }
  Mod operator/(Mod b) { return *this * inverse(b); }
  Mod operator%(Mod b) { return Mod(x % b.x); }

  static ll euclid(ll a, ll b, ll &x, ll &y) {
    if (b) {
      ll d = euclid(b, a % b, y, x);
      y -= a / b * x;
      return d;
    }
    x = 1;
    y = 0;
    return a;
  }

  Mod inverse(Mod a) {
    ll x, y, g = euclid(a.x, MOD, x, y);
    assert(g == 1);
    return Mod((x + MOD) % MOD);
  }

  Mod operator^(ll e) {
    if (!e)
      return Mod(1);
    Mod r = *this ^ (e / 2);
    r = r * r;
    return e & 1 ? *this * r : r;
  }
};

/* Input Library */
template <typename A, typename B>
istream &operator>>(istream &in, pair<A, B> &p) {
  in >> p.first >> p.second;
  return in;
}

template <typename A, typename B>
ostream &operator<<(ostream &out, pair<A, B> &p) {
  out << p.first << " " << p.second;
  return out;
}

template <typename I> istream &operator>>(istream &in, vector<I> &a) {
  trav(i, a) in >> i;
  return in;
}

template <typename I> ostream &operator<<(ostream &out, vector<I> &a) {
  rep(i, 0, sz(a)) {
    if (i)
      out << " ";
    out << a[i];
  }
  return out;
}

void fast_io() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  // cout.tie(0);
  cin.exceptions(cin.failbit);
}

void solve_test() {
  int n;
  string x;
  cin >> n >> x;

  int pc = 0;
  for (auto el : x) {
    pc += (el == '1');
  }

  map<int, int> pcs;
  pcs[pc - 1] = 0;
  pcs[pc] = 0;
  pcs[pc + 1] = 0;

  map<int, int> two;
  two[pc - 1] = 1;
  two[pc] = 1;
  two[pc + 1] = 1;
  for (int i = n - 1; i >= 0; --i) {
    for (auto &p : two) {
      if (x[i] == '1') {
        pcs[p.first] = (pcs[p.first] + p.second) % p.first;
      }
      p.second = p.second * 2 % p.first;
    }
  }

  two[pc - 1] = 1;
  two[pc] = 1;
  two[pc + 1] = 1;
  vector<int> ans(n);
  for (int i = n - 1; i >= 0; --i) {
    int m = (x[i] == '1' ? pc - 1 : pc + 1);
    int r = (x[i] == '1' ? (m - two[m]) : two[m]);
    r = (pcs[m] + r) % m;
    ans[i] = 1;
    while (r) {
      r = r % __builtin_popcount(r);
      ++ans[i];
    }
    for (auto &p : two) {
      p.second = p.second * 2 % p.first;
    }
  }

  for (auto el : ans) {
    cout << el << endl;
  }
}

void setup() {}

int main() {
  setup();
  srand(time(0));
  fast_io();
  int t = 1;
  // cin >> t;
  while (t--) {
    solve_test();
  }
}