
字典树
旺旺_碎_冰冰
这个作者很懒,什么都没留下…
展开
-
Xor Sum HDU - 4825(异或&01字典树)
Zeus 和 Prometheus 做了一个游戏,Prometheus 给 Zeus 一个集合,集合中包含了N个正整数,随后 Prometheus 将向 Zeus 发起M次询问,每次询问中包含一个正整数 S ,之后 Zeus 需要在集合当中找出一个正整数 K ,使得 K 与 S 的异或结果最大。Prometheus 为了让 Zeus 看到人类的伟大,随即同意 Zeus 可以向人类求助。你能证明...原创 2018-05-11 16:57:03 · 341 阅读 · 0 评论 -
Sausage Maximization CodeForces - 282E(异或&01字典树)
The Bitlandians are quite weird people. They have their own problems and their own solutions. They have their own thoughts and their own beliefs, they have their own values and their own merits. They ...原创 2018-05-11 17:49:19 · 327 阅读 · 0 评论 -
Vasiliy's Multiset CodeForces - 706D(异或&01字典树)
Author has gone out of the stories about Vasiliy, so here is just a formal task description.You are given q queries and a multiset A, initially containing only integer 0. There are three types of quer...原创 2018-05-11 19:13:08 · 243 阅读 · 0 评论 -
Hat’s Words HDU - 1247(字典树)
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 cons原创 2018-05-07 10:22:13 · 239 阅读 · 0 评论 -
统计难题 HDU - 1251 (字典树模板题&stl&二分)
Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀). Input 输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连串的提问,每行一...原创 2018-05-14 21:40:43 · 251 阅读 · 0 评论 -
单词数 HDU - 2072(字典树模板题&stl)
lily的好朋友xiaoou333最近很空,他想了一件没有什么意义的事情,就是统计一篇文章里不同单词的总数。下面你的任务是帮助xiaoou333解决这个问题。 Input 有多组数据,每组一行,每组就是一篇小文章。每篇小文章都是由小写字母和空格组成,没有标点符号,遇到#时表示输入结束。 Output 每组只输出一个整...原创 2018-05-15 08:10:49 · 742 阅读 · 0 评论 -
Phone List HDU - 1671(字典树模板题)
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: 1. Emergency 911 2. Alice 97 ...原创 2018-05-15 08:37:15 · 333 阅读 · 0 评论 -
Immediate Decodability HDU - 1305(字典树模板题)
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-05-15 09:02:04 · 313 阅读 · 0 评论 -
What Are You Talking About HDU - 1075(字典树)
Ignatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leaves. Now Ignatius wan...原创 2018-05-15 09:26:38 · 334 阅读 · 0 评论