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

// 四則演算 #pragma GCC target("avx")
// 並列計算 #pragma GCC optimize("O3")
// 条件分岐を減らす #pragma GCC optimize("unroll-loops")
// 浮動小数点演算 #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template <class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define eFOR(i, a, n) for (int i = (a); i <= (n); ++i)
#define rFOR(i, a, n) for (int i = (n)-1; i >= (a); --i)
#define erFOR(i, a, n) for (int i = (n); i >= (a); --i)
#define each(i, a) for (auto &i : a)
#define SORT(a) sort(a.begin(), a.end())
#define rSORT(a) sort(a.rbegin(), a.rend())
#define fSORT(a, f) sort(a.begin(), a.end(), f)
#define all(a) a.begin(), a.end()
#define out(y, x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define tp(a, i) get<i>(a)
#define line cout << "-----------------------------\\n"
#define ENDL(i, n) ((i) == (n)-1 ? "\\n" : " ")
#define stop system("pause")
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template <class T> inline bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
inline void init() {
  cin.tie(nullptr);
  cout.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
}
template <class T> inline istream &operator>>(istream &is, vector<T> &v) {
  for (auto &a : v)
    is >> a;
  return is;
}
template <class T> inline istream &operator>>(istream &is, deque<T> &v) {
  for (auto &a : v)
    is >> a;
  return is;
}
template <class T, class U>
inline istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}
template <class T> inline vector<T> vec(size_t a) { return vector<T>(a); }
template <class T> inline vector<T> defvec(T def, size_t a) {
  return vector<T>(a, def);
}
template <class T, class... Ts> inline auto vec(size_t a, Ts... ts) {
  return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...));
}
template <class T, class... Ts> inline auto defvec(T def, size_t a, Ts... ts) {
  return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...));
}
template <class T> inline void print(const T &a) { cout << a << "\\n"; }
template <class T, class... Ts> inline void print(const T &a, const Ts &...ts) {
  cout << a << " ";
  print(ts...);
}
template <class T> inline void print(const vector<T> &v) {
  for (int i = 0; i < v.size(); ++i)
    cout << v[i] << (i == v.size() - 1 ? "\\n" : " ");
}
template <class T> inline void print(const vector<vector<T>> &v) {
  for (auto &a : v)
    print(a);
}
inline string reversed(const string &s) {
  string t = s;
  reverse(all(t));
  return t;
}

VI v(1 << 18), w(1 << 18);
auto dp = vec<int>(1 << 9, 100001);
void dfs(int cur) {
  if (cur == 1)
    eFOR(i, w[1], 100000) dp[1][i] = v[1];
  else {
    int par = cur >> 1;
    eFOR(i, 1, 100000) {
      dp[cur][i] = max(dp[cur][i - 1], dp[par][i]);
      if (w[cur] <= i) {
        chmax(dp[cur][i], dp[par][i - w[cur]] + v[cur]);
      }
    }
  }
  if ((1 << 8) <= cur)
    return;
  dfs(cur << 1), dfs(cur << 1 | 1);
}
int sfd(int cur, int value, int weight, const int &limit) {
  if (cur < (1 << 9))
    return value + dp[cur][limit - weight];
  int res = sfd(cur >> 1, value, weight, limit);
  if (weight + w[cur] <= limit) {
    chmax(res, sfd(cur >> 1, value + v[cur], weight + w[cur], limit));
  }
  return res;
}

int main() {
  init();

  int n;
  cin >> n;
  eFOR(i, 1, n) cin >> v[i] >> w[i];
  dfs(1);

  int q;
  cin >> q;
  while (q--) {
    int a, b;
    cin >> a >> b;
    if (a < (1 << 9))
      print(dp[a][b]);
    else
      print(sfd(a, 0, 0, b));
  }

  return 0;
}

Error: -6
terminate called after throwing an instance of 'std::bad_alloc'
  what():  std::bad_alloc


Fixed submission:

// 四則演算 #pragma GCC target("avx")
// 並列計算 #pragma GCC optimize("O3")
// 条件分岐を減らす #pragma GCC optimize("unroll-loops")
// 浮動小数点演算 #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template <class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define eFOR(i, a, n) for (int i = (a); i <= (n); ++i)
#define rFOR(i, a, n) for (int i = (n)-1; i >= (a); --i)
#define erFOR(i, a, n) for (int i = (n); i >= (a); --i)
#define each(i, a) for (auto &i : a)
#define SORT(a) sort(a.begin(), a.end())
#define rSORT(a) sort(a.rbegin(), a.rend())
#define fSORT(a, f) sort(a.begin(), a.end(), f)
#define all(a) a.begin(), a.end()
#define out(y, x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define tp(a, i) get<i>(a)
#define line cout << "-----------------------------\\n"
#define ENDL(i, n) ((i) == (n)-1 ? "\\n" : " ")
#define stop system("pause")
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template <class T> inline bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> inline bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
inline void init() {
  cin.tie(nullptr);
  cout.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
}
template <class T> inline istream &operator>>(istream &is, vector<T> &v) {
  for (auto &a : v)
    is >> a;
  return is;
}
template <class T> inline istream &operator>>(istream &is, deque<T> &v) {
  for (auto &a : v)
    is >> a;
  return is;
}
template <class T, class U>
inline istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}
template <class T> inline vector<T> vec(size_t a) { return vector<T>(a); }
template <class T> inline vector<T> defvec(T def, size_t a) {
  return vector<T>(a, def);
}
template <class T, class... Ts> inline auto vec(size_t a, Ts... ts) {
  return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...));
}
template <class T, class... Ts> inline auto defvec(T def, size_t a, Ts... ts) {
  return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...));
}
template <class T> inline void print(const T &a) { cout << a << "\\n"; }
template <class T, class... Ts> inline void print(const T &a, const Ts &...ts) {
  cout << a << " ";
  print(ts...);
}
template <class T> inline void print(const vector<T> &v) {
  for (int i = 0; i < v.size(); ++i)
    cout << v[i] << (i == v.size() - 1 ? "\\n" : " ");
}
template <class T> inline void print(const vector<vector<T>> &v) {
  for (auto &a : v)
    print(a);
}
inline string reversed(const string &s) {
  string t = s;
  reverse(all(t));
  return t;
}

VI v(1 << 18), w(1 << 18);
auto dp = vec<int>(1 << 9, 100001);
void dfs(int cur) {
  if (cur == 1)
    dp[1][w[1]] = v[1];
  else {
    int par = cur >> 1;
    eFOR(i, 1, 100000) {
      dp[cur][i] = max(dp[cur][i - 1], dp[par][i]);
      if (w[cur] <= i) {
        chmax(dp[cur][i], dp[par][i - w[cur]] + v[cur]);
      }
    }
  }
  if ((1 << 8) <= cur)
    return;
  dfs(cur << 1), dfs(cur << 1 | 1);
}
int sfd(int cur, int value, int weight, const int &limit) {
  if (cur < (1 << 9))
    return value + dp[cur][limit - weight];
  int res = sfd(cur >> 1, value, weight, limit);
  if (weight + w[cur] <= limit) {
    chmax(res, sfd(cur >> 1, value + v[cur], weight + w[cur], limit));
  }
  return res;
}

int main() {
  init();

  print(dp[1 << 9][0]);

  int n;
  cin >> n;
  eFOR(i, 1, n) cin >> v[i] >> w[i];
  dfs(1);

  int q;
  cin >> q;
  while (q--) {
    int a, b;
    cin >> a >> b;
    if (a < (1 << 9))
      print(dp[a][b]);
    else
      print(sfd(a, 0, 0, b));
  }

  return 0;
}