Problem p02750 (C++)

Buggy submission (status: Runtime Error):
// Zory-2020
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// typedef __int128 ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FR first
#define SE second
#define MP make_pair
#define PB push_back
#define vc vector
#define db double
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define bin(x) (1ll << (x))
#define fo(i, l, r) for (int i = (l), I = (r); i <= I; i++)
#define fd(i, r, l) for (int i = (r), I = (l); i >= I; i--)
#define mem(x, val) memset(x, val, sizeof x)
#define Swap(a, b, n)                                                          \
  for (int I = 0; I <= n; I++)                                                 \
  swap(a[I], b[I])
#define PC __builtin_popcountll
#ifdef DEBUG
#define debug(A, args...) fprintf(stderr, A, ##args)
#else
#define debug(A, args...) printf("")
#endif
#define deb debug("line %d\n", __LINE__)
namespace mine {
ll qread() {
  ll ans = 0, f = 1;
  char c = getchar();
  while (c < '0' or c > '9') {
    if (c == '-')
      f = -1;
    c = getchar();
  }
  while ('0' <= c and c <= '9')
    ans = ans * 10 + c - '0', c = getchar();
  return ans * f;
}
void write(ll num) {
  if (num < 0)
    putchar('-'), num = -num;
  if (num >= 10)
    write(num / 10);
  putchar('0' + num % 10);
}
void write1(ll num) {
  write(num);
  putchar(' ');
}
void write2(ll num) {
  write(num);
  putchar('\n');
}
template <typename T> inline bool chmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T> inline bool chmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
bool IN(ll x, ll l, ll r) { return l <= x and x <= r; }
void GG() {
  puts("-1");
  exit(0);
}

const db eps = 1e-8;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int mm(const int x) { return x >= MOD ? x - MOD : x; }
template <typename T> void add(T &x, const int &y) {
  x = (x + y >= MOD ? x + y - MOD : x + y);
}
ll qpower(ll x, ll e, int mod = MOD) {
  ll ans = 1;
  while (e) {
    if (e & 1)
      ans = ans * x % mod;
    x = x * x % mod;
    e >>= 1;
  }
  return ans;
}
ll invm(ll x) { return qpower(x, MOD - 2); }
const int M = 1e6 + 10;
ll fac[M], facinv[M], Inv[M];
ll C(int n, int m) {
  return n < 0 or n < m ? 0 : fac[n] * facinv[m] % MOD * facinv[n - m] % MOD;
}
void PRE() {
  fac[0] = 1;
  fo(i, 1, M - 1) fac[i] = fac[i - 1] * i % MOD;
  facinv[M - 1] = invm(fac[M - 1]);
  fd(i, M - 1, 1) facinv[i - 1] = facinv[i] * i % MOD;
  Inv[1] = 1;
  fo(i, 2, M - 1) Inv[i] = (MOD - MOD / i) * Inv[MOD % i] % MOD;
}
const int N = 3e5 + 10;
//------------------FIXED------------------
pll a[N];
int dp[N][50];
vc<ll> hh;
void main() {
  int n = qread(), T = qread(), m = 0;
  fo(i, 1, n) {
    pll t;
    t.FR = qread() + 1, t.SE = qread() + 1;
    if (t.FR != 1)
      a[++m] = t;
    else
      hh.PB(t.SE);
  }
  hh.PB(0);
  sort(all(hh));
  fo(i, 1, sz(hh) - 1) hh[i] += hh[i - 1];

  sort(a + 1, a + m + 1,
       [&](pll a, pll b) { return b.SE * (a.FR - 1) <= a.SE * (b.FR - 1); });
  mem(dp, 0x3f);
  dp[m + 1][0] = 1;
  fd(i, m, 1) fo(ct, 0, 38) {
    chmin(dp[i][ct], dp[i + 1][ct]);
    dp[i][ct + 1] =
        min(1ll * dp[i][ct + 1], 1ll * dp[i + 1][ct] * a[i].FR + a[i].SE);
  }
  int ans = 0;
  fo(ct, 0, 39) fo(i, 0, sz(hh) - 1) if (dp[1][ct] + hh[i] <= T + 1)
      chmax(ans, ct + i);
  write(ans);
}
}; // namespace mine
signed main() {
#ifdef DEBUG
  // freopen("a.in","r",stdin);
  freopen("z.txt", "r", stdin);
// freopen("a.out","w",stdout);
#endif
  srand(time(0));
  mine::PRE(); // 线性预处理模意义
  mine::main();
  debug("\n---------------------Zory---------------------\nTime: %.2lf s",
        1.0 * clock() / CLOCKS_PER_SEC);
}

