poj1330 Nearest Common Ancestors LCA倍增法
来源:互联网 发布:电力数据库 编辑:程序博客网 时间:2024/05/16 08:02
Nearest Common Ancestors
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 29749 Accepted: 15179
Description
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
3
Source
Taejon 2002
#include <iostream>#include <stdio.h>#include <set>#include <vector>#include <map>#include <cmath>#include <algorithm>#include <string>#include <string.h>using namespace std;const int N=(int)1e4+10;vector <int> vec[N];int depth[N],pre[N][20];bool haspre[N];int n;void init(int n){ for(int i=1;i<=n;i++){ vec[i].clear(); } memset(haspre,false,sizeof(haspre)); memset(depth,0,sizeof(depth)); memset(pre,0,sizeof(pre));}void dfs(int u,int p,int d){ depth[u]=d; pre[u][0]=p; for(int i=0;i<vec[u].size();i++){ int v=vec[u][i]; if(v==p) continue; dfs(v,u,d+1); }}void gether(){ for(int j=1;(1<<j)<=n;j++){ for(int i=1;i<=n;i++){ pre[i][j]=pre[pre[i][j-1]][j-1]; } }}int LCA(int u,int v){ if(depth[u]>depth[v]) swap(u,v); int f=depth[v]-depth[u]; for(int i=0;i<=20;i++){ if((1<<i)&f) v=pre[v][i]; } if(u!=v){ for(int i=(int)log2(N);i>=0;i--){ if(pre[u][i]!=pre[v][i]){ u=pre[u][i]; v=pre[v][i]; } } u=pre[u][0]; } return u;}int main(){ int T; scanf("%d",&T); while(T--){ scanf("%d",&n); init(n); for(int i=0;i<n-1;i++){ int u,v; scanf("%d %d",&u,&v); vec[u].push_back(v); vec[v].push_back(u); haspre[v]=true; } int root; for(int i=1;i<=n;i++){ if(!haspre[i]){ root=i; break; } } dfs(root,0,0); gether(); int p,q; scanf("%d %d",&p,&q); printf("%d\n",LCA(p,q)); } return 0;}
- poj1330 Nearest Common Ancestors LCA倍增法
- 倍增LCA poj1330 Nearest Common Ancestors
- LCA-倍增思想 POJ1330 Nearest Common Ancestors
- poj1330 Nearest Common Ancestors(lca,tarjan&倍增)
- poj1330 Nearest Common Ancestors LCA倍增法 或 LCA转RMQ
- POJ1330 Nearest Common Ancestors[LCA]
- 【POJ1330】Nearest Common Ancestors(LCA)
- [LCA模板]POJ1330 Nearest Common Ancestors
- 【POJ1330】Nearest Common Ancestors-LCA算法
- poj1330 Nearest Common Ancestors(LCA离线)
- poj1330 Nearest Common Ancestors LCA Tarjan 待补完
- POJ 1330 Nearest Common Ancestors 倍增法求LCA
- Poj-1330-Nearest Common Ancestors-倍增LCA
- POJ.1330 Nearest Common Ancestors (LCA 倍增)
- POJ1330 Nearest Common Ancestors
- POJ1330(Nearest Common Ancestors)
- POJ1330--Nearest Common Ancestors
- poj1330 Nearest Common Ancestors
- MongoDB:副本集的配置
- MySQL高可用之MHA的搭建
- 机器学习算法总结--决策树
- Ionic2 bug
- HDU 1262 寻找素数对
- poj1330 Nearest Common Ancestors LCA倍增法
- 2015 ACM Amman Collegiate Programming Contest H.Bridges【边双联通+求树上最长链(树的直径)】
- 【miscellaneous】编码格式简介(ANSI、GBK、GB2312、UTF-8、GB18030和 UNICODE)
- 【物联网】矩阵式二维条码 介绍
- log4j2.xml路径的指定
- Java进阶之虚拟机《四》:类加载机制
- hdu 1198 Farm Irrigation 基础最小生成树★
- 进程/线程同步的方式和机制,进程间通信
- Dagger2