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

#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const long long int MOD = 1e9 + 7;
const long long int MOD2 = 2147483647;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \\
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \\
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \\
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \\
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \\
  do {                                                                         \\
    sort(ALL((vec)));                                                          \\
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \\
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  cin >> N;
  vector<pll> SI(N);
  vector<string> S(N);

  REP(i, N) {
    cin >> S[i];
    SI[i] = make_pair(S[i].size(), i);
  }
  sort(ALL(SI));
  // REP(i, N) cout << S[i] << endl;

  map<pll, map<char, ll>> M;

  vector<ll> SS(1e6, 0);

  ll ans = 0;

  REP(i, N) {
    ll SSN = S[SI[i].second].size();
    // ll count=0;
    REP(j, SSN) { SS[j + 1] = SS[j] | (1LL << (S[SI[i].second][j] - 'a')); }
    ll now = 0;
    ll strpo = 0;
    ll now2 = 0;
    ll strpo2 = 0;
    // string sss = "";
    RREP(j, SSN) {
      if (M.find({now, now2}) != M.end()) {
        AUTO(m, M[make_pair(now, now2)]) {
          if (SS[j + 1] & (1LL << (m.first - 'a')))
            ans += m.second;
        }
      }
      // sss = S[SI[i].second][j] + sss;
      now = ((ll)(S[SI[i].second][j] - 'a' + 1) + (now * 27)) % MOD;
      now2 = ((ll)(S[SI[i].second][j] - 'a' + 1) + (now2 * 27)) % MOD2;
      // cout << sss << now << "," << now2 << endl;
      if (j == 1) {
        strpo = now;
        strpo2 = now2;
      }
    }

    auto po = make_pair(strpo, strpo2);
    char poo = S[SI[i].second][0];
    if (M.find(po) == M.end()) {
      map<char, ll> yo;
      yo[poo] = 1;
      M[po] = yo;
    } else {
      if (M[po].find(poo) == M[po].end())
        M[po][poo] = 1;
      else
        M[po][poo]++;
    }
  }
  cout << ans << endl;

  return 0;
}


Error: TLE

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>

const int MOD = 1e9 + 7;
const int iINF = 2147483647 / 2;
const long long int llINF = 9223372036854775807 / 2;

using namespace std;
using ll = long long int;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;

typedef pair<ll, ll> pll;
bool paircomp(const pll &a, const pll &b) {
  if (a.first == b.first)
    return a.second < b.second;
  return a.first < b.first;
}

#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define AUTO(i, m) for (auto &i : m)
#define ALL(a) (a).begin(), (a).end()
#define MAX(vec) *std::max_element(vec.begin(), vec.end())
#define MIN(vec) *std::min_element(vec.begin(), vec.end())
#define ARGMAX(vec)                                                            \\
  std::distance(vec.begin(), std::max_element(vec.begin(), vec.end()))
#define ARGMIN(vec)                                                            \\
  std::distance(vec.begin(), std::min_element(vec.begin(), vec.end()))
#define REV(T) greater<T>()
#define PQ(T) priority_queue<T, vector<T>, greater<T>>
#define VVL(a, b, c) vector<vector<ll>>(a, vector<ll>(b, c))
#define VV(T, a, b, c) vector<vector<T>>(a, vector<T>(b, c))
#define VVVL(a, b, c, d)                                                       \\
  vector<vector<vector<ll>>>(a, vector<vector<ll>>(b, vector<ll>(c, d)))
#define VVV(T, a, b, c, d)                                                     \\
  vector<vector<vector<T>>>(a, vector<vector<T>>(b, vector<T>(c, d)))
#define SP(a) setprecision(a)
#define SQRT(a) sqrt((long double)(a))
#define DPOW(a, b) pow((long double)(a), (long double)(b))
#define UNIQUE(vec)                                                            \\
  do {                                                                         \\
    sort(ALL((vec)));                                                          \\
    (vec).erase(std::unique(ALL((vec))), (vec).end());                         \\
  } while (0)

ll POW(ll n, ll m) {
  if (m == 0) {
    return 1;
  } else if (m % 2 == 0) {
    ll tmp = POW(n, m / 2);
    return (tmp * tmp);
  } else {
    return (n * POW(n, m - 1));
  }
}

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  ll N;
  cin >> N;
  vector<pll> SI(N);
  vector<string> S(N);

  REP(i, N) {
    cin >> S[i];
    SI[i] = make_pair(S[i].size(), i);
  }
  sort(ALL(SI));
  // REP(i, N) cout << S[i] << endl;
  map<ll, map<char, ll>> M;
  vector<ll> SS(1e6, 0);

  ll ans = 0;

  REP(i, N) {
    ll SSN = S[SI[i].second].size();
    // ll count=0;
    REP(j, SSN) { SS[j + 1] = SS[j] | (1LL << (S[SI[i].second][j] - 'a')); }
    string now = "";
    string strpo;

    RREP(j, SSN) {
      if (M.find(hash<string>()(now)) != M.end()) {
        AUTO(m, M[hash<string>()(now)]) {
          if (SS[j + 1] & (1LL << (m.first - 'a')))
            ans += m.second;
        }
      }
      now = S[SI[i].second][j] + now;
      if (j == 1)
        strpo = now;
    }

    ll po = hash<string>()(strpo);
    char poo = S[SI[i].second][0];
    if (M.find(po) == M.end()) {
      map<char, ll> yo;
      yo[poo] = 1;
      M[po] = yo;
    } else {
      if (M[po].find(poo) == M[po].end())
        M[po][poo] = 1;
      else
        M[po][poo]++;
    }
  }
  cout << ans << endl;

  return 0;
}