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

#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() { cerr << '\\n'; }
template <class FIRST, class... REST> void Debug(FIRST arg, REST... rest) {
  cerr << arg << " ";
  Debug(rest...);
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &v) {
  out << "[";
  if (!v.empty()) {
    rep(i, 0, sz(v) - 1) out << v[i] << ", ";
    out << v.back();
  }
  out << "]";
  return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &v) {
  out << "(" << v.first << ", " << v.second << ")";
  return out;
}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; // use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

int N;
string S;
ll A[MAX_N][2];
ll D[MAX_N][2];
ll B[2];

int popcount(int v) {
  if (v == 0)
    return 0;
  else
    return popcount(v % (__builtin_popcount(v))) + 1;
}

void solve() {
  cin >> N;
  cin >> S;
  int sum = 0;
  rep(i, 0, N) { sum += S[i] == '1'; }
  reverse(all(S));
  B[0] = sum - 1;
  B[1] = sum + 1;
  A[0][0] = A[0][1] = 1;
  rep(i, 0, N) {
    rep(j, 0, 2) {
      if (B[j] <= 0)
        continue;
      A[i + 1][j] = A[i][j] * 2 % B[j];
      D[i + 1][j] = (D[i][j] + A[i][j] * (S[i] == '1')) % B[j];
    }
  }
  rer(i, N, 0) {
    int j = (S[i] == '0');
    if (B[j] == 0) {
      cout << 0 << "\\n";
    } else {
      ll v =
          (D[i][j] + D[N][j] - D[i + 1][j] + A[i][j] * (j == 1) + B[j]) % B[j];
      cout << popcount(v) + 1 << "\\n";
    }
  }
}

uint32_t rd() {
  uint32_t res;
#ifdef __MINGW32__
  asm volatile("rdrand %0" : "=a"(res)::"cc");
#else
  res = std::random_device()();
#endif
  return res;
}

int main() {
#ifndef LOCAL
  ios::sync_with_stdio(false);
  cin.tie(0);
#endif
  cout << fixed;
  cout.precision(20);
  cerr << fixed;
  cerr.precision(6);
  rng.seed(rd());
#ifdef LOCAL
  // freopen("in.txt", "wt", stdout); //for tester
  if (!freopen("in.txt", "rt", stdin))
    return 1;
#endif
  solve();
  cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\\n";
  return 0;
}


Error: 0
Time: 0.047982 s.


Fixed submission:

#include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), (a).end()
#define sz(v) (int)(v).size()
#define pb push_back
#define sec second
#define fst first
#define debug(fmt, ...) Debug(__LINE__, ":", fmt, ##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<int, pi> ppi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> mat;
typedef complex<double> comp;
void Debug() { cerr << '\\n'; }
template <class FIRST, class... REST> void Debug(FIRST arg, REST... rest) {
  cerr << arg << " ";
  Debug(rest...);
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &v) {
  out << "[";
  if (!v.empty()) {
    rep(i, 0, sz(v) - 1) out << v[i] << ", ";
    out << v.back();
  }
  out << "]";
  return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &v) {
  out << "(" << v.first << ", " << v.second << ")";
  return out;
}
const int MAX_N = 500010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = (1 << 30) - 1;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; // use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

int N;
string S;
ll A[MAX_N][2];
ll D[MAX_N][2];
ll B[2];

int popcount(int v) {
  if (v == 0)
    return 0;
  else
    return popcount(v % (__builtin_popcount(v))) + 1;
}

void solve() {
  cin >> N;
  cin >> S;
  int sum = 0;
  rep(i, 0, N) { sum += S[i] == '1'; }
  if (sum == 0) {
    rep(i, 0, N) { cout << 0 << "\\n"; }
    return;
  }
  reverse(all(S));
  B[0] = sum - 1;
  B[1] = sum + 1;
  A[0][0] = A[0][1] = 1;
  rep(i, 0, N) {
    rep(j, 0, 2) {
      A[i + 1][j] = A[i][j] * 2 % B[j];
      D[i + 1][j] = (D[i][j] + A[i][j] * (S[i] == '1')) % B[j];
    }
  }
  rer(i, N, 0) {
    int j = (S[i] == '0');
    ll v = (D[i][j] + D[N][j] - D[i + 1][j] + A[i][j] * (j == 1) + B[j]) % B[j];
    cout << popcount(v) + 1 << "\\n";
  }
}

uint32_t rd() {
  uint32_t res;
#ifdef __MINGW32__
  asm volatile("rdrand %0" : "=a"(res)::"cc");
#else
  res = std::random_device()();
#endif
  return res;
}

int main() {
#ifndef LOCAL
  ios::sync_with_stdio(false);
  cin.tie(0);
#endif
  cout << fixed;
  cout.precision(20);
  cerr << fixed;
  cerr.precision(6);
  rng.seed(rd());
#ifdef LOCAL
  // freopen("in.txt", "wt", stdout); //for tester
  if (!freopen("in.txt", "rt", stdin))
    return 1;
#endif
  solve();
  cerr << "Time: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\\n";
  return 0;
}