Submission #2114264

---

Source Code Expand

S = input()
T = input()
def count(S):
    L = len(S)
    cA = [0]*(L+1)
    cB = [0]*(L+1)
    for i in range(L):
        cA[i+1] = cA[i] + (S[i] == 'A')
        cB[i+1] = cB[i] + (S[i] == 'B')
    return cA, cB

sA, sB = count(S)
tA, tB = count(T)
q = int(input())
ans = []
for i in range(q):
    a, b, c, d = map(int, input().split())
    dA = (sA[b] - sA[a-1]) - (tA[d] - tA[c-1])
    dB = (sB[b] - sB[a-1]) - (tB[d] - tB[c-1])
    if (2*dA + dB) % 3 == 0 and (dA + 2*dB) % 3 == 0:
        ans.append('YES')
    else:
        ans.append('NO')
print(*ans, sep='\n')

Submission Info

Judge Result