poj1330题解(最近公共祖先模板题)
来源:互联网 发布:js object tostring 编辑:程序博客网 时间:2024/06/05 03:57
Nearest Common Ancestors
Time Limit: 1000MS
Memory Limit: 10000KTotal Submissions: 25625
Accepted: 13271
Memory Limit: 10000KTotal Submissions: 25625
Accepted: 13271
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
最近公共祖先模板题;
题意:求最近公共祖先。。。
首先是深搜,复杂度特别
特别
特别
特别
特别
高。
- #include<stdio.h>
- #include<string.h>
- #include<algorithm>
- using namespace std;
- const int maxm=10005;
- int father[maxm];
- bool vis[maxm];
- int main()
- {
- int n,i,j,k,sum,a,b,t,x,y;
- scanf("%d",&t);
- while(t--)
- {
- memset(vis,false,sizeof(vis));
- memset(father,-1,sizeof(father));
- scanf("%d",&n);
- for(i=1;i<n;i++)
- {
- scanf("%d%d",&x,&y);
- father[y]=x;
- }
- scanf("%d%d",&a,&b);
- while(b!=-1)
- {
- vis[b]=true;
- b=father[b];
- }
- while(!vis[a])
- a=father[a];
- printf("%d\n",a);
- }
- return 0;
- }
- /*
- 324
- 5
- 2 3
- 3 4
- 3 1
- 1 5
- 3 5
- */
tarjian离线法:
- #include<stdio.h>
- #include<algorithm>
- #include<string.h>
- #include<vector>
- using namespace std;
- const int maxm=10005;
- vector<int>v[maxm];
- vector<int>p[maxm];
- int father[maxm],vis[maxm],num[maxm],ans,n,flag[maxm];
- void tarjian(int x);
- int find(int k);
- void init();
- int main()
- {
- int i,j,k,t,sum,x,y;
- scanf("%d",&t);
- while(t--)
- {
- scanf("%d",&n);
- init();
- for(i=1;i<n;i++)
- {
- scanf("%d%d",&x,&y);
- flag[y]++;
- v[x].push_back(y);
- }
- scanf("%d%d",&x,&y);
- p[x].push_back(y);
- p[y].push_back(x);
- for(i=1;i<=n;i++)
- {
- if(!flag[i])
- tarjian(i);
- }
- printf("%d\n",ans);
- }
- return 0;
- }
- void init()
- {
- memset(vis,0,sizeof(vis));
- memset(flag,0,sizeof(flag));
- for(int i=1;i<=n;i++)
- {
- father[i]=i;
- v[i].clear();
- p[i].clear();
- }
- }
- void tarjian(int x)
- {
- int i,j;
- for(j=0;j<v[x].size();j++)
- {
- int xx=v[x][j];
- tarjian(xx);
- father[xx]=x;
- }
- vis[x]=1;
- for(j=0;j<p[x].size();j++)
- {
- int xx=p[x][j];
- if(vis[xx])
- {
- ans=find(xx);
- return;
- }
- }
- }
- int find(int k)
- {
- int x=k,i,j;
- while(father[x]!=x)
- x=father[x];
- i=k;
- while(father[i]!=x)
- {
- j=father[i];
- father[i]=x;
- i=j;
- }
- return x;
- }
阅读全文
0 0
- poj1330题解(最近公共祖先模板题)
- 【LCA倍增模板】【poj1330】最近公共祖先
- POJ1330(最近公共祖先)
- POJ1330最近公共祖先
- POJ1330 最近公共祖先
- POJ1330 最近公共祖先
- poj1330(LCA最近公共祖先)
- [luogu-3379]【模板】最近公共祖先(LCA) 题解
- 【POJ1330】最近公共祖先(LCA):并查集+深搜
- 【POJ1330】最近公共祖先(LCA):并查集+深搜
- poj1330——Nearest Common Ancestors(最近公共祖先)
- poj1330 Nearest Common Ancestors (最近公共祖先)
- 最近公共祖先模板
- 【模板】最近公共祖先(LCA)
- 【模板】最近公共祖先(LCA)
- P3379 【模板】最近公共祖先(LCA)
- LCA----【模板】最近公共祖先(LCA)
- 【模板】【图论】最近公共祖先(LCA)
- 对服务器端编程的理解
- hibernate一级缓存和二级缓存
- 绿卡在等你亚马逊北美招聘中国工程师
- win10 安装mysql5.7.19
- bzoj4555 [Tjoi2016&Heoi2016]求和(NTT)
- poj1330题解(最近公共祖先模板题)
- socket网络编程(3)- socket网络编程遇到的问题
- Linux 后台运行python程序
- 同步FIFO设计
- MySQL读书笔记
- eclipse下hadoop程序开发
- hdu 1231
- 题目描述 给定一个字符串,找出该字符串的最长回文子串。回文字符串指的就是从左右两边看都一样的字符串,如aba,cddc都是回文字符串。字符串abbacdc存在的回文子串有abba和cdc,因此它的最长
- C++中sizeof和结构体以及内存对其