LCM~~~!!!
2014-08-23 21:12
120 查看
D - LCA
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d
& %I64u
Submit Status
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
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d
& %I64u
Submit Status
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
#include<iostream> #include<cstdio> #include<cstring> using namespace std; const int maxn=12000; struct edge { int t; int next; }; int V; int p[maxn]; edge G[maxn]; int l; int fath[maxn];///父节点 int dep[maxn];///深度 void init() { memset(p,-1,sizeof(p));///初始化 memset(fath,-1,sizeof(fath));///按照并查集的观点来说应该是father[i]=i,但是这里的数是精准的 so...no l=0; } void addedge(int u,int t,int l) { G[l].t=t; G[l].next=p[u]; p[u]=l; fath[t]=u; } void LCA(int u,int deep) { dep[u]=deep; for(int i=p[u];i!=-1;i=G[i].next) { LCA(G[i].t,deep+1); } } int findLCA(int u,int t) { if(dep[u]<dep[t]) swap(u,t); while(dep[u]>dep[t]) { u=fath[u]; } while(u!=t) { u=fath[u]; t=fath[t]; } return t; } int main() { int ci; scanf("%d",&ci); while(ci--&&scanf("%d",&V)==1) { init(); for(int i=1;i<V;i++) { int u,t; scanf("%d%d",&u,&t); addedge(u,t,l++); } for(int i=1;i<=V;i++) { if(fath[i]==-1)///从根节点开始搜索关于深度的东西 { LCA(i,1); break; } } int st,ed; scanf("%d%d",&st,&ed); int tmp=findLCA(st,ed); printf("%d\n",tmp); } return 0; }
相关文章推荐
- LCD显示原理 && MTK平台LCM显存大小的计算 && mtk6589LCD显示子系统
- POJ/PKU 2429 GCD & LCM
- HDOJ2028 ( Lowest Common Multiple Plus ) 【水题,lcm】
- GCD & LCM 一个神奇的式子
- UVa 11388 - GCD LCM
- Hoj 2010 GCD & LCM Inverse
- 10791 - Minimum Sum LCM
- HDU 3071 Gcd & Lcm game
- gcd,lcm模板
- (Relax 数论 1.1)POJ 2429 GCD & LCM Inverse(已知GCD、LCM,反求a、b)
- UVA 10791 - Minimum Sum LCM
- UVA10791- Minimum Sum LCM
- mtk android lcm调试
- MTK平台LCM驱动详细分析(二)
- poj2492GCD & LCM Inverse(GCD&&LCM)(此题目前超时)
- uva 10717 Mint(lcm)
- uva 10791 Minimum Sum LCM(数论)
- poj 2429 GCD & LCM Inverse(拉宾米勒测试+大数分解+dfs)
- 解题报告 之 SOJ2106 GCD & LCM Inverse
- Minimum Sum LCM(uva10791+和最小的LCM+推理)