Submission #1687654

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define reps(i,s,n) for(int i=(int)(s);i<(int)(n);i++)
const ll mod = 1e9 + 7;
const int INF = 1e9;

int main() {
	cin.sync_with_stdio(false);
	string S, T;
	cin >> S >> T;
	int q;
	cin >> q;
	while (q) {
		q--;
		int a, b, c, d;
		cin >> a >> b >> c >> d;
		a--; b--; c--; d--;
		string s1,s2, t1,t2;
		reps(i, a, b + 1) {
			s1.push_back(S[i]);
		}
		reps(i, c, d + 1) {
			t1.push_back(T[i]);
		}
		bool flag = true;
		while (flag) {
			flag = false;
			rep(i,s1.size()) {
				int siz = s1.size();
				if (i < siz-2) {
					int cnta = 0, cntb = 0;
					reps(j, i, i + 3) {
						if (s1[j] == 'A')cnta++;
						else cntb++;
					}
					if(cnta&&cntb)s2.push_back((cnta>cntb ? 'A' : 'B'));
					flag = true;
					i+=2;
				}
				else s2.push_back(s1[i]);
			}
			s1 = s2;
			s2 = {""};
		}
		flag = true;
		while (flag) {
			flag = false;
			rep(i, t1.size()) {
				int siz = t1.size();
				if (i < siz-2) {
					int cnta = 0, cntb = 0;
					reps(j, i, i + 3) {
						if (t1[j] == 'A')cnta++;
						else cntb++;
					}
					if(cnta&&cntb)t2.push_back((cnta>cntb ? 'A' : 'B'));
					flag = true;
					i += 2;
				}
				else t2.push_back(t1[i]);
			}
			t1 = t2;
			t2 = {""};
		}
		if (s1 == "AA")s1 = 'B';
		if (s1 == "BB")s1 = 'A';
		if (t1 == "AA")t1 = 'B';
		if (t1 == "BB")t1 = 'A';
		//cout << s1 << " " << t1 << endl;
		if (s1 == t1)cout << "YES" << endl;
		else cout << "NO" << endl;
	}
	return 0;
}

Submission Info

Judge Result