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

#include <bits/stdc++.h>
#include <stdlib.h>
#include <sys/time.h>
#include <unistd.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<long double, ll> Ps;
typedef pair<ll, bool> Pb;

const ll INF = 1e18;
const ll fact_table = 3200008;
long double Pi = 3.1415926535897932384626;

priority_queue<ll> pql;
priority_queue<P> pqp;
priority_queue<P> bag;
// big priority queue
priority_queue<ll, vector<ll>, greater<ll>> pqls;
priority_queue<P, vector<P>, greater<P>> pqps;
// small priority queue
// top pop

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
char dir[] = "DRUL";
// ↓,→,↑,←

/*
#define endl "\\n"
#ifdef ENJAPMA
#undef endl
#endif
*/
#define p(x) cout << x << endl;
#define el cout << endl;
#define pe(x) cout << x << " ";
#define ps(x) cout << fixed << setprecision(25) << x << endl;
#define pu(x) cout << (x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)();
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i++)

// const ll mod = 998244353ll;
const ll mod = 1000000007ll;

ll mypow(ll a, ll b, ll mod) {
  ll x = 1;
  while (b) {
    while (!(b & 1)) {
      (a *= a) %= mod;
      b >>= 1;
    }
    (x *= a) %= mod;
    b--;
  }
  return x;
}
void YES(bool cond) {
  if (cond) {
    p("YES");
  } else {
    p("NO");
  }
  return;
}
void Yes(bool cond) {
  if (cond) {
    p("Yes");
  } else {
    p("No");
  }
  return;
}
void line() {
  p("--------------------");
  return;
}

/*
ll fact[fact_table + 5], rfact[fact_table + 5];

void c3_init() {
    fact[0] = rfact[0] = 1;
    for (ll i = 1; i <= fact_table; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
    for (ll i = fact_table; i >= 1; i--) {
        rfact[i - 1] = rfact[i] * i;
        rfact[i - 1] %= mod;
    }
    return;
}
ll c3(ll n, ll r) {
    return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod;
}
*/
struct Timer {
  int64_t start;
  const int64_t CYCLES_PER_SEC = 2800000000;
  Timer() { reset(); }
  void reset() { start = getCycle(); }
  inline double get() { return (double)(getCycle() - start) / CYCLES_PER_SEC; }
  inline int64_t getCycle() {
    uint32_t low, high;
    __asm__ volatile("rdtsc" : "=a"(low), "=d"(high));
    return ((int64_t)low) | ((int64_t)high << 32);
  }
};

Timer timer;

bool multicase = false;

ll n, m, k, w, num, a, b, c, d, e, h, q, ans, sum;

typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

ll x[500005], y[500005], z[500005];
ll dp[500005];
bool used[500005];
string s;

ll value[2][500005];

ll modi(ll m) {
  if (used[m]) {
    return x[m];
  }
  used[m] = true;
  ll sum = 0;
  for (int i = n - 1; i >= 0; i--) {
    sum *= 2;
    sum += (s[i] - '0');
    sum %= m;
  }
  x[m] = sum;
  return sum;
}

void calc() {
  dp[0] = 0;
  for (int i = 1; i <= n; i++) {
    ll pop = __builtin_popcountll(i);
    ll next = i % pop;
    dp[i] = dp[next] + 1;
  }
  return;
}

void solve() {
  cin >> n;
  cin >> s;
  calc();
  ll one = 0;
  for (int i = 0; i < n; i++) {
    if (s[i] == '1')
      one++;
  }
  ll m = one - 1;
  ll res = 1;
  ll sum1 = 0, sum2 = 0;
  if (one != 1) {
    for (int i = n - 1; i >= 0; i--) {
      if (s[i] == '1') {
        sum1 += res;
        sum1 %= m;
      }
      value[0][i] = res;
      res *= 2;
      res %= m;
    }
  }
  m = one + 1;
  res = 1;
  for (int i = n - 1; i >= 0; i--) {
    if (s[i] == '1') {
      sum2 += res;
      sum2 %= m;
    }
    value[1][i] = res;
    res *= 2;
    res %= m;
  }
  for (int i = 0; i < n; i++) {
    ll ans;
    if (s[i] == '1') {
      if (one == 1) {
        p(0);
        continue;
      }
      ans = sum1 - value[0][i] + (one - 1);
      ans %= (one - 1);
    } else {
      ans = sum2 + value[1][i];
      ans %= (one + 1);
    }
    ll res = dp[ans] + 1;
    p(res);
  }

  return;
}

int main() {
  // init();
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll q, testcase = 1;
  if (multicase) {
    cin >> q;
  } else {
    q = 1;
  }
  while (q--) {
    // pu("Case ");pu("#");pu(testcase);pu(": ");
    solve();
    testcase++;
  }
  // solve();
  return 0;
}


