<p>You are given an array <code>nums</code> consisting of non-negative integers. You are also given a <code>queries</code> array, where <code>queries[i] = [x<sub>i</sub>, m<sub>i</sub>]</code>.</p>

<p>The answer to the <code>i<sup>th</sup></code> query is the maximum bitwise <code>XOR</code> value of <code>x<sub>i</sub></code> and any element of <code>nums</code> that does not exceed <code>m<sub>i</sub></code>. In other words, the answer is <code>max(nums[j] XOR x<sub>i</sub>)</code> for all <code>j</code> such that <code>nums[j] &lt;= m<sub>i</sub></code>. If all elements in <code>nums</code> are larger than <code>m<sub>i</sub></code>, then the answer is <code>-1</code>.</p>

<p>Return <em>an integer array </em><code>answer</code><em> where </em><code>answer.length == queries.length</code><em> and </em><code>answer[i]</code><em> is the answer to the </em><code>i<sup>th</sup></code><em> query.</em></p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [0,1,2,3,4], queries = [[3,1],[1,3],[5,6]]
<strong>Output:</strong> [3,3,7]
<strong>Explanation:</strong>
1) 0 and 1 are the only two integers not greater than 1. 0 XOR 3 = 3 and 1 XOR 3 = 2. The larger of the two is 3.
2) 1 XOR 2 = 3.
3) 5 XOR 2 = 7.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [5,2,4,6,6,3], queries = [[12,4],[8,1],[6,3]]
<strong>Output:</strong> [15,-1,5]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length, queries.length &lt;= 10<sup>5</sup></code></li>
	<li><code>queries[i].length == 2</code></li>
	<li><code>0 &lt;= nums[j], x<sub>i</sub>, m<sub>i</sub> &lt;= 10<sup>9</sup></code></li>
</ul>

#include <bits/stdc++.h>

using namespace std;

class Solution {
public:
    vector<int> maximizeXor(vector<int> &nums, vector<vector<int>> &queries) {
        int n = nums.size(), m = queries.size();
        int tr[n << 5][2], idx = 0;
        int mn[n << 5];
        memset(tr, 0, sizeof tr);
        memset(mn, 0x3f, sizeof mn);
        auto insert = [&](int x) {
            int p = 0;
            for (int i = 31; ~i; i--) {
                int u = x >> i & 1;
                if (!tr[p][u]) tr[p][u] = ++idx;
                p = tr[p][u];
                mn[p] = min(mn[p], x);
            }
        };
        int min_value = 1e9;
        for (int x: nums) {
            min_value = min(min_value, x);
            insert(x);
        }
        vector<int> res(m);
        for (int it = 0; it < m; it++) {
            int xi = queries[it][0], mi = queries[it][1];
            if (mi < min_value) {
                res[it] = -1;
            } else {
                int num = 0;
                for (int p = 0, i = 31; ~i; i--) {
                    int u = xi >> i & 1;
                    if (tr[p][!u] && mn[tr[p][!u]] <= mi) {
                        p = tr[p][!u];
                        num += (1 << i) * (!u);
                    } else {
                        p = tr[p][u];
                        num += (1 << i) * u;
                    }
                }
                res[it] = num ^ xi;
            }
        }
        return res;
    }
};
131054