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

#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;

typedef tree<ll, null_type, less<ll>, rb_tree_tag,
             tree_order_statistics_node_update>
    orderedSet;

#define pb push_back
#define F first
#define S second
#define all(a) (a).begin(), (a).end()

#define for1(i0, l0, r0) for (int i0 = l0; i0 < r0; ++i0)
#define for2(i0, l0, r0) for (int i0 = l0; i0 <= r0; ++i0)
#define forn(i0, n0) for (int i0 = 0; i0 < n0; ++i0)
#define forn1(i0, n0) for (int i0 = 1; i0 < n0; ++i0)
#define forr(i0, n0) for (int i0 = n0; i0 >= 0; --i0)
#define forr1(i0, r0, l0) for (int i0 = r0; i0 > l0; --i0)
#define forr2(i0, r0, l0) for (int i0 = r0; i0 >= l0; --i0)

#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define relaxMax(a, b) a = max(a, b)
#define relaxMin(a, b) a = min(a, b)

typedef long double ld;
#define ui unsigned int
#define ull unsigned long long

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<ld> vld;
typedef vector<bool> vb;
typedef vector<string> vs;

typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pdd> vpdd;

typedef vector<vi> vvi;
typedef vector<vd> vvd;
typedef vector<vll> vvll;
typedef vector<vb> vvb;

#define vpss vector<pss>
#define vvs vector<vs>
#define vvpii vector<vpii>
#define vvpll vector<vpll>
#define vpt vector<pt>
#define vvvi vector<vvi>
#define vsi vector<set<int>>
#define ss second
#define ff first

#define printvi(arr)                                                           \\
  for (int x0 : arr)                                                           \\
    cout << x0 << ' ';                                                         \\
  cout << '\\n';
#define printvll(arr)                                                          \\
  for (ll x0 : arr)                                                            \\
    cout << x0 << ' ';                                                         \\
  cout << '\\n';
#define printpair(pair0) cout << pair0.F << ' ' << pair0.S << '\\n';
#define printvp(arr)                                                           \\
  for (auto pair0 : arr)                                                       \\
    printpair(pair0);
#define initArray(arr, N0, X0) memset(arr, X0, N0 * sizeof(int))
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void init() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  // cout.precision(16);
  // freopen("input.txt", "r", stdin);
  // freopen("output.txt", "w", stdout);
}

const ll MOD1 = 1e9 + 7;
const ll MOD2 = 1e9 + 9;
const ll p = 47;
const ll K = 2e9;

vpll sufHashes(string s) {
  int n = s.length();
  vpll h(n);
  ll h1 = 0, h2 = 0;
  forr(i, n - 1) {
    ll x = s[i] - 'a' + 1;
    h1 = (h1 * p + x) % MOD1;
    h2 = (h2 * p + x) % MOD2;
    h[i] = {h1, h2};
  }
  h.pb({0, 0});
  return h;
}

void solve() {
  int n;
  cin >> n;
  vs a(n);
  forn(i, n) cin >> a[i];
  vvpll h;
  unordered_set<ll> hashes;
  vvi pos(n, vi(26, 1e9));
  forn(i, n) {
    forn(j, a[i].length()) {
      int c = a[i][j] - 'a';
      if (pos[i][c] == 1e9)
        pos[i][c] = j;
    }
  }
  forn(i, n) {
    h.pb(sufHashes(a[i]));
    hashes.insert(h[i][0].F * K + h[i][0].S);
  }
  ll ans = 0;
  forn(i, n) {
    int l = a[i].length();
    forn1(j, a[i].length()) {
      l--;
      pll h0 = h[i][j + 1];
      forn(c, 26) {
        if (pos[i][c] <= j) {
          pll H = {(h0.F * p + c + 1) % MOD1, (h0.S * p + c + 1) % MOD2};
          if (hashes.count(H.F * K + H.S)) {
            ans++;
          }
        }
      }
    }
  }
  cout << ans << '\\n';
}

bool multitest = false;

int main() {
  init();
  int t = 1;
  if (multitest)
    cin >> t;
  forn(i, t) solve();
}

Error: TLE

Fixed submission:

