POJ 1330 LCA倍增模板题
来源:互联网 发布:淘宝聊天自动生成 编辑:程序博客网 时间:2024/05/31 18:34
A rooted tree is a well-known data structure in computer science and engineering. An example is shown below:
In the figure, each node is labeled with an integer from {1, 2,…,16}. Node 8 is the root of the tree. Node x is an ancestor of node y if node x is in the path between the root and node y. For example, node 4 is an ancestor of node 16. Node 10 is also an ancestor of node 16. As a matter of fact, nodes 8, 4, 10, and 16 are the ancestors of node 16. Remember that a node is an ancestor of itself. Nodes 8, 4, 6, and 7 are the ancestors of node 7. A node x is called a common ancestor of two different nodes y and z if node x is an ancestor of node y and an ancestor of node z. Thus, nodes 8 and 4 are the common ancestors of nodes 16 and 7. A node x is called the nearest common ancestor of nodes y and z if x is a common ancestor of y and z and nearest to y and z among their common ancestors. Hence, the nearest common ancestor of nodes 16 and 7 is node 4. Node 4 is nearer to nodes 16 and 7 than node 8 is.
For other examples, the nearest common ancestor of nodes 2 and 3 is node 10, the nearest common ancestor of nodes 6 and 13 is node 8, and the nearest common ancestor of nodes 4 and 12 is node 4. In the last example, if y is an ancestor of z, then the nearest common ancestor of y and z is y.
Write a program that finds the nearest common ancestor of two distinct nodes in a tree.
Input
The input consists of T test cases. The number of test cases (T) is given in the first line of the input file. Each test case starts with a line containing an integer N , the number of nodes in a tree, 2<=N<=10,000. The nodes are labeled with integers 1, 2,…, N. Each of the next N -1 lines contains a pair of integers that represent an edge –the first integer is the parent node of the second integer. Note that a tree with N nodes has exactly N - 1 edges. The last line of each test case contains two distinct integers whose nearest common ancestor is to be computed.
Output
Print exactly one line for each test case. The line should contain the integer that is the nearest common ancestor.
Sample Input
2
16
1 14
8 5
10 16
5 9
4 6
8 4
4 10
1 13
6 15
10 11
6 7
10 2
16 3
8 1
16 12
16 7
5
2 3
3 4
3 1
1 5
3 5
Sample Output
4
#include <iostream>#include <algorithm>#include <cstdio>#include <cstring>#include <vector>using namespace std;#define N 10010int n,t,cx,cy,deep[N];vector<int> p[N<<1];int g[N][21],vis[N];void dfs(int x,int de){ for(int i=0;i<p[x].size();i++) { if(!deep[p[x][i]]) { deep[p[x][i]]=deep[x]+1; g[p[x][i]][0]=x; dfs(p[x][i],de+1); } }}int lca(int a,int b){ if(deep[a]<deep[b]) swap(a,b); int t=deep[a]-deep[b]; for(int i=0;i<=20;i++) { if((1<<i)&t) a=g[a][i]; } if(a==b) return a; for(int i=20;i>=0;i--) { if(g[a][i]!=g[b][i]) { a=g[a][i]; b=g[b][i]; } } return g[a][0];}int main(){ scanf("%d",&t); while(t--){ memset(g,0,sizeof(g)); memset(p,0,sizeof(p)); memset(vis,0,sizeof(vis)); memset(deep,0,sizeof(deep)); scanf("%d",&n); int x,y; for(int i=1;i<n;i++) { scanf("%d%d",&x,&y); p[x].push_back(y); vis[y]++; } scanf("%d%d",&cx,&cy); for(int i=1;i<=n;i++) { if(!vis[i]) { dfs(i,1); break; } } for(int j=1;j<=20;j++) { for(int i=1;i<=n;i++) { g[i][j]=g[g[i][j-1]][j-1]; } } printf("%d\n",lca(cx,cy) ); }}
- POJ 1330 LCA倍增模板题
- LCA Tarjan及倍增模板(POJ 1330)
- (LCA倍增) poj 1330
- poj 1330 (LCA模板题)
- 【LCA模板题】POJ 1330
- LCA倍增算法(模板)
- 倍增lca模板
- LCA倍增法模板
- 倍增LCA模板
- LCA倍增模板
- 倍增LCA 模板
- lca倍增算法模板
- {模板}LCA倍增
- LCA模板(倍增)
- 倍增LCA模板
- 倍增LCA模板
- 倍增LCA模板
- [模板]倍增LCA
- OFDM大白话讲解
- 关于多线程调用的问题
- 双机流水作业调度——codevs3008 加工生产调度
- tomcat 调优
- Kotlin 初运行
- POJ 1330 LCA倍增模板题
- Android高德地图自定义信息窗
- 没有意义的博客会被删嘛,这里我能瞎写写嘛
- oracle分区
- Jenkins Failed to connect to repository
- 一键发布Qt应用程序(最快方法)- windows
- Spring MVC RedirectAttributes的用法解决办法
- linux jdk版本随时切换
- JS学习笔记(12)正则表达式