Problem p02648 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
using ll = long long;
using ull = unsigned long long;

namespace utils {
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
template <class T, class Compare>
using p_queue = priority_queue<T, vector<T>, Compare>;
template <class T> using min_queue = p_queue<T, greater<T>>;
template <class T> using max_queue = p_queue<T, less<T>>;

template <class T> inline bool UPMIN(T &X, const T &A) {
  if (X > A) {
    X = A;
    return true;
  }
  return false;
}
template <class T> inline bool UPMAX(T &X, const T &A) {
  if (X < A) {
    X = A;
    return true;
  }
  return false;
}

template <class T> vector<T> VEC(int n, T t) { return vector<T>(n, t); }
template <class... Ts> auto VEC(int n, Ts... ts) {
  return vector<decltype(VEC(ts...))>(n, VEC(ts...));
}

template <class S, class T> istream &operator>>(istream &is, tuple<S, T> &t) {
  return is >> get<0>(t) >> get<1>(t);
}

template <class S, class T, class U>
istream &operator>>(istream &is, tuple<S, T, U> &t) {
  return is >> get<0>(t) >> get<1>(t) >> get<2>(t);
}

template <class S, class T>
ostream &operator<<(ostream &os, const tuple<S, T> &t) {
  return os << get<0>(t) << ' ' << get<1>(t);
}

template <class S, class T, class U>
ostream &operator<<(ostream &os, const tuple<S, T, U> &t) {
  return os << get<0>(t) << ' ' << get<1>(t) << ' ' << get<2>(t);
}

template <class T> istream &operator>>(istream &is, vector<T> &v) {
  for (auto &&x : v) {
    is >> x;
  }
  return is;
}

template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  auto p = v.begin();
  assert(p != v.end());
  os << *p++;
  while (p != v.end()) {
    os << ' ' << *p++;
  }
  return os;
}

template <class T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
  auto p = v.begin();
  assert(p != v.end());
  os << *p++;
  while (p != v.end()) {
    os << '\n' << *p++;
  }
  return os;
}

template <class... Ts>
ostream &operator<<(ostream &os, const vector<tuple<Ts...>> &v) {
  auto p = v.begin();
  assert(p != v.end());
  os << *p++;
  while (p != v.end()) {
    os << '\n' << *p++;
  }
  return os;
}

constexpr long long INFLL = 1'000'000'000'000'000'000ll;
constexpr int INF = 1'000'000'000;
constexpr double PI = 3.14'159'265'358'973;
constexpr double EPS = 1e-10;
} // namespace utils
using namespace utils;

class solver {
  istream &is;
  ostream &os;

public:
  solver(istream &I, ostream &O) : is(I), os(O) {}

  int N;
  vector<tuple<ll, ll>> VW;

