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

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define vi vector<int>
#define vvi vector<vector<int>>
#define pi pair<int, int>
#define ALL(a) (a).begin(), (a).end()
#define BIT(n) (1LL << (n))
#define UNIQUE(v)                                                              \\
  v.erase(unique(v.begin(), v.end()), v.end()) // sortしてからつかうこと
constexpr int mod = 1e9 + 7;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
ll A, B, C, D, E, F, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S, T;

template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec)
    is >> x;
  return is;
}

class Fp {
public:
  int val;

  Fp() { val = 0; }
  Fp(int v) : val(v % mod) {
    if (val < 0)
      val += mod;
  }
  Fp operator+=(const Fp &in) {
    val += in.val;
    if (val >= mod)
      val -= mod;
    return *this;
  }
  Fp operator+(const Fp &in) const { return Fp(*this) += in; }
  Fp &operator-=(const Fp &in) {
    val -= in.val;
    if (val >= mod)
      val -= mod;
    if (val < 0)
      val += mod;
    return *this;
  }
  Fp operator-(const Fp &in) const { return Fp(*this) -= in; }
  Fp &operator*=(const Fp &in) {
    val = (long long)val * (long long)in.val % (long long)mod;
    return *this;
  }
  Fp operator*(const Fp &in) const { return Fp(*this) *= in; }
  Fp &operator/=(const Fp &in) {
    *this *= in.modpow(mod - 2);
    return *this;
  }
  Fp operator/(const Fp &in) const { return Fp(*this) /= in; }
  bool operator==(const Fp &in) const { return val == in.val; }
  bool operator!=(const Fp &in) const { return val != in.val; }
  Fp modpow(int n) const {
    if (n == 0)
      return 1;
    if (n & 1) {
      return (*this) * ((*this) * (*this)).modpow(n / 2);
    } else {
      return ((*this) * (*this)).modpow(n / 2);
    }
  }
  friend istream &operator>>(istream &is, Fp &fp) {
    is >> fp.val;
    return is;
  }
  friend ostream &operator<<(ostream &os, Fp &fp) {
    os << fp.val;
    return os;
  }
  friend ostream &operator<<(ostream &os, Fp &&fp) {
    os << fp.val;
    return os;
  }
};

Fp modpow(const Fp &in, const int n) { return in.modpow(n); }
Fp modpow(const int a, const int n) { return Fp(a).modpow(n); }

using mint = Fp;
class Factorial {
public:
  vector<mint> fact, finv;
  Factorial(int n) : fact(n + 1, mint(1)), finv(n + 1, mint(1)) {
    for (int i = 2; i <= n; i++) {
      fact[i] = fact[i - 1] * i;
      finv[i] = finv[i - 1] / i;
    }
  }
  mint com(const ll &n, const ll &k) {
    if (n < k || n < 0 || k < 0)
      return mint(0);
    return fact[n] * finv[k] * finv[n - k];
  }
};

signed main() {
  mint ans = 0;
  cin >> K;
  cin >> S;
  N = S.size() + K;
  Factorial f(N);
  for (int i = S.size() - 1; i < N; i++) {
    int tmp = N - 1 - i;
    ans += modpow(25, K - tmp) * modpow(26, tmp) *
           f.com(N - tmp - 1, S.size() - 1);
  }
  cout << ans << endl;
}

Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define dump(...)
#endif
#define endl "\\n"
#define ll long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define RREP(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define RREPS(i, x) for (int i = ((int)(x)); i > 0; i--)
#define INF 2147483647
#define LLINF 9223372036854775807LL
#define vi vector<int>
#define vvi vector<vector<int>>
#define pi pair<int, int>
#define ALL(a) (a).begin(), (a).end()
#define BIT(n) (1LL << (n))
#define UNIQUE(v)                                                              \\
  v.erase(unique(v.begin(), v.end()), v.end()) // sortしてからつかうこと
constexpr int MOD = 1e9 + 7;
int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};
ll A, B, C, D, E, F, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S, T;

template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
  for (T &x : vec)
    is >> x;
  return is;
}

class Fp {
public:
  int val;
  static int mod;

  Fp() { val = 0; }
  Fp(int v) : val(v % mod) {
    if (val < 0)
      val += mod;
  }
  Fp operator+=(const Fp &in) {
    val += in.val;
    if (val >= mod)
      val -= mod;
    return *this;
  }
  Fp operator+(const Fp &in) const { return Fp(*this) += in; }
  Fp &operator-=(const Fp &in) {
    val -= in.val;
    if (val >= mod)
      val -= mod;
    if (val < 0)
      val += mod;
    return *this;
  }
  Fp operator-(const Fp &in) const { return Fp(*this) -= in; }
  Fp &operator*=(const Fp &in) {
    val = (long long)val * (long long)in.val % (long long)mod;
    return *this;
  }
  Fp operator*(const Fp &in) const { return Fp(*this) *= in; }
  Fp &operator/=(const Fp &in) {
    *this *= in.modpow(mod - 2);
    return *this;
  }
  Fp operator/(const Fp &in) const { return Fp(*this) /= in; }
  bool operator==(const Fp &in) const { return val == in.val; }
  bool operator!=(const Fp &in) const { return val != in.val; }
  Fp modpow(int n) const {
    if (n == 0)
      return 1;
    if (n & 1) {
      return (*this) * ((*this) * (*this)).modpow(n / 2);
    } else {
      return ((*this) * (*this)).modpow(n / 2);
    }
  }
  friend istream &operator>>(istream &is, Fp &fp) {
    is >> fp.val;
    return is;
  }
  friend ostream &operator<<(ostream &os, Fp &fp) {
    os << fp.val;
    return os;
  }
  friend ostream &operator<<(ostream &os, Fp &&fp) {
    os << fp.val;
    return os;
  }
};

Fp modpow(const Fp &in, const int n) { return in.modpow(n); }
Fp modpow(const int a, const int n) { return Fp(a).modpow(n); }

using mint = Fp;
int mint::mod = MOD;

class Factorial {
public:
  vector<mint> fact, finv;
  Factorial(int n) : fact(n + 1, mint(1)), finv(n + 1, mint(1)) {
    for (int i = 2; i <= n; i++) {
      fact[i] = fact[i - 1] * i;
      finv[i] = finv[i - 1] / i;
    }
  }
  mint com(const ll &n, const ll &k) {
    if (n < k || n < 0 || k < 0)
      return mint(0);
    return fact[n] * finv[k] * finv[n - k];
  }
};

signed main() {
  mint ans = 0;
  cin >> K;
  cin >> S;
  N = S.size() + K;
  Factorial f(N);
  for (int i = S.size() - 1; i < N; i++) {
    int tmp = N - 1 - i;
    ans += modpow(25, K - tmp) * modpow(26, tmp) *
           f.com(N - tmp - 1, S.size() - 1);
  }
  cout << ans << endl;
}