Submission #1689373

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, a, n) for(ll i = ((ll) a); i < ((ll) n); i++)
using namespace std;
typedef long long ll;

string S, T;
ll Q, A, B, C, D;

void init(const string &S, string &s) {
  s = "X";
  REP(i, 0, S.length()) {
    if(s[i] == 'A' && S[i] == 'A') s += "B";
    if(s[i] == 'B' && S[i] == 'B') s += "A";
    if(s[i] == 'A' && S[i] == 'B') s += "X";
    if(s[i] == 'B' && S[i] == 'A') s += "X";
    if(s[i] == 'X' && S[i] == 'A') s += "A";
    if(s[i] == 'X' && S[i] == 'B') s += "B";
  }
}

char which(const string &s, ll l, ll r) {
  if(s[l] == 'A' && s[r] == 'A') return 'X';
  if(s[l] == 'B' && s[r] == 'B') return 'X';
  if(s[l] == 'A' && s[r] == 'B') return 'A';
  if(s[l] == 'B' && s[r] == 'A') return 'B';
  if(s[l] == 'X' && s[r] == 'A') return 'A';
  if(s[l] == 'X' && s[r] == 'B') return 'B';
  if(s[l] == 'A' && s[r] == 'X') return 'B';
  if(s[l] == 'B' && s[r] == 'X') return 'A';
  if(s[l] == 'X' && s[r] == 'X') return 'X';
}

int main(void) {
  cin >> S >> T;

  string s, t;
  init(S, s);
  init(T, t);

  cin >> Q;
  REP(i, 0, Q) {
    cin >> A >> B >> C >> D;
    if(which(s, A - 1, B) == which(t, C - 1, D)) cout << "YES" << endl;
    else cout << "NO" << endl;
  }
}

Submission Info

Judge Result