Problem p02648 (C++) — buggy submission, verdict: Time Limit Exceeded

// #ifdef LOCAL
// #define _GLIBCXX_DEBUG
// #endif
#include <bits/stdc++.h>
using namespace std;

#pragma region aliases

#define rep(i, n) for (long long i = 0; i < (n); i++)
#define rrep(i, n) for (long long i = (n)-1; i > -1; i--)
#define Rep(i, m, n) for (long long i = (m); i < (n); i++)
#define rRep(i, m, n) for (long long i = (n)-1; i >= (m); i--)
#define REP(i, m, n, p) for (long long i = m; i < n; i += p)
#define foa(s, v) for (auto &s : v)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define bcnt(n) __builtin_popcountll(n)
#define endk endl
#define ednl endl
#define enld endl

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using vb = vector<bool>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using mll = map<long long, long long>;
using pll = pair<long long, long long>;
using qll = queue<long long>;
using sll = set<long long>;
using vpll = vector<pair<long long, long long>>;
template <class T = ll> using V = vector<T>;
template <class T = ll> using VV = V<V<T>>;
template <class T = ll> using VVV = V<V<V<T>>>;
// 昇順pq(小さい方から取り出す)
template <class T = ll> using pqup = priority_queue<T, vector<T>, greater<T>>;
// 降順pq(大きい方から取り出す)
template <class T = ll> using pqdn = priority_queue<T>;

#pragma endregion

#pragma region constants

long long const limLL = 9223372036854775807; // POW(2,63)-1 ~ 9.22e18
long long const dekai = 3e16;
const long double pi = acos(-1);
const char dl = '\\n';
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};

const int mod = 1000000007;
// const int mod = 998244353;

#pragma endregion

#pragma region basic_procedure

template <class T> inline bool isin(T x, T lef, T rig) {
  return ((lef <= x) && (x < rig));
}

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

void Yes(bool f = 1) { cout << (f ? "Yes" : "No") << "\\n"; }
void No() { cout << "No\\n"; }
void YES(bool f = 1) { cout << (f ? "YES" : "NO") << "\\n"; }
void NO() { cout << "NO\\n"; }
template <class T> void drop(T answer) {
  cout << answer << "\\n";
  exit(0);
}
void err() {
  cout << -1 << "\\n";
  exit(0);
}

template <class T> void vout(vector<T> &v, bool tate = 0) {
  if (v.size() > 0) {
    for (auto it = v.begin(); it < v.end(); it++) {
      cout << *it;
      if (it != v.end() - 1) {
        if (tate)
          cout << endl;
        else
          cout << " ";
      }
    }
  }
  cout << endl;
}

template <class T> void add(vector<T> &v, T val) { // ベクトルの各要素に加算
  for (auto &a : v)
    a += val;
  return;
}

// vectorの中身を数える map<要素,個数>を返す
template <class T> map<T, long long> cntv(vector<T> v) {
  map<T, long long> m;
  for (auto &g : v) {
    if (m.count(g))
      m[g]++;
    else
      m[g] = 1;
  }
  return m;
}

// 配列圧縮
//{1,36,1,3,8,-2,-92}を
//{2, 5,2,3,4, 1,  0}にする
template <class T> vector<long long> press(vector<T> &v) {
  long long n = v.size();
  vector<long long> w(n);
  map<T, long long> m;
  for (T &p : v)
    m[p] = 0;
  long long i = 0;
  for (auto &p : m) {
    p.second = i;
    i++;
  }
  for (long long i = 0; i < n; i++)
    w.at(i) = m[v.at(i)];
  return w;
}

// 切り上げ除算
template <class T> T dup(T a, T b) {
  assert(b != 0);
  T x = abs(a);
  T y = abs(b);
  T z = (x + y - 1) / y;
  if ((a < 0 && b > 0) || (a > 0 && b < 0))
    return -z;
  else if (a == 0)
    return 0;
  else
    return z;
}

long long POW(long long a, long long n) {
  long long res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * a;
    a = a * a;
    n >>= 1;
  }
  return res;
}

