SMMR-Chi-004: Elision

#include <bits/stdc++.h>

using namespace std;
using pi = pair <int, int>;
const int N = 1e3 + 10;
char A[N], B[N];
bool vs[N][N];
int lenA, lenB;

bool isBig(char a){
    return 'A' <= a and a <= 'Z';
}

bool isSmall(char a){
    return !isBig(a);
}

char toBig(char a){
    if(isBig(a)) return a;
    return a - 'a' + 'A';
}

bool Solve(){
    queue <pi> q;
    q.push({0, 0});
    while(!q.empty()){
        int a = q.front().first;
        int b = q.front().second;
        q.pop();
        if(vs[a][b]) continue;
        vs[a][b] = true;
        if(a == lenA and b == lenB) return true;
        if(b + 1 <= lenB and A[a + 1] == B[b + 1]) q.push({a + 1, b + 1});
        if(b + 1 <= lenB and toBig(A[a + 1]) == B[b + 1]) q.push({a + 1, b + 1});
        if(isSmall(A[a + 1]) and toBig(A[a + 1])) q.push({a + 1, b});
    }
    return false;
}

void Setting(){
    for(int i=0;i<=lenA;i++){
        for(int j=0;j<=lenB;j++){
            vs[i][j] = false;
        }
    }
}

int main(){

    int Q;
    scanf("%d", &Q);

    for(int q=1;q<=Q;q++){
        scanf("%s", A + 1);
        scanf("%s", B + 1);
        lenA = strlen(A + 1);
        lenB = strlen(B + 1);
        if(Solve()) printf("YES\n");
        else printf("NO\n");
        Setting();
    }

    return 0;
}