2012-01-20 ACM群群赛

: · 20

/*2012-01-20 20:42:38	Accepted	1005	671 MS	1132 KB	GNU C++*/
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
#define MM(a,b) memset(a,b,sizeof(a));
typedef unsigned long long u64;
typedef long long lld;
#define maxn 20000

char ch[maxn], temp[ maxn+maxn ];
struct Info{
    int len,kind;
    char c[200];
}node[200];

int ans[maxn];

int next[maxn][26];
int solve(char *s,char *t){
    int i,j,ns,nt;
    ns= strlen(s);
    nt= strlen(t);
    for(i=0;i<26;++i)
        next[ns-1][i]= -1;
    for(i=ns-2;i>=0;--i){
        for(j=0;j<26;++j)
            next[i][j]= next[i+1][j];
        next[i][ s[i+1]-'a' ]= i+1;
    }

    int index;
    if( s[0]==t[0] ) index= 0;
    else index= next[0][t[0]-'a'];

    i= index;
    int n= (ns>>1);
    while(index<= n && index!=-1 ){
        i= index;
        for(j=1;j<nt;++j){
            int NEXT= next[i][ t[j]-'a' ];
            if( NEXT!=-1 && (NEXT-index+1)<= n )
                i= NEXT;
            else break;
        }
        if( j>=nt ) return 1;
        else index= next[index][t[0]-'a'];
    }
    return 0;
}

int main()
{
    //freopen("1005.txt","r",stdin);
    int T,m,i,j;
    cin>>T;
    while(T--){
        scanf("%s",ch);
        cin>>m;
        for(i=1;i<=m;++i){
            scanf("%d%s",&node[i].kind,node[i].c);
            node[i].len= strlen( node[i].c );
        }

        for(i=1;i<=m;++i){
            if( node[i].kind==1 )
                strcat( ch, node[i].c );
        }
        //puts(ch);

        int Q=0;
        for(i=m;i>=1;--i){
            if( node[i].kind==1 ){
                int n= strlen( ch );
                ch[ n-node[i].len ]= '\0';
            }
            else{
                strcpy( temp, ch );
                strcat( temp, ch );
                ans[++Q]= solve( temp, node[i].c );
            }
        }

        for(i=Q;i>0;--i)
            if( ans[i]==0 ) puts("NO");
            else puts("YES");
    }
}