Problem p02648 (C++)

Buggy submission (status: Time Limit Exceeded):
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
// #pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << '\n'
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
// #define int long long
#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v)                                                         \
  REP(i, v.size()) cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
  if (a > b)
    a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
  if (a < b)
    a = b;
}
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef array<int, 3> arr3;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;

int N;

vector<int> G[500050];
int par[500050];
int V[500050], W[500050];
int dp[(1 << 9) + 2][100010];
// int calc(int n, int L) {
//	vector<int>v, w;
//	while (true) {
//		v.push_back(V[n]);
//		w.push_back(W[n]);
//		if (par[n] == n)break;
//		n = par[n];
//	}
//	int siz = v.size();
//	REP(i, siz + 1)REP(j, L + 1)dp[i][j] = 0;
//	REP(i, siz)REP(j, L + 1) {
//		chmax(dp[i + 1][j], dp[i][j]);
//		if (j + w[i] <= L) {
//			chmax(dp[i + 1][j + w[i]], dp[i][j] + v[i]);
//		}
//	}
//	ll ans = 0;
//	REP(j, L + 1)chmax(ans, dp[siz][j]);
//	return ans;
// }
int cv[100010], cw[100010];
void solve() {
  cin >> N;
  REP(i, N) {
    cin >> V[i] >> W[i];
    if (i == 0)
      par[i] = i;
    else
      par[i] = (i - 1) / 2;
  }
  int small_n = min(1 << 8, N);
  REP(i, small_n) {
    if (i == 0) {
      dp[0][W[i]] = V[i];
      REP(j, 100001) chmax(dp[0][j + 1], dp[0][j]);
    } else {
      int p = par[i];
      REP(j, 100010) {
        chmax(dp[i][j], dp[p][j]);
        if (j + W[i] <= 100000)
          chmax(dp[i][j + W[i]], dp[p][j] + V[i]);
      }
      REP(j, 100001) chmax(dp[i][j + 1], dp[i][j]);
    }
    // REP(j, 100010) {
    //	chmax(dp[i*2+2][j], dp[i][j]);
    //	if (j + W[i] <= 100000)chmax(dp[i*2+2][j + W[i]], dp[i][j] + V[i]);
    //	chmax(dp[i * 2+1][j], dp[i][j]);
    //	if (j + W[i] <= 100000)chmax(dp[i*2+1][j + W[i]], dp[i][j] + V[i]);
    // }
    // REP(j, 100001) {
    //	chmax(dp[i*2+2][j + 1], dp[i*2+2][j]);
    //	chmax(dp[i * 2+1][j + 1], dp[i * 2+1][j]);
    // }
  }
  int Q;
  cin >> Q;
  REP(_, Q) {
    int v, L;
    cin >> v >> L;
    if (v <= small_n)
      print(dp[v - 1][L]);
    else {
      int idx = 0;
      v--;
      int num = v;
      while (num >= small_n) {
        cv[idx] = V[num];
        cw[idx] = W[num];
        idx++;
        num = par[num];
      }
      int p = num;
      ll res = 0;
      REP(bit, 1 << idx) {
        int sumw = 0;
        ll sumv = 0;
        REP(i, idx) {
          if (bit & (1 << i)) {
            sumw += cw[i];
            sumv += cv[i];
          }
          if (sumw > L)
            break;
        }
        if (sumw > L)
          continue;
        int rem = L - sumw;
        chmax(res, sumv + dp[p][rem]);
      }
      print(res);
    }
  }
}

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  mt.seed((int)(time(0)));
  // REP(_, 10000)test();
  // int q;
  // cin >> q;
  // while (q--)
  solve();
}


Fixed submission:
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
// #pragma warning(disable : 4996)

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64
#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m - 1; i >= n; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << '\n'
#define pe(x) cout << (x) << " "
#define DEBUG(x) cout << #x << ": " << x << endl
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
// #define int long long
#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v)                                                         \
  REP(i, v.size()) cout << v[i] << ((i == v.size() - 1) ? "\n" : " ")
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
  if (a > b)
    a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
  if (a < b)
    a = b;
}
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef array<int, 3> arr3;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 1e9 + 7;
constexpr int MAX = 500050;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e18 + 1;
constexpr int INF = 1e9 + 1;

int N;

vector<int> G[500050];
int par[500050];
int V[500050], W[500050];
int dp[(1 << 9) + 2][100010];
// int calc(int n, int L) {
//	vector<int>v, w;
//	while (true) {
//		v.push_back(V[n]);
//		w.push_back(W[n]);
//		if (par[n] == n)break;
//		n = par[n];
//	}
//	int siz = v.size();
//	REP(i, siz + 1)REP(j, L + 1)dp[i][j] = 0;
//	REP(i, siz)REP(j, L + 1) {
//		chmax(dp[i + 1][j], dp[i][j]);
//		if (j + w[i] <= L) {
//			chmax(dp[i + 1][j + w[i]], dp[i][j] + v[i]);
//		}
//	}
//	ll ans = 0;
//	REP(j, L + 1)chmax(ans, dp[siz][j]);
//	return ans;
// }
int cv[100010], cw[100010];
void solve() {
  cin >> N;
  REP(i, N) {
    cin >> V[i] >> W[i];
    if (i == 0)
      par[i] = i;
    else
      par[i] = (i - 1) / 2;
  }
  int small_n = min(1 << 9, N);
  REP(i, small_n) {
    if (i == 0) {
      dp[0][W[i]] = V[i];
      REP(j, 100001) chmax(dp[0][j + 1], dp[0][j]);
    } else {
      int p = par[i];
      REP(j, 100010) {
        chmax(dp[i][j], dp[p][j]);
        if (j + W[i] <= 100000)
          chmax(dp[i][j + W[i]], dp[p][j] + V[i]);
      }
      REP(j, 100001) chmax(dp[i][j + 1], dp[i][j]);
    }
    // REP(j, 100010) {
    //	chmax(dp[i*2+2][j], dp[i][j]);
    //	if (j + W[i] <= 100000)chmax(dp[i*2+2][j + W[i]], dp[i][j] + V[i]);
    //	chmax(dp[i * 2+1][j], dp[i][j]);
    //	if (j + W[i] <= 100000)chmax(dp[i*2+1][j + W[i]], dp[i][j] + V[i]);
    // }
    // REP(j, 100001) {
    //	chmax(dp[i*2+2][j + 1], dp[i*2+2][j]);
    //	chmax(dp[i * 2+1][j + 1], dp[i * 2+1][j]);
    // }
  }
  int Q;
  cin >> Q;
  REP(_, Q) {
    int v, L;
    cin >> v >> L;
    if (v <= small_n)
      print(dp[v - 1][L]);
    else {
      int idx = 0;
      v--;
      int num = v;
      while (num >= small_n) {
        cv[idx] = V[num];
        cw[idx] = W[num];
        idx++;
        num = par[num];
      }
      int p = num;
      ll res = 0;
      REP(bit, 1 << idx) {
        int sumw = 0;
        ll sumv = 0;
        REP(i, idx) {
          if (bit & (1 << i)) {
            sumw += cw[i];
            sumv += cv[i];
          }
          if (sumw > L)
            break;
        }
        if (sumw > L)
          continue;
        int rem = L - sumw;
        chmax(res, sumv + dp[p][rem]);
      }
      print(res);
    }
  }
}

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  mt.seed((int)(time(0)));
  // REP(_, 10000)test();
  // int q;
  // cin >> q;
  // while (q--)
  solve();
}