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

#ifndef ONLINE_JUDGE
#define DEBUG 1
#if DEBUG
#define _GLIBCXX_DEBUG
#endif
#endif
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using tll = tuple<ll, ll, ll>;
using vtll = vector<tll>;
using vvtll = vector<vtll>;
#define all(v) (v).begin(), (v).end()
#define for1(i, n) for (ll i = 0; i < (n); i++)
#define for2(i, m, n) for (ll i = (m); i < (n); i++)
#define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d))
#define rfor2(i, m, n) for (ll i = (m); i > (n); i--)
#define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d))
#define PI 3.1415926535897932384626433832795028841971693993751L
#define INF 1111111111111111111LL
#define print(...) print_1(__VA_ARGS__)
#define in(...) in_1(__VA_ARGS__)
#if DEBUG
#define dump(...) dump_1(#__VA_ARGS__, __VA_ARGS__)
#define dumpa(...) dumpa_1(#__VA_ARGS__, __VA_ARGS__)
#else
#define dump(...)
#define dumpa(...)
#endif
template <typename Head> void dump_1(const char *str, Head &&h) {
  cerr << str << ": " << h << '\\n';
}
template <typename Head, typename... Tail>
void dump_1(const char *str, Head &&h, Tail &&...t) {
  while (*str != ',') {
    cerr << *str++;
  }
  cerr << ": " << h << ' ';
  dump_1(str + 1, t...);
}
template <typename T>
void dumpa_1(const char *str, const T v[], const ll size) {
  while (*str != ',') {
    cerr << *str++;
  }
  cerr << ": ";
  for1(i, size) {
    if (i != 0) {
      cerr << ' ';
    }
    cerr << v[i];
  }
  cerr << '\\n';
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &v) {
  os << v.first << ' ' << v.second;
  return os;
}
template <typename T1, typename T2, typename T3>
ostream &operator<<(ostream &os, const tuple<T1, T2, T3> &v) {
  os << get<0>(v) << ' ' << get<1>(v) << ' ' << get<2>(v);
  return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
  for (auto it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) {
      os << ' ';
    }
    os << *it;
  }
  return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
  for (auto it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) {
      os << ' ';
    }
    os << *it;
  }
  return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &v) {
  for (auto it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) {
      os << ' ';
    }
    os << *it;
  }
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &v) {
  os << '{';
  for (auto it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) {
      os << ", ";
    }
    os << it->first << ':' << it->second;
  }
  os << '}';
  return os;
}
ll divup(ll nume, ll deno) {
  assert(nume >= 0);
  assert(deno > 0);
  return (nume + deno - 1) / deno;
}
void Yes(void) { cout << "Yes\\n"; }
void No(void) { cout << "No\\n"; }
void YES(void) { cout << "YES\\n"; }
void NO(void) { cout << "NO\\n"; }
template <typename T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> void vin(vector<T> &v) {
  ll len = v.size();
  for1(i, len) { cin >> v[i]; }
}
template <typename Head> void in_1(Head &h) { cin >> h; }
template <typename Head, typename... Tail> void in_1(Head &h, Tail &...t) {
  cin >> h;
  in_1(t...);
}
template <typename Head> void print_1(Head &&h) { cout << h << '\\n'; }
template <typename Head, typename... Tail> void print_1(Head &&h, Tail &&...t) {
  cout << h << ' ';
  print_1(t...);
}
//---------------------------------------------------------
const ll mod = 1000000007LL; // 10**9 + 7
struct mint {
  ll x; // typedef long long ll;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint &operator+=(const mint a) {
    if ((x += a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator-=(const mint a) {
    if ((x += mod - a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res -= a;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res *= a;
  }
  mint pow(ll t) const {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod - 2); }
  mint &operator/=(const mint a) { return (*this) *= a.inv(); }
  mint operator/(const mint a) const {
    mint res(*this);
    return res /= a;
  }
  friend ostream &operator<<(ostream &os, const mint &v) {
    os << v.x;
    return os;
  }
};
//---------------------------------------------------------
struct mintcomb {
  vector<mint> fact, ifact;
  mintcomb(int n) : fact(n + 1), ifact(n + 1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) {
      fact[i] = fact[i - 1] * i;
    }
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) {
      ifact[i - 1] = ifact[i] * i;
    }
  }
  mint permutation(int n, int k) {
    if (k < 0 || k > n)
      return 0;
    return fact[n] * ifact[n - k];
  }
  mint combination(int n, int k) {
    if (k < 0 || k > n)
      return 0;
    return fact[n] * ifact[k] * ifact[n - k];
  }
};
//---------------------------------------------------------
vector<vector<pll>> dp;
ll dpmax = 0;
ll N;
vll V;
vll W;

// v <= 2**9
ll calc(ll v, ll L) {
  if (dp[v].rbegin()->first <= L) {
    return dp[v].rbegin()->second;
  }
  ll lo = 0;
  ll hi = dp[v].size();
  while (hi - lo > 1) {
    ll mi = (hi + lo) / 2;
    if (dp[v][mi].first > L) {
      hi = mi;
    } else {
      lo = mi;
    }
  }
  return dp[v][lo].second;
}
ll dfs(ll v, ll L) {
  if (v <= dpmax) {
    return calc(v, L);
  }
  ll par = v / 2;
  ll ret = dfs(par, L);
  if (L >= W[v]) {
    ll ret2 = dfs(par, L - W[v]) + V[v];
    chmax(ret, ret2);
  }
  return ret;
}

void solve() {
  in(N);
  V = vll(N + 1);
  W = vll(N + 1);
  for2(i, 1, N + 1) { in(V[i], W[i]); }
  ll Q;
  in(Q);
  vll Qv(Q);
  vll QL(Q);
  for1(i, Q) { in(Qv[i], QL[i]); }
  ll weightmax = 0;
  for1(i, Q) { chmax(weightmax, QL[i]); }

  // dp[頂点][重さ] = 価値の最大
  dp = vector<vector<pll>>(N + 1);
  dpmax = min(N, 1LL << 9);
  dp[0].emplace_back(0, 0); // (重さ,価値の最大)
  for2(i, 1, dpmax + 1) {
    ll par = i / 2;
    map<ll, ll> m;
    for (auto &p : dp[par]) {
      ll k = p.first;
      chmax(m[k], p.second);
      k = p.first + W[i];
      if (k <= weightmax) {
        chmax(m[k], p.second + V[i]);
      }
    }
    ll maxval = -1;
    // dump(i, m);
    for (auto &p : m) {
      if (chmax(maxval, p.second)) {
        dp[i].emplace_back(p.first, p.second);
      }
    }
    // if (i % 10000 == 0) {
    //    dump(i, dp[i]);
    //}
  }

  for1(i, Q) {
    ll v = Qv[i];
    ll L = QL[i];
    // dump(v, dp[v]);
    print(dfs(v, L));
  }
}
//---------------------------------------------------------
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(16);
  cerr << fixed << setprecision(16);
  solve();
}


