Language: C++

#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>

using namespace std;
typedef tuple<unsigned, unsigned, unsigned> T;

template<unsigned mod>
struct RollingHash {
    vector<unsigned> hashed, power;

    inline unsigned mul(unsigned a, unsigned b) const {
        unsigned long long x = (unsigned long long) a * b;
        unsigned xh = (unsigned) (x >> 32), xl = (unsigned) x, d, m;
        asm("divl %4; \n\t" : "=a" (d), "=d" (m) : "d" (xh), "a" (xl), "r" (mod));
        return m;
    }

    RollingHash(const string &s, unsigned base = 10007) {
        int sz = (int) s.size();
        hashed.assign(sz + 1, 0);
        power.assign(sz + 1, 0);
        power[0] = 1;
        for (int i = 0; i < sz; i++) {
            power[i + 1] = mul(power[i], base);
            hashed[i + 1] = mul(hashed[i], base) + s[i];
            if (hashed[i + 1] >= mod) hashed[i + 1] -= mod;
        }
    }

    unsigned get(int l, int r) const {
        unsigned ret = hashed[r] + mod - mul(hashed[l], power[r - l]);
        if (ret >= mod) ret -= mod;
        return ret;
    }

    unsigned connect(unsigned h1, int h2, int h2len) const {
        unsigned ret = mul(h1, power[h2len]) + h2;
        if (ret >= mod) ret -= mod;
        return ret;
    }

    int LCP(const RollingHash<mod> &b, int l1, int r1, int l2, int r2) {
        int len = min(r1 - l1, r2 - l2);
        int low = -1, high = len + 1;
        while (high - low > 1) {
            int mid = (low + high) / 2;
            if (get(l1, l1 + mid) == b.get(l2, l2 + mid)) low = mid;
            else high = mid;
        }
        return (low);
    }
};

using RH1 = RollingHash<1000000007>;
using RH2 = RollingHash<998244353>;
using RH3 = RollingHash<10007>;

bool comp(const string &lh, const string &rh) {
    return lh.length() > rh.length();
}

