POJ 1330 Nearest Common Ancestors 树
2015-08-22 11:53
218 查看
Nearest Common Ancestors
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
Sample Output
Source
Taejon 2002
ACcode:
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 22015 | Accepted: 11524 |
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
ACcode:
#include <cstdio> #include <vector> #include <iostream> #include <cstring> #define maxn 10000 #define pb push_back using namespace std; vector<int> tree[maxn]; int deep[maxn],data[maxn]; void dfs(int node,int dep){ data[node]=dep; for(vector<int>::iterator it=tree[node].begin();it!=tree[node].end();++it) dfs(*it,dep+1); } int main(){ int loop,num,n,x,y; scanf("%d",&loop); num=0; while(loop--){ scanf("%d",&n); for(int i=0;i<n;++i)tree[i].clear(); memset(deep,-1,sizeof(deep)); for(int i=0;i<n-1;i++){ scanf("%d %d",&x,&y); tree[x-1].pb(y-1); deep[y-1]=x-1; } int i; for(i=0;deep[i]>=0;i++); dfs(i,0); scanf("%d %d",&x,&y); --x,--y; while(x!=y){ if(data[x]>data[y])x=deep[x]; else y=deep[y]; } printf("%d\n",x+1); num++; } return 0; }
相关文章推荐
- PAT 1064. Complete Binary Search Tree (30)
- 黑马程序员-java-多线程2
- json 解析
- CSS经典布局之圣杯布局、双飞翼布局
- 【LeetCode】258. Add Digits (2 solutions)
- Juerry 实现让复选框实现单选
- maven 入门
- 这个网站, 你值得拥有!
- UVALive 5983 MAGRID DP
- mysql实时同步到mssql的解决方案
- NOIP2012 疫情控制(二分,倍增,贪心)
- Java 网络下载
- hdu1846 巴什博奕
- 黑马程序员-java-反射2
- C#中数组、ArrayList和List三者的区别 .
- 欢迎使用CSDN-markdown编辑器
- Sublime Text 2 JS 格式化插件 JsFormat的配置使用
- java 中的 wait()方法和 sleep()方法的区别是什么?
- Erlang
- 人生需要看开些