具体见笔记P52或之前我写的题解：字符串哈希模板
别人的题解

#include <iostream>

using namespace std;

typedef unsigned long long ULL;
const int N = 100010, P = 131;
char str[N];
ULL h[N], p[N]; //h[k]存储字符串前k个字母的哈希值 p[k]存储(P^k) mod (2^64)

ULL get(int l, int r) {
    return h[r] - h[l - 1] * p[r - l + 1];
}

int main () {
    int n, m;
    scanf("%d%d%s", &n, &m, str + 1);
    p[0] = 1;
    for (int i = 1; i <= n; i ++) {
        p[i] = p[i - 1] * P;
        h[i] = h[i - 1] * P + str[i];
    }
    while (m --) {
        int l1, r1, l2, r2;
        cin >> l1 >> r1 >> l2 >> r2;
        if (get(l1, r1) == get(l2, r2)) puts("Yes");
        else puts("No");
    }
    return 0;
}