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

#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(), (a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define C complex<ld>
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i, j, k) mkp(i, mkp(j, k))
#define rng(i, s, n) for (int i = (s); i < (n); i++)
#define rep(i, n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define vi vec<int>
#define pb emplace_back
#define siz(a) (int)(a).size()
#define crdcomp(b)                                                             \\
  sort(all((b)));                                                              \\
  (b).erase(unique(all((b))), (b).end())
#define getidx(b, i) lower_bound(all(b), (i)) - b.begin()
#define ssp(i, n) (i == (int)(n)-1 ? "\\n" : " ")
#define ctoi(c) (int)(c - '0')
#define itoc(c) (char)(c + '0')
#define cyes printf("Yes\\n")
#define cno printf("No\\n")
#define cdf(n)                                                                 \\
  int quetimes_ = (n);                                                         \\
  rep(qq123_, quetimes_)
#define gcj printf("Case #%lld: ", qq123_ + 1)
#define readv(a, n)                                                            \\
  a.resize(n, 0);                                                              \\
  rep(i, (n)) a[i] = read()
// #define endl "\\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
constexpr int dx[] = {-1, 1, 0, 0}, dy[] = {0, 0, -1, 1};
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
ll read() {
  ll u, k = scanf("%lld", &u);
  return u;
}
string reads() {
  string s;
  cin >> s;
  return s;
}
H readh(bool g = 0) {
  H u;
  int k = scanf("%lld %lld", &u.fs, &u.sc);
  if (g)
    u.fs--, u.sc--;
  return u;
}
bool ina(H t, int h, int w) {
  return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w;
}
bool ina(int t, int l, int r) { return l <= t && t < r; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll popcount(ll x) {
  int sum = 0;
  for (int i = 0; i < 60; i++)
    if ((1ll << i) & x)
      sum++;
  return sum;
}
class mint {
public:
  ll v;
  mint(ll v = 0) { s(v % mod); }
  constexpr static int mod = 1e9 + 7;
  constexpr static int fn_ = 500005;
  static mint fact[fn_], comp[fn_];
  mint pow(mint x) const {
    mint b(v), c(1);
    while (x.v) {
      if (x.v & 1)
        c *= b;
      b *= b;
      x.v >>= 1;
    }
    return c;
  }
  inline mint &s(int vv) {
    v = vv < mod ? vv : vv - mod;
    return *this;
  }
  inline mint inv() const { return pow(mod - 2); }
  inline mint operator-() const { return mint() - *this; }
  inline mint &operator+=(const mint b) { return s(v + b.v); }
  inline mint &operator-=(const mint b) { return s(v + mod - b.v); }
  inline mint &operator*=(const mint b) {
    v = v * b.v % mod;
    return *this;
  }
  inline mint &operator/=(const mint b) { return (*this) *= b.inv(); }
  inline mint operator+(const mint b) const { return mint(v) += b; }
  inline mint operator-(const mint b) const { return mint(v) -= b; }
  inline mint operator*(const mint b) const { return mint(v) *= b; }
  inline mint operator/(const mint b) const { return mint(v) /= b; }
  friend ostream &operator<<(ostream &os, const mint &m) { return os << m.v; }
  friend istream &operator>>(istream &is, mint &m) {
    int x;
    is >> x;
    m = mint(x);
    return is;
  }
  bool operator<(const mint &r) const { return v < r.v; }
  bool operator>(const mint &r) const { return v > r.v; }
  bool operator<=(const mint &r) const { return v <= r.v; }
  bool operator>=(const mint &r) const { return v >= r.v; }
  bool operator==(const mint &r) const { return v == r.v; }
  bool operator!=(const mint &r) const { return v != r.v; }
  explicit operator bool() const { return v; }
  explicit operator int() const { return v; }
  mint comb(mint k) {
    if (k > *this)
      return mint();
    if (!fact[0])
      combinit();
    if (v >= fn_) {
      if (k > *this - k)
        k = *this - k;
      mint tmp(1);
      for (int i = v; i >= v - k.v + 1; i--)
        tmp *= mint(i);
      return tmp * comp[k.v];
    } else
      return fact[v] * comp[k.v] * comp[v - k.v];
  } // nCk
  static void combinit() {
    fact[0] = 1;
    for (int i = 1; i < fn_; i++)
      fact[i] = fact[i - 1] * mint(i);
    comp[fn_ - 1] = fact[fn_ - 1].inv();
    for (int i = fn_ - 2; i >= 0; i--)
      comp[i] = comp[i + 1] * mint(i + 1);
  }
};
mint mint::fact[fn_], mint::comp[fn_];
//--------------------------------------------------------------

//---------------------------------------------------------------------
int v[400000], w[400000];
int dep[400000];
vec<H> dp[10000];
signed main() {
  int n, q;
  n = read();
  rng(i, 1, n + 1) {
    v[i] = read(), w[i] = read();
    if (i > 1)
      dep[i] = dep[i / 2] + 1;
  }

  rng(i, 1, n + 1) {
    if (dep[i] > 9)
      break;

    int pos = i;
    int l = 1e5;

    vec<H> r;
    while (pos >= 1) {
      r.pb(v[pos], w[pos]);
      pos = pos / 2;
    }
    vec<H> b(1, H{0, 0});

    auto F = [&](int li, int ri, vec<H> &a) {
      rng(i, li, ri) {
        int t = 0;
        vec<H> c = a;

        rep(j, siz(a)) {
          if (a[j].sc + r[i].sc <= l)
            c.pb(a[j].fs + r[i].fs, a[j].sc + r[i].sc);
        }
        a = c;
      }
    };

    F(0, siz(r), b);

    sort(all(b), [](H x, H y) {
      if (x.sc != y.sc)
        return x.sc < y.sc;
      return x.fs > y.fs;
    });

    vec<H> c;
    int mx = -1;
    rep(i, siz(b)) {
      if (mx < b[i].fs) {
        c.pb(b[i]);
        mx = b[i].fs;
      }
    }

    dp[i] = c;
  }

  q = read();
  cdf(q) {
    int pos = read();
    int l = read();

    if (dep[pos] <= 9) {

      cout << (*prev((partition_point(all(dp[pos]),
                                      [&](H x) { return x.sc <= l; }))))
                  .fs
           << endl;
      continue;
    }

    vec<H> r;
    while (dep[pos] > 9) {
      r.pb(v[pos], w[pos]);
      pos = pos / 2;
    }

    vec<H> a(1, H{0, 0}), &c = dp[pos];

    auto F = [&](int li, int ri, vec<H> &a) {
      rng(i, li, ri) {
        int t = 0;
        vec<H> c = a;

        rep(j, siz(a)) {
          if (a[j].sc + r[i].sc <= l)
            c.pb(a[j].fs + r[i].fs, a[j].sc + r[i].sc);
        }
        a = c;
      }
    };

    F(0, siz(r), a);

    int ans = 0;
    rep(i, siz(a)) {
      if (a[i].sc > l)
        continue;

      chmax(ans,
            a[i].fs + (*prev((partition_point(
                           all(c), [&](H x) { return x.sc + a[i].sc <= l; }))))
                          .fs);
    }
    printf("%lld\\n", ans);
  }
}

Error: TLE

Fixed submission:

#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(), (a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define C complex<ld>
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i, j, k) mkp(i, mkp(j, k))
#define rng(i, s, n) for (int i = (s); i < (n); i++)
#define rep(i, n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define vi vec<int>
#define pb emplace_back
#define siz(a) (int)(a).size()
#define crdcomp(b)                                                             \\
  sort(all((b)));                                                              \\
  (b).erase(unique(all((b))), (b).end())
