代码

#include <bits/stdc++.h>

using namespace std;

void solve(int n, int q, char *s1, char *s2, int *q_x, int *q_y, int *q_len, unsigned *ans) {
  fill(ans, ans + n, 0);
  for (int i = 0; i < n; ++i) {
    s1[i] -= '0';
    s2[i] -= '0';
    s2[i] = (s2[i] + 2) % 3;
  }
  for (int i = 0; i < q; ++i) {
    for (int j = 0; j < q_len[i]; ++j) {
      ans[i] += s1[q_x[i] + j] == s2[q_y[i] + j];
    }
  }
}

评测结果