Submission #1857036

---

Source Code Expand

Ss = input()
Ts = input()
q = int(input())
querys = [tuple(map(lambda x: int(x) - 1, input().split())) for i in range(q)]

def countA(Cs):
    numAs = [0] * (len(Cs) + 1)

    for i, C in enumerate(Cs, 1):
        if C == 'A':
            numAs[i] = numAs[i - 1] + 1
        else:
            numAs[i] = numAs[i - 1]

    return numAs


numASs = countA(Ss)
numATs = countA(Ts)
        
for a, b, c, d in querys:
    lenS = b - a + 1
    numAS = numASs[b + 1] - numASs[a]
    lenT = d - c + 1
    numAT = numATs[d + 1] - numATs[c]

    if ((numAS - (lenS - numAS)) - (numAT - (lenT - numAT))) % 3 == 0:
        print('YES')
    else:
        print('NO')

Submission Info

Judge Result