CH1401 兔子与兔子

#include<bits/stdc++.h>
using namespace std;
const int size=1000005,p=131;
typedef unsigned long long ULL;//自然溢出 
ULL f[size],key[size]; 
int n,T,l1,r1,l2,r2;
char tmp[size];
int main(){
    scanf("%s",tmp+1);
    int len=strlen(tmp+1);f[0]=1;
    for(int i=1;i<=len;++i) key[i]=key[i-1]*p+(ULL)tmp[i],f[i]=f[i-1]*p;
    //按p进制计算 f数组预处理p的幂 
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d%d%d",&l1,&r1,&l2,&r2);
        if(key[r1]-key[l1-1]*f[r1-l1+1]==key[r2]-key[l2-1]*f[r2-l2+1])
        //相当于两段补0对齐相减 判断hash是否相等 
        puts("Yes");
        else puts("No");
    }
    return 0;
}