AcWing 138. 兔子与兔子--字符串哈希

AcWing 138. 兔子与兔子

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll N = 1e7 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 0x7fffffff;
const ll base = 131;
ull h[N], p[N];
char str[N];
ull solve(ll l, ll r) {
    return h[r] - h[l - 1] * p[r - l + 1];
}
int main() {
    ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    cin >> str + 1;
    ll L = strlen(str + 1);
    p[0] = 1;
    for (ll i = 1; i <= L; i++) {
        h[i] = h[i - 1] * base + str[i] - 'a' + 1;//计算hash值
        p[i] = p[i - 1] * base;
    }
    ll m;
    cin >> m;
    while (m--) {
        ll l1, r1, l2, r2;
        cin >> l1 >> r1 >>l2 >>r2;
        if(solve(l1,r1)==solve(l2,r2))cout<<"Yes\n";
        else cout<<"No\n";
    }
    return 0;

}