菜鸡的博客

度熊手上有一本神奇的字典，你可以在它里面做如下三个操作： 1、insert : 往神奇字典中插入一个单词 2、delete: 在神奇字典中删除所有前缀等于给定字符串的单词 3、search: 查询是否在神奇字典中有一个字符串的前缀等于给定的字符串 Input 这里仅有一组测试数据。第一行输入一个正整数N(1≤N≤100000)N(1≤N≤100000)，代表度熊对于字典的操作次数，...

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 system responds with the r...

Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀). Input 输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连串的提问,每行一个提问,每个提问都是一个字符串. 注意:...

　　We all use cell phone today. And we must be familiar with the intelligent English input method on the cell phone. To be specific, the number buttons may correspond to some English letters respective...

Today at the lesson Vitya learned a very interesting function—mex.Mexof a sequence of numbers is the minimum non-negative number that is not present in the sequence as element. For example,mex([4...

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 ancient printer: so ancient t...

Memphis loves xor very musch.Now he gets an array A.The length of A is n.Now he wants to know the sum of all (lowbit(AiAixorAjAj))(i,j∈[1,n])(i,j∈[1,n]) We define that lowbit(x)=2k2k,k is the small...

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...

【01字典树】 01字典树主要用于解决求异或最值的问题。 01字典树和普通的字典树原理类似，只不过把插入字符改成了插入二进制串的每一位（0或1）。 让我们通过一段简短的代码理解一下实现过程。 int pos=0; void add(int num) //插入 { int c=0; for(int i=31;i>=0;i--){ int op=((nu...

本文转载自：https://blog.youkuaiyun.com/weixin_39778570/article/details/81990417 什么是字典树？ 叫前缀树更容易理解 字典树的样子 Trie又被称为前缀树、字典树，所以当然是一棵树。上面这棵Trie树包含的字符串集合是{in, inn, int, tea, ten, to}。每个节点的编号是我们为了描述方便加上去的。树中的每...