Хэш подстроки

#include <bits/stdc++.h>
#define ull unsigned long long

using namespace std;

const int N = 1e5 + 3;
const pair<ull, ull> base = {29, 37};

pair<ull, ull> p[N], h[N];

pair<ull, ull> get(int i, int j) {
    if (i == 0) {
        return h[j];
    }
    return {h[j].first - h[i - 1].first * p[j - i + 1].first,
            h[j].second - h[i - 1].second * p[j - i + 1].second};
}

int main() {
    string s;
    cin >> s;
    int n = s.size();
    p[0] = {1, 1};
    for (int i = 1; i <= n; ++i) {
        p[i].first = p[i - 1].first * base.first;
        p[i].second = p[i - 1].second * base.second;
    }

    h[0] = {s[0], s[0]};
    for (int i = 1; i < n; ++i) {
        h[i].first = h[i - 1].first * base.first + s[i];
        h[i].second = h[i - 1].second * base.second + s[i];
    }

    int q;
    cin >> q;
    while (q--) {
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        if (get(a - 1, b - 1) == get(c - 1, d - 1)) {
            cout << "Yes" << endl;
        } else {
            cout << "No" << endl;
        }
    }

    return 0;
}