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

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repd(i, n) for (int i = (n)-1; i >= 0; --i)
#define repds(i, n) for (int i = (n); i > 0; --i)
#define loop(i, x, n) for (int i = (x); i < (n); ++i)
#define loops(i, x, n) for (int i = (x); i <= (n); ++i)
#define loopd(i, x, n) for (int i = (x); i > (n); --i)
#define loopds(i, x, n) for (int i = (x); i >= (n); --i)
#define itrep(i, a) for (auto i = begin(a); i != end(a); ++i)
#define itrepd(i, a) for (auto i = rbegin(a); i != rend(a); ++i)
#define each(i, x) for (auto &&i : x)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(a) ((int)a.size())
#define pow2(n) (n * n)
#define int ll
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
template <class T>
using priority_queuel = priority_queue<T, vector<T>, greater<T>>;
constexpr ll inf = static_cast<ll>(1e18);
constexpr int iinf = static_cast<int>(1e9);
constexpr double dinf = 1e10;
constexpr ld ldinf = 1e18;
constexpr double eps = 1e-9;
ll mod = static_cast<ll>(1e9 + 7);
template <class T, class... Args> constexpr void mins(T &a, Args... args) {
  a = min<T>({a, args...});
}
template <class T, class... Args> constexpr void maxs(T &a, Args... args) {
  a = max<T>({a, args...});
}
template <class F> class FixPoint : private F {
public:
  explicit constexpr FixPoint(F &&f) : F(std::forward<F>(f)) {}
  template <class... Args>
  constexpr decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};
template <class F> constexpr decltype(auto) funcs(F &&f) {
  return FixPoint<F>{std::forward<F>(f)};
}
template <class T> std::vector<T> vecs(int n, T &&val) {
  return std::vector<T>(std::forward<int>(n), std::forward<T>(val));
}
template <class... Args> decltype(auto) vecs(int n, Args &&...args) {
  return std::vector<decltype(vecs(std::forward<Args>(args)...))>(
      std::forward<int>(n), vecs(std::forward<Args>(args)...));
}
template <class V, class T> void fill(V &x, const T &val) { x = val; }
template <class V, class T> void fill(vector<V> &vec, const T &val) {
  for (auto &&v : vec)
    fill(v, val);
}

void solve() {
  int n;
  cin >> n;
  vector<int> mv(n + 1), mw(n + 1);
  reps(i, n) cin >> mv[i] >> mw[i];

  int e = min(n, 1LL << 9) + 1;
  auto dp = vecs(e, 100002, int(0));
  reps(i, e - 1) rep(j, 100001) {
    int p = i >> 1;
    maxs(dp[i][j], dp[p][j]);
    if (j >= mw[i])
      maxs(dp[i][j], dp[p][j - mw[i]] + mv[i]);
  }

  int q;
  cin >> q;
  rep(i, q) {
    int u, l;
    cin >> u >> l;
    vector<int> v, w;
    while (u >= e) {
      v.emplace_back(mv[u]);
      w.emplace_back(mw[u]);
      u >>= 1;
    }

    int ans = 0;
    rep(mask, 1 << sz(v)) {
      int sv = 0, sw = 0;
      rep(i, sz(v)) if ((mask >> i) & 1) {
        sv += v[i];
        sw += w[i];
      }

      if (sw <= l)
        maxs(ans, dp[u][l - sw] + sv);
    }
    cout << ans << '\\n';
  }
}

signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
  solve();
  cout.flush();
  return 0;
}

Error: TLE

Fixed submission:

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repd(i, n) for (int i = (n)-1; i >= 0; --i)
#define repds(i, n) for (int i = (n); i > 0; --i)
#define loop(i, x, n) for (int i = (x); i < (n); ++i)
#define loops(i, x, n) for (int i = (x); i <= (n); ++i)
#define loopd(i, x, n) for (int i = (x); i > (n); --i)
#define loopds(i, x, n) for (int i = (x); i >= (n); --i)
#define itrep(i, a) for (auto i = begin(a); i != end(a); ++i)
#define itrepd(i, a) for (auto i = rbegin(a); i != rend(a); ++i)
#define each(i, x) for (auto &&i : x)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(a) ((int)a.size())
#define pow2(n) (n * n)
#define int ll
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
template <class T>
using priority_queuel = priority_queue<T, vector<T>, greater<T>>;
constexpr ll inf = static_cast<ll>(1e18);
constexpr int iinf = static_cast<int>(1e9);
constexpr double dinf = 1e10;
constexpr ld ldinf = 1e18;
constexpr double eps = 1e-9;
ll mod = static_cast<ll>(1e9 + 7);
template <class T, class... Args> constexpr void mins(T &a, Args... args) {
  a = min<T>({a, args...});
}
template <class T, class... Args> constexpr void maxs(T &a, Args... args) {
  a = max<T>({a, args...});
}
template <class F> class FixPoint : private F {
public:
  explicit constexpr FixPoint(F &&f) : F(std::forward<F>(f)) {}
  template <class... Args>
  constexpr decltype(auto) operator()(Args &&...args) const {
    return F::operator()(*this, std::forward<Args>(args)...);
  }
};
template <class F> constexpr decltype(auto) funcs(F &&f) {
  return FixPoint<F>{std::forward<F>(f)};
}
template <class T> std::vector<T> vecs(int n, T &&val) {
  return std::vector<T>(std::forward<int>(n), std::forward<T>(val));
}
template <class... Args> decltype(auto) vecs(int n, Args &&...args) {
  return std::vector<decltype(vecs(std::forward<Args>(args)...))>(
      std::forward<int>(n), vecs(std::forward<Args>(args)...));
}
template <class V, class T> void fill(V &x, const T &val) { x = val; }
template <class V, class T> void fill(vector<V> &vec, const T &val) {
  for (auto &&v : vec)
    fill(v, val);
}

void solve() {
  int n;
  cin >> n;
  vector<int> mv(n + 1), mw(n + 1);
  reps(i, n) cin >> mv[i] >> mw[i];

  int q;
  cin >> q;
  rep(i, q) {
    int u, l;
    cin >> u >> l;
    vector<int> v1, w1, v2, w2;
    while (u != 0) {
      if (sz(v1) < 9) {
        v1.emplace_back(mv[u]);
        w1.emplace_back(mw[u]);
      } else {
        v2.emplace_back(mv[u]);
        w2.emplace_back(mw[u]);
      }
      u >>= 1;
    }

    vector<pair<int, int>> tmp1, tmp2;
    rep(mask, 1 << sz(v1)) {
      int v = 0, w = 0;
      rep(i, sz(v1)) if ((mask >> i) & 1) {
        v += v1[i];
        w += w1[i];
      }
      tmp1.emplace_back(w, v);
    }

    rep(mask, 1 << sz(v2)) {
      int v = 0, w = 0;
      rep(i, sz(v2)) if ((mask >> i) & 1) {
        v += v2[i];
        w += w2[i];
      }
      tmp2.emplace_back(w, v);
    }

    sort(all(tmp2));
    vector<pair<int, int>> val;
    rep(i, sz(tmp2)) {
      if (val.empty() || val.back().second < tmp2[i].second) {
        val.emplace_back(tmp2[i]);
      }
    }

    int ans = 0;
    rep(i, sz(tmp1)) {
      auto p = upper_bound(all(val), make_pair(l - tmp1[i].first, 0LL));
      if (p == val.begin())
        continue;
      --p;
      maxs(ans, tmp1[i].second + p->second);
    }
    cout << ans << '\\n';
  }
}

signed main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
  solve();
  cout.flush();
  return 0;
}