CodeForces - 514C Watto and Mechanism（字典树）

最新推荐文章于 2019-10-14 19:16:36 发布

xuziling_

最新推荐文章于 2019-10-14 19:16:36 发布

阅读量244

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/xuziling_/article/details/79822418

版权

博客讲述了如何使用字典树处理CodeForces上的514C问题，即判断一组字符串中是否存在另一个字符串与给定查询字符串仅相差一个位置。博客提供了输入输出示例，并解析了解题思路，强调了在编写解决方案时注意代码结构的重要性。

摘要由CSDN通过智能技术生成

CodeForces - 514C Watto and Mechanism（字典树）

【vj链接】
【cf链接】

题目

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·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).