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

#line 2 "lib/template.cpp"

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VLL = vector<ll>;
using VVLL = vector<vector<ll>>;
using VB = vector<bool>;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
constexpr int INF = 1000000007;
constexpr ll INF_LL = 1'000'000'000'000'000'007;
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define newl '\\n'

// loops rep(until) / rep(var, until) / rep(var, from, until) / repr (reversed
// order)
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define rep(...)                                                               \\
  OVERLOAD3(__VA_ARGS__, REPEAT_FROM_UNTIL, REPEAT_UNTIL, REPEAT)(__VA_ARGS__)
#define REPEAT(times) REPEAT_CNT(_repeat, __COUNTER__, times)
#define REPEAT_CNT(_repeat, cnt, times) REPEAT_CNT_CAT(_repeat, cnt, times)
#define REPEAT_CNT_CAT(_repeat, cnt, times)                                    \\
  REPEAT_FROM_UNTIL(_repeat##cnt, 0, times)
#define REPEAT_UNTIL(name, times) REPEAT_FROM_UNTIL(name, 0, times)
#define REPEAT_FROM_UNTIL(name, from, until)                                   \\
  for (int name = from, name##__until = (until); name < name##__until; name++)
#define repr(...)                                                              \\
  OVERLOAD3(__VA_ARGS__, REPR_FROM_UNTIL, REPR_UNTIL, REPEAT)(__VA_ARGS__)
#define REPR_UNTIL(name, times) REPR_FROM_UNTIL(name, 0, times)
#define REPR_FROM_UNTIL(name, from, until)                                     \\
  for (int name = (until)-1, name##__from = (from); name >= name##__from;      \\
       name--)

template <typename T, typename U> bool chmin(T &var, U x) {
  if (var > x) {
    var = x;
    return true;
  } else
    return false;
}
template <typename T, typename U> bool chmax(T &var, U x) {
  if (var < x) {
    var = x;
    return true;
  } else
    return false;
}
ll power(ll e, ll t, ll mod = INF_LL) {
  ll res = 1;
  for (; t; t >>= 1, (e *= e) %= mod)
    if (t & 1)
      (res *= e) %= mod;
  return res;
}
ll choose(ll n, int r) {
  chmin(r, n - r);
  if (r < 0)
    return 0;
  ll res = 1;
  rep(i, r) res *= n - i, res /= i + 1;
  return res;
}
template <typename T, typename U> T divceil(T m, U d) {
  return (m + d - 1) / d;
}
template <typename T> vector<T> make_v(size_t a, T b) {
  return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}

// debugging stuff
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wmisleading-indentation"
#define repi(it, ds) for (auto it = ds.begin(); it != ds.end(); it++)
class DebugPrint {
public:
  template <typename T> DebugPrint &operator<<(const T &v) {
#ifdef LOCAL
    cerr << v;
#endif
    return *this;
  }
} debugos;
template <typename T>
DebugPrint &operator<<(DebugPrint &os, const vector<T> &vec) {
  os << "{";
  for (int i = 0; i < vec.size(); i++)
    os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
  os << "}";
  return os;
}
template <typename T, typename U>
DebugPrint &operator<<(DebugPrint &os, const map<T, U> &map_var) {
  os << "{";
  repi(itr, map_var) {
    os << *itr;
    itr++;
    if (itr != map_var.end())
      os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
template <typename T>
DebugPrint &operator<<(DebugPrint &os, const set<T> &set_var) {
  os << "{";
  repi(itr, set_var) {
    os << *itr;
    itr++;
    if (itr != set_var.end())
      os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
template <typename T, typename U>
DebugPrint &operator<<(DebugPrint &os, const pair<T, U> &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
void dump_func() { debugos << newl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
  debugos << head;
  if (sizeof...(Tail) > 0) {
    debugos << ", ";
  }
  dump_func(forward<Tail>(tail)...);
}
#ifdef LOCAL
#define dump(...)                                                              \\
  debugos << "  " << string(#__VA_ARGS__) << ": "                              \\
          << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << newl  \\
          << "    ",                                                           \\
      dump_func(__VA_ARGS__)
#else
#define dump(...) ((void)0)
#endif
#pragma GCC diagnostic pop

#line 1 "lib/util/fast-io.cpp"

// IO
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wmisleading-indentation"
class MyScanner {
public:
  int offset = 0;
  char nc() { return getchar(); }
  template <typename T> void input_integer(T &var) {
    var = 0;
    T sign = 1;
    int cc = nc();
    for (; cc < '0' || '9' < cc; cc = nc())
      if (cc == '-')
        sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = nc())
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
    var += offset;
  }
  int c() {
    char c;
    while (c = nc(), c == ' ' or c == '\\n')
      ;
    return c;
  }
  MyScanner &operator>>(char &var) {
    var = c();
    return *this;
  }
  MyScanner &operator>>(int &var) {
    input_integer<int>(var);
    return *this;
  }
  MyScanner &operator>>(ll &var) {
    input_integer<ll>(var);
    return *this;
  }
  MyScanner &operator>>(string &var) {
    var = "";
    int cc = nc();
    for (; !isgraph(cc); cc = nc())
      ;
    for (; isgraph(cc); cc = nc())
      var.push_back(cc);
    return *this;
  }
  template <size_t N> MyScanner &operator>>(bitset<N> &var) {
    ll v;
    input_integer<ll>(v);
    var = bitset<N>(v);
    return *this;
  }
  template <typename T> operator T() {
    T x;
    *this >> x;
    return x;
  }
  template <typename T> void operator()(T &t) { *this >> t; }
  template <typename T, typename... Ts> void operator()(T &t, Ts &...ts) {
    *this >> t;
    this->operator()(ts...);
  }
  template <typename Iter> void iter(Iter first, Iter last) {
    while (first != last)
      *this >> *first, first++;
  }
  VI vi(int n) {
    VI res(n);
    iter(all(res));
    return res;
  }
  VVI vvi(int n, int m) {
    VVI res(n);
    rep(i, n) res[i] = vi(m);
    return res;
  }
  VLL vll(int n) {
    VLL res(n);
    iter(all(res));
    return res;
  }
  VVLL vvll(int n, int m) {
    VVLL res(n);
    rep(i, n) res[i] = vll(m);
    return res;
  }
  template <typename T> vector<T> v(int n) {
    vector<T> res(n);
    iter(all(res));
    return res;
  }
} IN, IN1{-1};
class MyPrinter {
public:
  int offset = 0;
  template <typename T> void output_integer(T var) {
    var += offset;
    if (var == 0) {
      putchar('0');
      return;
    }
    if (var < 0)
      putchar('-'), var = -var;
    char stack[32];
    int stack_p = 0;
    while (var)
      stack[stack_p++] = '0' + (var % 10), var /= 10;
    while (stack_p)
      putchar(stack[--stack_p]);
  }
  MyPrinter &operator<<(char c) {
    putchar(c);
    return *this;
  }
  MyPrinter &operator<<(double x) {
    printf("%.10f", x);
    return *this;
  }
  template <typename T> MyPrinter &operator<<(T var) {
    output_integer<T>(var);
    return *this;
  }
  MyPrinter &operator<<(char *str_p) {
    while (*str_p)
      putchar(*(str_p++));
    return *this;
  }
  MyPrinter &operator<<(const char *str_p) {
    while (*str_p)
      putchar(*(str_p++));
    return *this;
  }
  MyPrinter &operator<<(const string &str) {
    const char *p = str.c_str();
    const char *l = p + str.size();
    while (p < l)
      putchar(*p++);
    return *this;
  }
  template <typename T> void operator()(T x) { *this << x << newl; }
  template <typename T, typename... Ts> void operator()(T x, Ts... xs) {
    *this << x << " ";
    this->operator()(xs...);
  }
  template <typename Iter> void iter(Iter s, Iter t) {
    if (s == t)
      *this << "\\n";
    else
      for (; s != t; s++)
        *this << *s << " \\n"[next(s, 1) == t];
  }
} OUT, OUT1{1};
template <typename T, typename U>
MyPrinter &operator<<(MyPrinter &out, const pair<T, U> &var) {
  return out << var.first << " " << var.second;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I == N> * = nullptr>
MyPrinter &tuple_impl(MyPrinter &out, const Tuple &var) {
  return out;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I != N> * = nullptr>
MyPrinter &tuple_impl(MyPrinter &out, const Tuple &var) {
  out << get<I>(var) << " ";
  return tuple_impl<Tuple, I + 1, N>(out, var);
}
template <typename... Ts>
MyPrinter &operator<<(MyPrinter &out, const tuple<Ts...> &var) {
  return tuple_impl<tuple<Ts...>, 0, sizeof...(Ts)>(out, var);
}
template <typename T, typename U>
MyScanner &operator>>(MyScanner &in, pair<T, U> &var) {
  return in >> var.first >> var.second;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I == N> * = nullptr>
MyScanner &tuple_impl(MyScanner &in, Tuple &var) {
  return in;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I != N> * = nullptr>
MyScanner &tuple_impl(MyScanner &in, Tuple &var) {
  in >> get<I>(var);
  return tuple_impl<Tuple, I + 1, N>(in, var);
}
template <typename... Ts>
MyScanner &operator>>(MyScanner &in, tuple<Ts...> &var) {
  return tuple_impl<tuple<Ts...>, 0, sizeof...(Ts)>(in, var);
}
#pragma GCC diagnostic pop
#line 3 "main.cpp"

const int MaxN = 1 << 18 + 3;

pair<unsigned, unsigned> wv[1 << 10][1 << 11];
int v[MaxN], w[MaxN];

#include <climits>
#include <cstring>

int f(int i, int l) {
  vector<tuple<int, int, int>> il{make_tuple(i, l, 0)};
  int res = 0;
  while (not il.empty()) {
    auto [i, l, s] = il.back();
    il.pop_back();
    if (l < 0)
      continue;
    if (i == 1) {
      chmax(res, s + (w[i] <= l ? v[i] : 0));
    } else if (__builtin_clz(i) == __builtin_clz(1 << 10)) {
      i -= 1 << 10;
      auto it =
          lower_bound(wv[i], wv[i + 1], pair<unsigned, unsigned>(l + 1, 0));
      it--;
      chmax(res, s + it->second);
    } else {
      il.emplace_back(i / 2, l, s);
      il.emplace_back(i / 2, l - w[i], s + v[i]);
    }
  }
  return res;
}

int main() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  fill(wv[0], wv[1 << 10], make_pair((unsigned)-1, (unsigned)-1));
  int n;
  cin >> n;
  rep(i, 1, n + 1) cin >> v[i] >> w[i];
  if (n >= 1 << 10) {
    rep(i, 1 << 10, min(n + 1, 1 << 11)) {
      rep(mask, 1 << 11) {
        int w0 = 0, v0 = 0;
        rep(d, 11) if (mask >> d & 1) { v0 += v[i >> d], w0 += w[i >> d]; }
        wv[i - (1 << 10)][mask].first = w0;
        wv[i - (1 << 10)][mask].second = v0;
      }
      sort(wv[i - (1 << 10)], wv[i - (1 << 10) + 1]);
      int mx = 0;
      for (auto it = wv[i - (1 << 10)]; it != wv[i - (1 << 10) + 1]; it++) {
        chmax(mx, it->second);
        it->second = mx;
      }
    }
  }

  int q;
  cin >> q;
  rep(q) {
    int v, l;
    cin >> v >> l;
    cout << f(v, l) << newl;
  }
}


Error: 0

Fixed submission:

#line 2 "lib/template.cpp"

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VLL = vector<ll>;
using VVLL = vector<vector<ll>>;
using VB = vector<bool>;
using PII = pair<int, int>;
using PLL = pair<ll, ll>;
constexpr int INF = 1000000007;
constexpr ll INF_LL = 1'000'000'000'000'000'007;
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define newl '\\n'

// loops rep(until) / rep(var, until) / rep(var, from, until) / repr (reversed
// order)
#define OVERLOAD3(_1, _2, _3, name, ...) name
#define rep(...)                                                               \\
  OVERLOAD3(__VA_ARGS__, REPEAT_FROM_UNTIL, REPEAT_UNTIL, REPEAT)(__VA_ARGS__)
#define REPEAT(times) REPEAT_CNT(_repeat, __COUNTER__, times)
#define REPEAT_CNT(_repeat, cnt, times) REPEAT_CNT_CAT(_repeat, cnt, times)
#define REPEAT_CNT_CAT(_repeat, cnt, times)                                    \\
  REPEAT_FROM_UNTIL(_repeat##cnt, 0, times)
#define REPEAT_UNTIL(name, times) REPEAT_FROM_UNTIL(name, 0, times)
#define REPEAT_FROM_UNTIL(name, from, until)                                   \\
  for (int name = from, name##__until = (until); name < name##__until; name++)
#define repr(...)                                                              \\
  OVERLOAD3(__VA_ARGS__, REPR_FROM_UNTIL, REPR_UNTIL, REPEAT)(__VA_ARGS__)
#define REPR_UNTIL(name, times) REPR_FROM_UNTIL(name, 0, times)
#define REPR_FROM_UNTIL(name, from, until)                                     \\
  for (int name = (until)-1, name##__from = (from); name >= name##__from;      \\
       name--)

template <typename T, typename U> bool chmin(T &var, U x) {
  if (var > x) {
    var = x;
    return true;
  } else
    return false;
}
template <typename T, typename U> bool chmax(T &var, U x) {
  if (var < x) {
    var = x;
    return true;
  } else
    return false;
}
ll power(ll e, ll t, ll mod = INF_LL) {
  ll res = 1;
  for (; t; t >>= 1, (e *= e) %= mod)
    if (t & 1)
      (res *= e) %= mod;
  return res;
}
ll choose(ll n, int r) {
  chmin(r, n - r);
  if (r < 0)
    return 0;
  ll res = 1;
  rep(i, r) res *= n - i, res /= i + 1;
  return res;
}
template <typename T, typename U> T divceil(T m, U d) {
  return (m + d - 1) / d;
}
template <typename T> vector<T> make_v(size_t a, T b) {
  return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}

// debugging stuff
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wmisleading-indentation"
#define repi(it, ds) for (auto it = ds.begin(); it != ds.end(); it++)
class DebugPrint {
public:
  template <typename T> DebugPrint &operator<<(const T &v) {
#ifdef LOCAL
    cerr << v;
#endif
    return *this;
  }
} debugos;
template <typename T>
DebugPrint &operator<<(DebugPrint &os, const vector<T> &vec) {
  os << "{";
  for (int i = 0; i < vec.size(); i++)
    os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
  os << "}";
  return os;
}
template <typename T, typename U>
DebugPrint &operator<<(DebugPrint &os, const map<T, U> &map_var) {
  os << "{";
  repi(itr, map_var) {
    os << *itr;
    itr++;
    if (itr != map_var.end())
      os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
template <typename T>
DebugPrint &operator<<(DebugPrint &os, const set<T> &set_var) {
  os << "{";
  repi(itr, set_var) {
    os << *itr;
    itr++;
    if (itr != set_var.end())
      os << ", ";
    itr--;
  }
  os << "}";
  return os;
}
template <typename T, typename U>
DebugPrint &operator<<(DebugPrint &os, const pair<T, U> &p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
void dump_func() { debugos << newl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
  debugos << head;
  if (sizeof...(Tail) > 0) {
    debugos << ", ";
  }
  dump_func(forward<Tail>(tail)...);
}
#ifdef LOCAL
#define dump(...)                                                              \\
  debugos << "  " << string(#__VA_ARGS__) << ": "                              \\
          << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << newl  \\
          << "    ",                                                           \\
      dump_func(__VA_ARGS__)
#else
#define dump(...) ((void)0)
#endif
#pragma GCC diagnostic pop

#line 1 "lib/util/fast-io.cpp"

// IO
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wmisleading-indentation"
class MyScanner {
public:
  int offset = 0;
  char nc() { return getchar(); }
  template <typename T> void input_integer(T &var) {
    var = 0;
    T sign = 1;
    int cc = nc();
    for (; cc < '0' || '9' < cc; cc = nc())
      if (cc == '-')
        sign = -1;
    for (; '0' <= cc && cc <= '9'; cc = nc())
      var = (var << 3) + (var << 1) + cc - '0';
    var = var * sign;
    var += offset;
  }
  int c() {
    char c;
    while (c = nc(), c == ' ' or c == '\\n')
      ;
    return c;
  }
  MyScanner &operator>>(char &var) {
    var = c();
    return *this;
  }
  MyScanner &operator>>(int &var) {
    input_integer<int>(var);
    return *this;
  }
  MyScanner &operator>>(ll &var) {
    input_integer<ll>(var);
    return *this;
  }
  MyScanner &operator>>(string &var) {
    var = "";
    int cc = nc();
    for (; !isgraph(cc); cc = nc())
      ;
    for (; isgraph(cc); cc = nc())
      var.push_back(cc);
    return *this;
  }
  template <size_t N> MyScanner &operator>>(bitset<N> &var) {
    ll v;
    input_integer<ll>(v);
    var = bitset<N>(v);
    return *this;
  }
  template <typename T> operator T() {
    T x;
    *this >> x;
    return x;
  }
  template <typename T> void operator()(T &t) { *this >> t; }
  template <typename T, typename... Ts> void operator()(T &t, Ts &...ts) {
    *this >> t;
    this->operator()(ts...);
  }
  template <typename Iter> void iter(Iter first, Iter last) {
    while (first != last)
      *this >> *first, first++;
  }
  VI vi(int n) {
    VI res(n);
    iter(all(res));
    return res;
  }
  VVI vvi(int n, int m) {
    VVI res(n);
    rep(i, n) res[i] = vi(m);
    return res;
  }
  VLL vll(int n) {
    VLL res(n);
    iter(all(res));
    return res;
  }
  VVLL vvll(int n, int m) {
    VVLL res(n);
    rep(i, n) res[i] = vll(m);
    return res;
  }
  template <typename T> vector<T> v(int n) {
    vector<T> res(n);
    iter(all(res));
    return res;
  }
} IN, IN1{-1};
class MyPrinter {
public:
  int offset = 0;
  template <typename T> void output_integer(T var) {
    var += offset;
    if (var == 0) {
      putchar('0');
      return;
    }
    if (var < 0)
      putchar('-'), var = -var;
    char stack[32];
    int stack_p = 0;
    while (var)
      stack[stack_p++] = '0' + (var % 10), var /= 10;
    while (stack_p)
      putchar(stack[--stack_p]);
  }
  MyPrinter &operator<<(char c) {
    putchar(c);
    return *this;
  }
  MyPrinter &operator<<(double x) {
    printf("%.10f", x);
    return *this;
  }
  template <typename T> MyPrinter &operator<<(T var) {
    output_integer<T>(var);
    return *this;
  }
  MyPrinter &operator<<(char *str_p) {
    while (*str_p)
      putchar(*(str_p++));
    return *this;
  }
  MyPrinter &operator<<(const char *str_p) {
    while (*str_p)
      putchar(*(str_p++));
    return *this;
  }
  MyPrinter &operator<<(const string &str) {
    const char *p = str.c_str();
    const char *l = p + str.size();
    while (p < l)
      putchar(*p++);
    return *this;
  }
  template <typename T> void operator()(T x) { *this << x << newl; }
  template <typename T, typename... Ts> void operator()(T x, Ts... xs) {
    *this << x << " ";
    this->operator()(xs...);
  }
  template <typename Iter> void iter(Iter s, Iter t) {
    if (s == t)
      *this << "\\n";
    else
      for (; s != t; s++)
        *this << *s << " \\n"[next(s, 1) == t];
  }
} OUT, OUT1{1};
template <typename T, typename U>
MyPrinter &operator<<(MyPrinter &out, const pair<T, U> &var) {
  return out << var.first << " " << var.second;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I == N> * = nullptr>
MyPrinter &tuple_impl(MyPrinter &out, const Tuple &var) {
  return out;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I != N> * = nullptr>
MyPrinter &tuple_impl(MyPrinter &out, const Tuple &var) {
  out << get<I>(var) << " ";
  return tuple_impl<Tuple, I + 1, N>(out, var);
}
template <typename... Ts>
MyPrinter &operator<<(MyPrinter &out, const tuple<Ts...> &var) {
  return tuple_impl<tuple<Ts...>, 0, sizeof...(Ts)>(out, var);
}
template <typename T, typename U>
MyScanner &operator>>(MyScanner &in, pair<T, U> &var) {
  return in >> var.first >> var.second;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I == N> * = nullptr>
MyScanner &tuple_impl(MyScanner &in, Tuple &var) {
  return in;
}
template <typename Tuple, size_t I, size_t N, enable_if_t<I != N> * = nullptr>
MyScanner &tuple_impl(MyScanner &in, Tuple &var) {
  in >> get<I>(var);
  return tuple_impl<Tuple, I + 1, N>(in, var);
}
template <typename... Ts>
MyScanner &operator>>(MyScanner &in, tuple<Ts...> &var) {
  return tuple_impl<tuple<Ts...>, 0, sizeof...(Ts)>(in, var);
}
#pragma GCC diagnostic pop
#line 3 "main.cpp"

const int MaxN = 1 << 18;

pair<unsigned, unsigned> wv[1 << 10][1 << 11];
int v[MaxN], w[MaxN];

#include <climits>
#include <cstring>

int f(int i, int l) {
  if (l < 0)
    return INT_MIN;

  vector<tuple<int, int, int>> il{make_tuple(i, l, 0)};
  int res = 0;
  while (not il.empty()) {
    auto [i, l, s] = il.back();
    il.pop_back();
    if (l < 0)
      continue;
    if (i == 1) {
      chmax(res, s + (w[i] <= l ? v[i] : 0));
    } else if (__builtin_clz(i) == __builtin_clz(1 << 10)) {
      i -= 1 << 10;
      auto it =
          lower_bound(wv[i], wv[i + 1], pair<unsigned, unsigned>(l + 1, 0)) - 1;
      chmax(res, s + it->second);
    } else {
      il.emplace_back(i / 2, l, s);
      il.emplace_back(i / 2, l - w[i], s + v[i]);
    }
  }
  return res;
}
int main() {
  memset(wv, -1, sizeof(wv));
  int n;
  IN >> n;
  rep(i, 1, n + 1) IN >> v[i] >> w[i];
  if (n >= 1 << 10) {
    rep(i, 1 << 10, n + 1) {
      rep(mask, 1 << 11) {
        int w0 = 0, v0 = 0;
        rep(d, 11) if (mask >> d & 1) { v0 += v[i >> d], w0 += w[i >> d]; }
        wv[i - (1 << 10)][mask].first = w0;
        wv[i - (1 << 10)][mask].second = v0;
      }
      sort(wv[i - (1 << 10)], wv[i - (1 << 10) + 1]);
    }
  }

  int q;
  IN >> q;
  rep(q) {
    int v, l;
    IN >> v >> l;
    OUT << f(v, l) << newl;
  }
}