Codeforces C. Watto and Mechanism （字典树+DFS）

Top_Spirit

于 2019-01-17 10:08:57 发布

阅读量283

点赞数

CC 4.0 BY-SA版权

分类专栏：字典树搜索文章标签： acm 字典树 DFS

本文链接：https://blog.csdn.net/weixin_41190227/article/details/86518484

这是一道关于ACM竞赛的编程题目，要求实现一个机制来处理字符串查询。初始有n个字符串存储在内存中，之后有m个查询，每个查询要检查是否内存中存在一个与给定字符串长度相同且只在一位上不同的字符串。解题策略是使用字典树和深度优先搜索（DFS）。对于每个查询，在字典树中进行DFS，如果找到匹配或只有一位不同的字符串，则返回'YES'，否则返回'NO'。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 sin 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.<