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

#include <bits/stdc++.h>
typedef long long ll;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set                                                            \\
  tree<int, null_type, less_equal<int>, rb_tree_tag,                           \\
       tree_order_statistics_node_update>
#define pb push_back
#define ff first
#define ss second
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define lllim 2147483648
#define Pi 2 * acos(0.0)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mem(a, b) memset(a, b, sizeof(a))
#define fill_(a, b) fill(a, a + n, b);
#define MOD 1000000007
#define fast_cin                                                               \\
  ios_base::sync_with_stdio(0);                                                \\
  cin.tie(0);                                                                  \\
  cout.tie(0)
#define filein freopen("input.txt", "r", stdin)
#define D(x) cerr << __LINE__ << ": " << #x << " = " << (x) << '\\n'
#define case                                                                   \\
  int t, cas = 1;                                                              \\
  cin >> t;                                                                    \\
  while (t--)
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rev(i, n, a) for (int i = n; i >= a; i--)
#define sim template <class T

/*------------------------------Graph Moves----------------------------*/
// const int fx[]= {+1,-1,+0,+0};
// const int fy[]= {+0,+0,+1,-1};
// const int fx[]= {+0,+0,+1,-1,-1,+1,-1,+1};  // Kings Move
// const int fy[]= {-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
// const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
// const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*---------------------------------------------------------------------*/

sim > void read(T &a) { std::cin >> a; }
sim > void read(T &a, T &b) { std::cin >> a >> b; }
sim > void read(T &a, T &b, T &c) { std::cin >> a >> b >> c; }

sim > void readvec(std::vector<T> &v, const int n) {
  rep(i, 0, n) {
    T p;
    std::cin >> p;
    v.pb(p);
  }
}

using namespace std;
using namespace __gnu_pbds;

const int maxn = 2e6 + 5;

ll bigmod(ll a, ll b, ll m) {
  if (b == 0)
    return 1;
  if (b == 1)
    return a;

  if (b % 2) {
    ll res = bigmod(a, b / 2, m) % m;
    return ((((res % m) * (res % m)) % m) * (a)) % m;
  } else {
    ll res = bigmod(a, b / 2, m) % m;
    return (((res % m) * (res % m)) % m);
  }
}

int dp[maxn];

void init() {
  for (int i = 1; i < maxn; i++) {
    int y = i;
    int cnt = 0;
    while (y) {
      cnt += y & 1;
      y >>= 1;
    }

    dp[i] = dp[i % cnt] + 1;
  }
}

void solve() {
  int n;
  read(n);

  int cnt = 0;
  string s;
  read(s);

  ll num1 = 0, num = 0, num2 = 0;
  rep(i, 0, n) {
    if (s[i] == '1') {
      // num+=bigmod(2,n-i-1,);
      cnt++;
    }
  }

  rep(i, 0, n) {
    if (s[i] == '1') {
      num += (bigmod(2, n - 1 - i, cnt));
      num %= cnt;
      if (cnt - 1 > 0)
        num1 += bigmod(2, n - 1 - i, cnt - 1);
      if (cnt - 1 > 0)
        num1 %= (cnt - 1);
      num2 += bigmod(2, n - 1 - i, cnt + 1);
      num2 %= (cnt + 1);
    }
  }

  rep(i, 0, n) {
    if (s[i] == '0') {
      ll res = num2;
      res += bigmod(2, n - 1 - i, cnt + 1);
      res %= (cnt + 1);

      cout << 1 + dp[res] << endl;

    } else {
      ll res = num1;
      if (cnt - 1 > 0)
        res -= bigmod(2, n - 1 - i, cnt - 1);
      if (cnt - 1 > 0) {
        res %= (cnt - 1);
        res += (cnt - 1);
        res %= (cnt - 1);
      }

      cout << (cnt - 1 > 0 ? 1 : 0) + dp[res] << endl;
    }
  }
}

int main() {

  fast_cin;

  init();
  // case
  {
    // cout<<"Case "<<cas++<<": ";
    solve();
  }

  return 0;
}


