HDU 5661 Claris and XOR(xor贪心)

题意: $给定a,b,c,d,1\leq a,b,c,d\leq10^{18}$$现要求找到x\oplus y,x\in [a, b],y\in[c, d]的最大值$     Read more
TaoSama's avatar
TaoSama May 01, 2016

HDU 5014 Number Sequence(xor贪心)

题意: $给定n+1个数,a_i\in [0, n],并且a_i\neq a_j$$现要求构造n+1个b_i,构造方式同a_i,并且使得\sum a_i\oplus b_i最大$$输出这个sum,以及n+1个对应的b_i$     Read more
TaoSama's avatar
TaoSama May 01, 2016

HDU 4757 Tree(可持久化trie)

题意: $N\le 10^5个点的树,点权A_i < 2^{16},M\le 10^5次询问$$每次查询u\to v路径上点权与k异或的最大值$     Read more
TaoSama's avatar
TaoSama May 01, 2016

Educational Codeforces Round 12 E. Beautiful Subarrays(xor trie)

题意: $N\le 10^6个点的数,xor(l, r)=A_l\oplus A_{l+1}\oplus\cdots\oplus A_r$$求xor(l, r)\ge k的(l, r)对数$     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

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

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

CSU 1720 How to Get 2^n(trie上贪心、高精度)

题意: $给定N\le 10^5个数,1\le A_i\le 10^{30}(2^{100}>10^{30})$$求A_i+A_j=2^x的(i, j)对数$     Read more
TaoSama's avatar
TaoSama Apr 29, 2016