数据结构-Trie树
文章平均质量分 88
Trie
Mitsuha_
Rush to the dead summer
展开
-
Codeforces-1625D:Binary Spiders(Trie树优化DP)
D. Binary Spiders time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Binary Spiders are species of spiders that live on Mars. These spiders weave their webs to defend themselves from enemies. To we原创 2022-01-16 15:27:40 · 509 阅读 · 0 评论 -
Codeforces-948D:Perfect Security(Trie树)
D. Perfect Securitytime limit per test3.5 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputAlice has a very important message M consisting of some non-negative integers...原创 2018-03-11 10:24:56 · 517 阅读 · 3 评论 -
Codeforces-852G:Bathroom terminal(Trie树+枚举)
G. Bathroom terminal time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Smith wakes up at the side of a dirty,原创 2018-01-10 18:11:00 · 697 阅读 · 0 评论 -
HDU-5536:Chip Factory(Trie树)
HDU-5536:Chip Factory(Trie树)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 produces n chips today, the i-th chip原创 2017-09-21 22:04:05 · 448 阅读 · 0 评论 -
CSU - 1115 :最短的名字
CSU - 1115 :最短的名字在一个奇怪的村子中,很多人的名字都很长,比如aaaaa, bbb and abababab。 名字这么长,叫全名显然起来很不方便。所以村民之间一般只叫名字的前缀。比如叫'aaaaa'的时候可以只叫'aaa',因为没有第二个人名字的前三个字母是'aaa'。不过你不能叫'a',因为有两个人的名字都以'a'开头。村里的人都很聪明,他们总是用最短的称呼叫人。输入保证村里不会有一个人的名字是另外一个人名字的前缀(作为推论,任意两个人的名字都不会相同)。 如果村里的某个人要叫所有人的名原创 2017-08-09 16:47:10 · 351 阅读 · 0 评论