Submission #1517858

---

Source Code Expand

#include <cmath>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <functional>
#include <queue>
#include <iostream>
#include <string.h>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdint>
#include <climits>
#include <unordered_set>
#include <sstream>
#include <stack>

using namespace std;

typedef long long int ll;
typedef pair<int,int> pii;
typedef tuple<int,int,int> t3;

using namespace std;

int main(){
    string a, b;
    cin >> a >> b;
    vector<int> qa(a.length()+1);
    vector<int> qb(b.length()+1);
    qa[0] = qb[0] = 0;
    for (int i=0;i < a.length();i++) qa[i+1]=qa[i]+a[i]-'A'+1;
    for (int i=0;i < b.length();i++) qb[i+1]=qb[i]+b[i]-'A'+1;
    int n;
    cin >> n;
    while(n--)
    {
        int x,y,X,Y;
        cin >> x >> y >> X >> Y;
        if((qa[y]-qa[x-1])%3==(qb[Y]-qb[X-1])%3)
        {
            cout << "YES" << endl;
        }
        else
        {
            cout << "NO" << endl;
        }
    }
}

Submission Info

Judge Result