Codeforces Round #291 (Div. 2) C. Watto and Mechanism

C. Watto and Mechanism

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Watto, the owner of a spare parts store, has recently got an order for the mechanism that can process strings in a certain way. Initially the memory of the mechanism is filled with n strings. Then the mechanism should be able to process queries of the following type: "Given string s, determine if the memory of the mechanism contains string tthat consists of the same number of characters as s and differs from s in exactly one position".

Watto has already compiled the mechanism, all that's left is to write a program for it and check it on the data consisting of n initial lines and m queries. He decided to entrust this job to you.

Input

The first line contains two non-negative numbers n and m (0 ≤ n ≤ 3·105, 0 ≤ m ≤ 3·105) — the number of the initial strings and the number of queries, respectively.

Next follow n non-empty strings that are uploaded to the memory of the mechanism.

Next follow m non-empty strings that are the queries to the mechanism.

The total length of lines in the input doesn't exceed 6·105. Each line consists only of letters 'a', 'b', 'c'.

Output

For each query print on a single line "YES" (without the quotes), if the memory of the mechanism contains the required string, otherwise print "NO" (without the quotes).

Sample test(s)

input

2 3
aaaaa
acacaca
aabaa
ccacacc
caaac

output

YES
NO
NO

备注：只有三个字母，弄个三叉树就好了，，用原有的单词构树，在单词终点树的对应位置标记一下；然后M次查询。

#define INF 0x7fffffff
#define eps (1e-9)
#define maxn 1000000000
#define clearto(s,x) memset(s,x,sizeof(s))
using namespace std;
typedef long long llint;

int n,m,len;
char st[600005];
typedef struct nde{
    int ch,vis;
    nde *a,*b,*c;
}   node;
node* newnde(){
    node  *p=new node;
    p->vis=0;
    p->a=NULL;  p->b=NULL;   p->c=NULL;
    return p;
}
void updateTREE(node *root){
    int i;
    node *p=root;
    for(i=0;i<len;i++){
        if(st[i]=='a'){
           if(p->a==NULL) {   p->a=newnde();  p=p->a;   }
           else           {   p=p->a;   }
        }
        if(st[i]=='b'){
           if(p->b==NULL) {   p->b=newnde();  p=p->b;   }
           else           {   p=p->b;   }
        }
        if(st[i]=='c'){
           if(p->c==NULL) {   p->c=newnde();  p=p->c;   }
           else           {   p=p->c;   }
        }
    }
    p->vis=1;
}
int search(int id,int e,node *p){

    if(e==2)   return 0;
    if(id==len){
       if((p->vis==1)&&(e==1))   return 1;
       else                      return 0;
    }
    else if(st[id]=='a'){
         if(p->b!=NULL)    if(search(id+1,e+1,p->b)) return 1;
         if(p->c!=NULL)    if(search(id+1,e+1,p->c)) return 1;
         if(p->a!=NULL)    if(search(id+1,e,p->a))   return 1;
         if(p->a==NULL&&p->b==NULL&&p->c==NULL)      return 0;
    }
    else if(st[id]=='b'){
         if(p->a!=NULL)    if(search(id+1,e+1,p->a)) return 1;
         if(p->c!=NULL)    if(search(id+1,e+1,p->c)) return 1;
         if(p->b!=NULL)    if(search(id+1,e,p->b))   return 1;
         if(p->a==NULL&&p->b==NULL&&p->c==NULL)      return 0;
    }
    else if(st[id]=='c'){
         if(p->b!=NULL)    if(search(id+1,e+1,p->b)) return 1;
         if(p->a!=NULL)    if(search(id+1,e+1,p->a)) return 1;
         if(p->c!=NULL)    if(search(id+1,e,p->c))   return 1;
         if(p->a==NULL&&p->b==NULL&&p->c==NULL)      return 0;
    }
}

int main()
{
    #ifdef LOCAL
       freopen("E:\DATA.txt","r",stdin);
    #endif                       //*/
    int i=0,j=0;
    //puts("OK------");
    while(scanf("%d %d",&n,&m)!=EOF)
    {
         node *root=newnde();
         for(i=0;i<n;i++){
             scanf("%s",st);    len=strlen(st);
             updateTREE(root);
         }

         for(i=1;i<=m;i++){
             scanf("%s",st);       len=strlen(st);
             //printf("\n%s\n",st);
             if(search(0,0,root))  printf("YES");
             else                  printf("NO");
             if(i!=m)   putchar(10);
         }
    }
    return 0;
}