Leaderboard
Showing:
Handle Score
@Ibrahim Nash 6420
@blackshadows 6380
@mb1973 5642
@Quandray 5233
@akhayrutdinov 5111
@saiujwal13083 4510
@sanjay05 3762
@kirtidee18 3673
@marius_valentin_dragoi 3522
@sushant_a 3459
@verma_ji 3413
Complete Leaderboard
Tree and XOR
Easy Accuracy: 44.86% Submissions: 78 Points: 2

Given a tree with N nodes rooted at 1. Each node labeled with a value arr[i]. The task is to find the maximum xor of any subtree (xor of all labeled values of that subtree).

Note: All the nodes are numbered from 1 to N.

Input:
1. The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
2. The first line of each test case contains a single integer N.
3. The next line contains N space-separated positive integers represents the node value.
4. Next N-1 lines contain two space-separated integers u and v, represents an edge in between them


Output: For each test case, print the answer


Constraints:
1. 1 <= T <= 5

2. 1 <= N <= 105
3. 1 <= arr[i] <= 105


Example:
Input:

2
4
1 2 3 4
1 2
3 4

4 1
5
1 2 1 2 1
1 2
2 3
3 4
4 5

Output:
7
3

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Tree and XOR

Output Window