Submission #2102677

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
using namespace std;

string s;
string t;

int q;

int memo_s[100010];
int memo_t[100010];

void making(string a,int * memo)
{
	char now = 'A';
	int cou = 0;

	for(int i = 0;i < a.size();i++)
	{
		if(a[i] == now)
		{
			cou++;
		}
		else
		{
			cou = 1;
			now = a[i];
		}

		if(now == 'A')
		{
			memo[i + 1] = memo[i] + 1;
		}
		else
		{
			if(cou % 2 == 1)
			{
				memo[i + 1] = memo[i] + 2;
			}
			else
			{
				memo[i + 1] = memo[i] - 1;
			}
		}
	}
}

bool solve(int a,int b,int c,int d)
{
	int sv = memo_s[b] - memo_s[a - 1];
	int tv = memo_t[d] - memo_t[c - 1];
	int mod = (max(sv,tv) - min(sv,tv));

	mod = mod % 3;

	return mod == 0;
}

int main()
{
	cin >> s >> t >> q;
	
	making(s,memo_s);
	making(t,memo_t);
	for(int i = 0;i < q;i++)
	{
		int a,b,c,d;
		cin >> a >> b >> c >> d;

		if(solve(a,b,c,d))
		{
			cout << "YES" << endl;
		}
		else
		{
			cout << "NO" << endl;
		}
	}
	return 0;


}

Submission Info

Judge Result