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

#include <bits/stdc++.h>

//    #include <boost/multiprecision/cpp_int.hpp>
#define int long long
// #define inf  1000000007
#define inf 998244353

#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define pb push_back
#define EPS (1e-8)

int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};
using namespace std;
class pa3 {
public:
  int x;
  int y, z;
  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}
  bool operator<(const pa3 &p) const {
    if (x != p.x)
      return x < p.x;
    if (y != p.y)
      return y < p.y;
    return z < p.z;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator>(const pa3 &p) const {
    if (x != p.x)
      return x > p.x;
    if (y != p.y)
      return y > p.y;
    return z > p.z;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator==(const pa3 &p) const {
    return x == p.x && y == p.y && z == p.z;
  }
  bool operator!=(const pa3 &p) const {
    return !(x == p.x && y == p.y && z == p.z);
  }
};

class pa4 {
public:
  int x;
  int y, z, w;
  pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}
  bool operator<(const pa4 &p) const {
    if (x != p.x)
      return x < p.x;
    if (y != p.y)
      return y < p.y;
    if (z != p.z)
      return z < p.z;
    return w < p.w;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator>(const pa4 &p) const {
    if (x != p.x)
      return x > p.x;
    if (y != p.y)
      return y > p.y;
    if (z != p.z)
      return z > p.z;
    return w > p.w;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator==(const pa4 &p) const {
    return x == p.x && y == p.y && z == p.z && w == p.w;
  }
};
class pa2 {
public:
  int x, y;
  pa2(int x = 0, int y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
  bool operator!=(const pa2 &p) const {
    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
  }
};

string itos(int i) {
  ostringstream s;
  s << i;
  return s.str();
}

int Gcd(int v, int b) {
  if (v == 0)
    return b;
  if (b == 0)
    return v;
  if (v > b)
    return Gcd(b, v);
  if (v == b)
    return b;
  if (b % v == 0)
    return v;
  return Gcd(v, b % v);
}

int mod;
int extgcd(int a, int b, int &x, int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  int d = extgcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
pa operator+(const pa &l, const pa &r) {
  return {l.first + r.first, l.second + r.second};
}
pa operator-(const pa &l, const pa &r) {
  return {l.first - r.first, l.second - r.second};
}
int beki(int wa, int rr, int warukazu) {
  if (rr == 0)
    return 1 % warukazu;
  if (rr == 1)
    return wa % warukazu;
  wa %= warukazu;
  if (rr % 2 == 1)
    return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;
  ll zx = beki(wa, rr / 2, warukazu);
  return (zx * zx) % warukazu;
}

int pr[1000100];
int inv[1000010];

int comb(int nn, int rr) {
  if (rr < 0 || rr > nn || nn < 0)
    return 0;
  int r = pr[nn] * inv[rr];
  r %= mod;
  r *= inv[nn - rr];
  r %= mod;
  return r;
}

void gya(int ert) {
  pr[0] = 1;
  for (int i = 1; i <= ert; i++) {
    pr[i] = ((ll)pr[i - 1] * i) % mod;
  }
  inv[ert] = beki(pr[ert], mod - 2, mod);
  for (int i = ert - 1; i >= 0; i--) {
    inv[i] = (ll)inv[i + 1] * (i + 1) % mod;
  }
}

//   cin.tie(0);
//	ios::sync_with_stdio(false);
// priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
// sort(ve.begin(),ve.end(),greater<int>());
//   mt19937(clock_per_sec);
//  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;

int dp[3011][3111] = {};
int rui[3011][3111] = {};

int f[3011][3111] = {};

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int a, b, c, d;
  cin >> a >> b >> c >> d;

  dp[a][b] = 1;
  mod = 998244353;
  for (int i = a; i <= a; i++) {
    int mi = beki(i, mod - 2, mod);
    rui[i][3006] = dp[i][3006];
    for (int j = 3005; j >= 0; j--) {
      rui[i][j] = rui[i][j + 1] + dp[i][j];
      rui[i][j] %= mod;
    }
    int e = 1;
    for (int j = 0; j <= 3005; j++) {
      f[i][j] = dp[i][j] * e % mod;
      //	if(f[i][j])cout<<i<<" "<<j<<" "<<f[i][j]<<endl;
      e *= mi;
      e %= mod;
    }
    for (int j = 1; j <= 3005; j++) {
      f[i][j] += f[i][j - 1];
      f[i][j] %= mod;
    }
  }

  for (int i = a + 1; i <= c; i++) {
    int mi = beki(i, mod - 2, mod);
    {
      dp[i][b] = dp[i - 1][b] * b % mod;
      //		cout<<i<<" "<<b<<" "<<dp[i][b]<<endl;
    }
    int hh = beki(i - 1, b + 1, mod);
    for (int j = b + 1; j <= d; j++) {

      dp[i][j] = dp[i - 1][j] * j % mod;
      dp[i][j] += f[i - 1][j - 1] * hh % mod;
      dp[i][j] %= mod;
      hh *= i - 1;
      hh %= mod;
      //		cout<<i<<" "<<j<<" "<<dp[i][j]<<endl;
    }

    rui[i][3006] = dp[i][3006];
    for (int j = 3005; j >= 0; j--) {
      rui[i][j] = rui[i][j + 1] + dp[i][j];
      rui[i][j] %= mod;
    }
    int e = 1;
    for (int j = 0; j <= 3005; j++) {
      f[i][j] = dp[i][j] * e % mod;
      e *= mi;
      e %= mod;
    }
    for (int j = 1; j <= 3005; j++) {
      f[i][j] += f[i][j - 1];
      f[i][j] %= mod;
    }
  }

  int ans = 0;
  for (int j = b; j <= d; j++) {
    // cout<<dp[c][j]<<endl;
    ans += dp[c][j] * beki(c, d - j, mod) % mod;
  }
  cout << ans % mod << endl;

  return 0;
}


Error: TLE

Fixed submission:

#include <bits/stdc++.h>

//    #include <boost/multiprecision/cpp_int.hpp>
#define int long long
// #define inf  1000000007
#define inf 998244353

#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define pb push_back
#define EPS (1e-8)

int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};
using namespace std;
class pa3 {
public:
  int x;
  int y, z;
  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}
  bool operator<(const pa3 &p) const {
    if (x != p.x)
      return x < p.x;
    if (y != p.y)
      return y < p.y;
    return z < p.z;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator>(const pa3 &p) const {
    if (x != p.x)
      return x > p.x;
    if (y != p.y)
      return y > p.y;
    return z > p.z;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator==(const pa3 &p) const {
    return x == p.x && y == p.y && z == p.z;
  }
  bool operator!=(const pa3 &p) const {
    return !(x == p.x && y == p.y && z == p.z);
  }
};

class pa4 {
public:
  int x;
  int y, z, w;
  pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}
  bool operator<(const pa4 &p) const {
    if (x != p.x)
      return x < p.x;
    if (y != p.y)
      return y < p.y;
    if (z != p.z)
      return z < p.z;
    return w < p.w;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator>(const pa4 &p) const {
    if (x != p.x)
      return x > p.x;
    if (y != p.y)
      return y > p.y;
    if (z != p.z)
      return z > p.z;
    return w > p.w;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator==(const pa4 &p) const {
    return x == p.x && y == p.y && z == p.z && w == p.w;
  }
};
class pa2 {
public:
  int x, y;
  pa2(int x = 0, int y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
  bool operator!=(const pa2 &p) const {
    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
  }
};

string itos(int i) {
  ostringstream s;
  s << i;
  return s.str();
}

int Gcd(int v, int b) {
  if (v == 0)
    return b;
  if (b == 0)
    return v;
  if (v > b)
    return Gcd(b, v);
  if (v == b)
    return b;
  if (b % v == 0)
    return v;
  return Gcd(v, b % v);
}

int mod;
int extgcd(int a, int b, int &x, int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  int d = extgcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
pa operator+(const pa &l, const pa &r) {
  return {l.first + r.first, l.second + r.second};
}
pa operator-(const pa &l, const pa &r) {
  return {l.first - r.first, l.second - r.second};
}
int beki(int wa, int rr, int warukazu) {
  if (rr == 0)
    return 1 % warukazu;
  if (rr == 1)
    return wa % warukazu;
  wa %= warukazu;
  if (rr % 2 == 1)
    return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;
  ll zx = beki(wa, rr / 2, warukazu);
  return (zx * zx) % warukazu;
}

int pr[1000100];
int inv[1000010];

int comb(int nn, int rr) {
  if (rr < 0 || rr > nn || nn < 0)
    return 0;
  int r = pr[nn] * inv[rr];
  r %= mod;
  r *= inv[nn - rr];
  r %= mod;
  return r;
}

void gya(int ert) {
  pr[0] = 1;
  for (int i = 1; i <= ert; i++) {
    pr[i] = ((ll)pr[i - 1] * i) % mod;
  }
  inv[ert] = beki(pr[ert], mod - 2, mod);
  for (int i = ert - 1; i >= 0; i--) {
    inv[i] = (ll)inv[i + 1] * (i + 1) % mod;
  }
}

//   cin.tie(0);
//	ios::sync_with_stdio(false);
// priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
// sort(ve.begin(),ve.end(),greater<int>());
//   mt19937(clock_per_sec);
//  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;

int dp[3011][3111] = {};
int rui[3011][3111] = {};

int f[3011][3111] = {};

signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  int a, b, c, d;
  cin >> a >> b >> c >> d;

  dp[a][b] = 1;
  mod = 998244353;
  for (int i = a; i <= a; i++) {
    int mi = beki(i, mod - 2, mod);
    rui[i][3006] = dp[i][3006];
    for (int j = 3005; j >= 0; j--) {
      rui[i][j] = rui[i][j + 1] + dp[i][j];
      rui[i][j] %= mod;
    }
    int e = 1;
    for (int j = 0; j <= 3005; j++) {
      f[i][j] = dp[i][j] * e % mod;
      //	if(f[i][j])cout<<i<<" "<<j<<" "<<f[i][j]<<endl;
      e *= mi;
      e %= mod;
    }
    for (int j = 1; j <= 3005; j++) {
      f[i][j] += f[i][j - 1];
      f[i][j] %= mod;
    }
  }

  for (int i = a + 1; i <= c; i++) {
    int mi = beki(i, mod - 2, mod);
    {
      dp[i][b] = dp[i - 1][b] * b % mod;
      //		cout<<i<<" "<<b<<" "<<dp[i][b]<<endl;
    }
    for (int j = b + 1; j <= d; j++) {

      dp[i][j] = dp[i - 1][j] * j % mod;
      dp[i][j] += f[i - 1][j - 1] * beki(i - 1, j, mod) % mod;
      dp[i][j] %= mod;
      //		cout<<i<<" "<<j<<" "<<dp[i][j]<<endl;
    }

    rui[i][3006] = dp[i][3006];
    for (int j = 3005; j >= 0; j--) {
      rui[i][j] = rui[i][j + 1] + dp[i][j];
      rui[i][j] %= mod;
    }
    int e = 1;
    for (int j = 0; j <= 3005; j++) {
      f[i][j] = dp[i][j] * e % mod;
      e *= mi;
      e %= mod;
    }
    for (int j = 1; j <= 3005; j++) {
      f[i][j] += f[i][j - 1];
      f[i][j] %= mod;
    }
  }

  int ans = 0;
  for (int j = b; j <= d; j++) {
    // cout<<dp[c][j]<<endl;
    ans += dp[c][j] * beki(c, d - j, mod) % mod;
  }
  cout << ans % mod << endl;

  return 0;
}