POJ 1330(Nearest Common Ancestors-Lca模板题)
来源:互联网 发布:手机淘宝无法评价订单 编辑:程序博客网 时间:2024/06/05 03:18
Nearest Common Ancestors
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13559 Accepted: 7236
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.
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
2161 148 510 165 94 68 44 101 136 1510 116 710 216 38 116 1216 752 33 43 11 53 5
Sample Output
43
Source
Taejon 2002
Rt,纯粹无聊写的……(其实至今为止就写过2个………\("▔□▔)/)
#include<cstdio>#include<cstdlib>#include<cstring>#include<iostream>#include<algorithm>#include<functional>using namespace std;#define MAXN (10000+10)#define Li (17)int t,n,father[MAXN][Li];int edge[MAXN],pre[MAXN],next[MAXN],size=0;void addedge(int u,int v){edge[++size]=v;next[size]=pre[u];pre[u]=size;}int queue[MAXN],deep[MAXN],bin[Li];void bfs(){int head=1,tail=1;for (int i=1;i<=n;i++) if (!father[i][0]) {queue[1]=i;deep[i]=1;break;}while (head<=tail){int &u=queue[head];for (int i=1;i<Li;i++){father[u][i]=father[father[u][i-1]][i-1];if (father[u][i]==0) break;}for (int p=pre[u];p;p=next[p]){int &v=edge[p];deep[v]=deep[u]+1;queue[++tail]=v;}head++;}}int lca(int x,int y){if (x==y) return x;if (deep[x]<deep[y]) swap(x,y);int t=deep[x]-deep[y];for (int i=0;i<Li;i++)if (bin[i]&t){x=father[x][i];}int i=Li-1;while (x^y){while (father[x][i]==father[y][i]&&i) i--;x=father[x][i];y=father[y][i];}return x;}int main(){//freopen("poj1330.in","r",stdin);scanf("%d",&t);for (int i=0;i<Li;i++) bin[i]=1<<i;while (scanf("%d",&n)!=EOF){memset(pre,0,sizeof(pre));size=0;memset(father,0,sizeof(father));for (int i=1;i<n;i++) {int u,v;scanf("%d%d",&u,&v);father[v][0]=u;addedge(u,v);}bfs();int x,y;scanf("%d%d",&x,&y);printf("%d\n",lca(x,y));}return 0;}
- POJ 1330Nearest Common Ancestors LCA模板
- poj 1330 Nearest Common Ancestors(LCA模板)
- POJ 1330(Nearest Common Ancestors-Lca模板题)
- poj-1330 Nearest Common Ancestors(LCA模板题)
- POJ-1330 Nearest Common Ancestors(lca模板题)
- 【LCA模板题】poj 1330 Nearest Common Ancestors
- poj 1330 Nearest Common Ancestors(LCA模板)
- POJ-1330 Nearest Common Ancestors【LCA】
- POJ 1330 Nearest Common Ancestors [LCA+RMQ]
- poj 1330 Nearest Common Ancestors(LCA)
- POJ 1330 Nearest Common Ancestors (LCA)
- poj 1330 Nearest Common Ancestors (LCA)
- POJ 1330 Nearest Common Ancestors LCA
- POJ 1330 Nearest Common Ancestors LCA
- poj 1330 Nearest Common Ancestors LCA targin
- POJ 1330 Nearest Common Ancestors LCA题解
- poj 1330 Nearest Common Ancestors (LCA)
- Nearest Common Ancestors - POJ 1330 LCA
- hdu 2500
- Rman进度查询
- java设计模式之命令模式
- C++类的多态性与虚函数的使用
- 硬盘整数分区计算方法(精确硬盘分区算法)
- POJ 1330(Nearest Common Ancestors-Lca模板题)
- c#字典
- 导入导出mysql数据库 语句
- C++学习笔记
- Linux Socket编程(不限Linux)
- android – 多屏幕适配相关
- 关于颜色的整形表示
- Linux 信号signal处理机制
- window下,导入导出mysql数据库 语句