Fixed submission:
// Zory-2020
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// typedef __int128 ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define FR first
#define SE second
#define MP make_pair
#define PB push_back
#define vc vector
#define db double
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define bin(x) (1ll << (x))
#define fo(i, l, r) for (int i = (l), I = (r); i <= I; i++)
#define fd(i, r, l) for (int i = (r), I = (l); i >= I; i--)
#define mem(x, val) memset(x, val, sizeof x)
#define Swap(a, b, n)                                                          \
  for (int I = 0; I <= n; I++)                                                 \
  swap(a[I], b[I])
#define PC __builtin_popcountll
#ifdef DEBUG
#define debug(A, args...) fprintf(stderr, A, ##args)
#else
#define debug(A, args...) printf("")
#endif
#define deb debug("line %d\n", __LINE__)
namespace mine {
ll qread() {
  ll ans = 0, f = 1;
  char c = getchar();
  while (c < '0' or c > '9') {
    if (c == '-')
      f = -1;
    c = getchar();
  }
  while ('0' <= c and c <= '9')
    ans = ans * 10 + c - '0', c = getchar();
  return ans * f;
}
void write(ll num) {
  if (num < 0)
    putchar('-'), num = -num;
  if (num >= 10)
    write(num / 10);
  putchar('0' + num % 10);
}
void write1(ll num) {
  write(num);
  putchar(' ');
}
void write2(ll num) {
  write(num);
  putchar('\n');
}
template <typename T> inline bool chmax(T &a, const T &b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T> inline bool chmin(T &a, const T &b) {
  return a > b ? a = b, 1 : 0;
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
bool IN(ll x, ll l, ll r) { return l <= x and x <= r; }
void GG() {
  puts("-1");
  exit(0);
}

const db eps = 1e-8;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
int mm(const int x) { return x >= MOD ? x - MOD : x; }
template <typename T> void add(T &x, const int &y) {
  x = (x + y >= MOD ? x + y - MOD : x + y);
}
ll qpower(ll x, ll e, int mod = MOD) {
  ll ans = 1;
  while (e) {
    if (e & 1)
      ans = ans * x % mod;
    x = x * x % mod;
    e >>= 1;
  }
  return ans;
}
ll invm(ll x) { return qpower(x, MOD - 2); }
const int M = 1e6 + 10;
ll fac[M], facinv[M], Inv[M];
ll C(int n, int m) {
  return n < 0 or n < m ? 0 : fac[n] * facinv[m] % MOD * facinv[n - m] % MOD;
}
void PRE() {
  fac[0] = 1;
  fo(i, 1, M - 1) fac[i] = fac[i - 1] * i % MOD;
  facinv[M - 1] = invm(fac[M - 1]);
  fd(i, M - 1, 1) facinv[i - 1] = facinv[i] * i % MOD;
  Inv[1] = 1;
  fo(i, 2, M - 1) Inv[i] = (MOD - MOD / i) * Inv[MOD % i] % MOD;
}
const int N = 3e5 + 10;
//------------------FIXED------------------
pll a[N];
int dp[N][50];
vc<ll> hh;
void main() {
  int n = qread(), T = qread(), m = 0;
  fo(i, 1, n) {
    pll t;
    t.FR = qread() + 1, t.SE = qread() + 1;
    if (t.FR != 1)
      a[++m] = t;
    else
      hh.PB(t.SE);
  }
  hh.PB(0);
  sort(all(hh));
  fo(i, 1, sz(hh) - 1) hh[i] += hh[i - 1];

  sort(a + 1, a + m + 1,
       [&](pll a, pll b) { return b.SE * (a.FR - 1) < a.SE * (b.FR - 1); });
  mem(dp, 0x3f);
  dp[m + 1][0] = 1;
  fd(i, m, 1) fo(ct, 0, 38) {
    chmin(dp[i][ct], dp[i + 1][ct]);
    dp[i][ct + 1] =
        min(1ll * dp[i][ct + 1], 1ll * dp[i + 1][ct] * a[i].FR + a[i].SE);
  }
  int ans = 0;
  fo(ct, 0, 39) fo(i, 0, sz(hh) - 1) if (dp[1][ct] + hh[i] <= T + 1)
      chmax(ans, ct + i);
  write(ans);
}
}; // namespace mine
signed main() {
#ifdef DEBUG
  // freopen("a.in","r",stdin);
  freopen("z.txt", "r", stdin);
// freopen("a.out","w",stdout);
#endif
  srand(time(0));
  mine::PRE(); // 线性预处理模意义
  mine::main();
  debug("\n---------------------Zory---------------------\nTime: %.2lf s",
        1.0 * clock() / CLOCKS_PER_SEC);
}