Problem p02648 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
// const double PI = acos(-1);
// const double EPS = 1e-15;
// long long INF=(long long)1E17;
// #define i_7 (long long)(1e9+7)
#define i_7 998'244'353
long mod(long a) {
  long long c = a % i_7;
  if (c >= 0)
    return c;
  return c + i_7;
}
long long po(long a, long b) {
  if (b == 0) {
    return 1;
  }

  long long z = po(a, b / 2);
  z = mod(z * z);
  if (b % 2 != 0) {
    z = mod(a * z);
  }
  return z;
}

bool prime_(int n) {
  if (n == 1) {
    return false;
  } else if (n == 2) {
    return true;
  } else {
    for (int i = 2; i <= std::sqrt(n); i++) {
      if (n % i == 0) {
        return false;
      }
    }
    return true;
  }
}

long long gcd_(long long a, long long b) {
  if (a < b) {
    std::swap(a, b);
  }
  if (a % b == 0) {
    return b;
  } else {
    return gcd_(b, a % b);
  }
}

long long lcm_(long long x, long long y) { return (x / gcd_(x, y)) * y; }

using namespace std;
// using namespace boost::multiprecision;
// using namespace __gnu_pbds;

long long dp[512][100'010];

int main() {
  // using namespace std;
  int n;
  cin >> n;
  long long V[n], W[n];
  REP(i, n) cin >> V[i] >> W[i];
  int q;
  cin >> q;
  int v[q];
  long long l[q];
  REP(i, q) cin >> v[i] >> l[i];

  int m = min(1 << 9, n);
  // vector<vector<long long>> dp(m, vector<long long>(100'010, 0));
  REP(i, m) {
    REP(j, 100'010) {
      if (i == 0) {
        if (W[i] <= j)
          dp[i][j] = V[i];
        continue;
      }
      dp[i][j] = dp[(i + 1) / 2 - 1][j];
      if (j < W[i])
        continue;
      dp[i][j] = max(dp[i][j], dp[(i + 1) / 2 - 1][j - W[i]] + V[i]);
    }
  }

  auto query = [&](int qv, long long ql) -> long long {
    long long res = 0;
    if (qv < m)
      return dp[qv][ql];
    int tv = qv;
    typedef pair<long long, long long> P;
    vector<P> temp;
    while (tv >= m) {
      temp.emplace_back(V[tv], W[tv]);
      tv = (tv + 1) / 2 - 1;
    }
    int k = temp.size();
    REP(s, 1 << k) {
      long long totv = 0, totw = 0;
      REP(i, k) {
        if (s >> i & 1) {
          totv += temp[i].first;
          totw += temp[i].second;
        }
      }
      if (totw > ql)
        continue;
      res = max(res, totv + dp[tv][ql - totw]);
    }
    return res;
  };

  REP(i, q) {
    long long ans = query(v[i], l[i]);
    cout << ans << endl;
  }

  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
// const double PI = acos(-1);
// const double EPS = 1e-15;
// long long INF=(long long)1E17;
// #define i_7 (long long)(1e9+7)
#define i_7 998'244'353
long mod(long a) {
  long long c = a % i_7;
  if (c >= 0)
    return c;
  return c + i_7;
}
long long po(long a, long b) {
  if (b == 0) {
    return 1;
  }

  long long z = po(a, b / 2);
  z = mod(z * z);
  if (b % 2 != 0) {
    z = mod(a * z);
  }
  return z;
}

bool prime_(int n) {
  if (n == 1) {
    return false;
  } else if (n == 2) {
    return true;
  } else {
    for (int i = 2; i <= std::sqrt(n); i++) {
      if (n % i == 0) {
        return false;
      }
    }
    return true;
  }
}

long long gcd_(long long a, long long b) {
  if (a < b) {
    std::swap(a, b);
  }
  if (a % b == 0) {
    return b;
  } else {
    return gcd_(b, a % b);
  }
}

long long lcm_(long long x, long long y) { return (x / gcd_(x, y)) * y; }

using namespace std;
// using namespace boost::multiprecision;
// using namespace __gnu_pbds;

long long dp[512][100'010];

int main() {
  // using namespace std;
  int n;
  cin >> n;
  long long V[n], W[n];
  REP(i, n) cin >> V[i] >> W[i];
  int q;
  cin >> q;
  int v[q];
  long long l[q];
  REP(i, q) {
    cin >> v[i] >> l[i];
    v[i]--;
  }

  int m = min(1 << 9, n);
  // vector<vector<long long>> dp(m, vector<long long>(100'010, 0));
  REP(i, m) {
    REP(j, 100'010) {
      if (i == 0) {
        if (W[i] <= j)
          dp[i][j] = V[i];
        continue;
      }
      dp[i][j] = dp[(i + 1) / 2 - 1][j];
      if (j < W[i])
        continue;
      dp[i][j] = max(dp[i][j], dp[(i + 1) / 2 - 1][j - W[i]] + V[i]);
    }
  }

  auto query = [&](int qv, long long ql) -> long long {
    long long res = 0;
    if (qv < m)
      return dp[qv][ql];
    int tv = qv;
    typedef pair<long long, long long> P;
    vector<P> temp;
    while (tv >= m) {
      temp.emplace_back(V[tv], W[tv]);
      tv = (tv + 1) / 2 - 1;
    }
    int k = temp.size();
    REP(s, 1 << k) {
      long long totv = 0, totw = 0;
      REP(i, k) {
        if (s >> i & 1) {
          totv += temp[i].first;
          totw += temp[i].second;
        }
      }
      if (totw > ql)
        continue;
      res = max(res, totv + dp[tv][ql - totw]);
    }
    return res;
  };

  REP(i, q) {
    long long ans = query(v[i], l[i]);
    cout << ans << endl;
  }

  return 0;
}