CF1709E.XOR Tree

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

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$ .

You can apply the following operation any number of times (possibly, zero): select a vertex of the tree and 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?

输入格式

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

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

Then $n - 1$ lines follow, each containing two integers $x$ and $y$ ( $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.

输出格式

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

输入输出样例

输入#1
```
6
3 2 1 3 2 1
4 5
3 4
1 4
2 1
6 1
```
输出#1
```
2
```
输入#2
```
4
2 1 1 1
1 2
1 3
1 4
```
输出#2
```
0
```
输入#3
```
5
2 2 2 2 2
1 2
2 3
3 4
4 5
```
输出#3
```
2
```

说明/提示

In the first example, it is enough to replace the value on the vertex $1$ with $13$ , and the value on the vertex $4$ with $42$ .

首页