代码

#pragma GCC optimize("Ofast",3,"inline")
void solve(int n, int q, char *s1, char *s2, int *q_x, int *q_y, int *q_len, unsigned *ans) {
    const int win[] = { 0, 1, 0, 0, 0, 1, 1, 0, 0 };
    for (int i = 0; i < q; ++i) {
        char *x = s1 + q_x[i];
        char *y = s2 + q_y[i];
        int ret = 0;
        for (int j = 0; j < q_len[i]; ++j) ret += win[(*(x++) ^ 48) * 3 + (*(y++) ^ 48)];
        ans[i] = ret;
    }
}

评测结果