Codeforces Round #396 (Div. 2) E. Mahmoud and a xor trip dfs 按位考虑
来源:互联网 发布:python 图形化界面 编辑:程序博客网 时间:2024/06/07 05:30
E. Mahmoud and a xor trip
题目连接:
http://codeforces.com/contest/766/problem/E
Description
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.
Sample Input
3
1 2 3
1 2
2 3
Sample Output
10
Hint
题意
给你一棵树,点权,让你输出所有路径的异或和的和。
题解:
因为是点权,和边权不一样的是要考虑LCA的影响,所以我们这样做:
异或我们把数的二进制每一位单独拿出来考虑就好了。
dfs考虑每一个点作为LCA的答案是多少,不停走下去就好了,记录下0和1的数量。
#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<algorithm>using namespace std;int a[100005];int head[100005];struct node{ int u,v,nex;}edge[200005];int cnt;long long ans;void add(int u,int v){ edge[cnt].u=u; edge[cnt].v=v; edge[cnt].nex=head[u]; head[u]=cnt++;}long long num[100005][2];void dfs(int u,int fa,int bit){ int t=(a[u]>>bit)&(1); num[u][t]=1; num[u][t^1]=0; long long sum=0; for(int i=head[u];i!=-1;i=edge[i].nex) { int v=edge[i].v; if(v==fa) continue; dfs(v,u,bit); sum+=(num[u][0]*num[v][1]+num[u][1]*num[v][0]); num[u][0^t]+=num[v][0]; num[u][1^t]+=num[v][1]; } ans+=(long long)sum*(1<<bit);}int main(){ int n; while(~scanf("%d",&n)) { cnt=0; ans=0; for(int i=1;i<=n;i++) { head[i]=-1; scanf("%d",&a[i]); ans+=a[i]; } for(int i=0;i<n-1;i++) { int u,v; scanf("%d%d",&u,&v); add(u,v); add(v,u); } for(int i=0;i<30;i++) { dfs(1,-1,i); } printf("%lld\n",ans); }}
- Codeforces Round #396 (Div. 2) E. Mahmoud and a xor trip dfs 按位考虑
- Codeforces Round #396(Div. 2)E. Mahmoud and a xor trip【二进制拆位+Dfs处理】
- Codeforces Round #396 (Div. 2) E. Mahmoud and a xor trip(树形dp+二进制按位拆分)
- Codeforces Round #396(Div. 2)E. Mahmoud and a xor trip
- Codeforces Round #396 (Div. 2) E. Mahmoud and a xor trip
- codeforces round 396 div2 E Mahmoud and a xor trip 按位操作+dp子树内外
- 766E Mahmoud and a xor trip[二进制拆位][dfs]
- 【Codeforces 766E】 Mahmoud and a xor trip 【二进制计数】
- Codeforces Round #435 (Div. 2) C. Mahmoud and Ehab and the xor 【位运算+思维】
- Codeforces 766E Mahmoud and a xor trip [二进制,]【数学+思维】
- Codeforces Round #396 (Div. 2)Mahmoud and a Message
- Codeforces Round #396 (Div. 2)Mahmoud and a Dictionary
- Codeforces Round #396 (Div. 2)C. Mahmoud and a Message
- Codeforces Round #396 (Div. 2) C.Mahmoud and a Message
- Codeforces Round #396 (Div. 2) C.Mahmoud and a Message
- Codeforces Round #396 (Div. 2) C. Mahmoud and a Message
- E. Mahmoud and a xor trip----树形DP
- Codeforces Round #435 (Div. 2) C. Mahmoud and Ehab and the xor(xor运算应用)
- FFmpeg解码视频帧为jpg图片保存到本地
- leetcode 337. House Robber III DP动态规划 + DFS深度有限遍历
- java集合
- HDU 5514 Frogs (容斥+数论)
- Java第一个简单的程序
- Codeforces Round #396 (Div. 2) E. Mahmoud and a xor trip dfs 按位考虑
- Django UnicodeEncodeError
- 【Hibernate】mysql版本影响hibernate操作数据库
- Kafka的基本shell命令
- Attribute 和 Parameter 的区别
- Lintcode 3:Digit Counts
- Tarjan无向图最小权值割边
- uml类图&类的关系
- hdu5546 Ancient Go(bfs)