[Solution] Or Permutation CodeChef Solution | CodeChef Problem Solution 2022

[Solution] Or Permutation CodeChef Solution | CodeChef Problem Solution 2022

Chef has a sequence A$A$ of N$N$ integers. He picked a non-negative integer X$X$ and obtained another sequence B$B$ of N$N$ integers, defined as Bi=Ai∣X$B_i=A_i\mid X$ for each 1≤i≤N$1\le i\le N$. Unfortunately, he forgot X$X$, and the sequence B$B$ got jumbled.

Chef wonders what the value of X$X$ is. He gives you the sequence A$A$ and the jumbled sequence B$B$. Your task is to find whether there is a non-negative integer X$X$ such that there exists a permutation C$C$ of B$B$ satisfying the condition Ci=Ai∣X$C_i=A_i\mid X$ for each 1≤i≤N$1\le i\le N$.

Solution Click Below:-  CLICK HERE

If there are multiple such X$X$, find any of them.

Note: Here |$|$ represents the bitwise OR operation.

Input Format

• The first line of the input contains a single integer, T$T$, denoting the number of test cases. The description of T$T$ test cases follows.
• Each test case consists of 3$3$ lines of input.
• The first line of each test case contains a single integer N$N$.
• The second line of each test case contains N$N$ space-separated integers, denoting the sequence A$A$.

Doubt Support Availability CodeChef Solution

Whatsapp Messages CodeChef Solution

Good Pairs CodeChef Solution

Difficulty Rating Order CodeChef Solution

Take discount or Not CodeChef Solution

Infinity Staircase CodeChef Solution

Or Permutation CodeChef Solution

• The third line of each test case contains N$N$ space-separated integers, denoting the sequence B$B$.

Output Format

• For each test case, output on a new line a single non-negative integer X$X$ that satisfies the given condition. If there is no such X$X$, print −1$-1$ instead.

Constraints

• 1≤T≤104$1\le T\le {10}^4$
• 1≤N≤2⋅105$1\le N\le 2\cdot {10}^5$
• 0≤Ai,Bi≤109$0\le A_i,B_i\le {10}^9$ for each 1≤i≤N$1\le i\le N$
• The sum of N$N$ over all test cases doesn't exceed 2⋅105