← All problemsSign in

Even Subarray XOR

CodeChefRating 1620Open on judge ↗

Given a positive integer $N$, construct two arrays $A$ and $B$, each of size $N$ such that: - $A_i \ne A_j$ for all $(1\le i \lt j \le N)$; - $B_i \ne B_j$ for all $(1\le i \lt j \le N)$; - $A_i \ne B_j$ for all $(1\le i,j \le N)$; - $1 \leq A_i, B_i \leq 3\cdot 10^5$ for all $(1\leq i \leq N)$; - $\oplus A[1,i] = \oplus B[1,i]$ for all $(1\le i \le N)$ such that $i$ is **even**. Here $\oplus

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start