Problem p02648 (C++) — buggy submission, verdict: Runtime Error

#line 2 "codes/header.hpp"

//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H

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

// varibable settings
const long long INF = 1e18;
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (ll i = (ll)((b)-1); i >= (ll)(a); --i)
#define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define ub upper_bound
#define lb lower_bound
#define lpos(A, x) (lower_bound(all(A), x) - A.begin())
#define upos(A, x) (upper_bound(all(A), x) - A.begin())
template <class T> inline void chmax(T &a, const T &b) {
  if ((a) < (b))
    (a) = (b);
}
template <class T> inline void chmin(T &a, const T &b) {
  if ((a) > (b))
    (a) = (b);
}
template <typename X, typename T> auto make_table(X x, T a) {
  return vector<T>(x, a);
}
template <typename X, typename Y, typename Z, typename... Zs>
auto make_table(X x, Y y, Z z, Zs... zs) {
  auto cont = make_table(y, z, zs...);
  return vector<decltype(cont)>(x, cont);
}

#define cdiv(a, b) (((a) + (b)-1) / (b))
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x)                                                                 \\
  sort(all(x));                                                                \\
  x.erase(unique(all(x)), x.end())
#define slice(l, r) substr(l, r - l)

typedef long long ll;
typedef long double ld;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;

template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
void check_input() {
  assert(cin.eof() == 0);
  int tmp;
  cin >> tmp;
  assert(cin.eof() == 1);
}

#if defined(PCM) || defined(LOCAL)
#else
#define dump(...) ;
#define dump_1d(...) ;
#define dump_2d(...) ;
#define cerrendl ;
#endif

#endif /* HEADER_H */
//%snippet.end()%
#line 2 "codes/solve.cpp"
template <class T = ll> using vec = vector<T>;
struct Fast {
  Fast() {
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;

int solve() {
  int n;
  cin >> n;
  dump(n);
  vec<int> v(n), w(n);
  rep(i, n) { cin >> v[i] >> w[i]; }
  int n1 = 10;
  vec<vec<ll>> dp = make_table((1 << n1), 1e5 + 1, 0LL);
  dp[0][w[0]] = v[0];
  rep(j, 1, 1e5 + 1) chmax(dp[0][j], dp[0][j - 1]);
  rep(i, 1, min(1 << n1, n)) {
    rep(j, 1e5 + 1) {
      chmax(dp[i][j], dp[(i - 1) / 2][j]);
      if (j + w[i] < 1e5 + 1)
        chmax(dp[i][j + w[i]], dp[(i - 1) / 2][j] + v[i]);
    }
    rep(j, 1, 1e5 + 1) chmax(dp[i][j], dp[i][j - 1]);
  }

  int Q;
  cin >> Q;
  dump(Q);
  while (Q--) {
    int u;
    cin >> u;
    u--;
    int L;
    cin >> L;
    dump(u, L);

    if (u < (1 << n1) - 1) {
      cout << dp[u][L] << endl;
    } else {
      vec<int> vs;
      while (u > 1022) {
        vs.pb(u);
        u = (u - 1) / 2;
      }
      int m = sz(vs);
      ll ans = 0;
      rep(s, 1 << m) {
        ll sw = 0, sv = 0;
        rep(i, m) {
          if (s >> i & 1) {
            sv += v[vs[i]];
            sw += w[vs[i]];
          }
        }
        if (L - sw >= 0)
          chmax(ans, sv + dp[u][(L - sw)]);
      }
      cout << ans << endl;
    }
  }
  return 0;
}

int main() { /*{{{*/
  solve();
  check_input();
  return 0;
} /*}}}*/


Error: 0

Fixed submission:

#line 2 "codes/header.hpp"

//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H

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

// varibable settings
const long long INF = 1e18;
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (ll i = (ll)((b)-1); i >= (ll)(a); --i)
#define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define ub upper_bound
#define lb lower_bound
#define lpos(A, x) (lower_bound(all(A), x) - A.begin())
#define upos(A, x) (upper_bound(all(A), x) - A.begin())
template <class T> inline void chmax(T &a, const T &b) {
  if ((a) < (b))
    (a) = (b);
}
template <class T> inline void chmin(T &a, const T &b) {
  if ((a) > (b))
    (a) = (b);
}
template <typename X, typename T> auto make_table(X x, T a) {
  return vector<T>(x, a);
}
template <typename X, typename Y, typename Z, typename... Zs>
auto make_table(X x, Y y, Z z, Zs... zs) {
  auto cont = make_table(y, z, zs...);
  return vector<decltype(cont)>(x, cont);
}

#define cdiv(a, b) (((a) + (b)-1) / (b))
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x)                                                                 \\
  sort(all(x));                                                                \\
  x.erase(unique(all(x)), x.end())
#define slice(l, r) substr(l, r - l)

typedef long long ll;
typedef long double ld;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;

template <typename T> using PQ = priority_queue<T, vector<T>, greater<T>>;
void check_input() {
  assert(cin.eof() == 0);
  int tmp;
  cin >> tmp;
  assert(cin.eof() == 1);
}

#if defined(PCM) || defined(LOCAL)
#else
#define dump(...) ;
#define dump_1d(...) ;
#define dump_2d(...) ;
#define cerrendl ;
#endif

#endif /* HEADER_H */
//%snippet.end()%
#line 2 "codes/solve.cpp"
template <class T = ll> using vec = vector<T>;
struct Fast {
  Fast() {
    std::cin.tie(0);
    ios::sync_with_stdio(false);
  }
} fast;

int solve() {
  int n;
  cin >> n;
  dump(n);
  vec<int> v(n), w(n);
  rep(i, n) { cin >> v[i] >> w[i]; }
  dump(v);
  dump(w);
  int n1 = n / 2;
  vec<vec<ll>> dp = make_table((1 << n1), 1e5 + 1, 0LL);
  dp[0][w[0]] = v[0];
  rep(j, 1, 1e5 + 1) chmax(dp[0][j], dp[0][j - 1]);
  rep(i, 1, min(1 << n1, n)) {
    rep(j, 1e5 + 1) {
      chmax(dp[i][j], dp[(i - 1) / 2][j]);
      if (j + w[i] < 1e5 + 1)
        chmax(dp[i][j + w[i]], dp[(i - 1) / 2][j] + v[i]);
    }
    rep(j, 1, 1e5 + 1) chmax(dp[i][j], dp[i][j - 1]);
  }

  int Q;
  cin >> Q;
  dump(Q);
  while (Q--) {
    int u;
    cin >> u;
    u--;
    int L;
    cin >> L;
    dump(u, L);

    if (u < (1 << n1) - 1) {
      cout << dp[u][L] << endl;
    } else {
      vec<int> vs;
      while (u > (1 << n1) - 2) {
        vs.pb(u);
        u = (u - 1) / 2;
      }
      dump(vs);
      dump(u);
      int m = sz(vs);
      ll ans = 0;
      rep(s, 1 << m) {
        ll sw = 0, sv = 0;
        rep(i, m) {
          if (s >> i & 1) {
            sv += v[vs[i]];
            sw += w[vs[i]];
          }
        }
        dump(sv);
        if (L - sw >= 0)
          chmax(ans, sv + dp[u][(L - sw)]);
      }
      cout << ans << endl;
    }
  }
  return 0;
}

int main() { /*{{{*/
  solve();
  check_input();
  return 0;
} /*}}}*/