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

#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, t) for (ll i = (ll)(s); i < (ll)(t); i++)
#define rrep(i, s, t) for (ll i = (ll)(s - 1); (ll)(t) <= i; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
constexpr ll INF = numeric_limits<ll>::max() / 4;
constexpr ll n_max = 2e5 + 10;
#define int ll

template <typename A, typename B> string to_string(pair<A, B> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *c) { return to_string((string)c); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <size_t N> string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++)
    res += static_cast<char>('0' + v[i]);
  return res;
}
template <typename A> string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first)
      res += ", ";
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B> string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

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

template <class T> bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  ll n;
  cin >> n;
  vector<ll> v(n + 1), w(n + 1);
  for (int i = 0; i < n; i++)
    cin >> v[i + 1] >> w[i + 1];
  ll q;
  cin >> q;
  const ll l_max = 1e5 + 10;
  ll tn = 0;
  ll temp = 1;
  while (temp < n && tn < 9) {
    tn++;
    temp *= 2;
  }
  debug(tn);
  vector<vector<ll>> dp((1LL << tn), vector<ll>(l_max));
  rep(i, 1, (1LL << tn)) {
    rep(j, 0, l_max) {
      chmax(dp[i][j], dp[i / 2][j]);
      if (j)
        chmax(dp[i][j], dp[i][j - 1]);
      if (j >= w[i])
        chmax(dp[i][j], dp[i / 2][j - w[i]] + v[i]);
    }
  }
  vector<Pll> tmp, sum;
  while (q--) {
    ll V, L;
    cin >> V >> L;
    if (V < (1LL << tn)) {
      cout << dp[V][L] << "\\n";
      continue;
    }
    tmp.clear();
    sum.clear();
    while (V >= (1LL << tn)) {
      tmp.emplace_back(Pll(w[V], v[V]));
      V /= 2;
    }
    debug(V);
    ll n1 = tmp.size();
    ll sv, sw;
    rep(i, 0, 1LL << n1) {
      sv = 0, sw = 0;
      rep(j, 0, n1) {
        if ((i >> j) & 1) {
          sw += tmp[j].first;
          sv += tmp[j].second;
        }
      }
      if (sw <= L)
        sum.emplace_back(Pll(sw, sv));
    }
    ll ans = 0;
    for (auto &p : sum) {
      chmax(ans, p.second + dp[V][L - p.first]);
    }
    chmax(ans, dp[V][L]);
    cout << ans << "\\n";
  }
}

Error: 0

Fixed submission:

#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
using namespace std;
#define rep(i, s, t) for (ll i = (ll)(s); i < (ll)(t); i++)
#define rrep(i, s, t) for (ll i = (ll)(s - 1); (ll)(t) <= i; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> Pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
constexpr ll INF = numeric_limits<ll>::max() / 4;
constexpr ll n_max = 2e5 + 10;
#define int ll

template <typename A, typename B> string to_string(pair<A, B> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *c) { return to_string((string)c); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <size_t N> string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++)
    res += static_cast<char>('0' + v[i]);
  return res;
}
template <typename A> string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first)
      res += ", ";
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B> string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

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

template <class T> bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T> bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  ll n;
  cin >> n;
  vector<ll> v(n + 1), w(n + 1);
  for (int i = 0; i < n; i++)
    cin >> v[i + 1] >> w[i + 1];
  ll q;
  cin >> q;
  const ll l_max = 1e5 + 10;
  ll tn = 0;
  ll temp = 1;
  while (temp < n && tn < 9) {
    tn++;
    temp *= 2;
  }
  debug(tn);
  vector<vector<ll>> dp((1LL << tn), vector<ll>(l_max));
  rep(i, 1, (1LL << tn)) {
    rep(j, 0, l_max) {
      chmax(dp[i][j], dp[i / 2][j]);
      if (j)
        chmax(dp[i][j], dp[i][j - 1]);
      if (j >= w[i])
        chmax(dp[i][j], dp[i / 2][j - w[i]] + v[i]);
    }
  }
  vector<Pll> tmp, sum;
  while (q--) {
    ll V, L;
    cin >> V >> L;
    if (V < (1LL << 9)) {
      cout << dp[V][L] << "\\n";
      continue;
    }
    tmp.clear();
    sum.clear();
    while (V >= (1LL << 9)) {
      tmp.emplace_back(Pll(w[V], v[V]));
      V /= 2;
    }
    debug(V);
    ll n1 = tmp.size();
    ll sv, sw;
    rep(i, 0, 1LL << n1) {
      sv = 0, sw = 0;
      rep(j, 0, n1) {
        if ((i >> j) & 1) {
          sw += tmp[j].first;
          sv += tmp[j].second;
        }
      }
      if (sw <= L)
        sum.emplace_back(Pll(sw, sv));
    }
    ll ans = 0;
    for (auto &p : sum) {
      chmax(ans, p.second + dp[V][L - p.first]);
    }
    chmax(ans, dp[V][L]);
    cout << ans << "\\n";
  }
}