Problem p03070 (C++)

Buggy submission (status: Runtime Error):
#include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 998244353;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop                                                                   \
  char nyaa;                                                                   \
  cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
#define int long long

void Yes() {
  cout << "Yes" << endl;
  exit(0);
}

void No() {
  cout << "No" << endl;
  exit(0);
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int N;
  cin >> N;
  ll a[330], sum = 0;
  rep(i, N) {
    cin >> a[i];
    sum += a[i];
  }
  ll all = 1LL, hoshugo = 0;
  rep(i, N) {
    all *= 3LL;
    all %= mod;
  }
  ll dp[330][90900], dp2[330][90900];
  memset(dp, 0, sizeof(dp));
  memset(dp2, 0, sizeof(dp2));
  dp[0][0] = 1LL;
  dp2[0][0] = 1LL;
  rep(i, N) {
    rep(s, sum + 1) {
      if (s - a[i] >= 0) {
        (dp[i + 1][s] += dp[i][s - a[i]]) %= mod;
        (dp2[i + 1][s] += dp2[i][s - a[i]]) %= mod;
      }
      (dp[i + 1][s] += 2 * dp[i][s]) %= mod;
      (dp2[i + 1][s] += dp2[i][s]) %= mod;
    }
  }
  Rep(s, (ll)(sum + 1) / 2, sum + 1) { (hoshugo += dp[N][s] * 3) %= mod; }
  if (sum % 2 == 0) {
    hoshugo -= 3 * dp2[N][sum / 2];
    hoshugo = (hoshugo + 4 * mod) % mod;
  }
  ll ans = all - hoshugo;
  cout << (ans + mod) % mod << endl;
  return 0;
}

Fixed submission:
#include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 998244353;
typedef long double ld;
const ll INF = 1e+14;
typedef pair<int, int> P;
#define stop                                                                   \
  char nyaa;                                                                   \
  cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
#define int long long

void Yes() {
  cout << "Yes" << endl;
  exit(0);
}

void No() {
  cout << "No" << endl;
  exit(0);
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int N;
  cin >> N;
  ll a[330], sum = 0;
  rep(i, N) {
    cin >> a[i];
    sum += a[i];
  }
  ll all = 1LL, hoshugo = 0;
  rep(i, N) {
    all *= 3LL;
    all %= mod;
  }
  vector<vector<ll>> dp(N + 1, vector<ll>(sum + 1, 0));
  auto dp2 = dp;
  dp[0][0] = 1LL;
  dp2[0][0] = 1LL;
  rep(i, N) {
    rep(s, sum + 1) {
      if (s - a[i] >= 0) {
        (dp[i + 1][s] += dp[i][s - a[i]]) %= mod;
        (dp2[i + 1][s] += dp2[i][s - a[i]]) %= mod;
      }
      (dp[i + 1][s] += 2 * dp[i][s]) %= mod;
      (dp2[i + 1][s] += dp2[i][s]) %= mod;
    }
  }
  Rep(s, (ll)(sum + 1) / 2, sum + 1) { (hoshugo += dp[N][s] * 3) %= mod; }
  if (sum % 2 == 0) {
    hoshugo -= 3 * dp2[N][sum / 2];
    hoshugo = (hoshugo + 4 * mod) % mod;
  }
  ll ans = all - hoshugo;
  cout << (ans + mod) % mod << endl;
  return 0;
}