题目

蒟蒻的哈希代码

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<queue>
#include<map>
#include<cstring>
#include<stack>
#define ull unsigned long long
using namespace std;
ull T,p=131,he[100010],cnt=0,ji[100010];
string s,t;
ull haxi(string s)
{
	ull ans=0;
	for(int i=0;i<s.length();i++)ans=ans*p+(s[i]-'a'+1);
	return ans;
}
int main()
{
	cin>>s;
	ji[0]=1;
	for(int i=1;i<=s.size();i++)
	{
		t+=s[i-1];
		he[i]=haxi(t),ji[i]=ji[i-1]*p;
	}
	cin>>T;
	while(T--)
	{
		int l1,l2,r1,r2;
		cin>>l1>>r1>>l2>>r2;
		if(he[r1]-he[l1-1]*ji[r1-l1+1]==he[r2]-he[l2-1]*ji[r2-l2+1])cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	}
	return 0;
}