template <class T> T greatest_lower_multiple(T x, T d) {
  if (d == 0)
    return 0;
  if (d < 0)
    d *= -1;
  T y = x % d;
  if (y < 0)
    y += d;
  return x - y;
}

template <class T> T least_upper_multiple(T x, T d) {
  return -greatest_lower_multiple(-x, d);
}

long long modpow(long long a, long long n, long long mod) { // a^n mod
  if (mod == 1)
    return 0LL;
  long long res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}

// a * x % mod == __gcd(a,mod)なるxを返す
// a が modの倍数でないことが条件
long long modinv(long long a, long long mod) {
  long long b = mod, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= mod;
  if (u < 0)
    u += mod;
  return u;
}

vvll comb(100, vll(100, -1));
long long com(long long n, long long k) { // 普通の二項計数(overflowに注意)
  assert(n < 100 && k < 100);
  if (n < k || k < 0 || n < 0)
    return 0;
  if (comb[n][k] != -1)
    return comb[n][k];
  ll res;
  if (n - k < k)
    res = com(n, n - k);
  else if (k == 0)
    res = 1;
  else
    res = com(n - 1, k - 1) + com(n - 1, k);
  comb[n][k] = res;
  return res;
}

// nCk modを求める
const int MAX = 5100000;
// この値は求める二項計数の値に応じて変える
// MAX=3*10^7のとき1900msほど、ほぼ比例
// MAX=5*10^6程度ならそれほど気にしなくてよい(300ms程)
long long fac[MAX], finv[MAX], inv[MAX];

void cominit() {
  // テーブルを作る前処理
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % mod;
    inv[i] = mod - inv[mod % i] * (mod / i) % mod;
    finv[i] = finv[i - 1] * inv[i] % mod;
  }
}
long long commod(long long n, long long k) { // 二項係数
  if (n < k)
    return 0;
  if (n < 0 || k < 0)
    return 0;
  return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
long long pmod(long long n, long long k) { // 順列
  if (n < k)
    return 0;
  if (n < 0 || k < 0)
    return 0;
  return fac[n] * finv[n - k] % mod;
}
// n個の区別しないボールを区別するk個の箱に入れる方法の総数
long long hmod(long long n, long long k) { // 重複組み合わせ
  return commod(n + k - 1, n);
}
#pragma endregion

#pragma region input
#define VEC(type, name, size)                                                  \\
  vector<type> name(size);                                                     \\
  INPUT(name)
#define VVEC(type, name, h, w)                                                 \\
  vector<vector<type>> name(h, vector<type>(w));                               \\
  INPUT(name)
#define INT(...)                                                               \\
  int __VA_ARGS__;                                                             \\
  INPUT(__VA_ARGS__)
#define LL(...)                                                                \\
  long long __VA_ARGS__;                                                       \\
  INPUT(__VA_ARGS__)
#define STR(...)                                                               \\
  string __VA_ARGS__;                                                          \\
  INPUT(__VA_ARGS__)
#define CHAR(...)                                                              \\
  char __VA_ARGS__;                                                            \\
  INPUT(__VA_ARGS__)
#define DOUBLE(...)                                                            \\
  double __VA_ARGS__;                                                          \\
  INPUT(__VA_ARGS__)
#define LD(...)                                                                \\
  long double __VA_ARGS__;                                                     \\
  INPUT(__VA_ARGS__)

template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &a) {
  for (auto &i : a)
    scan(i);
}
template <class T, class L> void scan(pair<T, L> &p) {
  scan(p.first);
  scan(p.second);
}
void INPUT() {}
template <class Head, class... Tail> void INPUT(Head &head, Tail &...tail) {
  scan(head);
  INPUT(tail...);
}
template <class T> inline void print(T x) { cout << x << '\\n'; }

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}
#pragma endregion

#pragma region debug

#pragma region output
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    if (i)
      os << " ";
    os << v[i];
  }
  return os;
}
#pragma endregion

#pragma region view

template <typename T> void view(const T e) { std::cerr << e; }

template <typename T, typename U> void view(const std::pair<T, U> &p) {
  std::cerr << "(";
  view(p.first);
  cerr << ", ";
  view(p.second);
  cerr << ")";
}