int main() {
    int n;
    cin >> n;
    vector<string> s(n);
    for (int i = 0; i < n; i++)cin >> s[i];
    sort(s.begin(), s.end(), comp);

    long long ret = 0;
    unordered_map<T, vector<int>> ma;
    for (int i = 0; i < n; i++) {
        RH1 x(s[i]);
        RH2 y(s[i]);
        RH3 z(s[i]);

        T suffix = {x.get(1, s[i].size()), y.get(1, s[i].size()), z.get(1, s[i].size())};
        if (ma.find(suffix) != ma.end()) {
            ret += ma[suffix][s[i][0] - 'a'];
        }

        vector<bool> found(26);
        for (int j = 0; j <= s[i].size(); j++) {
            if (j > 0) {
                T now = {x.get(j, s[i].size()), y.get(j, s[i].size()), z.get(j, s[i].size())};
                if (ma.find(now) == ma.end())ma[now] = vector<int>(26);
                for (int k = 0; k < 26; k++) {
                    ma[now][k] += found[k] ? 1 : 0;
                }
            }
            if (j < s[i].size())found[s[i][j] - 'a'] = true;
        }
    }

    cout << ret << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:72:35: error: use of deleted function 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map() [with _Key = std::tuple<unsigned int, unsigned int, unsigned int>; _Tp = std::vector<int>; _Hash = std::hash<std::tuple<unsigned int, unsigned int, unsigned int> >; _Pred = std::equal_to<std::tuple<unsigned int, unsigned int, unsigned int> >; _Alloc = std::allocator<std::pair<const std::tuple<unsigned int, unsigned int, unsigned int>, std::vector<int> > >]'
   72 |     unordered_map<T, vector<int>> ma;
      |                                   ^~
In file included from /usr/include/c++/14/unordered_map:41,
                 from a.cc:3:
/usr/include/c++/14/bits/unordered_map.h:148:7: note: 'std::unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map() [with _Key = std::tuple<unsigned int, unsigned int, unsigned int>; _Tp = std::vector<int>; _Hash = std::hash<std::tuple<unsigned int, unsigned int, unsigned int> >; _Pred = std::equal_to<std::tuple<unsigned int, unsigned int, unsigned int> >; _Alloc = std::allocator<std::pair<const std::tuple<unsigned int, unsigned int, unsigned int>, std::vector<int> > >]' is implicitly deleted because the default definition would be ill-formed:
  148 |       unordered_map() = default;
      |       ^~~~~~~~~~~~~
/usr/include/c++/14/bits/unordered_map.h: At global scope:
/usr/include/c++/14/bits/unordered_map.h:148:7: error: use of deleted function 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_Hashtable() [with _Key = std::tuple<unsigned int, unsigned int, unsigned int>; _Value = std::pair<const std::tuple<unsigned int, unsigned int, unsigned int>, std::vector<int> >; _Alloc = std::allocator<std::pair<const std::tuple<unsigned int, unsigned int, unsigned int>, std::vector<int> > >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::tuple<unsigned int, unsigned int, unsigned int> >; _Hash = std::hash<std::tuple<unsigned int, unsigned int, unsigned int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, false, true>]'
In file included from /usr/include/c++/14/bits/unordered_map.h:33:
/usr/include/c++/14/bits/hashtable.h:539:7: note: 'std::_Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::_Hashtable() [with _Key = std::tuple<unsigned int, unsigned int, unsigned int>; _Value = std::pair<const std::tuple<unsigned int, unsigned int, unsigned int>, std::vector<int> >; _Alloc = std::allocator<std::pair<const std::tuple<unsigned int, unsigned int, unsigned int>, std::vector<int> > >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::tuple<unsigned int, unsigned int, unsigned int> >; _Hash = std::hash<std::tuple<unsigned int, unsigned int, unsigned int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _RehashPolicy = std::__detail::_Prime_rehash_policy; _Traits = std::__detail::_Hashtable_traits<true, false, true>]' is implicitly deleted because the default definition would be ill-formed:
  539 |       _Hashtable() = default;
      |       ^~~~~~~~~~
/usr/include/c++/14/bits/hashtable.h:539:7: error: use of deleted function 'std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _Traits>::_Hashtable_base() [with _Key = std::tuple<unsigned int, unsigned int, unsigned int>; _Value = std::pair<const std::tuple<unsigned int, unsigned int, unsigned int>, std::vector<int> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::tuple<unsigned int, unsigned int, unsigned int> >; _Hash = std::hash<std::tuple<unsigned int, unsigned int, unsigned int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _Traits = std::__detail::_Hashtable_traits<true, false, true>]'
In file included from /usr/include/c++/14/bits/hashtable.h:35:
/usr/include/c++/14/bits/hashtable_policy.h:1731:7: note: 'std::__detail::_Hashtable_base<_Key, _Value, _ExtractKey, _Equal, _Hash, _RangeHash, _Unused, _Traits>::_Hashtable_base() [with _Key = std::tuple<unsigned int, unsigned int, unsigned int>; _Value = std::pair<const std::tuple<unsigned int, unsigned int, unsigned int>, std::vector<int> >; _ExtractKey = std::__detail::_Select1st; _Equal = std::equal_to<std::tuple<unsigned int, unsigned int, unsigned int> >; _Hash = std::hash<std::tuple<unsigned int, unsigned int, unsigned int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; _Traits = std::__detail::_Hashtable_traits<true, false, true>]' is implicitly deleted because the default definition would be ill-formed:
 1731 |       _Hashtable_base() = default;
      |       ^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1731:7: error: use of deleted function 'std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash, _Unused, __cache_hash_code>::_Hash_code_base() [with _Key = std::tuple<unsigned int, unsigned int, unsigned int>; _Value = std::pair<const std::tuple<unsigned int, unsigned int, unsigned int>, std::vector<int> >; _ExtractKey = std::__detail::_Select1st; _Hash = std::hash<std::tuple<unsigned int, unsigned int, unsigned int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; bool __cache_hash_code = true]'
/usr/include/c++/14/bits/hashtable_policy.h: In instantiation of 'std::__detail::_Hashtable_ebo_helper<_Nm, _Tp, true>::_Hashtable_ebo_helper() [with int _Nm = 1; _Tp = std::hash<std::tuple<unsigned int, unsigned int, unsigned int> >]':
/usr/include/c++/14/bits/hashtable_policy.h:1328:7:   required from here
 1328 |       _Hash_code_base() = default;
      |       ^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1245:49: error: use of deleted function 'std::hash<std::tuple<unsigned int, unsigned int, unsigned int> >::hash()'
 1245 |       _Hashtable_ebo_helper() noexcept(noexcept(_Tp())) : _Tp() { }
      |                                                 ^~~~~
In file included from /usr/include/c++/14/string_view:50,
                 from /usr/include/c++/14/bits/basic_string.h:47,
                 from /usr/include/c++/14/string:54,
                 from /usr/include/c++/14/bits/locale_classes.h:40,
                 from /usr/include/c++/14/bits/ios_base.h:41,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:1:
/usr/include/c++/14/bits/functional_hash.h:102:12: note: 'std::hash<std::tuple<unsigned int, unsigned int, unsigned int> >::hash()' is implicitly deleted because the default definition would be ill-formed:
  102 |     struct hash : __hash_enum<_Tp>
      |            ^~~~
/usr/include/c++/14/bits/functional_hash.h:102:12: error: no matching function for call to 'std::__hash_enum<std::tuple<unsigned int, unsigned int, unsigned int>, false>::__hash_enum()'
/usr/include/c++/14/bits/functional_hash.h:83:7: note: candidate: 'std::__hash_enum<_Tp, <anonymous> >::__hash_enum(std::__hash_enum<_Tp, <anonymous> >&&) [with _Tp = std::tuple<unsigned int, unsigned int, unsigned int>; bool <anonymous> = false]'
   83 |       __hash_enum(__hash_enum&&);
      |       ^~~~~~~~~~~
/usr/include/c++/14/bits/functional_hash.h:83:7: note:   candidate expects 1 argument, 0 provided
/usr/include/c++/14/bits/functional_hash.h:102:12: error: 'std::__hash_enum<_Tp, <anonymous> >::~__hash_enum() [with _Tp = std::tuple<unsigned int, unsigned int, unsigned int>; bool <anonymous> = false]' is private within this context
  102 |     struct hash : __hash_enum<_Tp>
      |            ^~~~
/usr/include/c++/14/bits/functional_hash.h:84:7: note: declared private here
   84 |       ~__hash_enum();
      |       ^
/usr/include/c++/14/bits/hashtable_policy.h:1245:49: note: use '-fdiagnostics-all-candidates' to display considered candidates
 1245 |       _Hashtable_ebo_helper() noexcept(noexcept(_Tp())) : _Tp() { }
      |                                                 ^~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1328:7: note: 'std::__detail::_Hash_code_base<_Key, _Value, _ExtractKey, _Hash, _RangeHash, _Unused, __cache_hash_code>::_Hash_code_base() [with _Key = std::tuple<unsigned int, unsigned int, unsigned int>; _Value = std::pair<const std::tuple<unsigned int, unsigned int, unsigned int>, std::vector<int> >; _ExtractKey = std::__detail::_Select1st; _Hash = std::hash<std::tuple<unsigned int, unsigned int, unsigned int> >; _RangeHash = std::__detail::_Mod_range_hashing; _Unused = std::__detail::_Default_ranged_hash; bool __cache_hash_code = true]' is implicitly deleted because the default definition would be ill-formed:
 1328 |       _Hash_code_base() = default;
      |       ^~~~~~~~~~~~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1328:7: error: use of deleted function 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::tuple<unsigned int, unsigned int, unsigned int> >, true>::~_Hashtable_ebo_helper()'
/usr/include/c++/14/bits/hashtable_policy.h:1242:12: note: 'std::__detail::_Hashtable_ebo_helper<1, std::hash<std::tuple<unsigned int, unsigned int, unsigned int> >, true>::~_Hashtable_ebo_helper()' is implicitly deleted because the default definition would be ill-formed:
 1242 |     struct _Hashtable_ebo_helper<_Nm, _Tp, true>
      |            ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/hashtable_policy.h:1242:12: error: use of deleted function 'std::hash<std::tuple<unsigned int, unsigned int, unsigned int> >::~hash()'
/usr/include/c++/14/bits/functional_hash.h:102:12: note: 'std::hash<std::tuple<unsigned int, unsigned int, unsigned int> >::~hash()' is implicitly deleted because the default definition would be ill-formed:
  102 |     struct hash : __hash_enum<_Tp>
      |            ^~~~
/usr/include/c++/14/bits/functional_hash.h:102:12: error: 'std::__hash_enum<_Tp, <anonymous> >::~__hash_enum() [with _Tp = std::tuple<unsigned i