Error: 0

Fixed submission:

#include <bits/stdc++.h>
typedef long long ll;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set                                                            \\
  tree<int, null_type, less_equal<int>, rb_tree_tag,                           \\
       tree_order_statistics_node_update>
#define pb push_back
#define ff first
#define ss second
#define gcd(a, b) __gcd(a, b)
#define lcm(a, b) ((a) * ((b) / gcd(a, b)))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define lllim 2147483648
#define Pi 2 * acos(0.0)
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mem(a, b) memset(a, b, sizeof(a))
#define fill_(a, b) fill(a, a + n, b);
#define MOD 1000000007
#define fast_cin                                                               \\
  ios_base::sync_with_stdio(0);                                                \\
  cin.tie(0);                                                                  \\
  cout.tie(0)
#define filein freopen("input.txt", "r", stdin)
#define D(x) cerr << __LINE__ << ": " << #x << " = " << (x) << '\\n'
#define case                                                                   \\
  int t, cas = 1;                                                              \\
  cin >> t;                                                                    \\
  while (t--)
#define rep(i, a, n) for (int i = a; i < n; i++)
#define rev(i, n, a) for (int i = n; i >= a; i--)
#define sim template <class T

/*------------------------------Graph Moves----------------------------*/
// const int fx[]= {+1,-1,+0,+0};
// const int fy[]= {+0,+0,+1,-1};
// const int fx[]= {+0,+0,+1,-1,-1,+1,-1,+1};  // Kings Move
// const int fy[]= {-1,+1,+0,+0,+1,+1,-1,-1}; // Kings Move
// const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
// const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*---------------------------------------------------------------------*/

sim > void read(T &a) { std::cin >> a; }
sim > void read(T &a, T &b) { std::cin >> a >> b; }
sim > void read(T &a, T &b, T &c) { std::cin >> a >> b >> c; }

sim > void readvec(std::vector<T> &v, const int n) {
  rep(i, 0, n) {
    T p;
    std::cin >> p;
    v.pb(p);
  }
}

using namespace std;
using namespace __gnu_pbds;

const int maxn = 2e5 + 5;

ll bigmod(ll a, ll b, ll m) {
  if (b == 0)
    return 1;
  if (b == 1)
    return a;

  if (b % 2) {
    ll res = bigmod(a, b / 2, m) % m;
    return ((((res % m) * (res % m)) % m) * (a)) % m;
  } else {
    ll res = bigmod(a, b / 2, m) % m;
    return (((res % m) * (res % m)) % m);
  }
}

int dp[maxn];

void init() {
  for (int i = 1; i < maxn; i++) {
    int y = i;
    int cnt = 0;
    while (y) {
      cnt += y & 1;
      y >>= 1;
    }

    dp[i] = dp[i % cnt] + 1;
  }
}

void solve() {
  ll n;
  read(n);

  ll cnt = 0;
  string s;
  read(s);

  ll num = 0;
  rep(i, 0, n) {
    if (s[i] == '1') {
      // num+=bigmod(2,n-i-1,);
      cnt++;
    }
  }
  rep(i, 0, n) {
    if (s[i] == '1') {
      num += bigmod(2, n - i - 1, cnt);
      num %= cnt;
      // cnt++;
    }
  }

  rep(i, 0, n) {
    if (s[i] == '0') {
      int r = cnt + 1;
      ll new_num = num + bigmod(2, n - i - 1, r) % r;
      new_num %= r;
      ll ans = 1 + dp[new_num];
      cout << ans << endl;

    } else {
      int r = cnt - 1;
      ll new_num = num - bigmod(2, n - i - 1, r) % r;

      new_num %= r;
      new_num += r;
      new_num %= r;

      ll ans = 1 + dp[new_num];
      cout << ans << endl;
    }
  }
}

int main() {

  fast_cin;

  init();
  // case
  {
    // cout<<"Case "<<cas++<<": ";
    solve();
  }

  return 0;
}