template <typename T> void view(std::set<T> &s) {
  if (s.empty()) {
    cerr << "{ }";
    return;
  }
  std::cerr << "{ ";
  for (auto &t : s) {
    view(t);
    std::cerr << ", ";
  }
  std::cerr << "\\b\\b }";
}

template <typename T> void view(const std::vector<T> &v) {
  if (v.empty()) {
    cerr << "{ }";
    return;
  }
  std::cerr << "{ ";
  for (const auto &e : v) {
    view(e);
    std::cerr << ", ";
  }
  std::cerr << "\\b\\b }";
}

template <typename T> void view(const std::vector<std::vector<T>> &vv) {
  std::cerr << "{\\n";
  for (const auto &v : vv) {
    std::cerr << "\\t";
    view(v);
    std::cerr << "\\n";
  }
  std::cerr << "}";
}

template <typename T, typename U>
void view(const std::vector<std::pair<T, U>> &v) {
  std::cerr << "{\\n";
  for (const auto &c : v) {
    std::cerr << "\\t(";
    view(c.first);
    cerr << ", ";
    view(c.second);
    cerr << ")\\n";
  }
  std::cerr << "}";
}

template <typename T, typename U> void view(const std::map<T, U> &m) {
  std::cerr << "{\\n";
  for (auto &t : m) {
    std::cerr << "\\t[";
    view(t.first);
    cerr << "] : ";
    view(t.second);
    cerr << "\\n";
  }
  std::cerr << "}";
}

#pragma endregion

// when debugging : g++ foo.cpp -DLOCAL
#ifdef LOCAL
void debug_out() {}
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
  view(H);
  cerr << ", ";
  debug_out(T...);
}
#define debug(...)                                                             \\
  do {                                                                         \\
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : [";                       \\
    debug_out(__VA_ARGS__);                                                    \\
    cerr << "\\b\\b]\\n";                                                         \\
  } while (0)
#define dump(x)                                                                \\
  do {                                                                         \\
    cerr << __LINE__ << " " << #x << " : ";                                    \\
    view(x);                                                                   \\
    cerr << "\\n";                                                              \\
  } while (0)

#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

#pragma endregion

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << fixed << setprecision(15);
  srand((unsigned)time(NULL));

  INT(n);
  int m = 1 << 18;
  int k = 1 << 9;
  vll v(m), w(m);
  rep(i, n) { cin >> v[i + 1] >> w[i + 1]; }

  vector<vector<pll>> dp(k); // val,wei
  dp[0] = {{0, 0}};
  rep(i, k) {
    if (i == 0)
      continue;
    int now = i, par = i / 2;
    dp[now] = dp[par];
    int ds = dp[now].size();
    rep(i, ds) {
      dp[now].push_back(
          {dp[now][i].first + v[now], dp[now][i].second + w[now]});
    }
    sort(rall(dp[now]));
    ds = dp[now].size();
    rep(j, ds - 1) { chmin(dp[now][j + 1].second, dp[now][j].second); }
  }

  rep(i, 30) { debug(dp[i]); }

  int q;
  cin >> q;
  vector<long long> ans(q);
  for (int i = 0; i < q; i++) {
    long long res = 0;
    INT(ver, l);
    vpll ep = {{0, 0}};
    while (ver >= k) {
      int sz = ep.size();
      rep(j, sz) {
        ep.push_back({ep[j].first + v[ver], ep[j].second + w[ver]});
      }
      ver /= 2;
    }
    sort(all(ep));

    int es = ep.size();
    rrep(j, es - 1) { chmin(ep[j].second, ep[j + 1].second); }

    int ds = dp[ver].size();
    int it = 0;
    rep(j, es) {
      while (it < ds && ep[j].second + dp[ver][it].second > l) {
        it++;
      }
      if (it == ds)
        break;
      chmax(res, ep[j].first + dp[ver][it].first);
    }
    ans[i] = res;
  }
  for (int i = 0; i < q; i++) {
    cout << ans[i] << endl;
  }

  return 0;
}

Error: TLE

Fixed submission:

// #ifdef LOCAL
// #define _GLIBCXX_DEBUG
// #endif
#include <bits/stdc++.h>
using namespace std;

#pragma region aliases

