poj-1330 Nearest Common Ancestors(LCA模板题)
来源:互联网 发布:cdr文件查看器 mac 编辑:程序博客网 时间:2024/05/16 06:06
题目链接: http://poj.org/problem?id=1330
Nearest Common Ancestors
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23822 Accepted: 12405
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
题意:
给一棵树,再给两节点,求两节点的最近公共祖先。
本题有暴力解,在线,离线三种解法。这里提供前两种。
代码1:
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>using namespace std;#define N 10010struct Node{ int parents; int flag;}tree[N];void init(int n){ for(int i=1;i<=n;i++) { tree[i].flag=0; tree[i].parents=i; }}void update(int s,int e){ tree[e].parents=s;}void LCA(int s,int e){ tree[s].flag=1; while(tree[s].parents!=s) { s=tree[s].parents; tree[s].flag=1; } int num; while(tree[e].parents!=e) { if(tree[e].flag) { num=e; break; } e=tree[e].parents; } if(tree[e].flag) num=e; printf("%d\n",num);}int main(){ int T,n; int s,e; scanf("%d",&T); while(T--) { scanf("%d",&n); init(n); for(int i=1;i<n;i++) { scanf("%d %d",&s,&e); update(s,e); } scanf("%d %d",&s,&e); LCA(s,e); } return 0;}代码2:
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>using namespace std;#define N 10010int dp[2*N][20];int head[N],p[N];int dep[2*N],f[2*N];int flag[N],cnt;struct Edge{ int to,next;} edge[2*N];void init(int n){ cnt=0; for(int i=0; i<=n; i++) { head[i]=-1; flag[i]=0; }}void addedge(int s,int e){ edge[cnt].to=e; edge[cnt].next=head[s]; head[s]=cnt++;}void dfs(int u,int d){ f[cnt]=u; dep[cnt]=d; p[u]=cnt++; for(int i=head[u]; i!=-1; i=edge[i].next) { int v=edge[i].to; dfs(v,d+1); f[cnt]=u; dep[cnt++]=d; }}void makermq(){ for(int i=0; i<cnt; i++) dp[i][0]=i; for(int j=1; (1<<j)<=cnt; j++) { for(int i=0; i+(1<<j)-1<cnt; i++) { if(dep[dp[i][j-1]]<dep[dp[i+(1<<(j-1))][j-1]]) dp[i][j]=dp[i][j-1]; else dp[i][j]=dp[i+(1<<(j-1))][j-1]; } }}int finds(int s,int e){ if(s>e) { int t=s; s=e; e=t; } int k=(int)(log(e-s+1.0)/log(2.0)); if(dep[dp[s][k]]<dep[dp[e-(1<<k)+1][k]]) return dp[s][k]; return dp[e-(1<<k)+1][k];}void LCA(int root,int n){ cnt=0; dfs(root,0); makermq(); int s,e; scanf("%d %d",&s,&e); printf("%d\n",f[finds(p[s],p[e])]);}int main(){ int T,n; int s,e,root; scanf("%d",&T); while(T--) { scanf("%d",&n); init(n); for(int i=1; i<n; i++) { scanf("%d %d",&s,&e); addedge(s,e); flag[e]=1; } for(int i=1; i<=n; i++) if(!flag[i]) { root=i; break; } LCA(root,n); } return 0;}
0 0
- poj-1330 Nearest Common Ancestors(LCA模板题)
- POJ 1330Nearest 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)
- poj 1330 Nearest Common Ancestors(LCA)
- POJ 1330Nearest Common Ancestors(LCA)
- POJ 1330 Nearest Common Ancestors(LCA)
- POJ 1330 Nearest Common Ancestors(LCA)
- POJ 1330 Nearest Common Ancestors (模板水题离线LCA,3级)
- 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)
- HDU2050 折线分割平面解题报告
- 1006. 换个格式输出整数 (15)
- Linux内核分析:实验六
- LintCode_452_删除链表中的元素
- [Properties]——读配置文件
- poj-1330 Nearest Common Ancestors(LCA模板题)
- [DevExpress]GridControl中的GridView内容打印
- cocos2d-x中的图片异步加载机制
- UITableView优化
- R文件丢失异常原因汇总
- oj问题三-结构体-高于均分的学生
- AngularJs Scrope
- ECNU_OJ_1030
- HDU 5650 so easy(异或)