# poj1330 Nearest Common Ancestors (最近公共祖先)

Nearest Common Ancestors

 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 24236 Accepted: 12619

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

[Submit]   [Go Back]   [Status]
[Discuss]

#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
const int N=10005;
int fa[N];
bool has[N];
int n;
int find(int x,int y)
{
memset(has,false,sizeof(has));
while(fa[x])
{
has[x]=true;
x=fa[x];
}
has[x]=true;
while(fa[y])
{
if(has[y])
break;
y=fa[y];
}
return y;
}
int main()
{
int ncase;
scanf("%d",&ncase);
while(ncase--)
{
memset(fa,0,sizeof(fa));
scanf("%d",&n);
for(int i=0;i<n-1;i++)
{
int a,b;
scanf("%d %d",&a,&b);
fa[b]=a;
}
int x,y;
scanf("%d %d",&x,&y);
printf("%d\n",find(x,y));
}
return 0;
}

## POJ1330 Nearest Common Ancestors(最近公共祖先）（tarjin)

A - Nearest Common Ancestors Time Limit:1000MS     Memory Limit:10000KB     64bit IO Format:%lld & %llu Submit Status Description A rooted tree is a well-known data structure in computer science and engineering. An example is shown below: In the figu

## POJ - 1330 Nearest Common Ancestors 最近公共祖先+链式前向星 模板题

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 n

## POJ 1330 Nearest Common Ancestors 最近公共祖先

LCA模板题,用倍增法去写 首先把每一个节点的向上$$2^i (i \in \mathbb N)$$个祖先给枚举出来 再把要求公共祖先的两个节点拉到同一深度 向上不断利用倍增一起跳跃同样层数到他们各自的非公共祖先的祖先节点 最后他们一起到达共同祖先节点的子节点,再同时向上走一位即可 在这个过程中,同时维护cost即可 #include<bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long

## POJ 1330 Nearest Common Ancestors (最近公共祖先LCA + 详解博客）

LCA问题的tarjan解法模板 LCA问题 详细 1.二叉搜索树上找两个节点LCA 1 public int query(Node t, Node u, Node v) { 2 int left = u.value; 3 int right = v.value; 4 5 //二叉查找树内,如果左结点大于右结点,不对,交换 6 if (left > right) { 7 int temp = left; 8 left = right; 9 right = temp; 10 } 11 12 whi

## POJ1330 Nearest Common Ancestors【最近公共祖先】【Tarjan-LCA算法】

Nearest Common Ancestors Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 19636Accepted: 10412 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

## POJ1330 Nearest Common Ancestors

Nearest Common Ancestors Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 24587   Accepted: 12779 Description A rooted tree is a well-known data structure in computer science and engineering. An example is shown below:  In the figure, eac

## 【LCA|Tarjan】POJ-1330 Nearest Common Ancestors

Nearest Common Ancestors Time Limit: 1000MS Memory Limit: 10000K 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,-