AcWing841 字符串哈希

#include<iostream>
using namespace std;
const int N = 100010;
int P = 131;//p一般取131/13331
char str[N];
typedef unsigned long long ULL;//可以避免对2^64取模
ULL h[N], p[N];//p用来存储p的次方
ULL getn(int l,int r) {
	return h[r] - h[l - 1] * p[r - l + 1];
	//将hl-1段移动到与r的低位对齐便于减法求出l~r的哈希值
}
int main() {
	int n, m;
	cin >> n >> m >> str + 1;
	p[0] = 1, h[0] = 0;
	for (int i = 1; i <= n; i++) {
		p[i] = p[i - 1] * P;
		h[i] = h[i - 1] * P + str[i];
		//把字符串看成是p进制的数 预处理前缀和
	}
	while (m--) {
		int l1, r1, l2, r2;
		cin >> l1 >> r1 >> l2 >> r2;
		if (getn(l1, r1) == getn(l2, r2))puts("Yes");
		else puts("No");
	}
	return 0;
}