代码

#include<bits/stdc++.h> 
#pragma GCC optimize("Ofast,inline,no-stack-protector,unroll-loops,fast-math")
using namespace std;
#define rep(i,a,b) for(signed i(a);i<=b;++i)
#define rep_(i,a,b) for(signed i(a);i^b;++i)
#define req(i,a,b) for(signed i(a);i>=b;--i)
#define slove(n,q,s1,s2,q_x,q_y,ql_en,anss)\
int chk[3][3]={{0,1,0},{0,0,1},{1,0,0}};\
int i=0;\
for(;i+10<n;i+=10)s1[i]^=48,s2[i]^=48,s1[i+1]^=48,s2[i+1]^=48,s1[i+2]^=48,s2[i+2]^=48,s1[i+3]^=48,s2[i+3]^=48,s1[i+4]^=48,s2[i+4]^=48,s1[i+5]^=48,s2[i+5]^=48,s1[i+6]^=48,s2[i+6]^=48,s1[i+7]^=48,s2[i+7]^=48,s1[i+8]^=48,s2[i+8]^=48,s1[i+9]^=48,s2[i+9]^=48;\
for(;i<n;++i)s1[i]^=48,s2[i]^=48;\
rep_(i,0,q)\
{\
	int ans0,ans1,ans2,ans3,ans4,ans5,ans6,ans7,ans8,ans9;\
	ans0=ans1=ans2=ans3=ans4=ans5=ans6=ans7=ans8=ans9=0;\
	int j=0;\
	for(;j+10<q_len[i];j+=10)ans0+=chk[s1[q_x[i]+j]][s2[q_y[i]+j]],ans1+=chk[s1[q_x[i]+j+1]][s2[q_y[i]+j+1]],ans2+=chk[s1[q_x[i]+j+2]][s2[q_y[i]+j+2]],ans3+=chk[s1[q_x[i]+j+3]][s2[q_y[i]+j+3]],ans4+=chk[s1[q_x[i]+j+4]][s2[q_y[i]+j+4]],ans5+=chk[s1[q_x[i]+j+5]][s2[q_y[i]+j+5]],ans6+=chk[s1[q_x[i]+j+6]][s2[q_y[i]+j+6]],ans7+=chk[s1[q_x[i]+j+7]][s2[q_y[i]+j+7]],ans8+=chk[s1[q_x[i]+j+8]][s2[q_y[i]+j+8]],ans9+=chk[s1[q_x[i]+j+9]][s2[q_y[i]+j+9]];\
	for(;j<q_len[i];++j)ans0+=chk[s1[q_x[i]+j]][s2[q_y[i]+j]];\
	anss[i]=ans0+ans1+ans2+ans3+ans4+ans5+ans6+ans7+ans8+ans9;\
}
void solve(int n, int q, char *s1, char *s2, int *q_x, int *q_y, int *q_len, unsigned *ans) {


		slove(n,q,s1,s2,q_x,q_y,q_len,ans);
}

评测结果