#define getidx(b, i) lower_bound(all(b), (i)) - b.begin()
#define ssp(i, n) (i == (int)(n)-1 ? "\\n" : " ")
#define ctoi(c) (int)(c - '0')
#define itoc(c) (char)(c + '0')
#define cyes printf("Yes\\n")
#define cno printf("No\\n")
#define cdf(n)                                                                 \\
  int quetimes_ = (n);                                                         \\
  rep(qq123_, quetimes_)
#define gcj printf("Case #%lld: ", qq123_ + 1)
#define readv(a, n)                                                            \\
  a.resize(n, 0);                                                              \\
  rep(i, (n)) a[i] = read()
// #define endl "\\n"
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr ld EPS = 1e-10;
constexpr ll inf = 3 * 1e18;
constexpr int Inf = 15 * 1e8;
constexpr int dx[] = {-1, 1, 0, 0}, dy[] = {0, 0, -1, 1};
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
ll read() {
  ll u, k = scanf("%lld", &u);
  return u;
}
string reads() {
  string s;
  cin >> s;
  return s;
}
H readh(bool g = 0) {
  H u;
  int k = scanf("%lld %lld", &u.fs, &u.sc);
  if (g)
    u.fs--, u.sc--;
  return u;
}
bool ina(H t, int h, int w) {
  return 0 <= t.fs && t.fs < h && 0 <= t.sc && t.sc < w;
}
bool ina(int t, int l, int r) { return l <= t && t < r; }
ll gcd(ll i, ll j) { return j ? gcd(j, i % j) : i; }
ll popcount(ll x) {
  int sum = 0;
  for (int i = 0; i < 60; i++)
    if ((1ll << i) & x)
      sum++;
  return sum;
}
class mint {
public:
  ll v;
  mint(ll v = 0) { s(v % mod); }
  constexpr static int mod = 1e9 + 7;
  constexpr static int fn_ = 500005;
  static mint fact[fn_], comp[fn_];
  mint pow(mint x) const {
    mint b(v), c(1);
    while (x.v) {
      if (x.v & 1)
        c *= b;
      b *= b;
      x.v >>= 1;
    }
    return c;
  }
  inline mint &s(int vv) {
    v = vv < mod ? vv : vv - mod;
    return *this;
  }
  inline mint inv() const { return pow(mod - 2); }
  inline mint operator-() const { return mint() - *this; }
  inline mint &operator+=(const mint b) { return s(v + b.v); }
  inline mint &operator-=(const mint b) { return s(v + mod - b.v); }
  inline mint &operator*=(const mint b) {
    v = v * b.v % mod;
    return *this;
  }
  inline mint &operator/=(const mint b) { return (*this) *= b.inv(); }
  inline mint operator+(const mint b) const { return mint(v) += b; }
  inline mint operator-(const mint b) const { return mint(v) -= b; }
  inline mint operator*(const mint b) const { return mint(v) *= b; }
  inline mint operator/(const mint b) const { return mint(v) /= b; }
  friend ostream &operator<<(ostream &os, const mint &m) { return os << m.v; }
  friend istream &operator>>(istream &is, mint &m) {
    int x;
    is >> x;
    m = mint(x);
    return is;
  }
  bool operator<(const mint &r) const { return v < r.v; }
  bool operator>(const mint &r) const { return v > r.v; }
  bool operator<=(const mint &r) const { return v <= r.v; }
  bool operator>=(const mint &r) const { return v >= r.v; }
  bool operator==(const mint &r) const { return v == r.v; }
  bool operator!=(const mint &r) const { return v != r.v; }
  explicit operator bool() const { return v; }
  explicit operator int() const { return v; }
  mint comb(mint k) {
    if (k > *this)
      return mint();
    if (!fact[0])
      combinit();
    if (v >= fn_) {
      if (k > *this - k)
        k = *this - k;
      mint tmp(1);
      for (int i = v; i >= v - k.v + 1; i--)
        tmp *= mint(i);
      return tmp * comp[k.v];
    } else
      return fact[v] * comp[k.v] * comp[v - k.v];
  } // nCk
  static void combinit() {
    fact[0] = 1;
    for (int i = 1; i < fn_; i++)
      fact[i] = fact[i - 1] * mint(i);
    comp[fn_ - 1] = fact[fn_ - 1].inv();
    for (int i = fn_ - 2; i >= 0; i--)
      comp[i] = comp[i + 1] * mint(i + 1);
  }
};
mint mint::fact[fn_], mint::comp[fn_];
//--------------------------------------------------------------

