字典树
文章平均质量分 71
kuronekonano
这个作者很懒,什么都没留下…
展开
-
深信服2020研发新员工训练题【组词】(字典树单串多词判断)
题目描述 判断所给的字符串是否由所给的词典中的若干个词组成。 如已知词典[“code”, “sangfor”, “org”] 则字符串"codesangfororg" 由上述词典组成, 字符串"codesangforsangfororg" 也由上述词典组成, 但字符串"sangforcom" 则不由上述词典组成。 输入描述: 第一行一个数字K 表示词典个数 后面若干行则为具体的输入词典,一个词典一行 最后一行输入待判定的字符串 输出描述: 若字符串为对应的词典组成,则输出yes,否则输出no 示例1 输入原创 2020-07-02 21:36:09 · 405 阅读 · 1 评论 -
字典树【入门介绍】
什么是字典树? 字典树(又叫单词查找树、TrieTree),是一种树形结构,典型应用是用于统计,排序和保存大量的字符串(但不仅限于字符串,如01字典树)。主要思想是利用字符串的公共前缀来节约存储空间。很好地利用了串的公共前缀,节约了存储空间。字典树主要包含两种操作,插入和查找。 字典树的优点 节约空间 例如在现实生活中,我们需要存储很多URL(Uniform Resoure Locator:...原创 2019-08-25 15:40:12 · 5022 阅读 · 8 评论 -
UPC-3029 Bless You Autocorrect!(字典树+BFS)
Typing on phones can be tedious. It is easy to make typing mistakes, which is why most phones come with an autocorrect feature. Autocorrect not only fixes common typos, but also suggests how to finish t...原创 2018-10-14 22:43:17 · 339 阅读 · 0 评论 -
UPC-9264 Chip Factory(01字典树)
题目描述 John is a manager of a CPU chip factory, the factory produces lots of chips everyday. To manage large amounts of products, every processor has a serial number. More specifically, the factory produ...原创 2018-10-04 11:46:10 · 188 阅读 · 0 评论 -
UPC-6597 Don't Be a Subsequence(字符串最短不存在子串)
题目描述 A subsequence of a string S is a string that can be obtained by deleting zero or more characters from S without changing the order of the remaining characters. For example, arc, artistic and (an...原创 2018-08-11 09:34:14 · 416 阅读 · 0 评论 -
NBUT - 1597 Find MaxXorSum(01字典树&两两异或最大值)
[1597] Find MaxXorSum 时间限制: 2000 ms 内存限制: 65535 K 问题描述 Given n non-negative integers, you need to find two integers a and b that a xor b is maximum. xor is exclusive-or. 输入 Input starts with an i...原创 2018-08-02 11:03:48 · 376 阅读 · 0 评论 -
UPC-6359 售票(字典树)
题目描述 C 市火车站最近出现了一种新式自动售票机。买票时,乘客要先在售票机上 输入终点名称。一共有 N 处目的地,随着乘客按顺序输入终点名称的每个字母, 候选终点站数目会逐渐减少。 在自动售票机屏幕上,有一个 4 行 8 列的键盘,如下图所示。 在乘客每输入一个字母后,键盘上只有有效字符是可选的(取决于还有哪些 候选终点站),其余的字母会被字符 ’*’ 取代。 告诉你 N 处目的地...原创 2018-08-02 10:28:57 · 200 阅读 · 0 评论 -
Codeforces Round #367 (Div. 2) D. Vasiliy's Multiset(带删除的01字典树)
D. Vasiliy’s Multiset time limit per test4 seconds memory limit per test256 megabytes inputstandard input outputstandard output Author has gone out of the stories about Vasiliy, so here is just a...原创 2018-08-05 20:40:48 · 212 阅读 · 0 评论 -
HDU-4825 Xor Sum(01字典树)
Problem Description Zeus 和 Prometheus 做了一个游戏,Prometheus 给 Zeus 一个集合,集合中包含了N个正整数,随后 Prometheus 将向 Zeus 发起M次询问,每次询问中包含一个正整数 S ,之后 Zeus 需要在集合当中找出一个正整数 K ,使得 K 与 S 的异或结果最大。Prometheus 为了让 Zeus 看到人类的伟大,随即同...原创 2018-08-05 20:32:48 · 132 阅读 · 0 评论 -
CSU - 2082 I'm new here(树上路径异或和)
The environment of Beijing is insufferable as you know.You have to wear a mask when you go outside because of the smog. Xiaoming is new here,he has to get accustomed to the lifestyle of beijing.So at ...原创 2018-06-23 20:17:14 · 849 阅读 · 0 评论 -
HDU - 1251 统计难题(字典树)
Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀). Input 输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连串的提问,每行一个提问,每个提问都是一个字符串. ...原创 2018-03-10 21:27:56 · 189 阅读 · 0 评论 -
HDU - 1247 Hat’s Words(字典树)
A hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary. You are to find all the hat’s words in a dictionary. Input Standard input consists...原创 2018-03-10 21:16:12 · 117 阅读 · 0 评论 -
POJ - 3630 Phone List(字典树建树同时检索)
Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let’s say the phone catalogue listed these numbers: Emergency 911 Alice 97 625 999 ...原创 2018-03-09 20:47:38 · 182 阅读 · 0 评论 -
POJ 2503 Babelfish(字典树模板题)
You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them. Input Input ...原创 2018-03-09 19:38:25 · 284 阅读 · 0 评论 -
POJ - 1056 IMMEDIATE DECODABILITY(字典树建树同时判断前缀重复)
An encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for another symbol. We will assume for this problem that all codes are in binary, ...原创 2018-03-08 23:18:15 · 256 阅读 · 0 评论 -
POJ - 2001 Shortest Prefixes(字典树重复前缀查询)
A prefix of a string is a substring starting at the beginning of the given string. The prefixes of “carbon” are: “c”, “ca”, “car”, “carb”, “carbo”, and “carbon”. Note that the empty string is not cons...原创 2018-03-08 22:40:31 · 478 阅读 · 0 评论