zoukankan      html  css  js  c++  java
  • Nearest Common Ancestors POJ

    Nearest Common Ancestors
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 34657   Accepted: 17585

    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
    
    

    Source

    题意:给出n个点,n-1条边的树,求lca(u,v);

    思路:LCA

    #include<iostream>
    #include<cstdio>
    #include<algorithm>
    #include<cstring>
    #include<cmath>
    #include<cstdlib>
    #include<queue>
    #include<set>
    #include<stack>
    #include<vector>
    #include<map>
    using namespace std;
    using namespace std;
    typedef long long ll;
    const int INF = 0x3f3f3f3f;
    const int MAXN=10010;
    const int DEG=20;
    
    struct Edge{
        int to,next;
    }edge[MAXN*2];
    int head[MAXN],tot;
    void addedge(int u,int v){
        edge[tot].to=v;
        edge[tot].next=head[u];
        head[u]=tot++;
    }
    void init(){
        tot=0;
        memset(head,-1,sizeof(head));
    }
    int fa[MAXN][DEG];    //fa[i][j]表示结点i的第2^j个祖先
    int deg[MAXN];        //深度数组
    
    void bfs(int root){
        queue<int>que;
        deg[root]=0;
        fa[root][0]=root;
        que.push(root);
        while(!que.empty()){
            int tmp=que.front();
            que.pop();
            for(int i=1;i<DEG;i++)
                fa[tmp][i]=fa[fa[tmp][i-1]][i-1];
            for(int i=head[tmp];i!=-1;i=edge[i].next){
                int v=edge[i].to;
                if(v==fa[tmp][0])continue;
                deg[v]=deg[tmp]+1;
                fa[v][0]=tmp;
                que.push(v);
            }
        }
    }
    int LCA(int u,int v){
        if(deg[u]>deg[v])swap(u,v);
        int hu=deg[u],hv=deg[v];
        int tu=u,tv=v;
        for(int det=hv-hu,i=0;det;det>>=1,i++)
            if(det&1)
                tv=fa[tv][i];
        if(tu==tv)return tu;
        for(int i=DEG-1;i>=0;i--){
            if(fa[tu][i] == fa[tv][i])continue;
            tu=fa[tu][i];
            tv=fa[tv][i];
        }
        return fa[tu][0];
    }
    bool flag[MAXN];
    int main(){
        int T,n,u,v;
        scanf("%d",&T);
        while(T--){
            scanf("%d",&n);
            init();
            memset(flag,false,sizeof(flag));
            for(int i=1;i<n;i++){
                scanf("%d%d",&u,&v);
                addedge(u,v);
                addedge(v,u);
                flag[v]=true;
            }
            int root;
            for(int i=1;i<=n;i++)
                if(!flag[i]){
                    root=i;
                    break;
                }
            bfs(root);
            scanf("%d%d",&u,&v);
            printf("%d
    ",LCA(u,v));
        }
    }
  • 相关阅读:
    sql server 中隐藏掉无关数据库
    Web Deploy自动配置
    jQuery form表单序列化为JSON对象!
    CURL HELP
    sql server生成递归日期、连续数据
    MVC项目中,如何访问Views目录下的静态文件!
    DDNS动态更新
    佛祖保佑 永无bug
    asp.net webservice返回json问题
    asp.net使用Get请求webservice
  • 原文地址:https://www.cnblogs.com/smallhester/p/9670646.html
Copyright © 2011-2022 走看看