提出 #53366745

---

ソースコード 拡げる

// #pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define inf (ll)1e18
#define pll pair<ll, ll>
#define vi vector<int>
#define vl vector<ll>
#define fi first
#define se second
#define lll __int128
const int N = 1e6 + 5;
struct H {
    static const int N = 1e6 + 5, P = 131;
    ll mod1 = 0, mod2 = 0; //双模数
    ll p1[N], h1[N], p2[N], h2[N];
    ll T1 = 1e5, T2 = 1e9;
    vl t1 = { 3, 19, 43, 49, 57, 69, 103, 109, 129, 151, 153, 169, 183, 189, 193, 207, 213, 237, 267, 271,
              279, 291, 297, 313, 333, 343, 357, 361, 363, 379, 391, 393, 403, 411, 417, 447, 459, 469 };
    vl t2 = { 7, 9, 21, 33, 87, 93, 97, 103, 123, 181, 207, 223, 241, 271, 289, 297, 321, 349, 363, 403,
              409, 411, 427, 433, 439, 447, 453, 459, 483, 513, 531, 579, 607, 613, 637, 663, 711, 753 };
    void init(string s) { //下标从1开始
        ll n = s.size() - 1;
        if (!mod1) {
            srand(time(0)); //随机模数
            mod1 = T1 + t1[rand() % t1.size()], mod2 = T2 + t2[rand() % t2.size()];
        }
        p1[0] = p2[0] = 1, h1[0] = h2[0] = 0;
        for(ll i = 1; i <= n; i++){
            p1[i] = p1[i - 1] * P % mod1;
            p2[i] = p2[i - 1] * P % mod2;
            h1[i] = (h1[i - 1] * P % mod1 + s[i]) % mod1;
            h2[i] = (h2[i - 1] * P % mod2 + s[i]) % mod2;
        }
    }
    pll get(ll l, ll r){
        return {(h1[r] + mod1 - h1[l - 1] * p1[r - l + 1] % mod1) % mod1,
                (h2[r] + mod2 - h2[l - 1] * p2[r - l + 1] % mod2) % mod2};
    }
    bool equal(ll l1, ll r1, ll l2, ll r2){
        return get(l1, r1) == get(l2, r2);
    }
} hx;
ll n;
string s[N];
void solve() {
    cin >> n;
    for (ll i = 1; i <= n; i++)
        cin >> s[i];
    map<pll, ll> mp;
    ll ans = 0;
    for (ll i = 1; i <= n; i++) {
        s[i] = '0' + s[i];
        hx.init(s[i]);
        for (ll j = 1; j < s[i].size(); j++) {
            pll h = hx.get(1, j);
            ans += mp[h];
        	mp[h]++;
        }
    }
    cout << ans << endl;
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    solve();
    return 0;
}

提出情報

コンパイルエラー

Main.cpp: In function ‘void solve()’:
Main.cpp:55:26: warning: comparison of integer expressions of different signedness: ‘long long int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   55 |         for (ll j = 1; j < s[i].size(); j++) {
      |                        ~~^~~~~~~~~~~~~

ジャッジ結果