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 t that 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·10⁵, 0 ≤ m ≤ 3·10⁵) — 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·10⁵. 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

题意：n个串，m次查询，每次给一个字符串，问在原串中能不能找到一个串，与之长度相同，且只有一个字符不同。

题解：没什么好说的，字典树，强行有个数组不开成全局变量，T哭了，，，，

9856760	2015-02-15 11:39:10	njczy2010	C - Watto and Mechanism	GNU C++	Accepted	577 ms	99188 KB
9856712	2015-02-15 11:34:22	njczy2010	C - Watto and Mechanism	GNU C++	Time limit exceeded on test 32	3000 ms	101200 KB
9856707	2015-02-15 11:33:54	njczy2010	C - Watto and Mechanism	GNU C++	Memory limit exceeded on test 1	46 ms	262100 KB
9856697	2015-02-15 11:32:29	njczy2010	C - Watto and Mechanism	GNU C++	Time limit exceeded on test 32	3000 ms	90700 KB
9856633	2015-02-15 11:26:42	njczy2010	C - Watto and Mechanism	GNU C++	Time limit exceeded on test 32	3000 ms	89500 KB
9856553	2015-02-15 11:17:52	njczy2010	C - Watto and Mechanism	GNU C++	Wrong answer on test 4	15 ms	70700 KB
9856517	2015-02-15 11:14:26	njczy2010	C - Watto and Mechanism	GNU C++	Wrong answer on test 13	46 ms	70800 KB

#include<iostream>
#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<string>

#define N 300005
#define M 1505
//#define mod 10000007
//#define p 10000007
#define mod2 1000000000
#define ll long long
#define LL long long
#define eps 1e-6
//#define inf 2147483647
#define maxi(a,b) (a)>(b)? (a) : (b)
#define mini(a,b) (a)<(b)? (a) : (b)

using namespace std;

int n,m;
int fff[10*N];

typedef struct
{
    char v;
    int mp[4];
}PP;

int tot;
int cnt[10*N];

PP p[10*N];
char s[10*N];

void insert(int l)
{
    int i;
    int now=0;
    for(i=0;i<l;i++){
        if(p[now].mp[ s[i]-'a' ]==0){
            tot++;
            p[now].mp[ s[i]-'a' ]=tot;
            p[tot].v=s[i];
            memset(p[tot].mp,0,sizeof(p[tot].mp));
            now=tot;
        }
        else{
            now=p[now].mp[ s[i]-'a' ];
        }
    }
    cnt[now]++;
}

void ini()
{
    memset(fff,0,sizeof(fff));
    int i;
    int l;
    tot=0;
    p[0].v='z';
    memset(p[0].mp,0,sizeof(p[0].mp));

    for(i=1;i<=n;i++){
        scanf("%s",s);
        l=strlen(s);
        fff[l]=1;
        insert(l);
    }
    //for(i=0;i<=tot;i++){
   //     printf(" i=%d v=%c cnt=%d
",i,p[i].v,cnt[i]);
   // }
}

int check(int l,int cou,int now,int f)
{
   // printf(" l=%d cou=%d now=%d v=%c cnt=%d f=%d
",l,cou,now,p[now].v,cnt[now],f);
    if(cou==l){
        if(cnt[now]==0) return 0;
        if(f==1) return 1;
        else return 0;
    }
    if(f>=2) return 0;
    int i;
    int ff;
    for(i=0;i<=2;i++){
        if(p[now].mp[i]!=0){
            if(s[cou]==i+'a'){
                ff=check(l,cou+1,p[now].mp[i],f);
            }
            else{
                ff=check(l,cou+1,p[now].mp[i],f+1);
            }
            if(ff==1) return 1;
        }
    }
    return 0;
}

void solve()
{
    int i;
    int l;
    int flag;
    for(i=1;i<=m;i++){
        scanf("%s",s);
        l=strlen(s);
       // printf("l=%d
",l);
        if(fff[l]==0){
            flag=0;
        }
        else{
            flag=check(l,0,0,0);
        }
        if(flag==1){
            printf("YES
");
        }
        else{
            printf("NO
");
        }
    }
}

void out()
{

}

int main()
{
    //freopen("data.in","r",stdin);
    //freopen("data.out","w",stdout);
    //scanf("%d",&T);
    //for(int ccnt=1;ccnt<=T;ccnt++)
    //while(T--)
    //scanf("%d%d",&n,&m);
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        ini();
        solve();
        out();
    }
    return 0;
}