Error: 0

Fixed submission:

#include <bits/stdc++.h>
#include <stdlib.h>
#include <sys/time.h>
#include <unistd.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<long double, ll> Ps;
typedef pair<ll, bool> Pb;

const ll INF = 1e18;
const ll fact_table = 3200008;
long double Pi = 3.1415926535897932384626;

priority_queue<ll> pql;
priority_queue<P> pqp;
priority_queue<P> bag;
// big priority queue
priority_queue<ll, vector<ll>, greater<ll>> pqls;
priority_queue<P, vector<P>, greater<P>> pqps;
// small priority queue
// top pop

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
char dir[] = "DRUL";
// ↓,→,↑,←

/*
#define endl "\\n"
#ifdef ENJAPMA
#undef endl
#endif
*/
#define p(x) cout << x << endl;
#define el cout << endl;
#define pe(x) cout << x << " ";
#define ps(x) cout << fixed << setprecision(25) << x << endl;
#define pu(x) cout << (x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)();
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i++)

// const ll mod = 998244353ll;
const ll mod = 1000000007ll;

ll mypow(ll a, ll b, ll mod) {
  ll x = 1;
  while (b) {
    while (!(b & 1)) {
      (a *= a) %= mod;
      b >>= 1;
    }
    (x *= a) %= mod;
    b--;
  }
  return x;
}
void YES(bool cond) {
  if (cond) {
    p("YES");
  } else {
    p("NO");
  }
  return;
}
void Yes(bool cond) {
  if (cond) {
    p("Yes");
  } else {
    p("No");
  }
  return;
}
void line() {
  p("--------------------");
  return;
}

/*
ll fact[fact_table + 5], rfact[fact_table + 5];

void c3_init() {
    fact[0] = rfact[0] = 1;
    for (ll i = 1; i <= fact_table; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
    for (ll i = fact_table; i >= 1; i--) {
        rfact[i - 1] = rfact[i] * i;
        rfact[i - 1] %= mod;
    }
    return;
}
ll c3(ll n, ll r) {
    return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod;
}
*/
struct Timer {
  int64_t start;
  const int64_t CYCLES_PER_SEC = 2800000000;
  Timer() { reset(); }
  void reset() { start = getCycle(); }
  inline double get() { return (double)(getCycle() - start) / CYCLES_PER_SEC; }
  inline int64_t getCycle() {
    uint32_t low, high;
    __asm__ volatile("rdtsc" : "=a"(low), "=d"(high));
    return ((int64_t)low) | ((int64_t)high << 32);
  }
};

Timer timer;

bool multicase = false;

ll n, m, k, w, num, a, b, c, d, e, h, q, ans, sum;

typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

ll x[500005], y[500005], z[500005];
ll dp[500005];
bool used[500005];
string s;

ll value[2][500005];

ll modi(ll m) {
  if (used[m]) {
    return x[m];
  }
  used[m] = true;
  ll sum = 0;
  for (int i = n - 1; i >= 0; i--) {
    sum *= 2;
    sum += (s[i] - '0');
    sum %= m;
  }
  x[m] = sum;
  return sum;
}

void calc() {
  dp[0] = 0;
  for (int i = 1; i <= n; i++) {
    ll pop = __builtin_popcountll(i);
    ll next = i % pop;
    dp[i] = dp[next] + 1;
  }
  return;
}

void solve() {
  cin >> n;
  cin >> s;
  calc();
  ll one = 0;
  for (int i = 0; i < n; i++) {
    if (s[i] == '1')
      one++;
  }
  ll m = one - 1;
  ll res = 1;
  ll sum1 = 0, sum2 = 0;
  for (int i = n - 1; i >= 0; i--) {
    if (s[i] == '1') {
      sum1 += res;
      sum1 %= m;
    }
    value[0][i] = res;
    res *= 2;
    res %= m;
  }
  m = one + 1;
  res = 1;
  for (int i = n - 1; i >= 0; i--) {
    if (s[i] == '1') {
      sum2 += res;
      sum2 %= m;
    }
    value[1][i] = res;
    res *= 2;
    res %= m;
  }
  for (int i = 0; i < n; i++) {
    ll ans;
    if (s[i] == '1') {
      ans = sum1 - value[0][i] + (one - 1);
      ans %= (one - 1);
    } else {
      ans = sum2 + value[1][i];
      ans %= (one + 1);
    }
    ll res = dp[ans] + 1;
    p(res);
  }

  return;
}

int main() {
  // init();
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll q, testcase = 1;
  if (multicase) {
    cin >> q;
  } else {
    q = 1;
  }
  while (q--) {
    // pu("Case ");pu("#");pu(testcase);pu(": ");
    solve();
    testcase++;
  }
  // solve();
  return 0;
}