Problem p02648 (C++)

Buggy submission (status: Runtime Error):
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#pragma warning(disable : 4786)
#pragma warning(disable : 4996)
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                 \
  sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(    \
            c i) {
sim > struct rge {
  c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
  ~debug() { cerr << endl; }
  template <class c>
  typename enable_if<sizeof dud<c>(0) != 1, debug &>::type operator<<(c i) {
    cerr << boolalpha << i;
    return *this;
  }

  template <class c, int = 0>
  typename enable_if<sizeof dud<c>(0) == 1, debug &>::type operator<<(c i) {
    return *this << range(begin(i), end(i));
  }

  sim, class b dor(pair<b, c> d) {
    ris << "(" << d.first << ", " << d.second << ")";
  }
  sim dor(rge<c> d) {
    *this << "[";
    for (auto it = d.b; it != d.e; ++it)
      *this << ", " + 2 * (it == d.b) << *it;
    ris << "]";
  }
#else
  sim dor(const c &) { ris; }
#endif
};
#define watch(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#define MEM(a, b) memset(a, (b), sizeof(a))
#define CLR(a) memset(a, 0, sizeof(a))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(X) ((X) > 0 ? (X) : (-(X)))
#define S(X) ((X) * (X))
#define SZ(V) (int)V.size()
#define FORN(i, n) for (int i = 0; i < n; i++)
#define FORAB(i, a, b) for (int i = a; i <= b; i++)
#define ALL(V) V.begin(), V.end()
#define IN(A, B, C) ((B) <= (A) && (A) <= (C))
#define AIN(A, B, C) assert(IN(A, B, C))

typedef long long int LL;
// typedef __int128 LLL;
typedef long long LLL;

typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PLL> VPL;
typedef vector<PII> VP;
typedef vector<double> VD;
typedef vector<vector<int>> VVI;
typedef vector<string> VS;
typedef long double ld;

#define MAXN 1000006
// #define MAXN 1006

const LL MOD = 1000000007;
// const LL MOD = 998244353;
const LL INF = 2000000000000000001LL; // 2e18 + 1

VP V[1 << 10];
int v[(1 << 18) + 5], w[(1 << 18) + 5];
int n, q;

void dfs(int at, int dep) {
  if (v[at] == 0)
    return;
  if (at == 1) {
    V[at].push_back({0, 0});
    V[at].push_back({w[at], v[at]});
  } else {
    for (auto &p : V[at / 2]) {
      V[at].push_back(p);
      V[at].push_back({p.first + w[at], p.second + v[at]});
    }
  }
  sort(ALL(V[at]));
  int mx = 0;
  for (int i = 0; i < SZ(V[at]); i++) {
    mx = MAX(mx, V[at][i].second);
    V[at][i].second = mx;
  }
  dfs(at * 2, dep + 1);
  dfs(at * 2 + 1, dep + 1);
}

int Query(int v, int L) {
  if (L == 0)
    return 0;
  if (v < (1 << 10)) {
    auto iV = upper_bound(ALL(V[v]), PII({L + 1, -1}));
    iV--;
    return iV->second;
  }

  int x = Query(v / 2, L);
  int y = (L < w[v] ? 0 : Query(v / 2, L - w[v]) + ::v[v]);
  return MAX(x, y);
}

void solve(int ks) {
  scanf("%d", &n);
  FORAB(i, 1, n) scanf("%d %d", &v[i], &w[i]);
  dfs(1, 1);
  scanf("%d", &q);
  while (q--) {
    int v, L;
    scanf("%d %d", &v, &L);
    int ans = Query(v, L);
    printf("%d\n", ans);
  }
}

void gen() {}

int main() {
  double start_time = clock();
#ifdef LOCAL
  freopen("C:\\Home\\ContestCodes\\sample.in", "r", stdin);
  // freopen("C:\\Home\\ContestCodes\\sample.in", "r", stdin);
  //	freopen("out.out", "w", stdout);
#endif

  gen();

  if (0) {
    int T;
    scanf("%d", &T);
    // AIN(T, 1, 5000);
    for (int ks = 1; ks <= T; ks++) {
      solve(ks);
      if (ks % 1 == 0)
        fprintf(stderr, "%d done\n", ks);
    }
  } else {
    solve(0);
  }

  double end_time = clock();
  fprintf(stderr, "Time = %lf\n", (end_time - start_time) / CLOCKS_PER_SEC);

  return 0;
}


Fixed submission:
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#pragma warning(disable : 4786)
#pragma warning(disable : 4996)
#include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;

#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                 \
  sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(    \
            c i) {
sim > struct rge {
  c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
  ~debug() { cerr << endl; }
  template <class c>
  typename enable_if<sizeof dud<c>(0) != 1, debug &>::type operator<<(c i) {
    cerr << boolalpha << i;
    return *this;
  }

  template <class c, int = 0>
  typename enable_if<sizeof dud<c>(0) == 1, debug &>::type operator<<(c i) {
    return *this << range(begin(i), end(i));
  }

  sim, class b dor(pair<b, c> d) {
    ris << "(" << d.first << ", " << d.second << ")";
  }
  sim dor(rge<c> d) {
    *this << "[";
    for (auto it = d.b; it != d.e; ++it)
      *this << ", " + 2 * (it == d.b) << *it;
    ris << "]";
  }
#else
  sim dor(const c &) { ris; }
#endif
};
#define watch(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#define MEM(a, b) memset(a, (b), sizeof(a))
#define CLR(a) memset(a, 0, sizeof(a))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(X) ((X) > 0 ? (X) : (-(X)))
#define S(X) ((X) * (X))
#define SZ(V) (int)V.size()
#define FORN(i, n) for (int i = 0; i < n; i++)
#define FORAB(i, a, b) for (int i = a; i <= b; i++)
#define ALL(V) V.begin(), V.end()
#define IN(A, B, C) ((B) <= (A) && (A) <= (C))
#define AIN(A, B, C) assert(IN(A, B, C))

typedef long long int LL;
// typedef __int128 LLL;
typedef long long LLL;

typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<double, double> PDD;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<PLL> VPL;
typedef vector<PII> VP;
typedef vector<double> VD;
typedef vector<vector<int>> VVI;
typedef vector<string> VS;
typedef long double ld;

#define MAXN 1000006
// #define MAXN 1006

const LL MOD = 1000000007;
// const LL MOD = 998244353;
const LL INF = 2000000000000000001LL; // 2e18 + 1

VP V[1 << 10];
int v[(1 << 18) + 5], w[(1 << 18) + 5];
int n, q;

void dfs(int at, int dep) {
  if (v[at] == 0)
    return;
  if (dep == 11)
    return;
  if (at == 1) {
    V[at].push_back({0, 0});
    V[at].push_back({w[at], v[at]});
  } else {
    for (auto &p : V[at / 2]) {
      V[at].push_back(p);
      V[at].push_back({p.first + w[at], p.second + v[at]});
    }
  }
  sort(ALL(V[at]));
  int mx = 0;
  for (int i = 0; i < SZ(V[at]); i++) {
    mx = MAX(mx, V[at][i].second);
    V[at][i].second = mx;
  }
  dfs(at * 2, dep + 1);
  dfs(at * 2 + 1, dep + 1);
}

int Query(int v, int L) {
  if (L == 0)
    return 0;
  if (v < (1 << 10)) {
    auto iV = upper_bound(ALL(V[v]), PII({L + 1, -1}));
    iV--;
    return iV->second;
  }

  int x = Query(v / 2, L);
  int y = (L < w[v] ? 0 : Query(v / 2, L - w[v]) + ::v[v]);
  return MAX(x, y);
}

void solve(int ks) {
  scanf("%d", &n);
  FORAB(i, 1, n) scanf("%d %d", &v[i], &w[i]);
  dfs(1, 1);
  scanf("%d", &q);
  while (q--) {
    int v, L;
    scanf("%d %d", &v, &L);
    int ans = Query(v, L);
    printf("%d\n", ans);
  }
}

void gen() {}

int main() {
  double start_time = clock();
#ifdef LOCAL
  freopen("C:\\Home\\ContestCodes\\sample.in", "r", stdin);
  // freopen("C:\\Home\\ContestCodes\\sample.in", "r", stdin);
  //	freopen("out.out", "w", stdout);
#endif

  gen();

  if (0) {
    int T;
    scanf("%d", &T);
    // AIN(T, 1, 5000);
    for (int ks = 1; ks <= T; ks++) {
      solve(ks);
      if (ks % 1 == 0)
        fprintf(stderr, "%d done\n", ks);
    }
  } else {
    solve(0);
  }

  double end_time = clock();
  fprintf(stderr, "Time = %lf\n", (end_time - start_time) / CLOCKS_PER_SEC);

  return 0;
}