代码

	void solve(int n,int q,char *s1,char* s2,int *qx,int *qy,int *qlen,unsigned* anss)
	{
		int *ss1=new int[n],*ss2=new int[n];
		for(int i=0;i<n;i++){
			ss1[i]=s1[i]-'0';
			ss2[i]=s2[i]-'0';
			ss2[i]=ss2[i]?ss2[i]-1:2;
		}
		for(int i=0;i<q;i++){
			for(int j=0;j<qlen[i];j++){
				ss1[qx[i]+j]==ss2[qy[i]+j]?++anss[i]:0;
			}
		}
	}

评测结果