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

#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(50) << S << endl
#define Vec(K, L, N, S) vector<L> K(N, S)
#define DV(K, L, N, M, S) vector<vector<L>> K(N, vector<L>(M, S))
#define TV(K, L, N, M, R, S)                                                   \\
  vector<vector<vector<L>>> K(N, vector<vector<L>>(M, vector<L>(R, S)))
#define pint pair<lli, lli>
#define paf(L, R) pair<L, R>
#define mod 998244353
#define MAX 10000000
#define ALL(a) a.begin(), a.end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  lli A, B, C, D, E, H, W, M, K, L, R, N, num = 0, sum = 0, flag = 0;
  string S, T;
  cin >> N >> K;
  DV(dp, lli, N, K + 100, 0);
  Vec(P, lli, N, 0);
  rep(i, 0, N) cin >> P[i];
  dp[0][0] = 2;
  if (P[0] <= K)
    dp[0][P[0]] = 1;
  rep(i, 1, N) rep(j, 0, K + 1) {
    if (j + P[i] <= K)
      dp[i][j + P[i]] = (dp[i][j + P[i]] + dp[i - 1][j]) % mod;
    dp[i][j] = (dp[i][j] + 2 * dp[i - 1][j]) % mod;
  }
  Out(dp[N - 1][K] % mod);
}

Error: 0

Fixed submission:


#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define lli long long int
#define uli unsigned long long int
#define INF 999999999999
#define rep(i, m, n) for (lli i = m; i < n; i++)
#define rrep(i, m, n) for (lli i = m - 1; i >= n; i--)
#define pb(n) push_back(n)
#define UE(N) N.erase(unique(N.begin(), N.end()), N.end());
#define Sort(n) sort(n.begin(), n.end())
#define Rev(n) reverse(n.begin(), n.end())
#define Out(S) cout << S << endl
#define NeOut(S) cout << S
#define HpOut(S) cout << setprecision(50) << S << endl
#define Vec(K, L, N, S) vector<L> K(N, S)
#define DV(K, L, N, M, S) vector<vector<L>> K(N, vector<L>(M, S))
#define TV(K, L, N, M, R, S)                                                   \\
  vector<vector<vector<L>>> K(N, vector<vector<L>>(M, vector<L>(R, S)))
#define pint pair<lli, lli>
#define paf(L, R) pair<L, R>
#define mod 998244353
#define MAX 10000000
#define ALL(a) a.begin(), a.end()
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  lli A, B, C, D, E, H, W, M, K, L, R, N, num = 0, sum = 0, flag = 0;
  string S, T;
  cin >> N >> K;
  DV(dp, lli, N, K + 10, 0);
  Vec(P, lli, N, 0);
  rep(i, 0, N) cin >> P[i];
  dp[0][0] = 2;
  dp[0][P[0]] = 1;
  rep(i, 1, N) rep(j, 0, K + 1) {
    if (j + P[i] <= K)
      dp[i][j + P[i]] = (dp[i][j + P[i]] + dp[i - 1][j]) % mod;
    dp[i][j] = (dp[i][j] + 2 * dp[i - 1][j]) % mod;
    dp[i][j] % mod;
  }
  /*rep(i,0,N){
    rep(j,0,K+1)cout << dp[i][j] << " ";
    Out("");
  }*/
  // rep(i,0,N)sum+=dp[i][K];
  Out(dp[N - 1][K] % mod);
}