Problem p02662 (C++)

Buggy submission (status: Runtime Error):
#define _CRT_SECURE_NO_WARNINGS
#define REL

#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

typedef int64_t i64;
typedef long long LL;
typedef long long ll;
typedef long double LD;
typedef complex<LD> cld;
typedef unsigned int uint;
typedef complex<double> cd;
typedef unsigned long long ULL;

// #define endl "\n"
#define dendl "\n\n"
#define mp make_pair
#define mt make_tuple
#define size(v) (int)v.size()
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()

/////////////////////////////////////////////////////////////////////

template <typename T> T sqr(T a) { return a * a; }

template <typename T> int sign(T a) {
  if (a == 0)
    return 0;
  return (a > 0 ? 1 : -1);
}

template <typename T> bool uax(T &a, const T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

template <typename T> bool uin(T &a, const T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

template <typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
  in >> p.first >> p.second;
  return in;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &out, pair<T1, T2> &p) {
  out << p.first << ' ' << p.second;
  return out;
}

mt19937_64 rnd(0);

const int LOG = 64;
const int N = (int)3e2 + 7;
const int MAXN = (int)4e5 + 7;
const int MOD = (int)998244353;
const int INF = (int)2e9 + 7;
const int CONST = 450;
const LL LINF = (i64)1e18;
const LD PI = 3.1415926535897932384626433832795;
const LD EPS = 1;

/////////////////////////////////////////////////////////////////////

int n, s, a[N];
int cnt[N][N];

int bin_pow(int a, int p) {
  int res = 1;
  while (p) {
    if (p & 1)
      res = 1LL * res * a % MOD;
    a = 1LL * a * a % MOD;
    p >>= 1;
  }
  return res;
}

void solve() {
  cin >> n >> s;
  for (int i = 1; i <= n; i++)
    cin >> a[i];
  cnt[0][0] = bin_pow(2, n);
  int mul = bin_pow(2, MOD - 2);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= s; j++) {
      cnt[i][j] = cnt[i - 1][j];
      if (j < a[i])
        continue;
      cnt[i][j] = (cnt[i][j] + 1LL * cnt[i - 1][j - a[i]] * mul) % MOD;
    }
  }
  cout << cnt[n][s];
}

int main() {
  double start = clock();
#ifdef _DEBUG
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  cout << fixed << setprecision(20);
  cerr << fixed << setprecision(20);
#else
  cout << fixed << setprecision(20);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  rnd.seed(time(0));
#endif

  int t = 1;
  for (int i = 0; i < t; i++) {
    solve();
  }

#ifdef _DEBUG
  cout << endl << "Time is " << (clock() - start) / 1000.0;
#endif
}

Fixed submission:
#define _CRT_SECURE_NO_WARNINGS
#define REL

#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

typedef int64_t i64;
typedef long long LL;
typedef long long ll;
typedef long double LD;
typedef complex<LD> cld;
typedef unsigned int uint;
typedef complex<double> cd;
typedef unsigned long long ULL;

// #define endl "\n"
#define dendl "\n\n"
#define mp make_pair
#define mt make_tuple
#define size(v) (int)v.size()
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()

/////////////////////////////////////////////////////////////////////

template <typename T> T sqr(T a) { return a * a; }

template <typename T> int sign(T a) {
  if (a == 0)
    return 0;
  return (a > 0 ? 1 : -1);
}

template <typename T> bool uax(T &a, const T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

template <typename T> bool uin(T &a, const T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

template <typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
  in >> p.first >> p.second;
  return in;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &out, pair<T1, T2> &p) {
  out << p.first << ' ' << p.second;
  return out;
}

mt19937_64 rnd(0);

const int LOG = 64;
const int N = (int)3e3 + 7;
const int MAXN = (int)4e5 + 7;
const int MOD = (int)998244353;
const int INF = (int)2e9 + 7;
const int CONST = 450;
const LL LINF = (i64)1e18;
const LD PI = 3.1415926535897932384626433832795;
const LD EPS = 1;

/////////////////////////////////////////////////////////////////////

int n, s, a[N];
int cnt[N][N];

int bin_pow(int a, int p) {
  int res = 1;
  while (p) {
    if (p & 1)
      res = 1LL * res * a % MOD;
    a = 1LL * a * a % MOD;
    p >>= 1;
  }
  return res;
}

void solve() {
  cin >> n >> s;
  for (int i = 1; i <= n; i++)
    cin >> a[i];
  cnt[0][0] = bin_pow(2, n);
  int mul = bin_pow(2, MOD - 2);
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j <= s; j++) {
      cnt[i][j] = cnt[i - 1][j];
      if (j < a[i])
        continue;
      cnt[i][j] = (cnt[i][j] + 1LL * cnt[i - 1][j - a[i]] * mul) % MOD;
    }
  }
  cout << cnt[n][s];
}

int main() {
  double start = clock();
#ifdef _DEBUG
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  cout << fixed << setprecision(20);
  cerr << fixed << setprecision(20);
#else
  cout << fixed << setprecision(20);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  rnd.seed(time(0));
#endif

  int t = 1;
  for (int i = 0; i < t; i++) {
    solve();
  }

#ifdef _DEBUG
  cout << endl << "Time is " << (clock() - start) / 1000.0;
#endif
}