#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;

typedef tree<ll, null_type, less<ll>, rb_tree_tag,
             tree_order_statistics_node_update>
    orderedSet;

#define pb push_back
#define F first
#define S second
#define all(a) (a).begin(), (a).end()

#define for1(i0, l0, r0) for (int i0 = l0; i0 < r0; ++i0)
#define for2(i0, l0, r0) for (int i0 = l0; i0 <= r0; ++i0)
#define forn(i0, n0) for (int i0 = 0; i0 < n0; ++i0)
#define forn1(i0, n0) for (int i0 = 1; i0 < n0; ++i0)
#define forr(i0, n0) for (int i0 = n0; i0 >= 0; --i0)
#define forr1(i0, r0, l0) for (int i0 = r0; i0 > l0; --i0)
#define forr2(i0, r0, l0) for (int i0 = r0; i0 >= l0; --i0)

#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define relaxMax(a, b) a = max(a, b)
#define relaxMin(a, b) a = min(a, b)

typedef long double ld;
#define ui unsigned int
#define ull unsigned long long

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<ld> vld;
typedef vector<bool> vb;
typedef vector<string> vs;

typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pdd> vpdd;

typedef vector<vi> vvi;
typedef vector<vd> vvd;
typedef vector<vll> vvll;
typedef vector<vb> vvb;

#define vpss vector<pss>
#define vvs vector<vs>
#define vvpii vector<vpii>
#define vvpll vector<vpll>
#define vpt vector<pt>
#define vvvi vector<vvi>
#define vsi vector<set<int>>
#define ss second
#define ff first

#define printvi(arr)                                                           \\
  for (int x0 : arr)                                                           \\
    cout << x0 << ' ';                                                         \\
  cout << '\\n';
#define printvll(arr)                                                          \\
  for (ll x0 : arr)                                                            \\
    cout << x0 << ' ';                                                         \\
  cout << '\\n';
#define printpair(pair0) cout << pair0.F << ' ' << pair0.S << '\\n';
#define printvp(arr)                                                           \\
  for (auto pair0 : arr)                                                       \\
    printpair(pair0);
#define initArray(arr, N0, X0) memset(arr, X0, N0 * sizeof(int))
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void init() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  // cout.precision(16);
  // freopen("input.txt", "r", stdin);
  // freopen("output.txt", "w", stdout);
}

const ll MOD1 = 1e9 + 7;
const ll MOD2 = 1e9 + 9;
const ll p = 47;
const ll K = 2e9;

vpll sufHashes(string s) {
  int n = s.length();
  vpll h(n);
  ll h1 = 0, h2 = 0;
  forr(i, n - 1) {
    ll x = s[i] - 'a' + 1;
    h1 = (h1 * p + x) % MOD1;
    h2 = (h2 * p + x) % MOD2;
    h[i] = {h1, h2};
  }
  h.pb({0, 0});
  return h;
}

void solve() {
  int n;
  cin >> n;
  vs a(n);
  forn(i, n) cin >> a[i];
  vvpll h;
  map<int, unordered_set<ll>> hashes;
  vvi pos(n, vi(26, 1e9));
  forn(i, n) {
    forn(j, a[i].length()) {
      int c = a[i][j] - 'a';
      if (pos[i][c] == 1e9)
        pos[i][c] = j;
    }
  }
  forn(i, n) {
    h.pb(sufHashes(a[i]));
    hashes[a[i].length()].insert(h[i][0].F * K + h[i][0].S);
  }
  ll ans = 0;
  forn(i, n) {
    int l = a[i].length();
    forn1(j, a[i].length()) {
      l--;
      pll h0 = h[i][j + 1];
      forn(c, 26) {
        if (pos[i][c] <= j) {
          pll H = {(h0.F * p + c + 1) % MOD1, (h0.S * p + c + 1) % MOD2};
          if (hashes[l].count(H.F * K + H.S)) {
            ans++;
          }
        }
      }
    }
  }
  cout << ans << '\\n';
}

bool multitest = false;

int main() {
  init();
  int t = 1;
  if (multitest)
    cin >> t;
  forn(i, t) solve();
}