Codeforces Round #396 (Div. 2)E(树形dp,按位运算,好题)

题目链接

E. Mahmoud and a xor trip

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Mahmoud and Ehab live in a country with n cities numbered from 1 to n and connected by n - 1 undirected roads. It's guaranteed that you can reach any city from any other using these roads. Each city has a number ai attached to it.

We define the distance from city x to city y as the xor of numbers attached to the cities on the path from x to y (including both x and y). In other words if values attached to the cities on the path from x to y form an array p of length l then the distance between them is , where  is bitwise xor operation.

Mahmoud and Ehab want to choose two cities and make a journey from one to another. The index of the start city is always less than or equal to the index of the finish city (they may start and finish in the same city and in this case the distance equals the number attached to that city). They can't determine the two cities so they try every city as a start and every city with greater index as a finish. They want to know the total distance between all pairs of cities.

Input

The first line contains integer n (1 ≤ n ≤ 105) — the number of cities in Mahmoud and Ehab's country.

Then the second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 106) which represent the numbers attached to the cities. Integer ai is attached to the city i.

Each of the next n  -  1 lines contains two integers u and v (1  ≤  u,  v  ≤  n, u  ≠  v), denoting that there is an undirected road between cities u and v. It's guaranteed that you can reach any city from any other using these roads.

Output

Output one number denoting the total distance between all pairs of cities.

Examples

input

3
1 2 3
1 2
2 3

output

10

input

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

output

52

input

5
10 9 8 7 6
1 2
2 3
3 4
3 5

output

131

Note

A bitwise xor takes two bit integers of equal length and performs the logical xor operation on each pair of corresponding bits. The result in each position is 1 if only the first bit is 1 or only the second bit is 1, but will be 0 if both are 0 or both are 1. You can read more about bitwise xor operation here: https://en.wikipedia.org/wiki/Bitwise_operation#XOR.

In the first sample the available paths are:

• city 1 to itself with a distance of 1, 
• city 2 to itself with a distance of 2, 
• city 3 to itself with a distance of 3, 
• city 1 to city 2 with a distance of , 
• city 1 to city 3 with a distance of , 
• city 2 to city 3 with a distance of . 

The total distance between all pairs of cities equals  1 + 2 + 3 + 3 + 0 + 1 = 10.

题意：

给出一棵树，树上每个结点有个权值，树上两点u，v间一条路径的长度定义为u到v的路径上结点权值异或和。自身到自身的路径长度定义为该结点的权值。求所有点对之间路径长度和。

参考博客链接

题解：

这题可以计算二进制每一位对答案的贡献,因为权值范围1e6,计算2^0----2^20就好了

计数的时候用cnt[u][0]记录以u为根异或值为0的路径数量,cnt[u][1]记录异或值为1的数量（其实就是以u为公共祖先时情况）

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#include<queue>
#include<stack>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define fi first
#define se second
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const int inf=0x3fffffff;
const ll mod=1000000007;
const int maxn=1e5+10;
int cnt[maxn][2],b[maxn];
ll a[maxn];
int head[maxn];
struct edge
{
    int from,to,next;
}e[maxn*2];   //
int tol=0;
void add(int u,int v)
{
    e[++tol].to=v,e[tol].next=head[u],head[u]=tol;
}
ll ans=0,num;
void dfs(int u,int f)
{
    cnt[u][b[u]]=1,cnt[u][b[u]^1]=0;
    num+=b[u];   //算上自身
    for(int i=head[u];i;i=e[i].next)
    {
        int v=e[i].to;
        if(v==f) continue;
        dfs(v,u);
        num+=cnt[u][0]*cnt[v][1]+cnt[u][1]*cnt[v][0];
        cnt[u][b[u]]+=cnt[v][0];
        cnt[u][b[u]^1]+=cnt[v][1];
    }
}
int main()
{
    int n;
    scanf("%d",&n);
    rep(i,1,n+1) scanf("%lld",&a[i]);
    tol=0;
    memset(head,0,sizeof(head));
    rep(i,1,n)
    {
        int u,v;
        scanf("%d%d",&u,&v);
        add(u,v),add(v,u);
    }
    rep(i,0,21)
    {
        rep(j,1,n+1)
        {
            if(a[j]&(1<<i))
                b[j]=1;
            else b[j]=0;
        }
        num=0;
        dfs(1,-1);
        ans+=(num<<i);
    }
    printf("%lld\n",ans);
    return 0;
}