Submission #1623989

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7;
const int MAX_N=10000;
int q,a,b,c,d,s[100010]={},t[100010]={};
string ss,tt;

//項書換えだ〜、わーい。 多分合流性はあるので'A'の数でア

int main(){
	cin >> ss >> tt >> q;
	
	REP(i,0,ss.size()) s[i+1]=s[i]+(ss[i]=='A'?1:2);
	REP(i,0,tt.size()) t[i+1]=t[i]+(tt[i]=='A'?1:2);

	REP(i,0,q){
		cin >> a >> b >> c >> d;
		cout << ((s[b]-s[a-1])%3==(t[d]-t[c-1])%3?"YES":"NO") << endl;
	}			
	
	return 0;
}
	

Submission Info

Judge Result