vloai

D. Polycarp's phone book time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output There are n phone numbers in Polyc

Ancient Printer Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others) Total Submission(s): 2067    Accepted Submission(s): 1033 Problem Description The conte

Hat’s Words Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 15814    Accepted Submission(s): 5637 Problem Description A hat’s word

Repository Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 5624    Accepted Submission(s): 1868 Problem Description When you go sho

平衡树 Time Limit: 4000/2000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others) Submit Statistic Next Problem Problem Description 神奇的cxlove有一颗平衡树，其树之神奇无法用语言来描述 OrzOrz。 这棵树支持3种操作： 1、

C. Old Berland Languagetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBerland scientists know that the Old Berland language had exactly n words. ...

题目链接题意：有一个有n个数的数列a[]，从1到n标号，有m次询问，询问包含三个数 b,l,r求 a[l] , ... , a[r] 区间内的一个数与 b 异或的最大值求异或最大，假如区间均为[1,n]，则可以用字典树，然后每次询问都只用O(1)的效率就可以得到了就是化为二进制数，然后从位数高的向下推，尽量找不同的当区间会变时，要判断含有在位置上有0或1的数是否在这个区间里所以利用可持续化的思想（...