![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
----字典树
文章平均质量分 85
_Occult_
物語が始まった
展开
-
HDU 3460 Ancient Printer
Problem Description The contest is beginning! While preparing the contest, iSea wanted to print the teams' names separately on a single paper. Unfortunately, what iSea could find was only an ancie原创 2015-04-22 17:54:03 · 361 阅读 · 0 评论 -
POJ 3149 Billing Tables
Description In the world of telecommunications phone calls to different phone numbers have to be charged using different rate or different billing plan. International Carrier of Phone Communicati原创 2016-08-27 19:46:05 · 764 阅读 · 0 评论 -
ACdream 1063 平衡树
Description 神奇的cxlove有一颗平衡树,其树之神奇无法用语言来描述 OrzOrz。 这棵树支持3种操作: 1、加入一个数到树中,维护平衡树的合法性; 2、给一个数X,用O(1)的时间求出来树中的数Y使得 Y ^ X 最大(异或操作, Pascal 写作 xor , 0 ^ 0 = 0 , 1 ^ 1 = 0 , 0 ^ 1 = 1 , 1 ^ 0 = 1 , 2 ^ 3 =原创 2015-05-27 21:39:21 · 598 阅读 · 0 评论 -
HDU 5687 Problem C
Problem Description 度熊手上有一本神奇的字典,你可以在它里面做如下三个操作: 1、insert : 往神奇字典中插入一个单词 2、delete: 在神奇字典中删除所有前缀等于给定字符串的单词 3、search: 查询是否在神奇字典中有一个字符串的前缀等于给定的字符串 Input 这里仅有一组测试数据。第一行输入一原创 2016-05-16 13:42:50 · 609 阅读 · 0 评论 -
HDU 5229 ZCC loves strings
Problem Description ZCC has got N strings. He is now playing a game with Miss G.. ZCC will pick up two strings among those N strings randomly(A string can't be chosen twice). Each string has the sa原创 2015-05-16 21:39:25 · 544 阅读 · 0 评论 -
UVA 1401 Remember the Word
Neal is very curious about combinatorial problems, and now here comes a problem about words. Knowing that Ray has a photographic memory and this may not trouble him, Neal gives it to Jiejie. Since原创 2015-02-17 15:31:49 · 554 阅读 · 0 评论 -
CSU 1115 最短的名字
Description 在一个奇怪的村子中,很多人的名字都很长,比如aaaaa, bbb and abababab。 名字这么长,叫全名显然起来很不方便。所以村民之间一般只叫名字的前缀。比如叫'aaaaa'的时候可以只叫'aaa',因为没有第二个人名字的前三个字母是'aaa'。不过你不能叫'a',因为有两个人的名字都以'a'开头。村里的人都很聪明,他们总是用最短的称呼叫人。输入保证村里原创 2015-04-07 12:37:06 · 653 阅读 · 0 评论 -
HDU 1251 统计难题
Problem Description Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀). Input 输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一原创 2015-04-22 17:14:09 · 436 阅读 · 0 评论 -
HDU 1298 T9
Problem Description A while ago it was quite cumbersome to create a message for the Short Message Service (SMS) on a mobile phone. This was because you only have nine keys and the alphabet has more原创 2015-04-22 17:16:36 · 413 阅读 · 0 评论 -
HDU 1671 Phone List
Problem Description 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. Emerge原创 2015-04-22 17:18:11 · 447 阅读 · 0 评论 -
HDU 2846 Repository
Problem Description When you go shopping, you can search in repository for avalible merchandises by the computers and internet. First you give the search system a name about something, then the sys原创 2015-04-22 17:18:13 · 386 阅读 · 0 评论 -
HDU 1800 Flying to the Mars
Problem Description In the year 8888, the Earth is ruled by the PPF Empire . As the population growing , PPF needs to find more land for the newborns . Finally , PPF decides to attack Kscinow w原创 2015-04-22 17:36:17 · 354 阅读 · 0 评论 -
HYSBZ 2251 外星联络
小 P 在看过电影《超时空接触》(Contact)之后被深深的打动,决心致力于寻 找外星人的事业。于是,他每天晚上都爬在屋顶上试图用自己的收音机收听外星 人发来的信息。虽然他收听到的仅仅是一些噪声,但是他还是按照这些噪声的高 低电平将接收到的信号改写为由 0 和 1 构成的串, 并坚信外星人的信息就隐藏在 其中。他认为,外星人发来的信息一定会在他接受到的 01 串中重复出现,所以 他希望原创 2016-12-30 10:48:43 · 279 阅读 · 0 评论