Problem p04015 (C++)

Buggy submission (status: Runtime Error):
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define debugv(v)                                                              \
  printf("L%d %s => ", __LINE__, #v);                                          \
  for (auto e : v) {                                                           \
    cout << e << " ";                                                          \
  }                                                                            \
  cout << endl;
#define debugm(m)                                                              \
  printf("L%d %s is..\n", __LINE__, #m);                                       \
  for (auto v : m) {                                                           \
    for (auto e : v) {                                                         \
      cout << e << " ";                                                        \
    }                                                                          \
    cout << endl;                                                              \
  }
#define debuga(m, w)                                                           \
  printf("L%d %s is => ", __LINE__, #m);                                       \
  for (int x = 0; x < (w); x++) {                                              \
    cout << (m)[x] << " ";                                                     \
  }                                                                            \
  cout << endl;
#define debugaa(m, w, h)                                                       \
  printf("L%d %s is..\n", __LINE__, #m);                                       \
  for (int y = 0; y < (h); y++) {                                              \
    for (int x = 0; x < (w); x++) {                                            \
      cout << (m)[x][y] << " ";                                                \
    }                                                                          \
    cout << endl;                                                              \
  }
#define debugaar(m, w, h)                                                      \
  printf("L%d %s is..\n", __LINE__, #m);                                       \
  for (int y = 0; y < (h); y++) {                                              \
    for (int x = 0; x < (w); x++) {                                            \
      cout << (m)[y][x] << " ";                                                \
    }                                                                          \
    cout << endl;                                                              \
  }
#define ALL(v) (v).begin(), (v).end()
#define repeat(l) for (auto cnt = 0; cnt < (l); ++cnt)
#define iterate(b, e) for (auto cnt = (b); cnt != (e); ++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template <typename T1, typename T2>
ostream &operator<<(ostream &o, const pair<T1, T2> p) {
  o << "(" << p.first << ":" << p.second << ")";
  return o;
}

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())
namespace {
std::chrono::system_clock::time_point ttt;
void tic() { ttt = TIME; }
void toc() { fprintf(stderr, "TIME : %lldms\n", MILLISEC(TIME - ttt)); }
std::chrono::system_clock::time_point tle = TIME;
#ifdef __MAI
void safe_tle(int msec) { assert(MILLISEC(TIME - tle) < msec); }
#else
#define safe_tle(k) ;
#endif
} // namespace

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiablechar(c) (0x21 <= (c) && (c) <= 0x7E)
class MaiScanner {
public:
  template <typename T> void input_integer(T &var) {
    var = 0;
    T sign = 1;
    int cc = getchar_unlocked();
    for (; cc < '0' || '9' < cc; cc = getchar_unlocked())
      if (cc == '-')
        sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() { return getchar_unlocked(); }
  inline MaiScanner &operator>>(int &var) {
    input_integer<int>(var);
    return *this;
  }
  inline MaiScanner &operator>>(long long &var) {
    input_integer<long long>(var);
    return *this;
  }
  inline MaiScanner &operator>>(string &var) {
    int cc = getchar_unlocked();
    for (; !isvisiablechar(cc); cc = getchar_unlocked())
      ;
    for (; isvisiablechar(cc); cc = getchar_unlocked())
      var.push_back(cc);
  }
};
} // namespace
MaiScanner scanner;

ll m, n, kei;

ll xdp[50][3000];
ll ydp[50][3000];

int main() {

  scanner >> n >> kei;

  vector<int> xx;
  vector<int> yy;

  repeat(n) {
    int x;
    scanner >> x;

    x -= kei;

    if (0 < x)
      xx.push_back(x);
    if (0 > x)
      yy.push_back(-x);
    m += (0 == x);
  }

  xdp[0][0] = 1;
  for (int i = 0; i < xx.size(); ++i) {
    int e = xx[i];
    for (int x = 0; x < 2500; ++x) {
      xdp[i + 1][x + e] += xdp[i][x];
      xdp[i + 1][x] += xdp[i][x];
    }
  }

  ydp[0][0] = 1;
  for (int i = 0; i < yy.size(); ++i) {
    int e = yy[i];
    for (int y = 0; y < 2500; ++y) {
      ydp[i + 1][y + e] += ydp[i][y];
      ydp[i + 1][y] += ydp[i][y];
    }
  }

  ll zero = (1ll << m);
  ll result = (zero - 1ll);

  for (int z = 1; z <= 2500; ++z) {
    result += xdp[xx.size()][z] * ydp[yy.size()][z] * zero;
  }

  cout << result << endl;

  return 0;
}

Fixed submission:
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"

using namespace std;
typedef long long int ll;

#define debugv(v)                                                              \
  printf("L%d %s => ", __LINE__, #v);                                          \
  for (auto e : v) {                                                           \
    cout << e << " ";                                                          \
  }                                                                            \
  cout << endl;
#define debugm(m)                                                              \
  printf("L%d %s is..\n", __LINE__, #m);                                       \
  for (auto v : m) {                                                           \
    for (auto e : v) {                                                         \
      cout << e << " ";                                                        \
    }                                                                          \
    cout << endl;                                                              \
  }
#define debuga(m, w)                                                           \
  printf("L%d %s is => ", __LINE__, #m);                                       \
  for (int x = 0; x < (w); x++) {                                              \
    cout << (m)[x] << " ";                                                     \
  }                                                                            \
  cout << endl;
#define debugaa(m, w, h)                                                       \
  printf("L%d %s is..\n", __LINE__, #m);                                       \
  for (int y = 0; y < (h); y++) {                                              \
    for (int x = 0; x < (w); x++) {                                            \
      cout << (m)[x][y] << " ";                                                \
    }                                                                          \
    cout << endl;                                                              \
  }
#define debugaar(m, w, h)                                                      \
  printf("L%d %s is..\n", __LINE__, #m);                                       \
  for (int y = 0; y < (h); y++) {                                              \
    for (int x = 0; x < (w); x++) {                                            \
      cout << (m)[y][x] << " ";                                                \
    }                                                                          \
    cout << endl;                                                              \
  }
#define ALL(v) (v).begin(), (v).end()
#define repeat(l) for (auto cnt = 0; cnt < (l); ++cnt)
#define iterate(b, e) for (auto cnt = (b); cnt != (e); ++cnt)
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
template <typename T1, typename T2>
ostream &operator<<(ostream &o, const pair<T1, T2> p) {
  o << "(" << p.first << ":" << p.second << ")";
  return o;
}

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())
namespace {
std::chrono::system_clock::time_point ttt;
void tic() { ttt = TIME; }
void toc() { fprintf(stderr, "TIME : %lldms\n", MILLISEC(TIME - ttt)); }
std::chrono::system_clock::time_point tle = TIME;
#ifdef __MAI
void safe_tle(int msec) { assert(MILLISEC(TIME - tle) < msec); }
#else
#define safe_tle(k) ;
#endif
} // namespace

#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiablechar(c) (0x21 <= (c) && (c) <= 0x7E)
class MaiScanner {
public:
  template <typename T> void input_integer(T &var) {
    var = 0;
    T sign = 1;
    int cc = getchar_unlocked();
    for (; cc < '0' || '9' < cc; cc = getchar_unlocked())
      if (cc == '-')
        sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
  }
  inline int c() { return getchar_unlocked(); }
  inline MaiScanner &operator>>(int &var) {
    input_integer<int>(var);
    return *this;
  }
  inline MaiScanner &operator>>(long long &var) {
    input_integer<long long>(var);
    return *this;
  }
  inline MaiScanner &operator>>(string &var) {
    int cc = getchar_unlocked();
    for (; !isvisiablechar(cc); cc = getchar_unlocked())
      ;
    for (; isvisiablechar(cc); cc = getchar_unlocked())
      var.push_back(cc);
  }
};
} // namespace
MaiScanner scanner;

ll m, n, kei;

ll xdp[51][3000];
ll ydp[51][3000];

int main() {

  scanner >> n >> kei;

  vector<int> xx;
  vector<int> yy;

  repeat(n) {
    int x;
    scanner >> x;

    x -= kei;

    if (0 < x)
      xx.push_back(x);
    if (0 > x)
      yy.push_back(-x);
    m += (0 == x);
  }

  xdp[0][0] = 1;
  for (int i = 0; i < xx.size(); ++i) {
    int e = xx[i];
    for (int x = 0; x < 2500; ++x) {
      xdp[i + 1][x + e] += xdp[i][x];
      xdp[i + 1][x] += xdp[i][x];
    }
  }

  ydp[0][0] = 1;
  for (int i = 0; i < yy.size(); ++i) {
    int e = yy[i];
    for (int y = 0; y < 2500; ++y) {
      ydp[i + 1][y + e] += ydp[i][y];
      ydp[i + 1][y] += ydp[i][y];
    }
  }

  ll zero = (1ll << m);
  ll result = (zero - 1ll);

  for (int z = 1; z <= 2500; ++z) {
    result += xdp[xx.size()][z] * ydp[yy.size()][z] * zero;
  }

  cout << result << endl;

  return 0;
}