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

    POJ 1330 Nearest Common Ancestors
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 24209   Accepted: 12604

    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
     1 #define N 10100
     2 #include<iostream>
     3 using namespace std;
     4 #include<cstdio>
     5 #include<cstring>
     6 struct Edge{
     7     int v,last;
     8 }edge[N*2];
     9 bool visit[N],root[N];
    10 int father[N],ance[N];
    11 int T,n,head[N];
    12 int x,y;
    13 void add_edge(int u,int v,int k)
    14 {
    15     edge[k].v=v;
    16     edge[k].last=head[u];
    17     head[u]=k;
    18 }
    19 void input()
    20 {
    21     memset(root,false,sizeof(root));
    22     memset(edge,0,sizeof(edge));
    23     memset(head,0,sizeof(head));/*注意多组数据之间的衔接,把数据都清空了*/
    24     scanf("%d",&n);
    25     for(int i=1;i<n;++i)
    26     {
    27         int u,v;
    28         scanf("%d%d",&u,&v);
    29         add_edge(u,v,i);
    30         father[i]=i;
    31         ance[i]=0;
    32         root[v]=true;
    33         visit[i]=false;
    34     }
    35     scanf("%d%d",&x,&y);
    36     father[n]=n;
    37     ance[n]=0;
    38     visit[n]=false;
    39     
    40 }
    41 int find(int k)
    42 {
    43     return (father[k]==k)?father[k]:father[k]=find(father[k]);
    44 }
    45 void tarjan(int k)
    46 {
    47     ance[k]=k;
    48     for(int l=head[k];l;l=edge[l].last)
    49     {
    50         tarjan(edge[l].v);
    51         father[edge[l].v]=k;
    52         ance[edge[l].v]=k;
    53     }
    54     visit[k]=true;
    55     if(k==x&&visit[y])
    56     {
    57         printf("%d
    ",ance[find(y)]);
    58     }
    59     if(k==y&&visit[x])
    60     {
    61         printf("%d
    ",ance[find(x)]);
    62     }
    63 }
    64 int main()
    65 {
    66     scanf("%d",&T);
    67     while(T--)
    68     {
    69         input();
    70         for(int i=1;i<=n;++i)
    71           if(!root[i])
    72           {
    73                 tarjan(i);
    74                 break;
    75           }
    76     }
    77     return 0;
    78 }
  • 相关阅读:
    关于json字符串与实体之间的严格验证
    SQL Pretty Printer 一款值得你拥有的MSSQL格式化插件
    ABP增加记录EFCore 生成数据库脚本日志到新的txt文件
    Multiple types were found that match the controller named 'Auth'.
    sqlserver 交叉去重
    sqlserver分组排序取前三条数据
    C# 读取.resx资源文件写入到json文件中
    SqlServer根据经纬度排序
    .net core 简单定时程序
    使用游标,查询一张的数据往另外三张表里面添加数据
  • 原文地址:https://www.cnblogs.com/c1299401227/p/5500930.html
Copyright © 2011-2022 走看看