poj 1330 (LCA模板题)
来源:互联网 发布:mac 怎么用excel 编辑:程序博客网 时间:2024/06/05 13:21
Nearest Common Ancestors
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9838 Accepted: 5224
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
题目:http://poj.org/problem?id=1330
分析:很经典的LCA问题,写个模板试试速度,居然16ms。。。囧了
代码:
#include<cstdio>using namespace std;const int mm=11111;int h[mm],t[mm],p[mm],q[mm],f[mm];bool vis[mm];int i,j,k,n,T;int find(int u){ if(f[u]==u)return u; else return f[u]=find(f[u]);}bool tarjan(int u){ if(q[u]&&vis[q[u]]) { printf("%d\n",find(q[u])); return 1; } vis[f[u]=u]=1; for(int i=h[u],v;i;i=p[i]) if(!vis[v=t[i]]) { if(tarjan(v))return 1; f[v]=u; } return 0;}int main(){ scanf("%d",&T); while(T--) { scanf("%d",&n); for(i=1;i<=n;++i)h[i]=q[i]=f[i]=vis[i]=0; for(k=1;k<n;++k) { scanf("%d%d",&i,&j); t[k]=j,p[k]=h[i],h[i]=k; ++f[j]; } scanf("%d%d",&i,&j); q[q[i]=j]=i; for(i=1;i<=n;++i) if(!f[i])tarjan(i); } return 0;}
- poj 1330 (LCA模板题)
- 【LCA模板题】POJ 1330
- POJ 1330 LCA转RMQ模板题
- poj 1330lca模板题离线算法
- POJ 1330 LCA倍增模板题
- POJ-1330 更新LCA模板
- LCA & RMQ 模板 POJ 1330
- poj 1470(LCA模板题)
- 【poj】lca模板题 poj1330
- 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 1330Nearest Common Ancestors LCA模板
- poj 1330 Nearest Common Ancestors(LCA模板)
- LCA Tarjan及倍增模板(POJ 1330)
- poj 1330 LCA模版题
- POJ 1330 Nearest Common Ancestors (模板水题离线LCA,3级)
- android 2.2源码查看
- 二、工欲善其事必先利其器
- css absolute定位,让层固定在网页的底部
- 矩阵乘法,留待熟悉一下类再学习。
- 爱立信实习生面试小结
- poj 1330 (LCA模板题)
- xp linux 双系统引导修复
- 软件工程师入门教程--KaYiCRM实录(1)
- 软件工程师入门教程--KaYiCRM实录(2)
- Eclipse 使用 Link 方式安装插件
- 解决linux系统启动之:unexpected inconsistency; RUN fsck MANUALLY...
- 三种简单博弈问题
- 基于STM32 8通道ADC采样实现源代码(转) 以后设计参考使用
- 算法与数据结构基础知识