Codeforces Round #291 (Div. 2 ),

Codeforces Round #291 (Div. 2 ),

C. Watto and mechanic ismtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output

Watto, the owner of a spare parts store, has recently got an order for the mechanic that can process strings in a certain way. Initially the memory of the mechanic is filledNStrings. Then the mechanic shocould be able to process queries of the following type: "Given stringS, Determine if the memory of the mechanic contains stringTThat consists of the same number of charactersSAnd differs fromSIn exactly one position ".

Watto has already compiled the mechanic, all that's left is to write a program for it and check it on the data consistingNInitial lines andMQueries. He decided to entrust this job to you.

Input

The first line contains two non-negative numbersNAndM(0 bytes ≤ bytesNLimit ≤ limit 3 · 105, 0 limit ≤ limitMLimit ≤ limit 3 · 105)-the number of the initial strings and the number of queries, respectively.

Next followNNon-empty strings that are uploaded to the memory of the mechanic.

Next followMNon-empty strings that are the queries to the mechanic.

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 mechanic contains the required string, otherwise print "NO" (without the quotes ).

Sample test (s) input

2 3aaaaaacacacaaabaaccacacccaaac

Output

YESNONO

Thought: At first I thought it was the Trie tree, and then I slowly typed... Finally, we can find the brute force, and it seems that many people use hash to do it. It's not very good. Please try again later .. This problem is solved by brute force.

Violent AC code:

#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <set>#define LL long longusing namespace std;int main() {int n, m;while(scanf("%d %d", &n, &m) != EOF) {set<string> a;LL maxn = 0;for(int i = 0; i < n; i++) {string tmp;cin >> tmp;a.insert(tmp);if((int)tmp.size() > maxn) maxn = tmp.size();}if(m * n * maxn < 100000000) {for(int i = 0 ; i < m; i++) {string tmp;cin >> tmp;bool flag = false;for(set<string>::iterator it = a.begin(); it != a.end() && !flag; it++) {if(it->size() == tmp.size()) {int cnt = 0;for(int j = 0; j < it->size(); j++) {if((*it)[j] != tmp[j]) cnt++;}if(cnt == 1) flag = true;}}if(flag) printf("YES\n");else printf("NO\n");}continue;}for(int i = 0; i < m; i++) {string tmp;cin >> tmp;bool flag = false;for(int j = 0; j < tmp.size() && !flag; j++) {if(tmp[j] == 'a') {tmp[j] = 'b';if(a.find(tmp) != a.end()) flag = true;tmp[j] = 'c';if(a.find(tmp) != a.end()) flag = true;tmp[j] = 'a';}else if(tmp[j] == 'b') {tmp[j] = 'c';if(a.find(tmp) != a.end()) flag = true;tmp[j] = 'a';if(a.find(tmp) != a.end()) flag = true;tmp[j] = 'b';}else if(tmp[j] == 'c') {tmp[j] = 'a';if(a.find(tmp) != a.end()) flag = true;tmp[j] = 'b';if(a.find(tmp) != a.end()) flag = true;tmp[j] = 'c';}}if(flag) printf("YES\n");else printf("NO\n");}}return 0;}