Maximum XOR
You are given an array of
n integers, and you need to process q queries. Each query consists of a single integer Input
The first line of the input contains two space-separated integers,
n (1 ≤ n ≤ 100 000) and q (1 ≤ q ≤ 100 000), representing the size of the array and the number of queries, respectively.The second line contains
n space-separated integers, The following
q lines each contain a single integer, Output
For each query, output a single integer on a new line, representing the maximum XOR value between the query integer and any element from the array.
Input | Output |
4
3 7 2 5
3
0
2
7 | 7
7
5 |
Constraints
Time limit: 8 seconds
Memory limit: 512 MB
Output limit: 1 MB