Problem p03064 (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() { 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 = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 998244353;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; // use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

int N;
int A[MAX_N];
ll dp[300][90010][2][2];

ll mod_pow(ll a, ll n) {
  if (n == 0)
    return 1;
  ll res = mod_pow(a, n / 2);
  if (n % 2 == 0)
    return res * res % mod;
  else
    return a * res % mod * res % mod;
}

void solve() {
  cin >> N;
  rep(i, 0, N) { cin >> A[i]; }
  int sum = accumulate(A, A + N, 0);
  sum = (sum + 1) / 2;
  dp[0][0][0][0] = 1;
  rep(i, 0, N) {
    rep(j, 0, 90000) {
      rep(k, 0, 2) {
        rep(l, 0, 2) {
          if (dp[i][j][k][l] == 0)
            continue;
          ADD(dp[i + 1][j][k | 1][l], dp[i][j][k][l]);
          ADD(dp[i + 1][j][k][l | 1], dp[i][j][k][l]);
          ADD(dp[i + 1][j + A[i]][k][l], dp[i][j][k][l]);
        }
      }
    }
  }
  ll ans = mod_pow(3, N);
  ADD(ans, mod - mod_pow(2, N) * 3 % mod);
  ADD(ans, 3);
  // debug(ans);
  rep(i, sum, 90000 + 1) {
    // if(i < 20)debug(sum, i, dp[N][i][1][1]);
    ADD(ans, mod - dp[N][i][1][1] * 3 % mod);
  }
  cout << ans << "\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
  freopen("in.txt", "rt", stdin);
#endif
  solve();
  cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
  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() { 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 = 300010;
const int MAX_V = 100010;
const double eps = 1e-6;
const ll mod = 998244353;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
const double PI = 3.14159265358979323846;
mt19937 rng; // use it by rng() % mod, shuffle(all(vec), rng)
///////////////////////////////////////////////////////////////////////////////////////////////////

int N;
int A[MAX_N];
ll dp[310][90010][2][2];

ll mod_pow(ll a, ll n) {
  if (n == 0)
    return 1;
  ll res = mod_pow(a, n / 2);
  if (n % 2 == 0)
    return res * res % mod;
  else
    return a * res % mod * res % mod;
}

void solve() {
  cin >> N;
  rep(i, 0, N) { cin >> A[i]; }
  int sum = accumulate(A, A + N, 0);
  sum = (sum + 1) / 2;
  dp[0][0][0][0] = 1;
  rep(i, 0, N) {
    rep(j, 0, 90000) {
      rep(k, 0, 2) {
        rep(l, 0, 2) {
          if (dp[i][j][k][l] == 0)
            continue;
          ADD(dp[i + 1][j][k | 1][l], dp[i][j][k][l]);
          ADD(dp[i + 1][j][k][l | 1], dp[i][j][k][l]);
          ADD(dp[i + 1][j + A[i]][k][l], dp[i][j][k][l]);
        }
      }
    }
  }
  ll ans = mod_pow(3, N);
  ADD(ans, mod - mod_pow(2, N) * 3 % mod);
  ADD(ans, 3);
  // debug(ans);
  rep(i, sum, 90000 + 1) {
    // if(i < 20)debug(sum, i, dp[N][i][1][1]);
    ADD(ans, mod - dp[N][i][1][1] * 3 % mod);
  }
  cout << ans << "\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
  freopen("in.txt", "rt", stdin);
#endif
  solve();
  cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
  return 0;
}