F - Nearest Common Ancestors
来源:互联网 发布:游族网络002174股吧 编辑:程序博客网 时间:2024/04/30 14:12
F - Nearest Common Ancestors
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uDescription
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
这道题感觉就是模板题,需要的查询的数组都只有一组,算比较简单的了。
#include <iostream>#include<cstdio>#include<cstring>#include<algorithm>#define mm 10010using namespace std;int n,num,x,y;int fa[mm],head[mm];bool isroot[mm],vis[mm];struct node{ int next,en;}e[mm];void add(int a,int b){ e[num].en=b; e[num].next=head[a]; head[a]=num++;}int Find(int a){ if(a!=fa[a]) a=Find(fa[a]); return a;}void dfs(int root){ fa[root]=root; for(int i=head[root];i+1;i=e[i].next) { int t=e[i].en; dfs(t); fa[t]=root; } if(vis[x]&&root==y) printf("%d\n",Find(x)); if(vis[y]&&root==x) printf("%d\n",Find(y)); vis[root]=true;}int main(){ int t; scanf("%d",&t); while(t--) { num=0; memset(vis,false,sizeof(vis)); memset(isroot,true,sizeof(isroot)); memset(head,-1,sizeof(head)); scanf("%d",&n); int a,b; for(int i=1;i<n;i++) { scanf("%d%d",&a,&b); add(a,b); isroot[b]=false; } int root; for(int i=1;i<=n;i++) { if(isroot[i]) { root=i; break; } } scanf("%d%d",&x,&y); dfs(root); } return 0;}
0 0
- F - Nearest Common Ancestors
- POJ1330 Nearest Common Ancestors
- POJ1330(Nearest Common Ancestors)
- POJ1330--Nearest Common Ancestors
- Nearest Common Ancestors
- POJ Nearest Common Ancestors
- poj_1330 Nearest Common Ancestors
- Nearest Common Ancestors
- poj1330 Nearest Common Ancestors
- Nearest Common Ancestors Poj1330
- POJ1330 Nearest Common Ancestors
- poj1330 Nearest Common Ancestors
- poj1330 Nearest Common Ancestors
- Nearest Common Ancestors
- poj1330 Nearest Common Ancestors
- Nearest Common Ancestors--LCA
- Nearest Common Ancestors POJ
- Nearest Common Ancestors
- 欢迎使用CSDN-markdown编辑器
- 使用selenuim自动操作浏览器
- 计算机是如何工作的
- 展望2016,,总结2015
- 字符串最后一个字符的长度
- F - Nearest Common Ancestors
- poj-1408-计算两线相交点坐标模板
- php和python 中变量作用域的解析
- I/O复用的高级应用一:非阻塞connect
- 如何快糙好猛地在Windows下编译CAFFE并使用其matlab和python接口
- 机器学习之路(一元线性回归)
- java学习(一)
- ACM_模板_进制转换
- 杂记