字典树
junior19
abcde
展开
-
NBUT1597:Find MaxXorSum(字典树)
[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 w原创 2017-04-07 18:49:40 · 365 阅读 · 0 评论 -
HDU1247:Hat’s Words(字典树)
Hat’s WordsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14599 Accepted Submission(s): 5214Problem DescriptionA hat’s word原创 2017-04-08 16:51:26 · 253 阅读 · 0 评论 -
HDU1671:Phone List(字典树)
Phone ListTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19457 Accepted Submission(s): 6568Problem DescriptionGiven a list o原创 2017-04-08 17:42:13 · 275 阅读 · 0 评论 -
HDU5536:Chip Factory(字典树)
Chip FactoryTime Limit: 18000/9000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2699 Accepted Submission(s): 1197Problem DescriptionJohn is a原创 2017-05-20 13:57:10 · 304 阅读 · 0 评论 -
CF512A:Fox And Names(拓扑排序 & 字典树)
A. Fox And Namestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFox Ciel is going to publish a paper on FO原创 2017-08-04 13:41:03 · 280 阅读 · 0 评论 -
HDU4757: Tree(可持久化Trie)
Zero and One are good friends who always have fun with each other. This time, they decide to do something on a tree which is a kind of graph that there is only one path from node to node. First, Zero...原创 2018-05-17 08:04:21 · 358 阅读 · 0 评论 -
CODECHEF:Sheokand and String(字典树)
Sheokand loves strings. Chef has NN strings S1,S2,…,SNS1,S2,…,SN which he wants to give to Sheokand; however, he doesn't want to give them away for free, so Sheokand must first correctly answer QQ que...原创 2018-06-21 19:20:17 · 352 阅读 · 0 评论 -
nowcoder:[编程题] 异或(01字典树)
[编程题] 异或时间限制:1秒空间限制:32768K给定整数m以及n各数字A1,A2,..An,将数列A中所有元素两两异或,共能得到n(n-1)/2个结果,请求出这些结果中大于m的有多少个。输入描述:第一行包含两个整数n,m. 第二行给出n个整数A1,A2,...,An。数据范围对于30%的数据,1 <= n, m <= 1000对于100%的数据...原创 2018-11-20 16:57:41 · 297 阅读 · 0 评论