//---------------------------------------------------------------------
int v[400000], w[400000];
signed main() {
  int n, q;
  n = read();
  rng(i, 1, n + 1) { v[i] = read(), w[i] = read(); }
  q = read();
  cdf(q) {
    int pos = read();
    int l = read();

    vec<H> r;
    while (pos >= 1) {
      r.pb(v[pos], w[pos]);
      pos = pos / 2;
    }
    vec<H> a(1, H{0, 0}), b(1, H{0, 0});

    auto F = [&](int li, int ri, vec<H> &a) {
      rng(i, li, ri) {
        int t = 0;
        vec<H> c = a;

        rep(j, siz(a)) {
          if (a[j].sc + r[i].sc <= l)
            c.pb(a[j].fs + r[i].fs, a[j].sc + r[i].sc);
        }
        a = c;
      }
    };

    F(0, siz(r) / 2, a);
    F(siz(r) / 2, siz(r), b);

    sort(all(b), [](H x, H y) {
      if (x.sc != y.sc)
        return x.sc < y.sc;
      return x.fs > y.fs;
    });

    vec<H> c;
    int mx = -1;
    rep(i, siz(b)) {
      if (mx < b[i].fs) {
        c.pb(b[i]);
        mx = b[i].fs;
      }
    }

    int ans = 0;
    rep(i, siz(a)) {
      if (a[i].sc > l)
        continue;

      chmax(ans,
            a[i].fs + (*prev((partition_point(
                           all(c), [&](H x) { return x.sc + a[i].sc <= l; }))))
                          .fs);
    }
    printf("%lld\\n", ans);
  }
}