#define rep(i, n) for (long long i = 0; i < (n); i++)
#define rrep(i, n) for (long long i = (n)-1; i > -1; i--)
#define Rep(i, m, n) for (long long i = (m); i < (n); i++)
#define rRep(i, m, n) for (long long i = (n)-1; i >= (m); i--)
#define REP(i, m, n, p) for (long long i = m; i < n; i += p)
#define foa(s, v) for (auto &s : v)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define bcnt(n) __builtin_popcountll(n)
#define endk endl
#define ednl endl
#define enld endl

using ll = long long;
using ld = long double;
using ull = unsigned long long;
using vb = vector<bool>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using mll = map<long long, long long>;
using pll = pair<long long, long long>;
using qll = queue<long long>;
using sll = set<long long>;
using vpll = vector<pair<long long, long long>>;
template <class T = ll> using V = vector<T>;
template <class T = ll> using VV = V<V<T>>;
template <class T = ll> using VVV = V<V<V<T>>>;
// 昇順pq(小さい方から取り出す)
template <class T = ll> using pqup = priority_queue<T, vector<T>, greater<T>>;
// 降順pq(大きい方から取り出す)
template <class T = ll> using pqdn = priority_queue<T>;

#pragma endregion

#pragma region constants

long long const limLL = 9223372036854775807; // POW(2,63)-1 ~ 9.22e18
long long const dekai = 3e16;
const long double pi = acos(-1);
const char dl = '\\n';
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int ddx[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ddy[8] = {-1, 0, 1, -1, 1, -1, 0, 1};

const int mod = 1000000007;
// const int mod = 998244353;

#pragma endregion

#pragma region basic_procedure

template <class T> inline bool isin(T x, T lef, T rig) {
  return ((lef <= x) && (x < rig));
}

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

void Yes(bool f = 1) { cout << (f ? "Yes" : "No") << "\\n"; }
void No() { cout << "No\\n"; }
void YES(bool f = 1) { cout << (f ? "YES" : "NO") << "\\n"; }
void NO() { cout << "NO\\n"; }
template <class T> void drop(T answer) {
  cout << answer << "\\n";
  exit(0);
}
void err() {
  cout << -1 << "\\n";
  exit(0);
}

template <class T> void vout(vector<T> &v, bool tate = 0) {
  if (v.size() > 0) {
    for (auto it = v.begin(); it < v.end(); it++) {
      cout << *it;
      if (it != v.end() - 1) {
        if (tate)
          cout << endl;
        else
          cout << " ";
      }
    }
  }
  cout << endl;
}

template <class T> void add(vector<T> &v, T val) { // ベクトルの各要素に加算
  for (auto &a : v)
    a += val;
  return;
}

// vectorの中身を数える map<要素,個数>を返す
template <class T> map<T, long long> cntv(vector<T> v) {
  map<T, long long> m;
  for (auto &g : v) {
    if (m.count(g))
      m[g]++;
    else
      m[g] = 1;
  }
  return m;
}

// 配列圧縮
//{1,36,1,3,8,-2,-92}を
//{2, 5,2,3,4, 1,  0}にする
template <class T> vector<long long> press(vector<T> &v) {
  long long n = v.size();
  vector<long long> w(n);
  map<T, long long> m;
  for (T &p : v)
    m[p] = 0;
  long long i = 0;
  for (auto &p : m) {
    p.second = i;
    i++;
  }
  for (long long i = 0; i < n; i++)
    w.at(i) = m[v.at(i)];
  return w;
}

// 切り上げ除算
template <class T> T dup(T a, T b) {
  assert(b != 0);
  T x = abs(a);
  T y = abs(b);
  T z = (x + y - 1) / y;
  if ((a < 0 && b > 0) || (a > 0 && b < 0))
    return -z;
  else if (a == 0)
    return 0;
  else
    return z;
}

long long POW(long long a, long long n) {
  long long res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * a;
    a = a * a;
    n >>= 1;
  }
  return res;
}

template <class T> T greatest_lower_multiple(T x, T d) {
  if (d == 0)
    return 0;
  if (d < 0)
    d *= -1;
  T y = x % d;
  if (y < 0)
    y += d;
  return x - y;
}

