[Solution] XOR Tree Codeforces Solution 2022 | Solution Codeforces

E. XOR Tree

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a tree consisting of 𝑛$n$ vertices. A number is written on each vertex; the number on vertex 𝑖$i$ is equal to 𝑎𝑖$a_i$.

Recall that a simple path is a path that visits each vertex at most once. Let the weight of the path be the bitwise XOR of the values written on vertices it consists of. Let's say that a tree is good if no simple path has weight 0$0$.

You can apply the following operation any number of times (possibly, zero): select a vertex of the tree and

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

 replace the value written on it with an arbitrary positive integer. What is the minimum number of times you have to apply this operation in order to make the tree good?

Input

The first line contains one integer 𝑛$n$ (1≤𝑛≤2⋅105$1\le n\le 2\cdot {10}^5$) — the number of vertices.

Three Doors Codeforces Solution 2022

Also Try Minecraft Codeforces Solution

Recover an RBS Codeforces Solution

Rorororobot Codeforces Solution 

XOR Tree Codeforces Solution

Multiset of Strings Codeforces Solution

The second line contains 𝑛$n$ integers 𝑎1$a_1$, 𝑎2$a_2$, ..., 𝑎𝑛$a_n$ (1≤𝑎𝑖<230$1\le a_i<2^{30}$) — the numbers written on vertices.

Then 𝑛−1$n-1$ lines follow, each containing two integers 𝑥$x$ and 𝑦$y$ (1≤𝑥,𝑦≤𝑛;𝑥≠𝑦$1\le x,y\le n;x\ne y$) denoting an edge connecting vertex 𝑥$x$ with vertex 𝑦$y$. It is guaranteed that these edges form a tree.

Output

Print a single integer — the minimum number of times you have to apply the operation in order to make the tree good.