双哈希模板

#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'

using namespace std;

typedef pair<int, int> PII;
typedef long long ll;

const int N = 100010, mod1 = 1e9 + 7, mod2 = 1e9 + 9;
const int P1 = 131, P2 = 13331;

int n, m;
char s[N];
ll p1[N], p2[N], h1[N], h2[N];

inline int get1(int l, int r)
{
	return (h1[r] - h1[l - 1] * p1[r - l + 1] % mod1 + mod1) % mod1;
}

inline int get2(int l, int r)
{
	return (h2[r] - h2[l - 1] * p2[r - l + 1] % mod2 + mod2) % mod2;
}

int main()
{
	IOS
	p1[0] = p2[0] = 1;
	cin >> n >> m;
	cin >> s + 1;
	
	for(int i = 1; i <= n; i ++)
	{
		h1[i] = (h1[i - 1] * P1 + s[i]) % mod1;
		h2[i] = (h2[i - 1] * P2 + s[i]) % mod2;
		
		p1[i] = p1[i - 1] * P1 % mod1;
		p2[i] = p2[i - 1] * P2 % mod2;
	}
	
	while(m --)
	{
		int l1, r1, l2, r2;
		cin >> l1 >> r1 >> l2 >> r2;
		
		if(get1(l1, r1) == get1(l2, r2) && get2(l1, r1) == get2(l2, r2))
		{
			cout << "Yes" << endl;
		}
		else cout << "No" << endl;
	}
	
	return 0;
}

就是两个单独的哈希，双重保障。