template <class T> T least_upper_multiple(T x, T d) {
  return -greatest_lower_multiple(-x, d);
}

long long modpow(long long a, long long n, long long mod) { // a^n mod
  if (mod == 1)
    return 0LL;
  long long res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}

// a * x % mod == __gcd(a,mod)なるxを返す
// a が modの倍数でないことが条件
long long modinv(long long a, long long mod) {
  long long b = mod, u = 1, v = 0;
  while (b) {
    long long t = a / b;
    a -= t * b;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  u %= mod;
  if (u < 0)
    u += mod;
  return u;
}

vvll comb(100, vll(100, -1));
long long com(long long n, long long k) { // 普通の二項計数(overflowに注意)
  assert(n < 100 && k < 100);
  if (n < k || k < 0 || n < 0)
    return 0;
  if (comb[n][k] != -1)
    return comb[n][k];
  ll res;
  if (n - k < k)
    res = com(n, n - k);
  else if (k == 0)
    res = 1;
  else
    res = com(n - 1, k - 1) + com(n - 1, k);
  comb[n][k] = res;
  return res;
}

// nCk modを求める
const int MAX = 5100000;
// この値は求める二項計数の値に応じて変える
// MAX=3*10^7のとき1900msほど、ほぼ比例
// MAX=5*10^6程度ならそれほど気にしなくてよい(300ms程)
long long fac[MAX], finv[MAX], inv[MAX];

void cominit() {
  // テーブルを作る前処理
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % mod;
    inv[i] = mod - inv[mod % i] * (mod / i) % mod;
    finv[i] = finv[i - 1] * inv[i] % mod;
  }
}
long long commod(long long n, long long k) { // 二項係数
  if (n < k)
    return 0;
  if (n < 0 || k < 0)
    return 0;
  return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
long long pmod(long long n, long long k) { // 順列
  if (n < k)
    return 0;
  if (n < 0 || k < 0)
    return 0;
  return fac[n] * finv[n - k] % mod;
}
// n個の区別しないボールを区別するk個の箱に入れる方法の総数
long long hmod(long long n, long long k) { // 重複組み合わせ
  return commod(n + k - 1, n);
}
#pragma endregion

#pragma region input
#define VEC(type, name, size)                                                  \\
  vector<type> name(size);                                                     \\
  INPUT(name)
#define VVEC(type, name, h, w)                                                 \\
  vector<vector<type>> name(h, vector<type>(w));                               \\
  INPUT(name)
#define INT(...)                                                               \\
  int __VA_ARGS__;                                                             \\
  INPUT(__VA_ARGS__)
#define LL(...)                                                                \\
  long long __VA_ARGS__;                                                       \\
  INPUT(__VA_ARGS__)
#define STR(...)                                                               \\
  string __VA_ARGS__;                                                          \\
  INPUT(__VA_ARGS__)
#define CHAR(...)                                                              \\
  char __VA_ARGS__;                                                            \\
  INPUT(__VA_ARGS__)
#define DOUBLE(...)                                                            \\
  double __VA_ARGS__;                                                          \\
  INPUT(__VA_ARGS__)
#define LD(...)                                                                \\
  long double __VA_ARGS__;                                                     \\
  INPUT(__VA_ARGS__)

template <class T> void scan(T &a) { cin >> a; }
template <class T> void scan(vector<T> &a) {
  for (auto &i : a)
    scan(i);
}
template <class T, class L> void scan(pair<T, L> &p) {
  scan(p.first);
  scan(p.second);
}
void INPUT() {}
template <class Head, class... Tail> void INPUT(Head &head, Tail &...tail) {
  scan(head);
  INPUT(tail...);
}
template <class T> inline void print(T x) { cout << x << '\\n'; }

template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}
#pragma endregion

#pragma region debug

#pragma region output
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) {
    if (i)
      os << " ";
    os << v[i];
  }
  return os;
}
#pragma endregion

#pragma region view

template <typename T> void view(const T e) { std::cerr << e; }

template <typename T, typename U> void view(const std::pair<T, U> &p) {
  std::cerr << "(";
  view(p.first);
  cerr << ", ";
  view(p.second);
  cerr << ")";
}