Error: TLE

Fixed submission:

#ifndef ONLINE_JUDGE
#define DEBUG 1
#if DEBUG
#define _GLIBCXX_DEBUG
#endif
#endif
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using tll = tuple<ll, ll, ll>;
using vtll = vector<tll>;
using vvtll = vector<vtll>;
#define all(v) (v).begin(), (v).end()
#define for1(i, n) for (ll i = 0; i < (n); i++)
#define for2(i, m, n) for (ll i = (m); i < (n); i++)
#define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d))
#define rfor2(i, m, n) for (ll i = (m); i > (n); i--)
#define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d))
#define PI 3.1415926535897932384626433832795028841971693993751L
#define INF 1111111111111111111LL
#define print(...) print_1(__VA_ARGS__)
#define in(...) in_1(__VA_ARGS__)
#if DEBUG
#define dump(...) dump_1(#__VA_ARGS__, __VA_ARGS__)
#define dumpa(...) dumpa_1(#__VA_ARGS__, __VA_ARGS__)
#else
#define dump(...)
#define dumpa(...)
#endif
template <typename Head> void dump_1(const char *str, Head &&h) {
  cerr << str << ": " << h << '\\n';
}
template <typename Head, typename... Tail>
void dump_1(const char *str, Head &&h, Tail &&...t) {
  while (*str != ',') {
    cerr << *str++;
  }
  cerr << ": " << h << ' ';
  dump_1(str + 1, t...);
}
template <typename T>
void dumpa_1(const char *str, const T v[], const ll size) {
  while (*str != ',') {
    cerr << *str++;
  }
  cerr << ": ";
  for1(i, size) {
    if (i != 0) {
      cerr << ' ';
    }
    cerr << v[i];
  }
  cerr << '\\n';
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &v) {
  os << v.first << ' ' << v.second;
  return os;
}
template <typename T1, typename T2, typename T3>
ostream &operator<<(ostream &os, const tuple<T1, T2, T3> &v) {
  os << get<0>(v) << ' ' << get<1>(v) << ' ' << get<2>(v);
  return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
  for (auto it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) {
      os << ' ';
    }
    os << *it;
  }
  return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
  for (auto it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) {
      os << ' ';
    }
    os << *it;
  }
  return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &v) {
  for (auto it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) {
      os << ' ';
    }
    os << *it;
  }
  return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &v) {
  os << '{';
  for (auto it = v.begin(); it != v.end(); it++) {
    if (it != v.begin()) {
      os << ", ";
    }
    os << it->first << ':' << it->second;
  }
  os << '}';
  return os;
}
ll divup(ll nume, ll deno) {
  assert(nume >= 0);
  assert(deno > 0);
  return (nume + deno - 1) / deno;
}
void Yes(void) { cout << "Yes\\n"; }
void No(void) { cout << "No\\n"; }
void YES(void) { cout << "YES\\n"; }
void NO(void) { cout << "NO\\n"; }
template <typename T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> void vin(vector<T> &v) {
  ll len = v.size();
  for1(i, len) { cin >> v[i]; }
}
template <typename Head> void in_1(Head &h) { cin >> h; }
template <typename Head, typename... Tail> void in_1(Head &h, Tail &...t) {
  cin >> h;
  in_1(t...);
}
template <typename Head> void print_1(Head &&h) { cout << h << '\\n'; }
template <typename Head, typename... Tail> void print_1(Head &&h, Tail &&...t) {
  cout << h << ' ';
  print_1(t...);
}
//---------------------------------------------------------
const ll mod = 1000000007LL; // 10**9 + 7
struct mint {
  ll x; // typedef long long ll;
  mint(ll x = 0) : x((x % mod + mod) % mod) {}
  mint &operator+=(const mint a) {
    if ((x += a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator-=(const mint a) {
    if ((x += mod - a.x) >= mod)
      x -= mod;
    return *this;
  }
  mint &operator*=(const mint a) {
    (x *= a.x) %= mod;
    return *this;
  }
  mint operator+(const mint a) const {
    mint res(*this);
    return res += a;
  }
  mint operator-(const mint a) const {
    mint res(*this);
    return res -= a;
  }
  mint operator*(const mint a) const {
    mint res(*this);
    return res *= a;
  }
  mint pow(ll t) const {
    if (!t)
      return 1;
    mint a = pow(t >> 1);
    a *= a;
    if (t & 1)
      a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod - 2); }
  mint &operator/=(const mint a) { return (*this) *= a.inv(); }
  mint operator/(const mint a) const {
    mint res(*this);
    return res /= a;
  }
  friend ostream &operator<<(ostream &os, const mint &v) {
    os << v.x;
    return os;
  }
};
//---------------------------------------------------------
struct mintcomb {
  vector<mint> fact, ifact;
  mintcomb(int n) : fact(n + 1), ifact(n + 1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) {
      fact[i] = fact[i - 1] * i;
    }
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) {
      ifact[i - 1] = ifact[i] * i;
    }
  }
  mint permutation(int n, int k) {
    if (k < 0 || k > n)
      return 0;
    return fact[n] * ifact[n - k];
  }
  mint combination(int n, int k) {
    if (k < 0 || k > n)
      return 0;
    return fact[n] * ifact[k] * ifact[n - k];
  }
};
//---------------------------------------------------------
void solve() {
  ll N;
  in(N);
  vll V(N + 1);
  vll W(N + 1);
  for2(i, 1, N + 1) { in(V[i], W[i]); }
  ll Q;
  in(Q);
  vll Qv(Q);
  vll QL(Q);
  for1(i, Q) { in(Qv[i], QL[i]); }
  ll weightmax = 0;
  for1(i, Q) { chmax(weightmax, QL[i]); }

  // dp[頂点][重さ] = 価値の最大
  vector<vector<pll>> dp(N + 1);
  dp[0].emplace_back(0, 0); // (重さ,価値の最大)
  for2(i, 1, N + 1) {
    ll par = i / 2;
    map<ll, ll> m;
    for (auto &p : dp[par]) {
      ll k = p.first;
      chmax(m[k], p.second);
      k = p.first + W[i];
      if (k <= weightmax) {
        chmax(m[k], p.second + V[i]);
      }
    }
    ll maxval = -1;
    // dump(i, m);
    for (auto &p : m) {
      if (chmax(maxval, p.second)) {
        dp[i].emplace_back(p.first, p.second);
      }
    }
    // if (i % 10000 == 0) {
    //    dump(i, dp[i]);
    //}
  }

  for1(i, Q) {
    ll v = Qv[i];
    ll L = QL[i];
    // dump(v, dp[v]);
    if (dp[v].rbegin()->first <= L) {
      print(dp[v].rbegin()->second);
      continue;
    }
    ll lo = 0;
    ll hi = dp[v].size();
    while (hi - lo > 1) {
      ll mi = (hi + lo) / 2;
      if (dp[v][mi].first > L) {
        hi = mi;
      } else {
        lo = mi;
      }
    }
    print(dp[v][lo].second);
  }
}
//---------------------------------------------------------
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(16);
  cerr << fixed << setprecision(16);
  solve();
}