  vector<ll> ans;
  vector<vector<ll>> dp;
  bool input() {
    is >> N;
    VW.resize(N);
    is >> VW;
    dp.resize(513, VEC(100'010, 0ll));
    return !!is;
  }

  void dfs_knop(int v, int p) {
    if (v > 512)
      return;
    if (v > N)
      return;

    ll val, wei;
    tie(val, wei) = VW[v - 1];
    for (ll w = 0; w < dp[v].size(); ++w) {
      dp[v][w] = dp[p][w];

      if (w - wei >= 0) {
        UPMAX(dp[v][w], dp[p][w - wei] + val);
      }
      if (w > 0) {
        UPMAX(dp[v][w], dp[v][w - 1]);
      }
    } // end i

    dfs_knop(2 * v, v);
    dfs_knop(2 * v + 1, v);
  }

  ll calc(int v, ll l) const {
    vector<tuple<ll, ll>> items;
    while (v > 2) {
      items.emplace_back(VW[v - 1]);
      v /= 2;
    }
    ll mx = dp[v][l];

    int f = 1 << items.size();
    for (int i = 1; i < f; ++i) {
      ll vs, ws;
      vs = ws = 0;
      for (int k = 0; k < items.size(); ++k) {
        if (i & (1 << k)) {
          vs += get<0>(items[k]);
          ws += get<1>(items[k]);
        }
      } // end k
      if (l - ws >= 0)
        UPMAX(mx, dp[v][l - ws] + vs);
    } // end i
    return mx;
  }

  void run();
};

int main(int argc, char *argv[]) {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << setprecision(16) << scientific;
#ifdef XELMH
  string test_cases = "test_D.txt";
  cerr << test_cases << " -->" << endl;
  auto fs = fstream(test_cases, fstream::in);
  int loop = 0;
  while (fs) {
    loop++;
    cout << '#' << loop << "#------\n";
    solver(fs, cout).run();
  }
  if (loop <= 1) {
    cout << "===" << endl;
    while (cin)
      solver(cin, cout).run();
  }
#else
  solver(cin, cout).run();
#endif
  return 0;
}

void solver::run() {
  if (!input())
    return;
  dfs_knop(1, 0);

  int Q;
  is >> Q;
  for (int i = 0; i < Q; ++i) {
    ll v, l;
    is >> v >> l;
    cout << calc(v, l) << '\n';
  } // end i
}


Fixed submission:
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
using ll = long long;
using ull = unsigned long long;

namespace utils {
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
template <class T, class Compare>
using p_queue = priority_queue<T, vector<T>, Compare>;
template <class T> using min_queue = p_queue<T, greater<T>>;
template <class T> using max_queue = p_queue<T, less<T>>;

template <class T> inline bool UPMIN(T &X, const T &A) {
  if (X > A) {
    X = A;
    return true;
  }
  return false;
}
template <class T> inline bool UPMAX(T &X, const T &A) {
  if (X < A) {
    X = A;
    return true;
  }
  return false;
}

template <class T> vector<T> VEC(int n, T t) { return vector<T>(n, t); }
template <class... Ts> auto VEC(int n, Ts... ts) {
  return vector<decltype(VEC(ts...))>(n, VEC(ts...));
}

template <class S, class T> istream &operator>>(istream &is, tuple<S, T> &t) {
  return is >> get<0>(t) >> get<1>(t);
}

template <class S, class T, class U>
istream &operator>>(istream &is, tuple<S, T, U> &t) {
  return is >> get<0>(t) >> get<1>(t) >> get<2>(t);
}

template <class S, class T>
ostream &operator<<(ostream &os, const tuple<S, T> &t) {
  return os << get<0>(t) << ' ' << get<1>(t);
}

template <class S, class T, class U>
ostream &operator<<(ostream &os, const tuple<S, T, U> &t) {
  return os << get<0>(t) << ' ' << get<1>(t) << ' ' << get<2>(t);
}

template <class T> istream &operator>>(istream &is, vector<T> &v) {
  for (auto &&x : v) {
    is >> x;
  }
  return is;
}

template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
  auto p = v.begin();
  assert(p != v.end());
  os << *p++;
  while (p != v.end()) {
    os << ' ' << *p++;
  }
  return os;
}

template <class T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
  auto p = v.begin();
  assert(p != v.end());
  os << *p++;
  while (p != v.end()) {
    os << '\n' << *p++;
  }
  return os;
}

template <class... Ts>
ostream &operator<<(ostream &os, const vector<tuple<Ts...>> &v) {
  auto p = v.begin();
  assert(p != v.end());
  os << *p++;
  while (p != v.end()) {
    os << '\n' << *p++;
  }
  return os;
}

constexpr long long INFLL = 1'000'000'000'000'000'000ll;
constexpr int INF = 1'000'000'000;
constexpr double PI = 3.14'159'265'358'973;
constexpr double EPS = 1e-10;
} // namespace utils
using namespace utils;

class solver {
  istream &is;
  ostream &os;

public:
  solver(istream &I, ostream &O) : is(I), os(O) {}

  int N;
  vector<tuple<ll, ll>> VW;

  vector<ll> ans;
  vector<vector<ll>> dp;
  bool input() {
    is >> N;
    VW.resize(N);
    is >> VW;
    dp.resize(513, VEC(100'010, 0ll));
    return !!is;
  }

  void dfs_knop(int v, int p) {
    if (v > 512)
      return;
    if (v > N)
      return;

    ll val, wei;
    tie(val, wei) = VW[v - 1];
    for (ll w = 0; w < dp[v].size(); ++w) {
      dp[v][w] = dp[p][w];

      if (w - wei >= 0) {
        UPMAX(dp[v][w], dp[p][w - wei] + val);
      }
      if (w > 0) {
        UPMAX(dp[v][w], dp[v][w - 1]);
      }
    } // end i

    dfs_knop(2 * v, v);
    dfs_knop(2 * v + 1, v);
  }

  ll calc(int v, ll l) const {
    vector<tuple<ll, ll>> items;
    while (v > 512) {
      items.emplace_back(VW[v - 1]);
      v /= 2;
    }
    ll mx = dp[v][l];

    int f = 1 << items.size();
    for (int i = 1; i < f; ++i) {
      ll vs, ws;
      vs = ws = 0;
      for (int k = 0; k < items.size(); ++k) {
        if (i & (1 << k)) {
          vs += get<0>(items[k]);
          ws += get<1>(items[k]);
        }
      } // end k
      if (l - ws >= 0)
        UPMAX(mx, dp[v][l - ws] + vs);
    } // end i
    return mx;
  }

  void run();
};

int main(int argc, char *argv[]) {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << setprecision(16) << scientific;
#ifdef XELMH
  string test_cases = "test_D.txt";
  cerr << test_cases << " -->" << endl;
  auto fs = fstream(test_cases, fstream::in);
  int loop = 0;
  while (fs) {
    loop++;
    cout << '#' << loop << "#------\n";
    solver(fs, cout).run();
  }
  if (loop <= 1) {
    cout << "===" << endl;
    while (cin)
      solver(cin, cout).run();
  }
#else
  solver(cin, cout).run();
#endif
  return 0;
}

void solver::run() {
  if (!input())
    return;
  dfs_knop(1, 0);

  int Q;
  is >> Q;
  for (int i = 0; i < Q; ++i) {
    ll v, l;
    is >> v >> l;
    cout << calc(v, l) << '\n';
  } // end i
}