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

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <utility>
#include <vector>

/* template start */

#define rep(i, a, b) for (long long i = (a); (i) < (b); (i)++)
#define all(i) i.begin(), i.end()

#ifdef LOCAL
#define debug(...)                                                             \\
  std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

void debug_out() { std::cerr << std::endl; }

template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {
  std::cerr << " " << h;
  if (sizeof...(t) > 0)
    std::cout << " :";
  debug_out(t...);
}

template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, std::pair<T1, T2> pa) {
  return os << pa.first << " " << pa.second;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, std::vector<T> vec) {
  for (std::size_t i = 0; i < vec.size(); i++)
    os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename Num> constexpr Num mypow(Num a, long long b) {
  if (b == 0)
    return 1;
  if (a == 0)
    return 0;
  Num x = 1;
  while (b > 0) {
    if (b & 1)
      x *= a;
    a *= a;
    b >>= 1;
  }
  return x;
}

/* template end */

using ll = long long;

int main() {
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);

  ll n;
  std::cin >> n;

  constexpr ll SIZE = 1ll << 9;
  constexpr ll MAXN = 1ll << 18;
  constexpr ll MAXW = 100010;

  std::vector<ll> v(MAXN - 1, 0), w(MAXN - 1, 0);
  rep(i, 0, n) std::cin >> v[i] >> w[i];

  std::vector<std::vector<ll>> dp(SIZE - 1, std::vector<ll>(MAXW, 0));

  rep(i, w[0], MAXW) dp[0][i] = v[0];

  rep(i, 1, SIZE - 1) {
    rep(j, 0, w[i]) dp[i][j] = dp[(i - 1) / 2][j];
    rep(j, w[i], MAXW) dp[i][j] =
        std::max(dp[(i - 1) / 2][j], dp[(i - 1) / 2][j - w[i]] + v[i]);
  }

  ll q;
  std::cin >> q;

  using P = std::pair<ll, ll>;

  while (q--) {
    ll a, l;
    std::cin >> a >> l;
    a--;

    if (a < SIZE - 1) {
      std::cout << dp[a][l] << "\\n";
      continue;
    }

    std::vector<P> tmp(1, {0, 0});
    while (a >= SIZE - 1) {
      ll m = tmp.size();
      rep(i, 0, m) {
        if (tmp[i].first + w[a] <= l)
          tmp.emplace_back(tmp[i].first + w[a], tmp[i].second + v[a]);
      }
      a = (a - 1) / 2;
    }

    ll ans = 0;
    for (const auto &e : tmp) {
      chmax(ans, e.second + dp[a][l - e.first]);
    }
    std::cout << ans << "\\n";
  }

  return 0;
}

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


Fixed submission:

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <utility>
#include <vector>

/* template start */

#define rep(i, a, b) for (long long i = (a); (i) < (b); (i)++)
#define all(i) i.begin(), i.end()

#ifdef LOCAL
#define debug(...)                                                             \\
  std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif

void debug_out() { std::cerr << std::endl; }

template <typename Head, typename... Tail> void debug_out(Head h, Tail... t) {
  std::cerr << " " << h;
  if (sizeof...(t) > 0)
    std::cout << " :";
  debug_out(t...);
}

template <typename T1, typename T2>
std::ostream &operator<<(std::ostream &os, std::pair<T1, T2> pa) {
  return os << pa.first << " " << pa.second;
}

template <typename T>
std::ostream &operator<<(std::ostream &os, std::vector<T> vec) {
  for (std::size_t i = 0; i < vec.size(); i++)
    os << vec[i] << (i + 1 == vec.size() ? "" : " ");
  return os;
}

template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}

template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}

template <typename Num> constexpr Num mypow(Num a, long long b) {
  if (b == 0)
    return 1;
  if (a == 0)
    return 0;
  Num x = 1;
  while (b > 0) {
    if (b & 1)
      x *= a;
    a *= a;
    b >>= 1;
  }
  return x;
}

/* template end */

using ll = long long;

int main() {
  std::cin.tie(nullptr);
  std::ios::sync_with_stdio(false);

  ll n;
  std::cin >> n;

  constexpr ll SIZE = 1ll << 8;
  constexpr ll MAXN = 1ll << 18;
  constexpr ll MAXW = 100000;

  std::vector<ll> v(MAXN - 1, 0), w(MAXN - 1, 0);
  rep(i, 0, n) std::cin >> v[i] >> w[i];

  std::vector<std::vector<ll>> dp(SIZE - 1, std::vector<ll>(MAXW, 0));

  rep(i, w[0], MAXW) dp[0][i] = v[0];

  rep(i, 1, SIZE - 1) {
    rep(j, 0, w[i]) dp[i][j] = dp[(i - 1) / 2][j];
    rep(j, w[i], MAXW) dp[i][j] =
        std::max(dp[(i - 1) / 2][j], dp[(i - 1) / 2][j - w[i]] + v[i]);
  }

  ll q;
  std::cin >> q;

  using P = std::pair<ll, ll>;

  while (q--) {
    ll a, l;
    std::cin >> a >> l;
    a--;

    if (a < SIZE - 1) {
      std::cout << dp[a][l] << "\\n";
      continue;
    }

    std::vector<P> tmp(1, {0, 0});
    while (a >= SIZE - 1) {
      ll m = tmp.size();
      rep(i, 0, m) {
        if (tmp[i].first + w[a] <= l)
          tmp.emplace_back(tmp[i].first + w[a], tmp[i].second + v[a]);
      }
    }

    ll ans = 0;
    for (const auto &e : tmp) {
      chmax(ans, e.second + dp[a][l - e.first]);
    }
    std::cout << ans << "\\n";
  }

  return 0;
}