代码

void solve(int n, int q, char *s1, char *s2, int *q_x, int *q_y, int *q_len, unsigned *ans) {
	int s[3000000];
        s[0]=s1[0]<s2[0]&&s2[0]!='2';
        for(int i=1;i<n;i++)s[i]=s[i-1]+(s1[0]<s2[0]&&s2[0]!=2);
        for(int i=0;i<q;i++)ans[i]=s[q_y[i]]-s[q_x[i]-1];
}

评测结果