F - Nearest Common Ancestors
2016-02-26 20:58
363 查看
F - Nearest Common Ancestors
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
这道题感觉就是模板题,需要的查询的数组都只有一组,算比较简单的了。
#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define mm 10010
using 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;
}
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>
#include<algorithm>
#define mm 10010
using 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;
}
相关文章推荐
- LintCode- 二叉树的所有路径
- POJ 1328 Radar Installation
- HP商务本安装Android Studio时HAXM安装失败并提示需要启动VT-X的问题
- C语言学习笔记7-字符串
- 【Java】异常处理
- LCS,经典DP(1159)
- 给自己找一个继续努力的理由!
- codevs1073 家族
- shell 编程之 if...else case...esac
- mysql的数据类型int、bigint、smallint 和 tinyint取值范围
- JAVA界面事件处理
- 使用GraphViz画caffe的网络结构图
- 使用selenuim自动操作浏览器
- java,我准备好了
- OC—— 代码块
- java底层学习
- 只需两步,使你的Android Studio支持Lambda表达式(有更新)
- ACM_模板_进制转换
- php和python 中变量作用域的解析
- 一点感悟吧