Problem p03849 (C++)

Buggy submission (status: 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() { cout << '\n'; }
template <class FIRST, class... REST> void Debug(FIRST arg, REST... rest) {
  cout << 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 = 200010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 29;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

ll N;
ll dp[50][2][2][2]; // i, kuriagari, u is bigger than N, v is bigger than N

int compare(int at, bool now, bool before) {
  int nat = (N & (1LL << at)) ? 1 : 0;
  if (before == false) {
    if (nat == 0 && now == 1)
      return 1;
    else
      return 0;
  } else {
    if (nat == 1 && now == 0)
      return 0;
    else
      return 1;
  }
}

void solve() {
  cin >> N;
  ll D = 0;
  while (N >= (1LL << D))
    D++;

  dp[0][0][0][0] = 1;
  rep(i, 0, D) {
    rep(j, 0, 2) {
      rep(k, 0, 2) {
        rep(l, 0, 2) {
          if (!dp[i][j][k][l])
            continue;
          if (j == 0) {
            ADD(dp[i + 1][0][compare(i, 0, k)][compare(i, 0, l)],
                dp[i][j][k][l]);
            ADD(dp[i + 1][0][compare(i, 1, k)][compare(i, 1, l)],
                dp[i][j][k][l]);
            ADD(dp[i + 1][1][compare(i, 0, k)][compare(i, 0, l)],
                dp[i][j][k][l]);
          } else if (j == 1) {
            ADD(dp[i + 1][0][compare(i, 0, k)][compare(i, 1, l)],
                dp[i][j][k][l]);
            ADD(dp[i + 1][1][compare(i, 1, k)][compare(i, 0, l)],
                dp[i][j][k][l]);
            ADD(dp[i + 1][1][compare(i, 0, k)][compare(i, 1, l)],
                dp[i][j][k][l]);
          }
        }
      }
    }
  }
  cout << dp[D][0][0][0] << "\n";
}

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


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() { cout << '\n'; }
template <class FIRST, class... REST> void Debug(FIRST arg, REST... rest) {
  cout << 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 = 200010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 1000000007;
const int inf = 1 << 29;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
///////////////////////////////////////////////////////////////////////////////////////////////////

ll N;
ll dp[63][2][2][2]; // i, kuriagari, u is bigger than N, v is bigger than N

int compare(int at, bool now, bool before) {
  int nat = (N & (1LL << at)) ? 1 : 0;
  if (before == false) {
    if (nat == 0 && now == 1)
      return 1;
    else
      return 0;
  } else {
    if (nat == 1 && now == 0)
      return 0;
    else
      return 1;
  }
}

void solve() {
  cin >> N;
  ll D = 0;
  while (N >= (1LL << D))
    D++;

  dp[0][0][0][0] = 1;
  rep(i, 0, D) {
    rep(j, 0, 2) {
      rep(k, 0, 2) {
        rep(l, 0, 2) {
          if (!dp[i][j][k][l])
            continue;
          if (j == 0) {
            ADD(dp[i + 1][0][compare(i, 0, k)][compare(i, 0, l)],
                dp[i][j][k][l]);
            ADD(dp[i + 1][0][compare(i, 1, k)][compare(i, 1, l)],
                dp[i][j][k][l]);
            ADD(dp[i + 1][1][compare(i, 0, k)][compare(i, 0, l)],
                dp[i][j][k][l]);
          } else if (j == 1) {
            ADD(dp[i + 1][0][compare(i, 0, k)][compare(i, 1, l)],
                dp[i][j][k][l]);
            ADD(dp[i + 1][1][compare(i, 1, k)][compare(i, 0, l)],
                dp[i][j][k][l]);
            ADD(dp[i + 1][1][compare(i, 0, k)][compare(i, 1, l)],
                dp[i][j][k][l]);
          }
        }
      }
    }
  }
  cout << dp[D][0][0][0] << "\n";
}

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