POJ 3764 The xor-longest Path(xor trie)

题意: $N\le 10^5个点的树,A_i < 2^{31}$$路径异或和:=路径上所有边权的异或和,求最大的路径异或和$     Read more
TaoSama's avatar
TaoSama May 01, 2016

BZOJ 4260 Codechef REBXOR(xor trie)

题意: $2\le N\le 4\times 10^5个数,A_i\le 10^9$$求(A_{l_1}\oplus A_{l_1+1}\oplus\cdots\oplus A_{r_1}) + (A_{l_2}\oplus A_{l_2+1}\oplus\cdots\oplus A_{r_2})$$且1\le l_1\le r_1 < l_2 \le r_2,的最大值$     Read more
TaoSama's avatar
TaoSama May 01, 2016

HDU 5536 Chip Factory(xor trie)

题意: $3\le N\le 10^3个数,求\max_{i,j,k} (s_i+s_j) \oplus s_k的最大值,i\ne j\ne k$     Read more
TaoSama's avatar
TaoSama May 01, 2016

HDU 4825 Xor Sum(xor trie)

题意: $N\le 10^5个数,M\le 10^5次询问$$每次询问给出一个整数K,从数列A_i中找出一个数S使得K\oplus S值最大$     Read more
TaoSama's avatar
TaoSama May 01, 2016