template <typename T> void view(std::set<T> &s) {
  if (s.empty()) {
    cerr << "{ }";
    return;
  }
  std::cerr << "{ ";
  for (auto &t : s) {
    view(t);
    std::cerr << ", ";
  }
  std::cerr << "\\b\\b }";
}

template <typename T> void view(const std::vector<T> &v) {
  if (v.empty()) {
    cerr << "{ }";
    return;
  }
  std::cerr << "{ ";
  for (const auto &e : v) {
    view(e);
    std::cerr << ", ";
  }
  std::cerr << "\\b\\b }";
}

template <typename T> void view(const std::vector<std::vector<T>> &vv) {
  std::cerr << "{\\n";
  for (const auto &v : vv) {
    std::cerr << "\\t";
    view(v);
    std::cerr << "\\n";
  }
  std::cerr << "}";
}

template <typename T, typename U>
void view(const std::vector<std::pair<T, U>> &v) {
  std::cerr << "{\\n";
  for (const auto &c : v) {
    std::cerr << "\\t(";
    view(c.first);
    cerr << ", ";
    view(c.second);
    cerr << ")\\n";
  }
  std::cerr << "}";
}

template <typename T, typename U> void view(const std::map<T, U> &m) {
  std::cerr << "{\\n";
  for (auto &t : m) {
    std::cerr << "\\t[";
    view(t.first);
    cerr << "] : ";
    view(t.second);
    cerr << "\\n";
  }
  std::cerr << "}";
}

#pragma endregion

// when debugging : g++ foo.cpp -DLOCAL
#ifdef LOCAL
void debug_out() {}
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
  view(H);
  cerr << ", ";
  debug_out(T...);
}
#define debug(...)                                                             \\
  do {                                                                         \\
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : [";                       \\
    debug_out(__VA_ARGS__);                                                    \\
    cerr << "\\b\\b]\\n";                                                         \\
  } while (0)
#define dump(x)                                                                \\
  do {                                                                         \\
    cerr << __LINE__ << " " << #x << " : ";                                    \\
    view(x);                                                                   \\
    cerr << "\\n";                                                              \\
  } while (0)

#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif

#pragma endregion

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout << fixed << setprecision(15);
  srand((unsigned)time(NULL));

  INT(n);
  int m = 1 << 18; // 512 * 512
  int k = 1 << 11; // 512

  vll v(m), w(m);
  rep(i, n) { cin >> v[i + 1] >> w[i + 1]; }

  int h = POW(10, 5) + 1;
  vvll dp(k, vll(h, -dekai)); // dp[i][j] = 重さjのときの価値の最大値
  rep(i, m) { dp[0][0] = 0; }

  Rep(i, 1, k) {
    int par = i / 2;
    int now = i;
    rep(j, h) {
      chmax(dp[now][j], dp[par][j]);
      if (j + w[now] < h)
        chmax(dp[now][j + w[now]], dp[par][j] + v[now]);
    }
  }

  rep(i, k) {
    rep(j, h - 1) { chmax(dp[i][j + 1], dp[i][j]); }
  }

  int q;
  cin >> q;
  vector<long long> ans(q);

  for (int i = 0; i < q; i++) {
    long long res = 0;
    INT(ver, l);
    if (ver < k) {
      res = dp[ver][l];
    } else {
      unordered_map<ll, ll> ma;
      ma[0] = 0;
      vector<pll> vp;
      vll e(h);
      while (ver >= k) {
        queue<pll> q;
        foa(t, ma) { q.push({t.first + w[ver], t.second + v[ver]}); }
        while (!q.empty()) {
          pll p = q.front();
          q.pop();
          if (p.first < h)
            chmax(ma[p.first], p.second);
        }
        ver /= 2;
      }
      foa(t, ma) {
        ll val, wei;
        tie(wei, val) = t;
        int gg = l - wei;
        if (gg > -1 && gg < h) {
          chmax(res, dp[ver][gg] + val);
        }
      }
    }
    ans[i] = res;
  }
  for (int i = 0; i < q; i++) {
    cout << ans[i] << endl;
  }

  return 0;
}