PROBLEM LINK:Div1, Div2 DIFFICULTY:EasyMedium PREREQUISITES:Prefix Sum PROBLEM:You are given an array with $N$ elements. You need to answer $Q$ queries. In each query, you are given two parameters $L$ and $R$, and you have to find the smallest integer $X$ such that $0 \le X < 2^{31}$ and the value of $\sum \limits_{i=L}^R (A[i]\text{ xor }X)$ is maximum possible. EXPLANATION:Lets focus on the binary representation of each $A[i]'s$ and $X$. You can observe that each bit are independent, i.e. you can solve the same problem by iterating over each bit. Basically, for each bit you can reduce the problem to simpler one. Given a binary array $P$ of length $N$. And in each query, you need to find minimum $X$ where $0 \le X \le 1$ and the value of $G(L,R) = \sum\limits_{i=L}^R (P[i]\text{ xor }X)$ is maximum possible. Lets see, if we take $X = 0$, value of $G(L,R)$ will be equal to number of occurences of $1$ in range $(L,R)$. If we take $X=1$, value of $G(L,R)$ will be equal to number of occurences of $0$ in range $(L,R)$. Hence, we can conclude that if the number of occurences of $1$ is greater than or equal to number of occurences of $0$ in range we will take $X$ as $0$ else we will take $X$ as $1$. For each query, we just need to answer number of bits that are $1$ at $j^{th}$ bit in the range $(L,R)$ for all $0 \le j < 31$. For doing the same we will maintain prefix sum for each of the bit position. The preprocessing part can be done in $O(N.log(MAX))$. We can answer each of the query in $O(log(MAX))$ now, i.e. $O(1)$ for each of the bit position. For more implementation details, you can have a look at attached solutions. Time Complexity:$O((Q+N).log(MAX))$ AUTHOR'S AND TESTER'S SOLUTIONS
This question is marked "community wiki".
asked 09 Mar, 01:29

No, you do not need segment tree for preprocessing. Just use a prefix array. answered 12 Mar, 19:19

@ayushgoyal1703 The link you provided won't work for other people. This is the link to your submission. answered 16 Mar, 18:09

What are the ways in which the preprocessing part can be done? Segment Tree? answered 12 Mar, 17:23

You can do it by using 2D arrays @stym_06. my c++ soln : https://www.codechef.com/viewsolution/17712082 answered 12 Mar, 20:00

My solution: answered 13 Mar, 01:45

Setter's and Tester's solution are not there and I am having trouble in understanding the approach used for this . Can someone explain an overview of what solution has been used in a less mathematical way ? Thanks in advance :) answered 13 Mar, 10:06

Initially, we have to store setbits of all numbers in a 2D vector. Then take prefix sum of the 2D vector. Let assume that the query is from l to r index. For any jth bit , the numbers having it set are prefix[r][j]  prefix[l  1][j]. The sole crux of the logic is to check whether (for any jth bit) numbers having that bit set are more or not. If numbers having jth bit set are more in query(l > r) , then we have to keep that bit unset in X. And in other way around, if numbers having that bit unset are more , then set that bit in X. If both are equal, keep it unset(question asks for smaller number). link to my solution: https://www.codechef.com/viewsolution/17598273 hope it helps :) answered 13 Mar, 10:27

Segment tree solution https://www.codechef.com/viewsolution/17804708 answered 13 Mar, 19:15

i used square root decomposition. whoever is interested can see answered 13 Mar, 20:33

XXOR this problem can be done with the help of prefix sum of a 2D array into a another matrix of same size of [n][31].This a simple Question based on the basics of dynamic programming as u store the value and use it further by substracting to row let L & R.First you have to on all the 31 bit that is equal 2^311.Then you have to decide which bits should off according to maximize the ans as well as minimize the X.If anyone need soln. Then comment pliz. answered 14 Mar, 18:18
