Submission #1215934

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX_N = 100000;

string S, T;
int Q;
int sumA[2][MAX_N + 1], sumB[2][MAX_N + 1];

signed main()
{
	cin >> S >> T >> Q;
	for (int i = 0; i < S.size(); i++)
	{
		sumA[0][i + 1] = sumA[0][i] + (S[i] == 'A');
		sumB[0][i + 1] = sumB[0][i] + (S[i] == 'B');
	}
	for (int i = 0; i < T.size(); i++)
	{
		sumA[1][i + 1] = sumA[1][i] + (T[i] == 'A');
		sumB[1][i + 1] = sumB[1][i] + (T[i] == 'B');
	}
	for (int i = 0; i < Q; i++)
	{
		int a, b, c, d;
		cin >> a >> b >> c >> d;
		a--; c--;
		int x = (3*MAX_N + sumA[0][b] - sumA[0][a] + sumB[0][a] - sumB[0][b]) % 3;
		int y = (3*MAX_N + sumA[1][d] - sumA[1][c] + sumB[1][c] - sumB[1][d]) % 3;
		puts(x == y ? "YES" : "NO");
	}
	return 0;
}

Submission Info

Judge Result