Submission #1294909

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb emplace_back
#define INF (1e9+1)
//#define INF (1LL<<59)

int main(){
    string s,t;
    cin>>s>>t;
    
    vector<int> cs(s.size()+1,0),ct(t.size()+1,0);
    
    rep(i,s.size()){
        if(s[i]=='A')cs[i+1]=1;
        else cs[i+1]=2;
    }
    rep(i,t.size()){
        if(t[i]=='A')ct[i+1]=1;
        else ct[i+1]=2;
    }
    rep(i,cs.size()-1)cs[i+1]+=cs[i];
    rep(i,ct.size()-1)ct[i+1]+=ct[i];
    
    int q;
    cin>>q;
    rep(i,q){
        int a,b,c,d;
        cin>>a>>b>>c>>d;
        a--,b--,c--,d--;
        
        int x=cs[b+1]-cs[a], y=ct[d+1]-ct[c];
        
        if(abs(x-y)%3==0)cout<<"YES"<<endl;
        else cout<<"NO"<<endl;
    }
}

Submission Info

Judge Result