580E - Kefa and Watch - CodeForces Solution

#include<bits/stdc++.h>
#include<cmath>
#define ll long long
#define For(i,a,b) for(ll i=a;i<=b;i++)
#define Rof(i,a,b) for(ll i=a;i>=b;i--)
#define N 100010
#define pb push_back
#define ls x<<1
#define rs x<<1|1
#define lson ls,l,mid
#define rson rs,mid+1,r
#define SP fixed<<setprecision(12)
#define mk make_pair
#define pque priority_queue

using namespace std;
char s[N];
int n,m,q,op,l,r,k;

ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}


int main()
{
    n=read(),m=read(),q=read();
    cin>>(s+1);
    For(i,1,m+q){
    	op=read(),l=read(),r=read(),k=read();
    	if(op==1) memset(s+l,k+'0',r-l+1);
    	else{
    		if(memcmp(s+l,s+l+k,r-l-k+1)) printf("NO\n");
    		else printf("YES\n");
		}
	}
    return 0;
}