1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38
   | #include<bits/stdc++.h> using namespace std; const int N = 1e5+10,P=131; typedef unsigned long long ull; ull h[N],p[N]; string s; ull get(int l,int r) {     return h[r]-h[l-1]*p[r-l+1]; } int main(void) {     int n,m;     scanf("%d%d",&n,&m);     cin>>s;     s = "0"+s;     p[0] =1;     for(int i=1;i<=n;i++)     {         p[i] = p[i-1]*P;         h[i]  = h[i-1]*P +s[i];     }     int l1,r1,l2,r2;     while(m--)     {         scanf("%d%d%d%d",&l1,&r1,&l2,&r2);         if(get(l1,r1)==get(l2,r2))         {             printf("Yes\n");         }         else         {             printf("No\n");         }     }            }
 
  |