Submission #1838946

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

const int N = 100005;

int q;
int fs[N], ft[N];
string s, t;

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	string s, t; cin >> s >> t;
	int ns = s.size();
	int nt = t.size();

	// numA - numB
	for (int i = 1; i <= ns; ++i) fs[i] = fs[i-1] + (s[i-1] == 'A' ? +1 : -1);
	for (int i = 1; i <= nt; ++i) ft[i] = ft[i-1] + (t[i-1] == 'A' ? +1 : -1);

	// can swap two positions: AB -> AAA -> ABBA -> BBBBA -> BA
	// relevant: modulo 3

	cin >> q;
	while(q--) {
		int a, b, c, d;
		cin >> a >> b >> c >> d;
		int S = fs[b] - fs[a - 1];
		int T = ft[d] - ft[c - 1];
		int dif = (T - S);
		if (dif % 3 == 0) printf("YES\n"); else printf("NO\n");
	}
}

Submission Info

Judge Result