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

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end()))
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a)-1) / (b) + 1)
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template <typename T>
using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int DX[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
  while (b) {
    swap(a %= b, b);
  }
  return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template <typename T> void fin(T mes) {
  cout << mes << endl;
  exit(0);
}
template <typename T, typename U> bool chmax(T &a, const U &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T, typename U> bool chmin(T &a, const U &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
  os << "(" << rhs.first << ", " << rhs.second << ")";
  return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
  os << "{";
  for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
    os << *itr << (next(itr) != rhs.end() ? ", " : "");
  }
  os << "}";
  return os;
}
struct setup {
  static constexpr int PREC = 20;
  setup() {
    cout << fixed << setprecision(PREC);
    cerr << fixed << setprecision(PREC);
  };
} setup;

int h[550][110000];
signed main() {
  int N;
  cin >> N;
  vint V(N + 1), W(N + 1);
  reps(i, N) { cin >> V[i] >> W[i]; }
  int m = min(bit(9), N + 1);
  vector<vpint> WV(m);
  for (int i = 1; i < m; i++) {
    vint Vc, Wc;
    int v = i;
    while (v > 0) {
      Vc.push_back(V[v]), Wc.push_back(W[v]), v >>= 1;
    }
    rep(j, bit(Vc.size())) {
      int Vcc = 0, Wcc = 0;
      rep(k, Vc.size()) {
        if (j & bit(k)) {
          Vcc += Vc[k], Wcc += Wc[k];
        }
      }
      WV[i].push_back({Wcc, Vcc});
    }
    sort(all(WV[i]));
    for (int j = 1; j < WV[i].size(); j++) {
      chmax(WV[i][j].second, WV[i][j - 1].second);
    }
    int c = WV[i].size() - 1;
    for (int j = 110000 - 1; j >= 0; j--) {
      while (WV[i][c].first > j) {
        c--;
      }
      h[i][j] = WV[i][c].second;
    }
  }
  int Q;
  cin >> Q;
  rep(i, Q) {
    int v, L;
    cin >> v >> L;
    int ans = 0;
    vint Vc, Wc;
    while (v >= m) {
      Vc.push_back(V[v]), Wc.push_back(W[v]), v >>= 1;
    }
    rep(j, bit(Vc.size())) {
      int Vcc = 0, Wcc = 0;
      rep(k, Vc.size()) {
        if (j & bit(k)) {
          Vcc += Vc[k], Wcc += Wc[k];
        }
      }
      if (Wcc > L) {
        continue;
      }
      chmax(ans, h[v][L - Wcc] + Vcc);
    }
    cout << ans << endl;
  }
}


Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end()))
#define bit(n) (1LL << (n))
#define cdiv(a, b) (((a)-1) / (b) + 1)
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template <typename T>
using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int DX[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
  while (b) {
    swap(a %= b, b);
  }
  return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template <typename T> void fin(T mes) {
  cout << mes << endl;
  exit(0);
}
template <typename T, typename U> bool chmax(T &a, const U &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T, typename U> bool chmin(T &a, const U &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
  os << "(" << rhs.first << ", " << rhs.second << ")";
  return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
  os << "{";
  for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
    os << *itr << (next(itr) != rhs.end() ? ", " : "");
  }
  os << "}";
  return os;
}
struct setup {
  static constexpr int PREC = 20;
  setup() {
    cout << fixed << setprecision(PREC);
    cerr << fixed << setprecision(PREC);
  };
} setup;

struct fast_io {
  static constexpr int size_in = 1 << 25, size_out = 1 << 25;
  char data_in[size_in], data_out[size_out], *p_in, *p_out, s[30];
  fast_io() {
    fread(data_in, 1, size_in, stdin), p_in = data_in, p_out = data_out;
  }
  ~fast_io() { fwrite(data_out, 1, p_out - data_out, stdout); }
  void putchar(char x) { *p_out++ = x; }
  template <typename T> void putint(T x) {
    if (x < 0) {
      *p_out++ = '-', x = -x;
    }
    int i = 0;
    do {
      s[i++] = x % 10 + '0';
    } while (x /= 10);
    while (i--) {
      *p_out++ = s[i];
    }
  }
  template <typename T = int> T getint() {
    while (!isdigit(*p_in) && *p_in != '-') {
      p_in++;
    }
    bool negative = *p_in == '-';
    int ret = negative ? 0 : *p_in - '0';
    while (isdigit(*++p_in)) {
      (ret *= 10) += *p_in - '0';
    };
    return negative ? -ret : ret;
  }
} io;

signed main() {
  int N = io.getint();
  vint V(N + 1), W(N + 1);
  reps(i, N) { V[i] = io.getint(), W[i] = io.getint(); }
  int m = min(bit(9), N + 1);
  vector<vpint> WV(m);
  for (int i = 1; i < m; i++) {
    vint Vc, Wc;
    int v = i;
    while (v > 0) {
      Vc.push_back(V[v]), Wc.push_back(W[v]), v >>= 1;
    }
    rep(j, bit(Vc.size())) {
      int Vcc = 0, Wcc = 0;
      rep(k, Vc.size()) {
        if (j & bit(k)) {
          Vcc += Vc[k], Wcc += Wc[k];
        }
      }
      WV[i].push_back({Wcc, Vcc});
    }
    sort(all(WV[i]));
    for (int j = 1; j < WV[i].size(); j++) {
      chmax(WV[i][j].second, WV[i][j - 1].second);
    }
  }
  int Q;
  Q = io.getint();
  rep(i, Q) {
    int v, L;
    v = io.getint(), L = io.getint();
    int ans = 0;
    vint Vc, Wc;
    while (v >= m) {
      Vc.push_back(V[v]), Wc.push_back(W[v]), v >>= 1;
    }
    rep(j, bit(Vc.size())) {
      int Vcc = 0, Wcc = 0;
      rep(k, Vc.size()) {
        if (j & bit(k)) {
          Vcc += Vc[k], Wcc += Wc[k];
        }
      }
      if (Wcc > L) {
        continue;
      }
      chmax(ans,
            (lower_bound(all(WV[v]), pint(L - Wcc, LLONG_MAX)) - 1)->second +
                Vcc);
    }
    io.putint(ans), io.putchar('\\n');
  }
}